{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"llrt_fetch::request::assign_request (cyclomatic 60): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25ef52db58b434eba4f55a46a9e4e89b0451633d40dee1977f3001d7a9c8278"}},{"ruleId":"D1","level":"warning","message":{"text":"jest-expect.JestChaiExpect (cyclomatic 59): jest-expect.JestChaiExpect has cyclomatic complexity 59 (threshold 15). Most of this is not in the body itself: 2 of the 59 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 420, 405, 69, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-expect.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad70421424aef21710f8305fb0e0c180fa99c11145efcf8959853791ec9472a9"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_logging::format_raw_inner (cyclomatic 57): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c6f6e8b2500bef3c848a21437c6028ab1fc641e52f2c0864428ba57de7c4f3"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_fetch::fetch::get_fetch_options (cyclomatic 49): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/fetch.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d38bc7be5ddfc67d3d205f6440a6a570134a200282ae1d5b3ca57722eb23f9"}},{"ruleId":"D1","level":"warning","message":{"text":"jest-utils.eq (cyclomatic 37): jest-utils.eq has cyclomatic complexity 37 (threshold 15). This file\u0027s 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 \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-utils.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5b02cbf2c6d7255d42aecbbf529118d3592314da7e5d7e3c787662048511ff"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_core::clone::structured_clone (cyclomatic 34): llrt_core::clone::structured_clone has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/clone.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8817153936087cc1163f363bb988a4102f50e253d379e08f0f6d9af0abc9b6ac"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_modules::package::resolver::package_exports_resolve (cyclomatic 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c3547fd009bfe8dbcc5af9976c6b497e46771c3fd26e787a0dc4a4eaa3773e"}},{"ruleId":"D1","level":"warning","message":{"text":"StringDecoder::decode_data (cyclomatic 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_string_decoder/src/string_decoder.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5d77b751ff349d2737357a0b03dc3e4847d0e26dcb7df78f7e6a32ad76e0f3"}},{"ruleId":"D1","level":"warning","message":{"text":"jest-utils.iterableEquality (cyclomatic 32): jest-utils.iterableEquality has cyclomatic complexity 32 (threshold 15). This file\u0027s 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 \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-utils.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e570f662beab8fdfb5f14856f3249b5f40ca29da286e8d1b75cd9fbf6c00c9ff"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_logging::write_object (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"1935582b9c0c955eec84981624cb65c4b5844c16a79dbb562230f185d692e434"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_intl::pattern_formatter::format_with_pattern (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/pattern_formatter.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e047422ef221c4bc1f3b1b2a202689d413cecb04b4492bf9ce2ba4153414e6d7"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_child_process::spawn (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_child_process/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c9fcbdb2c2e864ac8c4dc7ce9b071a0296c7016e0c031424a5a7e15dc18f24"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt::repl::run_repl (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt/src/repl.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cebcfcfbdeaf66eea2d90938b0bf3ab993402e395c4100714628beeed86e5a"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_crypto::subtle::export_key::export_jwk (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/export_key.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"db72d9e17ae6fcb0c07d1932419e48cb3bbf867baf0c90fcd022dfa73c0bb2aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Request::new (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bea7be4ce602bcc8966c82c1d803193e58f56f5259e42d73e09ae2da69e0da8"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_core::modules::console::write_lambda_log (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/console.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"10343f4e4d215f2d232cdbc00ca2c63b04fbd4760795e5da24e892134f936b4f"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt::start_cli (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt/src/main.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52d3e41ac1ac999b6ca3f8935b8e590a9f6052ccd5dc924e028e6c24d3ae95f"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_fetch::response::create_body_stream (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c48329f540aefb88fad53f564771b09661eaaec800dfc3ffa5a464d42984240"}},{"ruleId":"D1","level":"warning","message":{"text":"TextDecoder::decode (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_util/src/text_decoder.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"780f5cf2bb3c4977cd097025be4513da36f1c97adbb207a479e4283e625b924f"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::listen (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_net/src/server.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"da82ec3406bfd36cfd9ff59dd5fc0a57f4b9f0357563649e52e716868e2ed67c"}},{"ruleId":"D1","level":"warning","message":{"text":"Response::new (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"374f89acb6158a7b89992367715e96323d261dc2e74a896e85cc27626e5b06c2"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_path::join_resolve_path (cyclomatic 23): llrt_path::join_resolve_path has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_path/src/lib.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a35628499d8c11eedaa790412c1cd63179dab4fdd50f7dd46407f64b4bc2b90"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadableStream::readable_byte_stream_pull_with_byob_reader (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fbfd76a5922f4accf3e73e4f4cda93e257d00191d58218022b3e0f5085f331"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_modules::package::resolver::require_resolve (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a475c6001cd7f525ba22a8f52ba57fd822167d8d6dc528b560d98a1cd09a22"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_intl::date_time_format::build_format_parts (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/date_time_format.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2688fd0db630123ddd6df374fda9372daf3c5ca3132a2632e8dd4aaea33fd0"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_buffer::buffer::read_buf (cyclomatic 21): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_buffer/src/buffer.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe92a2c8d8fb85ef7af5aecb63f3639c74d156421d405396173a00607007538"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_crypto::subtle::encryption::encrypt_decrypt (cyclomatic 21): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/encryption.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0ada0acbef69d5df84186e1c46faba9f3c42439441d95a4669622feaa85876"}},{"ruleId":"D1","level":"warning","message":{"text":"build.defaultEndpointResolver (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5174faf9db1ba298dfe41acd0dc3fb25ba62bb3dcd71b1e87e34ace37dec7303"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_logging::build_formatted_string (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c32681090ecc9308ea898b8ba1d34fe4b51688c8e678228e08e1ccdc71f31a"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_modules::module::require::require (cyclomatic 20): llrt_modules::module::require::require has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/module/require.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42bef6c12b19512fea14a32fa9390634b9d0029fc90d9c507e4fafac4453335"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyAlgorithm::from_js (cyclomatic 20): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c0a0067616bf39ebff2354592aa8b34f4ec61c521492579b6fd2b10ba3b370"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadableStreamBYOBReader::read (cyclomatic 20): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byob_reader.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"174c3f484076f7e74a8e944d2b7689543045229d0d40093c3046edd10dd6afff"}},{"ruleId":"D1","level":"warning","message":{"text":"LookupOptions::from_js (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_dns/src/lookup.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f69bfcc9037fbbf90bee17804109b44a07fa349d86e62b18871adf08b5db61"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_fetch::fetch::build_request (cyclomatic 19): llrt_fetch::fetch::build_request has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/fetch.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7f03ec1c38bec2daed84e9e0422a5b751a0009f76d1cfe263e92cbe67ea4e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Socket::connect (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_net/src/socket.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"092a15cead7e54e2267ff6a373f97d6174763fdf4cfb319b2d9ccae8428f8729"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadableStream::do_process (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream/src/readable.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dbaa98476dee0b6ab3665c62ac1aab996098df5e68631412b83f474504535a"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadableStream::readable_byte_stream_pull_with_default_reader (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebec95d200fe23a6b66ed13f25942bec0c1116dae26f9fc13b7d558782a6a56c"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_modules::package::resolver::load_node_modules (cyclomatic 18): llrt_modules::package::resolver::load_node_modules has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad14f7f28c56b752b19a2736eb3e09c8cda944386b5d5148bc8dd756c8ac5002"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_buffer::buffer::write_buf (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_buffer/src/buffer.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a963cea8fb74635814d2c8fe23cd4a6d0b68cc53f294defeb5925e405822d98"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyUsage::classify_and_check_usages (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c36fae6b3693a1913d92f2847b34254d137af06b4944ece841201bddbae2582"}},{"ruleId":"D1","level":"warning","message":{"text":"Headers::append (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bca891daebeaa073310ac064d5dd297c9a47d3863465c8d7510fe3aacf42d86"}},{"ruleId":"D1","level":"warning","message":{"text":"DateTimeFormat::new (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/date_time_format.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8948cef90cb233e12bfc658e5bb785e5e44cde1b001cd178adc203a7a58470"}},{"ruleId":"D1","level":"warning","message":{"text":"getAwsChunkedEncodingStream.getAwsChunkedEncodingStream (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shims/@smithy/getAwsChunkedEncodingStream.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab1b1a88e5d1ca0f1e8052539eec36b8c937937651447ef8eb1d15faf8fa5c6"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_modules::package::resolver::load_package_exports (cyclomatic 17): llrt_modules::package::resolver::load_package_exports has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"542dd81447ea0b41db90e109a7507f2f6a10e977527fa0ff73b5b5f2fdba1eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_buffer::blob::process_parts (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_buffer/src/blob.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c63d86c7127c64f76ee35f43025e9b7c91a4405abec56821a7c61cd73e9be8e"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_crypto::subtle::key_algorithm::from_hmac (cyclomatic 17): llrt_crypto::subtle::key_algorithm::from_hmac has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e6155e93378f130a5089ea6c6644ae9a16834a2f28aee2a3fd6b3ad0be5382"}},{"ruleId":"D1","level":"warning","message":{"text":"Headers::from_value (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9b78a0167539ca4a91c3b1ca1cd724999c5c885d5a33c37f9e7b9c9a95b0d1"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_timers::poll_timers (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_timers/src/lib.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3df7f88592d7e11b830734960fcd0341c2c5a7e69946f7392c4966517cc7b7"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_json::stringify::write_primitive2 (cyclomatic 16): llrt_json::stringify::write_primitive2 has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_json/src/stringify.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6215b8ad1c9fe20845bf75b149013154330d47c531bdc3756d1b1de23a333784"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_async_hooks::invoke_async_hook (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_async_hooks/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c1ae86c1540492617724d5a6ea7efbc61ec2f89001f573dab682c03ccdc646"}},{"ruleId":"D1","level":"warning","message":{"text":"FormData::from_multipart_bytes (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/form_data.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b85b8480f31f059cac59176a0f5d12b58a9732ea5ad7e9fca4f9f9df01897b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Headers::set (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f1f75ab8a3a8b59cf8ae26e6f06309f2c15ea259ebafda242119d05c9f4aec"}},{"ruleId":"D1","level":"warning","message":{"text":"llrt_util::text_decoder::utf8_incomplete_tail (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_util/src/text_decoder.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b156f01b82386608b0d868dba38da2cc85cd57eef2d6d0d60d07ab29c0223f47"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_fetch::fetch::get_fetch_options (cognitive 116): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/fetch.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"2587951d4b9be8ef9a78326f4806472b7c5cd412d390aead891634cddc5681e9"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_logging::format_raw_inner (cognitive 114): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfddc4227f68058a056e461aed812afaf59a555948e21bba8570ca7edec4882b"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_fetch::request::assign_request (cognitive 113): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cf77d4648d31533d2437e4fe2f7a2d4633c353b44b8a7574b2b9a8e8910637"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_modules::package::resolver::package_exports_resolve (cognitive 106): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9be3d6c76dea6f49efa51d5e6f10828814308e37aa490f9bf0228d6fbba9a5"}},{"ruleId":"D2","level":"warning","message":{"text":"StringDecoder::decode_data (cognitive 94): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_string_decoder/src/string_decoder.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa5132787954522f6f269d0739dfbb672cf14843831be28eca237e184e6156f"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_logging::write_object (cognitive 88): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc2331897ac958e81b6b0d2bb5eaae259d7b3525e3478e662992b987c965e09"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_core::clone::structured_clone (cognitive 84): llrt_core::clone::structured_clone has cognitive complexity 84 (threshold 15). Drivers by points: if/else 19 (59 pts), loops 5 (13 pts), match/switch 5 (12 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/clone.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1b3768323d3ca9dfd2838ea00626d379906ad0c980dba9893f45f90eeddf8f"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_core::modules::console::write_lambda_log (cognitive 79): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/console.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c41e0e0dc17555623872541d91f8762e03bab5102852353acf38514f1d57a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"jest-expect.JestChaiExpect (cognitive 72): jest-expect.JestChaiExpect has cognitive complexity 72 (threshold 15). Drivers by points: if/else 36 (42 pts), boolean chains 21, ternaries 5 (7 pts), error handling 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 2 of the 72 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 420, 69, 140, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-expect.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e28ee65d35f1d5f35d31bf884fdab15aa48f6bcb6930c3f5ee7c776d650225c"}},{"ruleId":"D2","level":"warning","message":{"text":"jest-utils.iterableEquality (cognitive 71): 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\u0027s 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 \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-utils.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebed2c70f881fe62cf3902de4f117b9966abdd0f1c34fa9348eef54bc10d7f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::listen (cognitive 67): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_net/src/server.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a726231e4eb1b7dd8e724b14f1c5f7e628d53fc504304f700e8e0697320dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt::repl::run_repl (cognitive 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt/src/repl.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"73599ed6e0102fc0fadf90c1043ff0640a1ae35ef2397584638b31a3216b164d"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_child_process::spawn (cognitive 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_child_process/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89d5c339658921632587a29aa951f488ae520a107ee28ea85b1c39c1fc15ac0"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_path::join_resolve_path (cognitive 55): llrt_path::join_resolve_path has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (45 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_path/src/lib.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8c8444551bca90b219b4258d17592ef08034218205e6391376554ae904efe9"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_fetch::response::create_body_stream (cognitive 52): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"083b0d33b722ba67326017c2e0c4c48c41a3519443648aaf383b2a3c2508f8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Request::new (cognitive 48): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df55264bf6ff15baa1035a15c66f3fffac943ca5911a993eecd02ae4854c23c"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt::start_cli (cognitive 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt/src/main.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7370a239dcc239c9bcd634526bca1d6089dc87559ff7d406e80bcad0a4cb9a96"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_buffer::blob::process_parts (cognitive 47): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_buffer/src/blob.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85eb32e8741014581256b112a31e5306e6972006b2757e0e3031f372e1cc157"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadableStream::do_process (cognitive 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream/src/readable.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"767c8c294b1213fb9ce5507a809481f5adc0a54db7b413e84c9fd1a9b4e2f1fe"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_intl::pattern_formatter::format_with_pattern (cognitive 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/pattern_formatter.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3353ed4a78eb1808382833fbfeecd1f46445a97637b96b175e1d7aab3fafb2"}},{"ruleId":"D2","level":"warning","message":{"text":"FormData::from_multipart_bytes (cognitive 43): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/form_data.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c7b804bf3deb71329d79b6a56935fa6178399794da49bfe1e135ce3fafdc84"}},{"ruleId":"D2","level":"warning","message":{"text":"Headers::from_value (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bea1856736f6947e30b212dd64e64a4ffb68f990a88f9f88e3b626758140ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_modules::module::require::require (cognitive 40): llrt_modules::module::require::require has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (31 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/module/require.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92604ae9f15172ddbe584327b620ed2dcdfc3e0f32486e16f2bf132913fb2ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket::bind (cognitive 38): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_dgram/src/socket.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d984fc6f4a8395216ff805cf6a77dc7f0ac1b2d8ef1195d454232ceddc24cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_logging::build_formatted_string (cognitive 37): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90f02b61b0c55c317dafac1f0d487ecd09afba984084967019c5341a582c4d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Response::new (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5613d57ff4191f0f205c2caead51afaf9c76ffdb3d5d61f331e4ab3f9944d9"}},{"ruleId":"D2","level":"warning","message":{"text":"getAwsChunkedEncodingStream.getAwsChunkedEncodingStream (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shims/@smithy/getAwsChunkedEncodingStream.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfe9ab3fd6fc55c35a544026168ade25154f2adf7a735fb25b964393d6bcc97"}},{"ruleId":"D2","level":"warning","message":{"text":"WritableStream::process (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream/src/writable.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a144fd10faef559b7c16a581cab26e57442d66b4a7fc7896decfbd0b0fea929"}},{"ruleId":"D2","level":"warning","message":{"text":"jest-utils.eq (cognitive 36): 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\u0027s 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 \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-utils.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7b475985dc3cf6ea6debbe8e9951393f7e342723b1447e247a251e5e7a466f"}},{"ruleId":"D2","level":"warning","message":{"text":"TextDecoder::decode (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_util/src/text_decoder.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a4e0eea88f457bbae103e5baa9769d6f9a712c886d287a94b579d2c55b2955"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_modules::package::resolver::require_resolve (cognitive 34): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac1b44766a67899bc37039aedc089db64d828fc18165f4c0002abdeea40ef05"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket::start_listening (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_dgram/src/socket.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"131dc47019dabf0ca8cf37cc5b3bd2cf734c2811136513ef54f68ecfa899829b"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_modules::package::resolver::load_package_exports (cognitive 33): llrt_modules::package::resolver::load_package_exports has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"a624e8674f66a74bc2a608f2dadf2dadd652d8313ef16e785f14d86566c6d97e"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_timers::poll_timers (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_timers/src/lib.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18e87c5c01208914e588d112d1f1dc493342365e03f3240dbb4e6c0fe54bdba"}},{"ruleId":"D2","level":"warning","message":{"text":"Headers::from_array (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcc0fd909499848d68b9b7eb813aeef093b61f7cf9c6a91499554fb8d355e41"}},{"ruleId":"D2","level":"warning","message":{"text":"getAwsChunkedEncodingStream::pull (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shims/@smithy/getAwsChunkedEncodingStream.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d1b1cd3b498bf4ef880062388f1443538e903d324ad7e338714d3ae19773f4"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_crypto::subtle::encryption::encrypt_decrypt (cognitive 31): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/encryption.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd8a010898782ead133e71e2ebe221d91356ee7f49f99fb5f42c518aad3a9c4"}},{"ruleId":"D2","level":"warning","message":{"text":"LookupOptions::from_js (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_dns/src/lookup.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8038eb176391be857368e82cb6c0bddde80b8e3e95a769308c167d443b5acf91"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_modules::package::resolver::load_node_modules (cognitive 30): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"da440139c6da3c4911d62174d52633626bcb7082bfc753617a6def4ac002208e"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_intl::date_time_format::build_format_parts (cognitive 30): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/date_time_format.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c43255c1fc311d2a4c0d7bf2d2086a68bb9e817759e0043283af331f4f9a62"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_fetch::fetch::send_stream (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/fetch.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c1cac69e4bb3fe6cb858b9d92e2001c6b54d41e895b4a4fdf4cc7265526f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket::connect (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_net/src/socket.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f87a3e13a0bf28a98a336894fe1494efe698f2d6871c061cf48ce7496b7511"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadableStream::readable_byte_stream_pull_with_byob_reader (cognitive 29): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"525c73fd37ef7c1e4e3a663f50f17dcc2bc0f4b5f556c2c300acbc3d8c1e08a2"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_util::text_decoder::utf8_incomplete_tail (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_util/src/text_decoder.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1f44fac0154de9317cc496de4320d605705d6308b8fd0eb940184d28a88bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"XmlNode::to_string (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/llrt/xml.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd64ee00ff3f85361d690d840b830b03169b9ebc8b1668649eafb91628a4e05"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_crypto::subtle::export_key::export_jwk (cognitive 28): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/export_key.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eef200642a3f01bfdf910e3c8bc43e1cce51fc762c0a1ef07da59bbead3daf"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_fetch::fetch::build_request (cognitive 28): llrt_fetch::fetch::build_request has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/fetch.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9a83dbd2db5527de8473ab34b9c3992f66ff18fd876a47ccba75fd48fda5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt::run_tests (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt/src/main.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd6c70ee79b6004a32820b0dfde82342f205fc466dadd30e83a01903cbf017a"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadableStream::readable_stream_pipe_to (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/pipe.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf58c50c642dbefd0a97950fe7652a1d96027dc18ffdf65f26ddd3ab8450eac"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_modules::package::resolver::load_as_file (cognitive 26): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"124e14761a0e08db9331ca396690650f5291f7894c0a440f1f0c555773208f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_async_hooks::invoke_async_hook (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_async_hooks/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"530e79d5c78e5f5167554da2b4d1c4f533462693437bcf5722396f8063418e24"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_modules::package::resolver::load_index (cognitive 24): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cbb2c297ecd2da00caea6f69c9a0525cdf6bd380b6970fa855d2b97aaa5f65"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_buffer::buffer::write_buf (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_buffer/src/buffer.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"109e23aa0efcdf7c724b7ff2f7e281eb3a2953184e0d14b0ad683e34aaaac531"}},{"ruleId":"D2","level":"warning","message":{"text":"DateTimeFormat::new (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/date_time_format.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2477275da47c1197f3d7d615dba41d52a4d095b81b23434d0aec688bb87dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_crypto::subtle::key_algorithm::from_hmac (cognitive 23): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92533d9dd1196a7014889876958b0811ff91a2499af73bfece67fbde9d7b20b"}},{"ruleId":"D2","level":"warning","message":{"text":"MinimalTracer::enabled (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt/src/minimal_tracer.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9e8759ea42c0fcce11f008fd261470ce4683d880ce6ad54ba84c566e830488"}},{"ruleId":"D2","level":"warning","message":{"text":"Blob::from_parts (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_buffer/src/blob.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"58402f81aeff25b3d61c6c9ac2227b89c52ba2bcb1e973683faddb75dd94c1a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Headers::append (cognitive 22): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd72f7b694ff5b471c85abe821fdac6fea820c3e3053bc3a0b76722c7963aec0"}},{"ruleId":"D2","level":"warning","message":{"text":"defaultEndpointResolver (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd434aad45997f516f193166ca8d6cb37d69f9e87e377039fb191e73200a435"}},{"ruleId":"D2","level":"warning","message":{"text":"RustCryptoProvider::rsa_oaep_encrypt (cognitive 21): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd10207a8bbeb6b63339305eea0bf7821e855c5e64c6036a6b910b998eba25b8"}},{"ruleId":"D2","level":"warning","message":{"text":"RustCryptoProvider::rsa_oaep_decrypt (cognitive 21): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"b535729bd6dc4d1cf7dcac4e6818c9e41903202857a506c8eb7bb043115e1b7a"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_crypto::subtle::key_algorithm::import_okp_key (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"9843bf886523b8e7acaa1aec7e890c94c534292c74c52c513e33251605367f62"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_crypto::subtle::derive_bits::derive_bits (cognitive 21): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/derive_bits.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c804f472061608a2073a1b7ed2390569337a6dbd832e4423b69276b0b8e7743"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_json::stringify::write_primitive2 (cognitive 20): llrt_json::stringify::write_primitive2 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_json/src/stringify.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d85f5799a7298c65911940877bc9d55bd45a4858355607662c8da19b188d837"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_json::stringify::iterate (cognitive 20): llrt_json::stringify::iterate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_json/src/stringify.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"1686769fc0c168aca85745a6c1eb1a7dee28a60e6fdaad31c9151cfc545d1ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyUsage::classify_and_check_usages (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e589e7020a537491c65e5c00021aa6725df61d184c68a7fb2c6cc07418d8ef94"}},{"ruleId":"D2","level":"warning","message":{"text":"Response::json_static (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7f537551004d02fcbac03e50fe67fbbc51df9306a6c63e7fb62269fd076083"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_fetch::body_helpers::collect_readable_stream (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/body_helpers.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e03de9d7662510958e2b212639414208b3fcaa7a2c56dc793663008708a656"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_os::network::get_network_interfaces (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_os/src/network.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc0b001ae53021ed0b96617b5525c0740e0cf83cdd2c867227f687a929dbe72"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_core::modules::embedded::loader::init_client_connection (cognitive 19): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/embedded/loader.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3319517c18bcda841c6e0e04e78ccafd69b9a0aa37c848816ea61080908cde24"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_modules::package::resolver::load_package_self (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"148d7d7b2f9615cf6e1da266bfa6784955050314d0e4d5fdd4fbe24115997b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_crypto::subtle::key_algorithm::import_rsa_key (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"a670724ea827f742ade74209cf347d3642b87546530cdfd3017e21112edcc283"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_fetch::fetch::send (cognitive 19): llrt_fetch::fetch::send has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/fetch.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2c38552fde5d3f3091e4faf98d87084b346a2db56738d2e0f3d3584c2c272e"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_url::url_format (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_url/src/lib.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0677e8967880a934b37701e2ec95cc58b5fb0d155c933e56ab0d354b16d87704"}},{"ruleId":"D2","level":"warning","message":{"text":"Headers::set (cognitive 18): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e420055128a134fd6d782068082e9986a100658911798f9e77bed512d00f08cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Response::take_bytes (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1d3aa5fe241ae94fd7e9a004be28c02e7e7634d9dc77e33ba3ecfea2f08f58"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_fetch::headers::normalize_header_value_inplace (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc1c919ab339f9802f5b561f639330b341d73930b20a661f75a1b2548d482c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadableStream::readable_byte_stream_pull_with_default_reader (cognitive 18): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dc504fc8225707a367ced382a37a5f4d727a3f0c0da65cea573acb86fdb643"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_utils::bytes::replace_invalid_utf8_and_utf16_into (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_utils/src/bytes.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa228a7a1e7ad48587a89a58e0d8f39a5fce48e5348d829e59bec272abb8e121"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageLoader::load_cjs_module (cognitive 17): PackageLoader::load_cjs_module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/loader.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"815c9eca87f956e8f964aeb2ea9aa9ed5b9d9573c5125d235351570a338bb186"}},{"ruleId":"D2","level":"warning","message":{"text":"Response::body (cognitive 17): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"86435590c430e18c30a1e524b8f65bcdd61f8fcfe3c29384a89c11748cd9cceb"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_path::dirname (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_path/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6582f36ab753ba052dd7a5fd67e1668355476e89b89d61332e84f0906e38171"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_path::relative (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_path/src/lib.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d7b573953dfaa5c1b93f5c20594d9a8bcba672fba20cad9e714ad133995e94"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_modules::package::resolver::package_imports_resolve (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2633e087d23bbe9b325221accf1d2e9dde9223cccb3b55ae8b637c432689805"}},{"ruleId":"D2","level":"warning","message":{"text":"llrt_intl::date_time_format::format_date_in_timezone (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/date_time_format.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c923db57fd6186264e2e2fe145406f41b6cbaa0de7f51f05ad059059b19f9e35"}},{"ruleId":"D2","level":"warning","message":{"text":"URLSearchParams::from_array (cognitive 16): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_url/src/url_search_params.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ffd55b48fc7b8d4283013452ff95f71d2fe6ed9224a37c752ef03cd6a51e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"lambda-server.app.all(\u0022*\u0022) (cognitive 16): lambda-server.app.all(\u0022*\u0022) 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lambda-server.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6efb34ad6e529f52a842691bc61e0dc38f25e5d569aea2f39b1596aba6398e6"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lambda-server.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f1e7c4afd7093132a67f0c95fc567880b37bc12498d14822401931c26e33c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: jest-expect.JestChaiExpect: FunctionTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-expect.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"141cc0efbf5fec027b528d91f54399b84b122e1ef2fe7667f99d7d5a791da5e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: subtle/key_algorithm.rs: FileTooLong \u2014 1764 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 1264 over it, 3.53\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d2bb88dfa951160897ab83d548975f4135af3c3b7e9b16b2eda5032744859c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RustCryptoProvider: ClassTooLong \u2014 1164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 764 over it, 2.91\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb9f8356b545bca2c12640a44aade56687605075fb37ddddc803304bbaa8df5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReadableStream.readable_byte_stream_pull_with_byob_reader: MethodTooLong \u2014 readable_byte_stream_pull_with_byob_reader runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.82\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fa337fa484c0acdea659bc0a55125ab44b602e6bf46de9bc3f2e6f9cdcd87c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cldr_data.rs: FileTooLong \u2014 1319 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 819 over it, 2.64\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/cldr_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b872bf644a40173209b7699a6c0e98f180f367ea98987138c18e22561d88308"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: readable/byte_controller.rs: FileTooLong \u2014 1291 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3e20a0cb37fe6e2205245020919685784407333f642db32f8a217651b36f46"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OpenSslProvider: ClassTooLong \u2014 1008 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 608 over it, 2.52\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaa9d69d33ed53877c718e424139b6f14b8160427263951d6d2d1034daf9a91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rust/mod.rs: FileTooLong \u2014 1259 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: RustCryptoProvider (145-1653). The bar is 500 significant lines; this is 759 over it, 2.52\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc926632e130813afb20618914aa56dd6bf21c611506b9d5346541be9debae34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stream/tee.rs: FileTooLong \u2014 1240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e580944505f8129d8e057fad7a20d3c687295a60285db1c10757021d91ff366c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReadableByteStreamController: ClassTooLong \u2014 990 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 4 blocks, lines 46-1765. The bar is 400 significant lines; this is 590 over it, 2.48\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e1862c9e6255292b6b2f05820dcac1e1862574f72c5cc5dfee88dd2cc4e6e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReadableStream.readable_byte_stream_pull_with_default_reader: MethodTooLong \u2014 readable_byte_stream_pull_with_default_reader runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ca65a977257cfcfef54caf0080fe338110531dcd7af980ddfff4e1b4cfca03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: provider/openssl.rs: FileTooLong \u2014 1078 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26a541f2ccbdbabd4f747221d6b459b54a75129c727380643b8d0b93e6f281f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_logging::format_raw_inner: FunctionTooLong \u2014 llrt_logging::format_raw_inner runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.15\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"541eb52b22f57cf0b35f02c923ad544e8041bd464b85b64978c92c616094b5d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReadableStream.readable_stream_pipe_to: MethodTooLong \u2014 readable_stream_pipe_to runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/pipe.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf48772f031605d5737637d6f50031beaa8c9cdb6d76acd9836255d0b12b2ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_core::clone::structured_clone: FunctionTooLong \u2014 llrt_core::clone::structured_clone runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/clone.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"54100bfe68c434de9a559d6bb3e8e141f4fd1500ba33911b1fe9c78f5512fd71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/response.rs: FileTooLong \u2014 905 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: Response (5 blocks, 119-985). The bar is 500 significant lines; this is 405 over it, 1.81\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e576a58cbc104bf4345bf7a0345500ff240d18be06a07206edec87c313fab9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KeyAlgorithm.from_js: MethodTooLong \u2014 from_js runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"022b04f6593d87306a231ff82fb4694a3e36ee1e28037d9ac5e339b7eab3f5e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReadableStream.readable_byte_stream_tee: MethodTooLong \u2014 readable_byte_stream_tee runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a055833470485bc80d39573bb6544512dc0cc0b0134686e39eebec03f453053b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_fetch::request::assign_request: FunctionTooLong \u2014 llrt_fetch::request::assign_request runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"21058d5066bd0745dc6cf77b2809a2ad6ff8d06db6edb170e4773e1ff9e36073"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Response: ClassTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 5 blocks, lines 119-985. The bar is 400 significant lines; this is 210 over it, 1.53\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae679ccc5c87417c24523b73f63576744bf5e2b33cb7d1235f9b3d13748ce1a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ZonedDateTime: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/zoned_date_time.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"29326207943f308545edd53cb4251e3ca9da1a0e9028be4e50f7470dff716c20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: provider/mod.rs: FileTooLong \u2014 742 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 242 over it, 1.48\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aa3dfa78de70f6437bbcd4fd22d8b58f634c05e6f3055e03dd660f801b2a4e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReadableStream: ClassTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 4 blocks, lines 147-1073. The bar is 400 significant lines; this is 175 over it, 1.44\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f6898bee55dbe12560e3653658e5207376ad94fa5616727f18237730e299aa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReadableByteStreamController: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8a604d3128e9148f42d327b6f5b7e172b310aff048440876fee33789c72aa2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stream/mod.rs: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75eff0d4acbfb03ecaf6a4ceabd4e513425dc39dafb2678c91be337243b661b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_crypto::subtle::encryption::encrypt_decrypt: FunctionTooLong \u2014 llrt_crypto::subtle::encryption::encrypt_decrypt runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/encryption.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2e977dc476f5243e9d279b17a9477288f5028c1e682d9f11aeac5a12edb39e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_fetch::fetch::get_fetch_options: FunctionTooLong \u2014 llrt_fetch::fetch::get_fetch_options runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/fetch.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ad26f3f7debd50e2c0c77d00db18c0daef75cf98df67b09524b50fb32c9e43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: provider/modern.rs: FileTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 176 over it, 1.35\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/modern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9f11dc2907ab255e6a86c8921b00809382bdaea444910ede0842785e45c9ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_fetch::response::create_body_stream: FunctionTooLong \u2014 llrt_fetch::response::create_body_stream runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cde97fd899864d602d8939ad757609e87476c7a9b4e6d5782c3fd3b843c86f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fetch.rs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/fetch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a505e38d5c85190cb5c295e46176e1f025ee5299dc42e245d39a8e6b2de024dd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReadableStream: TooManyMethods \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f8423348a3a5ce7a3b6fd72c06f426f75e86538a91b8d0ec7e91d3f9f8e111"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlainDateTime: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/plain_date_time.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1c9243db491cf368a68e6c9b4e037307cf2b837a92fb7da343af51ed466c24"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt::start_cli: FunctionTooLong \u2014 llrt::start_cli runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt/src/main.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b46671804683f21c213fb176fe69c98a17b67cc7fee1d3ab75fef2df49d3c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/request.rs: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: Request (4 blocks, 73-625). The bar is 500 significant lines; this is 111 over it, 1.22\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df23687c5bcf576202acfec547c90f915068567c6e6bbe433630a74362921857"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_child_process::spawn: FunctionTooLong \u2014 llrt_child_process::spawn runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_child_process/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"70548f150a22464ac45f1d05c33b5b8a26d4f5ee5ffed7a6604964f97d9cb8e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/buffer.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_buffer/src/buffer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f8da234dda77f061860342c75ae70307b132e1c3cde648132f177483d3fcef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 95 over it, 1.19\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4cab8caf404af4b2656ded236180cf5b5f6b0463b307d17a67d60f870f1613"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt::repl::run_repl: FunctionTooLong \u2014 llrt::repl::run_repl runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt/src/repl.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0f5f217d46f15a758c14cf0f88d37ce544bd3a00c38f64fd425e082afbddd6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Socket.start_listening: MethodTooLong \u2014 start_listening runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_dgram/src/socket.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4464d5aa5c00765ae86206d7aa567a2a4976cedc3b1bf2fcf925ca0d87ea8827"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: readable/default_controller.rs: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: ReadableStreamDefaultController (4 blocks, 66-739). The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/default_controller.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"658cbbf43c6065ecbc9166d83095736679d4a46a744babbb48d0a8a69de088ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReadableStream.readable_stream_default_tee: MethodTooLong \u2014 readable_stream_default_tee runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66a1b18ef5cd43de5ed9e61ad23019b2b7a55be29538a8fa518747541cf44a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_stream_web::readable::stream::tee::tee_pull_algorithm: FunctionTooLong \u2014 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 \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a831a1f308e2750c8c9f27b54b0efb2e7fe7dac9de2ffb69c498182560960d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: URL: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_url/src/url_class.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b849eaf6efe4c61287d778d93d67c130f29c813609dc19a5418be09351322a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package/resolver.rs: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6dba1e4894a03148a04e7ff8f2fc02d175b46d3485efda7c3094f6c3f5556a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./build.mjs: FileTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3bdd8fd94648a504db30ed87216206f521bea3fd111f722f3fcd0492163131"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: writable/default_controller.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: WritableStreamDefaultController (3 blocks, 37-720). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/writable/default_controller.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e3c67c5b4f73804b27d95c7f3b624a2e67161d08274a14e9ecd3318f3fe581"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReadableStreamBYOBReader.read: MethodTooLong \u2014 read runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byob_reader.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca06e08f97e47fd0d21b9bbdc82232045b3522c1b00757f552ee38184a62507"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Duration: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/duration.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b523cf7479547a0329f97f30b7f4bf55f33616789359f1f175ebd6969671f5f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Request.new: MethodTooLong \u2014 new runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"870087ebe771c6917806913339dfe9c7ec541e1aa617f83a95e68b708630f5a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_crypto::subtle::export_key::export_jwk: FunctionTooLong \u2014 llrt_crypto::subtle::export_key::export_jwk runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/export_key.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3888446ef732471bc9c402d91a0d46ac94844f4d8cb760f40b0fc744df7061b9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WritableStream: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 4 blocks, lines 41-774. The bar is 400 significant lines; this is 18 over it, 1.05\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/writable/stream/mod.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b12ada7aece14f4c3b7f9cc664fbc73d004dc2f205a4b1e6960181dc2420941"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_logging::write_object: FunctionTooLong \u2014 llrt_logging::write_object runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c54350e6f46ea817cd775c90bb353c9f1e62145dfe1b2d21de322e3da1f647"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_modules::module::require::require: FunctionTooLong \u2014 llrt_modules::module::require::require runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/module/require.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9173f58d612ef000829f95e7eedd56c37959acca9385cdd391ec93dd673c7cf3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Request: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f840eed9b382a14ef3b3cc7f8d37def651dbf7297c708eaf7d94b47359920f67"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WritableStreamDefaultController: ClassTooLong \u2014 409 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 3 blocks, lines 37-720. The bar is 400 significant lines; this is 9 over it, 1.02\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/writable/default_controller.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ba5a19480a4697cfb9369ea96fa136dba8fdf5eccf8a9bfa7d981713654769"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llrt_json::stringify::iterate: FunctionTooLong \u2014 llrt_json::stringify::iterate runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_json/src/stringify.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e62b2f484270dd15dea740d0a2c4e049d111999a76fdfd53de1267f5d3500b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/headers.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: Headers (4 blocks, 49-586). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42386deeca11ed1eb7bd3eadf72135bee7425a1f5fb5e8d5150a264749ee51c9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReadableStreamDefaultController: ClassTooLong \u2014 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 4 blocks, lines 66-739. The bar is 400 significant lines; this is 5 over it, 1.01\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/default_controller.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d3f553e63d4d5f1bc69ededb5a04ab33ba629084479c6c9e0f7b008e48ed79"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): modules/llrt_crypto/src/subtle/key_algorithm.rs:920-1027 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1037-1118 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4768db668d6c5e98d038746d40188c00287b61c07ac8a47c18f4c3a8cd478d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): modules/llrt_crypto/src/provider/openssl.rs:439-496 | modules/llrt_crypto/src/provider/openssl.rs:505-564 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa849ace8247bebb00b32b6dab824b8507dce578a8a61de9e86474955563b50f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (34 shared lines): llrt_modules/src/package/resolver.rs:266-332 | llrt_modules/src/package/resolver.rs:335-394 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faae7fc3ad169db4e18c5dba274724a60e4eba111549c02026e684b462e767c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"88436abf63694759dd2dbeee306dd0601e4069f8befe1b7f11b13f878a33f8a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/plain_date.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4468dda53954e0f4ee1a6be2f9ad3cf68247347716516168cf051e0c9dbe99af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/tee.rs:1545-1577 | modules/llrt_stream_web/src/readable/stream/tee.rs:1627-1659 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d4b99ed68c7fa3461697b55f67fb1ce584c6d19a7c5132d9571f6dee96f153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): modules/llrt_crypto/src/provider/rust/mod.rs:1156-1186 | modules/llrt_crypto/src/provider/rust/mod.rs:1456-1485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d7480a12fd0db5c522b9b7f039eb190f69b59fb77b181ef039543a1734bc21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): modules/llrt_fetch/src/headers.rs:82-112 | modules/llrt_fetch/src/headers.rs:199-229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4aa274c303984e41faabe02a50d8fff48c5e89e914214105698e2a80731e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): modules/llrt_stream_web/src/readable/byte_controller.rs:100-124 | modules/llrt_stream_web/src/readable/default_controller.rs:110-134 \u2014 before extracting anything, compare \u0060modules/llrt_stream_web/src/readable/byte_controller.rs\u0060 and \u0060modules/llrt_stream_web/src/readable/default_controller.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3eb2164418e5272d8b35b84b08ea08739f5aa8272bc1a0a1966289102fc91fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): modules/llrt_stream_web/src/readable/byte_controller.rs:262-279 | modules/llrt_stream_web/src/readable/default_controller.rs:252-272 \u2014 before extracting anything, compare \u0060modules/llrt_stream_web/src/readable/byte_controller.rs\u0060 and \u0060modules/llrt_stream_web/src/readable/default_controller.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae004e5f0e38c7f8f3935b481e838b4a7b2a2972b6eb9b123dec257c2ece5568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): modules/llrt_crypto/src/subtle/key_algorithm.rs:468-487 | modules/llrt_crypto/src/subtle/key_algorithm.rs:521-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7a16cb48e7087853afccdb5c394c2bc78d6908dea2a0a4791c41f7985ecc6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): modules/llrt_stream_web/src/readable/byte_controller.rs:214-230 | modules/llrt_stream_web/src/readable/default_controller.rs:200-219 \u2014 before extracting anything, compare \u0060modules/llrt_stream_web/src/readable/byte_controller.rs\u0060 and \u0060modules/llrt_stream_web/src/readable/default_controller.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cb775fc425001afc931d5eeee14fc95405517e6397d64510de3852577d548e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/tee.rs:832-850 | modules/llrt_stream_web/src/readable/stream/tee.rs:1159-1178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c928bb7fdba43b67b6e1efec442c68e4ed1dd9a9aa13804c4dfe115e5e782368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): modules/llrt_temporal/src/utils/date_time.rs:47-66 | modules/llrt_temporal/src/utils/time.rs:42-61 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/utils/date_time.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e753b411d5c70b1da115fd1a9c6d83cff40e4d84b5fc054ca5ff6dc31e67d8b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): modules/llrt_os/src/network.rs:62-79 | modules/llrt_os/src/network.rs:84-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_os/src/network.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5792c89f79bab799a18c5042e1b0d33e1d79419d7ab4aca951b72cb268751ff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201318 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/date_time_format.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"d604fadb9e2cabe71c93d9e96fc0ea9defaf052d8a115c81d17c0a07ae59dce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): llrt_core/src/modules/embedded/loader.rs:94-111 | llrt_modules/src/package/loader.rs:61-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/embedded/loader.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c25f092f8cdbbcdd726c80e649e059d18881182b359015c40fd6b977d60746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): modules/llrt_fetch/src/headers.rs:74-90 | modules/llrt_fetch/src/headers.rs:191-207 | modules/llrt_fetch/src/headers.rs:251-267 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d09430fca8a23e284f667ece11c5284194f6794161634d71bf188dfc3b9685"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): libs/llrt_json/src/stringify.rs:487-503 | libs/llrt_json/src/stringify.rs:532-547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_json/src/stringify.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"740fd6ef848b2706366aa28a646721ea39748ca24e4474cccfe94e512d7ba937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): modules/llrt_child_process/src/lib.rs:559-575 | modules/llrt_child_process/src/lib.rs:577-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_child_process/src/lib.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"5797a8d83ef2264c73356fd5ec8400182805408f07b64d3e49ff6c68c49dcd09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): modules/llrt_crypto/src/subtle/key_algorithm.rs:1243-1259 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1284-1300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94319d2fbb889d6912bb46b7fb2f1ec214ed4b38d1b684dfbe6d481b3ec1398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): modules/llrt_fetch/src/response.rs:821-837 | modules/llrt_fetch/src/response.rs:867-882 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"068feb299d90d1d18a80e17769ea2c96765fef7724e111f38cc7ddca7c28d2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): modules/llrt_fetch/src/response.rs:905-920 | modules/llrt_fetch/src/response.rs:1001-1016 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f018bdf6443b47eec920a2c08ac28b67730dd9d3f77daf12a0f53cb07563155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/tee.rs:857-872 | modules/llrt_stream_web/src/readable/stream/tee.rs:1193-1208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9018538ed2fad84eb8ae0a2779caad8736382c3d684056eb7da7575a485afbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): llrt_modules/src/package/resolver.rs:277-291 | llrt_modules/src/package/resolver.rs:341-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"092390aff0faf2b48821d38d668b454bf8ba044cf4b10f162fa118b110f8c62f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): modules/llrt_intl/src/pattern_formatter.rs:81-95 | modules/llrt_intl/src/pattern_formatter.rs:99-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/pattern_formatter.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0b1b3ae9801f10e0429c5cef9cbd9b95cbe51e44a89c5cfd47e4fc1e18dba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"d290466633b1b39d14dbe6df450c35ead84545175ee42a107c7300e93c1911e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): modules/llrt_crypto/src/subtle/key_algorithm.rs:969-981 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1059-1072 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bac27bef2fe79cdb8e2aa0f4feddab9a034a5502de2b58a1541e388a49f068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): modules/llrt_fetch/src/response.rs:567-580 | modules/llrt_fetch/src/response.rs:602-615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7dcf035481e569c957f4f412c1e6d14a7c09a63f88cff31d3abbfe5c34c7f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/mod.rs:781-794 | modules/llrt_stream_web/src/readable/stream/mod.rs:878-891 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/mod.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb80599eaf64267d6117aab5afb4b3b1a11c457fc0be19675c7b9822fa359bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:468-480 | modules/llrt_crypto/src/provider/openssl.rs:534-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac26d3566532bc335ba5c65693ab824e752fa6f476e85519d29e66d3f809111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): modules/llrt_crypto/src/subtle/encapsulation.rs:142-154 | modules/llrt_crypto/src/subtle/encapsulation.rs:199-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/encapsulation.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92785ce462d5ce7517834ef3e44040e5e2c486931fea7a7070293670ae757d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): modules/llrt_crypto/src/subtle/key_algorithm.rs:452-464 | modules/llrt_crypto/src/subtle/key_algorithm.rs:505-517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24b430e5662d1c1610711f93a0605d83003918f7e15dbe77c188f0ef6dcffef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): modules/llrt_crypto/src/subtle/key_algorithm.rs:1013-1025 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1104-1116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"871aa12b3bb910b6099286f0996dde879259f2e944a7b65dadea5c9d0754da88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): modules/llrt_fetch/src/response.rs:922-934 | modules/llrt_fetch/src/response.rs:1018-1028 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe22e94f135008c53e08675b06955acf83c57598f4be2b3a91ac8bd399f78ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:440-451 | modules/llrt_crypto/src/provider/openssl.rs:506-517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5146c80a845a5d47ac187197328955da40670c59f24b76b0b27601b654d18628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:454-465 | modules/llrt_crypto/src/provider/openssl.rs:520-531 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b336a12e675fe39845e97e256de2c2f1da1b8c648d4131e16c6cff073bb1228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:923-933 | modules/llrt_crypto/src/provider/openssl.rs:936-947 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63367a1028d689c098b7d1aa23a0cb304fb8140343f2bcc0e759d0bc2221d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): modules/llrt_fetch/src/request.rs:289-300 | modules/llrt_fetch/src/response.rs:357-368 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"614f026c45d83f63e5e1164688ba1a3cfa9b83e5b511c54dea8a29e1fd4f278a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): modules/llrt_fetch/src/request.rs:527-538 | modules/llrt_fetch/src/response.rs:595-606 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"562ef99817085ccb84f5b1ffb97eaf1bc9ee1fd8fd83c9ad0a9935d89196e64a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): modules/llrt_stream_web/src/readable/byte_controller.rs:1633-1644 | modules/llrt_stream_web/src/readable/default_controller.rs:606-617 \u2014 before extracting anything, compare \u0060modules/llrt_stream_web/src/readable/byte_controller.rs\u0060 and \u0060modules/llrt_stream_web/src/readable/default_controller.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"780e9980ec4c5d31dab0f5a5c63b59f744d18eaf2c0fe827b054211bd05690cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/tee.rs:135-146 | modules/llrt_stream_web/src/readable/stream/tee.rs:528-536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15c3c44a03cb21a7e888377dda4ae98b5275b8fcfc323438534a2d566678bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/tee.rs:878-889 | modules/llrt_stream_web/src/readable/stream/tee.rs:1225-1236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35514a4be3866ad60338d2bedcd20f7d8eba734700b5a75d1b65d2cc14dd0c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:735-745 | modules/llrt_crypto/src/provider/openssl.rs:776-786 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ea32c303fa71a61ef2086680824da964acc68ae69adb0b4d9cfe72a5da02d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:754-764 | modules/llrt_crypto/src/provider/openssl.rs:798-808 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d86cb9bbcda5ebf64ebc307fe8f536bed46ee846afe5f01029609b59b96793c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): modules/llrt_crypto/src/provider/rust/mod.rs:392-402 | modules/llrt_crypto/src/provider/rust/mod.rs:451-461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4be2a0f39d3014ba33f37d6b549888a876f457b06fa94be98f68b862062020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): modules/llrt_crypto/src/provider/rust/mod.rs:993-1003 | modules/llrt_crypto/src/provider/rust/mod.rs:1035-1045 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bb8280c5e938172670c409d54b0525a76db0a7092179b69b54557f14d9e5cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): modules/llrt_fetch/src/body_helpers.rs:158-168 | modules/llrt_fetch/src/body_helpers.rs:188-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/body_helpers.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3ea47eef21772597ed1274674c88e81329c942bb6cd7e3ecb32f7165c3cc7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/tee.rs:652-662 | modules/llrt_stream_web/src/readable/stream/tee.rs:672-682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b4c4126de1c25e6700e1e6da7c225e71b6c0e8bfde0434a536b56787db5911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): modules/llrt_temporal/src/plain_date_time.rs:49-59 | modules/llrt_temporal/src/zoned_date_time.rs:49-59 \u2014 before extracting anything, compare \u0060modules/llrt_temporal/src/plain_date_time.rs\u0060 and \u0060modules/llrt_temporal/src/zoned_date_time.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/plain_date_time.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3179b5218b3434805721fe60559d03136020088614a059ab79d3a442f4cbc5e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): 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 \u2014 before extracting anything, compare \u0060modules/llrt_temporal/src/plain_date.rs\u0060 and \u0060modules/llrt_temporal/src/plain_date_time.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/plain_date.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7514bbd4f554ba78572d5f3661660d7c474ddf32fbe3705b09d4466bf632a11d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/export_key.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ac551328d8199c7d4333202cf5358013a2fc3db03a841060b2fdff459025bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fd174444b22b2245bd8f062bef756be37a4888e858ae1d2dd54b26abf07e8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): 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 \u2014 before extracting anything, compare \u0060modules/llrt_stream_web/src/readable/byte_controller.rs\u0060 and \u0060modules/llrt_stream_web/src/readable/default_controller.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2fd32a161272969466e9ab8e63579c1767145911120bbb7ed10a6591d295d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/llrt_logging/src/lib.rs:674-683 | libs/llrt_logging/src/lib.rs:734-743 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e9677f0700e31eea28588d0da1ffa3648b699fac3a4b7a5cb0a4c0c7077ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): libs/llrt_utils/src/bytes.rs:92-100 | libs/llrt_utils/src/bytes.rs:105-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_utils/src/bytes.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"115381f920519d93d2434507e344492d3053b31c6d4500690b8f7bda067da024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): modules/llrt_crypto/src/subtle/encryption_algorithm.rs:79-88 | modules/llrt_crypto/src/subtle/encryption_algorithm.rs:108-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/encryption_algorithm.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c38a937e018d097b27d9564a9f49d64be48a550a3c2c4e6bbb970e0f5afbfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_crypto/src/subtle/key_algorithm.rs:1151-1160 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1178-1187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4186b3f1bf8fff3c6ed3ae828e7c7d790314dba19d3844f14c8e5c648ab54eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_crypto/src/subtle/key_algorithm.rs:1229-1238 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1270-1279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19768d6acd6643883be569af34e815911ac9e19286c5958e7278a3e45ebeaa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_fs/src/file_handle.rs:171-180 | modules/llrt_fs/src/file_handle.rs:317-326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fs/src/file_handle.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0492700b7e0cdbe606a0262923fb89c82cddbbef7a092a5b6a7ef56e997fc066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_fs/src/file_handle.rs:190-199 | modules/llrt_fs/src/file_handle.rs:335-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fs/src/file_handle.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15ac82254f2bd8da66fdb21c6cfe902524d3701b93471491ec04c3389402521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/tee.rs:1374-1382 | modules/llrt_stream_web/src/readable/stream/tee.rs:1389-1398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cb53231bb6e8b0a37a6bee68cf19fd3d20fac85ed8c15de20d54a213ebd011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_temporal/src/utils/date.rs:36-45 | modules/llrt_temporal/src/utils/date_time.rs:37-46 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/utils/date.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"da56f09f736790114ef3bafb9bc90c3cde08478eb2201c6ee0752f59287caee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"82534d9f230118120c886fe00b3c91ea4a6bc485050486efa872d112f66f0808"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"34515a3543dc135fc63a0014b8962b6b810637e9b05f5fb464a4706d0f9d742a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): modules/llrt_crypto/src/provider/rust/mod.rs:992-1000 | modules/llrt_crypto/src/provider/rust/mod.rs:1012-1020 | modules/llrt_crypto/src/provider/rust/mod.rs:1034-1042 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6d0dd706f5235b5cc21199680c19916fc0fbe75f56e894d2e1f1a55c071fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): modules/llrt_crypto/src/provider/rust/mod.rs:1515-1523 | modules/llrt_crypto/src/provider/rust/mod.rs:1526-1534 | modules/llrt_crypto/src/provider/rust/mod.rs:1537-1545 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19b33bf0e2d1ab7dad76e505763000ca5301d49a8fee6bf6b692244ca35063a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/llrt_utils/src/bytes.rs:104-112 | libs/llrt_utils/src/bytes.rs:120-128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_utils/src/bytes.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df7933687cd224ec519bcf273ac789d8d2cc99104552d271e4399dbfe3687a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): modules/llrt_crypto/src/provider/rust/mod.rs:637-645 | modules/llrt_crypto/src/provider/rust/mod.rs:709-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2668d9948cd3c61c7092890ca84ff77f3c23ebfefaffbc785607deef682a444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): modules/llrt_fetch/src/response.rs:470-478 | modules/llrt_fetch/src/response.rs:484-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fe28e63faf87193090b4a928f00ebd0f94575b0f0b904c295e02d08f62cfb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/pipe.rs:590-598 | modules/llrt_stream_web/src/readable/stream/pipe.rs:619-627 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/pipe.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2330b335ee9bda8536a8f6e56f0014717f6d115ed58f46fac9c7b58eb8a4439"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3922f9dea48015bfe825ccca60c266cdfff3a94c25ca464677c0fddda75b1a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"3febf5571e29373defd3d1f1e137a597096492ef25492ed9eb9de6d0a3bfbf08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): llrt_modules/src/package/resolver.rs:294-301 | llrt_modules/src/package/resolver.rs:356-363 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec5a9697665ef83a28cecf4126bc329a36bbffdc05af1e93c1827a5abd39bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:228-235 | modules/llrt_crypto/src/provider/openssl.rs:282-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8972c592a2342aaf90f5c1354cb7c0c7cb0e0f247a0c368173c16f3f1a877e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:404-411 | modules/llrt_crypto/src/provider/openssl.rs:423-430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb6d6b292bb5a35acece203e66077c2409449a5f536baf148d1f57ab5bb38fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_crypto/src/provider/rust/mod.rs:750-757 | modules/llrt_crypto/src/provider/rust/mod.rs:759-766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c88d7a178f40ebbe9b69ab6763efa315c9d94cf7c47a91fd4f663073073fe17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_crypto/src/provider/rust/mod.rs:783-790 | modules/llrt_crypto/src/provider/rust/mod.rs:792-799 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"a958f36df1485373e1b12d4312fb9d9e6b18738106a66d388db4162bd8e6f048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_crypto/src/subtle/key_algorithm.rs:1134-1141 | modules/llrt_crypto/src/subtle/key_algorithm.rs:1166-1173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b4fdeb6f2e3775b14c462e882c1675542678208d661707df603ed73e8ee7f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_crypto/src/subtle/supports.rs:135-142 | modules/llrt_crypto/src/subtle/supports.rs:176-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/supports.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe0039a5bc3182bf521b701f8e8c6ffb82731453d38df73bfa032f391ce91be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_fs/src/file_handle.rs:429-436 | modules/llrt_fs/src/file_handle.rs:456-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fs/src/file_handle.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"885cf0613e17de21354c012389b6206adf3aac05e301ca0e6b349dbef140198f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/tee.rs:642-649 | modules/llrt_stream_web/src/readable/stream/tee.rs:662-669 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9662b5846512411be2733d88601dca5fd320ae3943c1a48c3f6f069c83fe820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_stream_web/src/writable/stream/mod.rs:110-117 | modules/llrt_stream_web/src/writable/stream/mod.rs:221-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/writable/stream/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ed39bff02504614a6aa6d9c72898a0f9230c2056037b6cfb2ee5f4dbc9e27a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_util/src/text_decoder_stream.rs:44-52 | modules/llrt_util/src/text_encoder_stream.rs:35-42 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_util/src/text_decoder_stream.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dffdb9e156d0b6acb47db1544c0158cc581d5072d066e9ae9e58f41b08d2ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e67a0261983cdde7d8f3810d5621fbba2fb2ad98fae2fa9c9d86bbf119c518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): modules/llrt_crypto/src/provider/openssl.rs:880-886 | modules/llrt_crypto/src/provider/openssl.rs:905-911 | modules/llrt_crypto/src/provider/openssl.rs:1172-1177 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5966f673276f6406a1440ce5662a2a100a5017a11d9a6dfc604cd0fab1255d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:851-857 | modules/llrt_crypto/src/provider/openssl.rs:866-872 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"148c4f900839e0b55cef16614ef7be0701e293d22b210cf8a796018e2d0a6a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): modules/llrt_crypto/src/provider/rust/aes_variants.rs:217-223 | modules/llrt_crypto/src/provider/rust/aes_variants.rs:254-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/aes_variants.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb223e23b9dd98989ed3d9eead9ecfe5bc77bc1d1fc579d52f1498cf9416dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): modules/llrt_crypto/src/subtle/sign.rs:67-73 | modules/llrt_crypto/src/subtle/verify.rs:88-94 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/sign.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0260240f886de87fc74a626e0601ea679db7328b414e6c5e29becb74643abd54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"4162e232153e1d31cb8c35433374d28b85de36606cbadbe7e26910384d2ba2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"6123dd7e96a69ab2c977992ac82e3a98d1b3da72acad0c5c3f6c374a73eee51a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): llrt_core/src/modules/console.rs:361-366 | modules/llrt_console/src/lib.rs:150-155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/console.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"841b87b32a972304eb562a55340aed91aa45fa7ca066972444daf23f9f5850ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_buffer/src/blob.rs:176-181 | modules/llrt_fetch/src/body_helpers.rs:74-79 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_buffer/src/blob.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bf11be4526f445f8c878060a6d2da376899c13c33c93263cdc0f0b66a3c5f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/graviola.rs:211-216 | modules/llrt_crypto/src/provider/graviola.rs:240-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/graviola.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0540f668357337828facf926556173bafb6657429dc730c96f6469aa5378ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/modern.rs:595-600 | modules/llrt_crypto/src/provider/rust/mod.rs:559-566 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/modern.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"8093a699272bb051c7492012a8b6e642bb994ded78a40a1b536ae6d5b95b79f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:163-168 | modules/llrt_crypto/src/provider/openssl.rs:391-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ad2b5681eb0512543ee3165f01a7655f661769f9918c433ddaeaddb4b004bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:335-340 | modules/llrt_crypto/src/provider/openssl.rs:368-373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfb32c62722c3749f009104559baef80b48185dc24957b2251b43bb1ce2693f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:1118-1123 | modules/llrt_crypto/src/provider/openssl.rs:1134-1139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac3f92abc4028f6267e67a91ea7e36cef29ff781b218d8217b46d7c86420c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:1235-1241 | modules/llrt_crypto/src/provider/rust/mod.rs:1548-1553 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81191c9717db3c9360d609745d42a2104bb51cffeac329b9ab7c5e42183b11f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/rust/aes_variants.rs:128-133 | modules/llrt_crypto/src/provider/rust/aes_variants.rs:144-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/aes_variants.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3f40c715e8ddff1b0db5a57e848d682a4ff5de24b338d50f4ba7f959431367"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/rust/mod.rs:753-758 | modules/llrt_crypto/src/provider/rust/mod.rs:786-791 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebab24a58013fcc98851a8da53e19cfbb13231407a759d59db8c09a3f678cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/rust/mod.rs:762-767 | modules/llrt_crypto/src/provider/rust/mod.rs:795-800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/rust/mod.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"4077a5fed70522d7e4acd60e3ff5757570c45868fe45863bf44231e2bba42d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/subtle/supports.rs:97-102 | modules/llrt_crypto/src/subtle/supports.rs:303-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/supports.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1c0a347847f1bb4c98e7a6765c65f72469bbd02aa012c0447202b0c6669126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_fetch/src/response.rs:423-428 | modules/llrt_fetch/src/response.rs:457-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"c593ba06705db8402f9238820977e8ce912c3e9eb996eed402b1a2e2c422f5bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): modules/llrt_fetch/src/response.rs:584-588 | modules/llrt_fetch/src/response.rs:619-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/response.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"15199102c0b33d4dc1add1aece608813adcbed9d1a4c04485bb7b5d5a5481415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_stream_web/src/readable/default_reader.rs:337-344 | modules/llrt_stream_web/src/readable/iterator.rs:469-474 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/default_reader.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"89817d673b9b05742ef280ad6b202420f3b74e76618f38de297fa6162a6afbd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/tee.rs:547-552 | modules/llrt_stream_web/src/readable/stream/tee.rs:595-600 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6da6bbbb99794c9f155c9130f4d0b7c779476a08c555717a0cd8b90b1d959df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_temporal/src/utils/date_time.rs:44-49 | modules/llrt_temporal/src/utils/zoned.rs:36-41 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/utils/date_time.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe69d0d978ec5a7798bad718dc7fc73087041ec47ec596177db0729ab1f7e231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_util/src/text_encoder_stream.rs:90-95 | modules/llrt_util/src/text_encoder_stream.rs:106-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_util/src/text_encoder_stream.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd6ad57739301e10c2ede255360abe1ea9704f817027abe03093133fce0d24b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 11): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_buffer/src/array_buffer_view.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"759b641e192015d0c986c244c7d60f5c00e34cee592f32ad4e0738bfea045266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): llrt_modules/src/package/resolver.rs:782-786 | llrt_modules/src/package/resolver.rs:837-841 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"966bc13404d7c4474eb4469d1ef1b3c46eb1a990f3a0da17069998aa1ab1d96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:261-265 | modules/llrt_crypto/src/provider/openssl.rs:308-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a55cf6ec21067be9cc1416eda6731435ec94ac53c57aed18d8635e103f5d996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:692-696 | modules/llrt_crypto/src/provider/openssl.rs:704-708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea80fc97e0965c19e25f482df0842f3589d2dd06416d2ca8fc375db4c97180d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): modules/llrt_crypto/src/provider/openssl.rs:792-795 | modules/llrt_crypto/src/provider/openssl.rs:1115-1119 | modules/llrt_crypto/src/provider/openssl.rs:1210-1214 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2773cacf9e3381ee113892638b8f068007d0be1a8213ac274be882383c789e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): modules/llrt_fetch/src/request.rs:605-609 | modules/llrt_fetch/src/response.rs:1058-1062 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/request.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b9f1fda984f6736cc91187f9fbdc96197305a75cac313034a96939dfa5639b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llrt_core/src/modules/console.rs:340-346 | modules/llrt_console/src/lib.rs:129-135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/console.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"462e1b6839bec00d80e8e3da584e5baa6ad328d67be35a9a204dd5f85e71d26a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): llrt_core/src/runtime_client.rs:85-90 | modules/llrt_timers/src/lib.rs:160-165 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/runtime_client.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3aa898820afa10df32a1ce47f5ce3b7576b33de520ee05c1853b328233fa5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_events/src/event_target.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a7b287ae10454c7e52ba4bafd4310aed3a2d52809e11297d3aba1276bf5a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_fs/src/file_handle.rs:474-483 | modules/llrt_fs/src/read_file.rs:60-69 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fs/src/file_handle.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"222be3fdb750aa692a0de6fef605eaad72aa8671dbea97e4cbd390b568a4adf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_fs/src/read_dir.rs:34-43 | modules/llrt_fs/src/stats.rs:272-281 \u2014 before extracting anything, compare \u0060modules/llrt_fs/src/read_dir.rs\u0060 and \u0060modules/llrt_fs/src/stats.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fs/src/read_dir.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba26393dd35402ee096f649269c3cd14bfe41bb3b7c2ed3aa27022bc03e9315e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_fs/src/read_dir.rs:45-54 | modules/llrt_fs/src/stats.rs:283-292 \u2014 before extracting anything, compare \u0060modules/llrt_fs/src/read_dir.rs\u0060 and \u0060modules/llrt_fs/src/stats.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fs/src/read_dir.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eba262284347f07d5e4b7a4774c323b349570cb93f8d0c4c22c75ef63f2f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_fs/src/read_dir.rs:56-65 | modules/llrt_fs/src/stats.rs:294-303 \u2014 before extracting anything, compare \u0060modules/llrt_fs/src/read_dir.rs\u0060 and \u0060modules/llrt_fs/src/stats.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fs/src/read_dir.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73bc51069df196638718138a5b5ff047ec19950814af90b65c71cd6967487de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_fs/src/read_dir.rs:67-76 | modules/llrt_fs/src/stats.rs:305-314 \u2014 before extracting anything, compare \u0060modules/llrt_fs/src/read_dir.rs\u0060 and \u0060modules/llrt_fs/src/stats.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fs/src/read_dir.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e3602ce8bb8499152ef5cd5bec768daba546298fcc46a136b71b11b7517ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): 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 \u2014 before extracting anything, compare \u0060modules/llrt_temporal/src/plain_date.rs\u0060 and \u0060modules/llrt_temporal/src/plain_date_time.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/instant.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a1e5335894606001dd57091a0b667d27581d430a80a5e7d21c320f7c804587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): 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 \u2014 before extracting anything, compare \u0060modules/llrt_temporal/src/plain_date.rs\u0060 and \u0060modules/llrt_temporal/src/plain_date_time.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/instant.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"270d35346af06b5d9b3e6ed08be1604b94a03f8cbad8ce1e7812a965df4bba41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): 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 \u2014 before extracting anything, compare \u0060modules/llrt_temporal/src/plain_date.rs\u0060 and \u0060modules/llrt_temporal/src/plain_date_time.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/instant.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15aae28c6c0ec9a6c7038eed5ffc14be3c96bcc7aa15496963c4e22b5bcaabc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_temporal/src/plain_date.rs:183-188 | modules/llrt_temporal/src/plain_time.rs:161-166 \u2014 before extracting anything, compare \u0060modules/llrt_temporal/src/plain_date.rs\u0060 and \u0060modules/llrt_temporal/src/plain_time.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/plain_date.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7797b7b162238259cfa4decce624fdd04238a10cbcf0c5f895c555cb800d8c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_tls/src/openssl_config.rs:15-22 | modules/llrt_tls/src/rustls_config.rs:38-45 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_tls/src/openssl_config.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccca40728f1ab412066110e57e4361f35221eebc52ac3fa4e8f3fbab06d364fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): modules/llrt_stream_web/src/readable/byob_reader.rs:48-61 | modules/llrt_stream_web/src/readable/default_reader.rs:52-66 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byob_reader.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5879960570003760f7b050d11366468b7989f6ab8ebd34b6d6291b8ae0d08f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): modules/llrt_stream_web/src/readable/byte_controller.rs:1584-1596 | modules/llrt_stream_web/src/readable/default_controller.rs:539-551 \u2014 before extracting anything, compare \u0060modules/llrt_stream_web/src/readable/byte_controller.rs\u0060 and \u0060modules/llrt_stream_web/src/readable/default_controller.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85b363919092e2993d46b67216ba5e756f98d89035fed28de86a0bcf3ee6e1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): modules/llrt_stream_web/src/readable/objects.rs:431-439 | modules/llrt_stream_web/src/writable/objects.rs:101-109 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/objects.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"b458133b5188528686d9f1b9499102a773056c265386987af5a06503a9694820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): 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 \u2014 before extracting anything, compare \u0060modules/llrt_temporal/src/plain_date_time.rs\u0060 and \u0060modules/llrt_temporal/src/plain_time.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/instant.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa31c15e990e8ee49b08a637951c0d35f9fcd1c8a448e5c495c80e6c9989e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): 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 \u2014 before extracting anything, compare \u0060modules/llrt_temporal/src/plain_date.rs\u0060 and \u0060modules/llrt_temporal/src/plain_date_time.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/plain_date.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1a626365f30b37a89ba98a33ee784f394d4b6f065104565bde479e44d6825a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): modules/llrt_fetch/src/headers.rs:435-445 | modules/llrt_fetch/src/headers.rs:484-497 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/headers.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b48744d3667693a5f1df0b3c7f2b359a5730efefb61a35545b7435aa994f038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): modules/llrt_stream_web/src/readable/stream/tee.rs:1582-1595 | modules/llrt_stream_web/src/readable/stream/tee.rs:1664-1677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/stream/tee.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57c3f33455d831102d9d191a9f0ac2a89085e492deabb3fff4b590c58aad784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): modules/llrt_crypto/src/subtle/encryption.rs:30-41 | modules/llrt_crypto/src/subtle/encryption.rs:56-67 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/encryption.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"515df931d735a8f9333fe7d4c2b0ecc545c759f7df891da6d7bd78f8db3476a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): llrt_modules/src/package/resolver.rs:321-332 | llrt_modules/src/package/resolver.rs:383-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/package/resolver.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"88eac2f3f26df7ebc04998e3722e9fc04f21a9ced64f0688d00db128508c2344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): modules/llrt_stream_web/src/readable/byte_controller.rs:1634-1644 | modules/llrt_stream_web/src/readable/default_controller.rs:607-617 | modules/llrt_stream_web/src/writable/default_controller.rs:664-674 \u2014 before extracting anything, compare \u0060modules/llrt_stream_web/src/readable/byte_controller.rs\u0060 and \u0060modules/llrt_stream_web/src/readable/default_controller.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9af9e595308787db8fe0b60ae8f3db3af5a54fbffaed331b45d606cfdbd49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): modules/llrt_stream/src/readable.rs:362-372 | modules/llrt_stream/src/writable.rs:300-310 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream/src/readable.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f820891bfcd4c6b667eaf2f5623c212288a20d471f0707aa2bf5d412ec06ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): modules/llrt_temporal/src/utils/date.rs:59-68 | modules/llrt_temporal/src/utils/time.rs:82-91 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/utils/date.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"caff0389a2f3249b52815f1998afe591c1fd08e0b89637e0befbe27a19a5c7a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): modules/llrt_stream_web/src/readable/byte_controller.rs:1689-1696 | modules/llrt_stream_web/src/readable/byte_controller.rs:1734-1742 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/readable/byte_controller.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf43df5da8615932602d80919651ff2f28d35ce5f9c05575e44225499c7d2098"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): llrt_modules/src/module/loader.rs:142-150 | llrt_modules/src/module/resolver.rs:150-158 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_modules/src/module/loader.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d508e8b9feb2e1eed2fa825d4d8a44e11fa744753fa12c8df7514e06c1af25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): llrt_core/src/builtins_inspect.rs:45-51 | llrt_core/src/builtins_inspect.rs:71-76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/builtins_inspect.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ba3f25896a9e51c8eb5561975db5e4890867c922c808fc0e175786de55bcd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): modules/llrt_crypto/src/subtle/encapsulation.rs:119-125 | modules/llrt_crypto/src/subtle/encapsulation.rs:172-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/encapsulation.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c569b0c13c3ecbf454f19619e5b8153ba3b7362097cc9b5d293a423f649f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/subtle/sign.rs:34-39 | modules/llrt_crypto/src/subtle/verify.rs:41-46 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/sign.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f0eef07827951674bffb8b0b806d7f9f815dd4a73fc4eaefb5463dd4da6efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:215-220 | modules/llrt_crypto/src/provider/openssl.rs:275-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3f2ac941bbf8bc95f895a6856b02c6a72d9cfc15862a1e900fd22a39392651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:247-252 | modules/llrt_crypto/src/provider/openssl.rs:300-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bf52d428cd980ba550b4fb0b369e3b82fa11164ff39722e0914633bc2efb1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): modules/llrt_crypto/src/provider/openssl.rs:1083-1087 | modules/llrt_crypto/src/provider/openssl.rs:1096-1100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/provider/openssl.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ca2d505e938be840e3adf86171ef6ad0dc7d901080782297c8b1521bdb48e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): modules/llrt_temporal/src/plain_date.rs:50-55 | modules/llrt_temporal/src/plain_time.rs:44-49 \u2014 before extracting anything, compare \u0060modules/llrt_temporal/src/plain_date.rs\u0060 and \u0060modules/llrt_temporal/src/plain_time.rs\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_temporal/src/plain_date.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68a0a4c99824eb1fabbf0ef107249d50f2f68d796875c59a4debb25344f254e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/llrt_test_tls/src/server.rs:92-102 | libs/llrt_test_tls/src/server.rs:168-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_test_tls/src/server.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3130fdc5cf2a68442329a9ce4259dbc54213bcafe0dc4ea6637e27084486768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/llrt_test_tls/src/server.rs:73-81 | libs/llrt_test_tls/src/server.rs:135-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_test_tls/src/server.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8150e0fdb5e64a34379add4f2858b5b6044c3c5588b087a37a5da7d6397836c1"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project llrt_child_process: llrt_child_process has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc33c9beea2df557d7170b0d815e71cb8627f166da7d940270b4e57d66c2d9a2"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project llrt_crypto: llrt_crypto has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6203da6dd99f0eec561c7986bf66cba8dd13e3d04a96c4665d5e4cb032867dbb"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project llrt_fetch: llrt_fetch has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"507c030a7dc68cdd6d2bab8a4f4d73b6587c9ef6b18fec143eaf8132c0b9531b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project llrt_modules: llrt_modules has instability 0.97 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ae2985aa6441e0b71f0799d81c112c30547e97ecfb450beaeff636324bad5024"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project llrt_net: llrt_net has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"acf2ad5ad1093d70cca45f2a57a27d23a1329783b0286c8cdb638cb6e763c580"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project llrt_util: llrt_util has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1330604468df3e25c539f3513be800da9b4a16746c9c400eb321d1365f02fd28"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: llrt_tls: llrt_tls: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b5620c5b437fcaeeef48f18da6955622da39a93e312e5857650f4c992f9e9bfb"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: llrt_exceptions: llrt_exceptions: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8351ed9c96e11f9ffcd5e9c5b04b920da3c7743e79787c6a91f12bc8e89cfe16"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: llrt_buffer: llrt_buffer: abstractness 0.00, instability 0.23, distance 0.77 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ac32b8f3f322d9bd4dbfd24e27a0ff508503d08a22d1605038757dd14d29136c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: llrt_json: llrt_json: abstractness 0.00, instability 0.29, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2c038a824b89c6a0d71c2fa700acbb1d3b0b3bbb4de0a13291b8cb87200fc084"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): is using a random TableName=${TableName}: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/dynamodb.e2e.test.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e00fabc861372a428d7fe901ef6d399b6bb6f314e3cd79933ad55d237e3ee92"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: can batch write: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/dynamodb.e2e.test.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1c6898c738cbbe3ab308294665d0047526d4ab238676710bb13f89cd26dba5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: can transact write: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/dynamodb.e2e.test.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d14001c494cf59fce5fdcebc63840908ac6e220824a28ee87fb747d5177c407"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: can execute transactions: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/dynamodb.e2e.test.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"4473570de323aadc49cc0263fa276de0db79989ed9b9e18e4e3b29ba00d49460"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should set nested timeout: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/timers.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"34376869cffc413837459cb62b3ca703d9970a591e8e29b9583700d9de303b4a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: encodings: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/string_decoder.test.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44a1031d42df872363e6206e3ccac18d46c95b5669b4237a501d68f69f491d2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should create a server and connect to it: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/socket.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8070f6b1d1b7cba9decb051c6878ebb99fb7d283563371f3e31be97c1cdaa44"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should handle server destroy: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/socket.test.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11cb5ae380e8c6f20f67c33548b7ef420c2b8194a97130331a41b565c95d31e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: require builtin modules: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/require.test.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a41981bdabe97781222f24da3fcd93f53a3c04432dd3f400832be08c7289d0b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: require \u0060debug\u0060 module element: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/require.test.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d7342a77613d88a00e9987397e821a2f12bf89e1e8345c9684ecfdefc5d87c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: require \u0060lodash.merge\u0060 module element: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/require.test.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47c04b4bff461f144f92fd7ffe9015b0736a1404f26b2bb469fc4c58d2ac202"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: require \u0060uuid\u0060 module element: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/require.test.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ff0a77827987e079b2d0fafc0eb4eb51200af2947fb5c63ca35bd3e6f96bfe"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: require \u0060react-dom\u0060 module element: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/require.test.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fc446a7882a3b977045d62c5bf86e0aa73be23665bdd00706c9d5ca86204d6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: require \u0060@aws-lambda-powertools\u0060 module element: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/require.test.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef68f959bc4fa9c37fbb29b1088dece60c488799371ec201e469cb3527004d0a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: require \u0060hono/utils/url\u0060 module element: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/require.test.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"32451172284a47e3f8cd1f966613ed7c9eaa7a082444acdd4d93d35d893b5759"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: regression testing for issue #1245: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/require.test.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1af7ef71f81afe9cafbbd84cb5de887cfc985da64c337de13e774bde60bbe5"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): should have value: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/jest-expect.test.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"36017cac52f1786fdc9ed075858b3dc9386cdc8750bac480aaf107cfd36c9350"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): should have value: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/jest-expect.test.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d974b9612d7a3bbd51c05f44b2e87001be158e6eb07242881464ca7573bf517"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): should have aggregated value: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/jest-expect.test.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"388c796e8171417684df68e6638affbedd1a66e02f76aafcdcc4c21d179889a1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: regression testing for issue #1492: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/import.test.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3efd069eb32d83dcc446553f80c45cdbd3a21e869bfb9581812d78345c0469"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should access a file: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/fs.test.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f4bec27e089e1b9485e70d5cd7d3edb5f1c3346af49d985c1ef427ad066691"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should access a file: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/fs.test.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"be90f4d5fb00c21ff4e0902e89da595596a043240db7ee8e7e679dd185a211f6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should access a file synchronously: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/fs.test.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da4d42991c8f50278541cf949fbab2c6e9bf30bf4f4c0e2d8c0fe9de741b1e9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should fetch a website in parallel: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/fetch.test.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f4746ca7f0c5c3ae44f85c40ea4a72a562ffb7dcb0532742de1dd7ad9a08bd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should compile JavaScript to a self-contained executable: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/executable.test.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d720b09165b415349bc61cd0e2449f00fb759b059b699468315e0d311fc626"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should result in the correct exit code: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/executable.test.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cccbdbdbf1dbd10a40badb617d488bb3fe2153ff467010fc5e8aee98532c4c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should result in the correct exit code passed via argument: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/executable.test.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd779f8021c501e6c88bb6742b6b8e3d6a2000c4ca659060086e37d11814ef3d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should log output from the executable: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/executable.test.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb03bea0a87980b1fc2b156217946ba3a96bdcb40e1ff07ae0dcc9d6e0f90f31"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should handle events emitted recursively: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/events.test.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b4d461754ecfc7b6b6d2fd8dd27c45a8a8832988f8bbad79b57c33d2338bc2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should emit close event: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/dgram.test.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e96954085601d2eb1343612f73d5c956f82d02a9bb5413d9d8a306e98546b56"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should pass ${file} tests: This method\u0027s 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* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wpt/_harness-util.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c5bf6dfde9877716c8c5d19becee79f6735ffa7a13b810f452af7821193b5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: modules/llrt_crypto/src/subtle/key_algorithm.rs: modules/llrt_crypto/src/subtle/key_algorithm.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in KeyAlgorithm::from_js at line 1319. 19 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/key_algorithm.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/key_algorithm.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5d6389a9080280f7272b1b081f4c9f184a76005697bdd3eac55fa88ea1959d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: modules/llrt_exceptions/src/lib.rs: modules/llrt_exceptions/src/lib.rs changed 8 times in last 90 days, max cyclomatic complexity 34 in DOMExceptionName::as_str at line 303. 4 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_exceptions/src/lib.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_exceptions/src/lib.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfd06aae45d14dc30a9c38347be7b01058a72f499bfa1b4289d67c48c7e1fdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: modules/llrt_crypto/src/subtle/export_key.rs: modules/llrt_crypto/src/subtle/export_key.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in llrt_crypto::subtle::export_key::export_jwk at line 219. 5 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/export_key.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/export_key.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbea1cf1f1dcc5038ca93b38a057fde162664f57a598560c3ff4709e73f17cbe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/llrt_utils/src/bytes.rs: libs/llrt_utils/src/bytes.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in ObjectBytes::from_array_buffer at line 391. 3 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- libs/llrt_utils/src/bytes.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_utils/src/bytes.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"6680eddb2c7512ebcc61d9afbc3e1e909ad9a042ec30923f14d00403189903a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: modules/llrt_buffer/src/blob.rs: modules/llrt_buffer/src/blob.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in llrt_buffer::blob::process_parts at line 335. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_buffer/src/blob.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_buffer/src/blob.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5553e271565bcc9b3146444fcbff8aeac84e3bab32ad96761039a3261c6f128"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: modules/llrt_crypto/src/subtle/derive_bits.rs: modules/llrt_crypto/src/subtle/derive_bits.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in llrt_crypto::subtle::derive_bits::derive_bits at line 42. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/derive_bits.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/derive_bits.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"304265834c0c92b1a7126d4b85f4411f3fbab0753439386fd6e9f9e2bcb320c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: modules/llrt_crypto/src/subtle/encryption.rs: modules/llrt_crypto/src/subtle/encryption.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in llrt_crypto::subtle::encryption::encrypt_decrypt at line 90. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/encryption.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/encryption.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c5b5fc51157601b77818d67c12ba8c28317ddd4d027433b166bf82d4c8d706"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: modules/llrt_fetch/src/fetch.rs: modules/llrt_fetch/src/fetch.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in llrt_fetch::fetch::send_stream at line 191. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_fetch/src/fetch.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/fetch.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bad650a0ba89499a6aba8b97b2454156fd31269851d3d1db807781b5cbefe72"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: modules/llrt_crypto/src/subtle/mod.rs: modules/llrt_crypto/src/subtle/mod.rs changed 13 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is llrt_crypto::subtle::normalize_algorithm_name at line 209), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(webcrypto): address review and CI failures\u201D; \u201Cfix(webcrypto): derive shared secrets into KDF keys\u201D; \u201Cfix(webcrypto): enforce WebIDL integer ranges\u201D; \u201Cfix(webcrypto): validate RSA-PSS salt lengths\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/mod.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf88b70775b3eb247d3e8e180303a0c4b5c7e07010e5021734e5cae9d6ae92eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: modules/llrt_crypto/src/subtle/verify.rs: modules/llrt_crypto/src/subtle/verify.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is llrt_crypto::subtle::verify::verify at line 81), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(webcrypto): address review and CI failures\u201D; \u201Cfix(webcrypto): compare HMAC signatures in constant time\u201D; \u201Cfix(webcrypto): validate RSA-PSS salt lengths\u201D; \u201Cfix(crypto): align sign and verify with WebCrypto\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/verify.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/verify.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b06fd4659267ebfc4549722d302cfae03727766fcb64d20700c4152378e19a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: modules/llrt_crypto/src/subtle/encryption_algorithm.rs: modules/llrt_crypto/src/subtle/encryption_algorithm.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is EncryptionAlgorithm::from_js at line 38), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(webcrypto): validate AES-GCM IVs during operations\u201D; \u201Cfix(webcrypto): reject null RSA-OAEP labels\u201D; \u201Cfix(webcrypto): enforce WebIDL integer ranges\u201D; \u201Cfix(crypto): support string encryption algorithm identifiers (#1717)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/encryption_algorithm.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/encryption_algorithm.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35ea39606ac33fe1323af4c6846983ea01baa7be4c779a4176f3e77cc80c90b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: modules/llrt_crypto/src/subtle/import_key.rs: modules/llrt_crypto/src/subtle/import_key.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is llrt_crypto::subtle::import_key::subtle_import_key at line 19), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(webcrypto): derive shared secrets into KDF keys\u201D; \u201Cfix(webcrypto): convert key formats asynchronously\u201D; \u201Cfix(webcrypto): follow importKey validation order\u201D; \u201Cfix(crypto): validate JWK extractability\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/import_key.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/import_key.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dd866abaddfafc8038c82f5502b1de8f717c63c1adc1ef9636cee4b3918a12"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: modules/llrt_crypto/src/subtle/sign.rs: modules/llrt_crypto/src/subtle/sign.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is llrt_crypto::subtle::sign::sign at line 61), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(webcrypto): address review and CI failures\u201D; \u201Cfix(webcrypto): validate RSA-PSS salt lengths\u201D; \u201Cfix(crypto): align sign and verify with WebCrypto\u201D; \u201Cfix(crypto): Add WPT tests and improve deriveBits and deriveKey compatibility (#1704)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/sign.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/sign.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d7fb02d19c09500f675421b490f1318ee99eb3216a8beb1c277860c93cf690"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: modules/llrt_crypto/src/subtle/sign_algorithm.rs: modules/llrt_crypto/src/subtle/sign_algorithm.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is SigningAlgorithm::from_js at line 32), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(webcrypto): address review and CI failures\u201D; \u201Cfix(webcrypto): enforce WebIDL integer ranges\u201D; \u201Cfix(crypto): align sign and verify with WebCrypto\u201D; \u201Cfix(crypto): support string encryption algorithm identifiers (#1717)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/sign_algorithm.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/sign_algorithm.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d625bd8e584b22c7a2110d8feedf7cb6e4f449c5ece9bdb521bf38c70f515e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: modules/llrt_crypto/src/subtle/derive_keys.rs: modules/llrt_crypto/src/subtle/derive_keys.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is llrt_crypto::subtle::derive_keys::derive_key at line 65), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(webcrypto): derive shared secrets into KDF keys\u201D; \u201Cfix(webcrypto): enforce HMAC key length constraints\u201D; \u201Cfix(crypto): Add WPT tests and improve encrypt and decrypt compatibility (#1710)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/derive_keys.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/derive_keys.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9caab0fed1949a73738e4339c971a5ba71ae12ccd4e1b1b0683e53a81cdd033"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: modules/llrt_crypto/src/subtle/wrapping.rs: modules/llrt_crypto/src/subtle/wrapping.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is llrt_crypto::subtle::wrapping::subtle_unwrap_key at line 53), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(webcrypto): convert key formats asynchronously\u201D; \u201Cfix(crypto): Allow \u0060Uint8Array\u0060 for \u0060wrappedKey\u0060 in \u0060crypto.unwrapKey\u0060\u201D; \u201Cfix(crypto): Add WPT tests and improve deriveBits and deriveKey compatibility (#1704)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 10:07:21 \u002B02:00\u0027 --until=\u00272026-09-28 10:07:21 \u002B02:00\u0027 --full-history --no-merges -- modules/llrt_crypto/src/subtle/wrapping.rs\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_crypto/src/subtle/wrapping.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8309cfb29005d8ae8ca2e7f2bfb77d29432b255ea3c591a5c2e3b4c1e2d64930"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 12 significant file(s) lose their only recent owner: llrt_core/src/clone.rs, modules/llrt_string_decoder/src/string_decoder.rs, modules/llrt_temporal/src/zoned_date_time.rs, modules/llrt_temporal/src/plain_date_time.rs, modules/llrt_temporal/src/duration.rs, llrt_modules/src/module/mod.rs, modules/llrt_temporal/src/instant.rs, modules/llrt_temporal/src/utils/mod.rs (\u002B4 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bb24ba2a9636e00542c37e16396430e04ccea23812f7971b6962d124ad71f181"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 6 significant file(s) lose their only recent owner: modules/llrt_stream_web/src/readable/byte_controller.rs, modules/llrt_stream_web/src/readable/default_controller.rs, modules/llrt_stream_web/src/writable/default_controller.rs, modules/llrt_stream_web/src/readable/iterator.rs, modules/llrt_stream_web/src/utils/promise.rs, modules/llrt_util/src/style_text.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"189891afac2220e1e7568ef2a3b313fff676b50530bb76e6941178ee9f2c1ca0"}},{"ruleId":"D16","level":"note","message":{"text":"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 \u2014 folded into the bus-factor score and metrics (21 single-owned of 176 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 176 of the 261 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME can be removed if https://github.com/DelSkayn/rquickjs/pull/447 is merged"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b78a38347086a3b3eed6bc594bf6d769363fc5bfbeae3245619b3b2cbb3fbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO fix when quickjs-ng exposes these types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_logging/src/lib.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ef8fef15948067547639ff75374039693abd5f58e29d63d4a442dbf7b2a63f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO impl round up \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_numbers/src/lib.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"503761ab5d172468241584564ff798f1c325b33b6528295515358581a2940ba3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this library is only needed until TLS is natively supported in wiremock. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_test_tls/src/lib.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1effcd4d99e4ebde33670413f3c94531bf85862e1a33a30e6cd0003ac8d52a2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: //hack to move, is safe since runtime is still alive in spawn \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/embedded/loader.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c3ad8d0945cc56e2a35dcf9fcc4f6d1e9796c9e92d2e457f1fdbdaea9b7eaa"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: //hack to move, is safe since runtime is still alive in spawn \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/embedded/loader.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b1156959180a30a324ccb0c1bcdac40fe434e18be799bad33551a342d09ba1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///TODO add backlog support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_net/src/server.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2544013eb47b1881230c1143a9818bdc792a85aec1f4298899286d694129ac2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO add backlog support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_net/src/server.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"598021dd1228a056a0a8cadb22c4f7e55e85a43089dba28ace9649b3e9d9d8fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //                             // TODO: Delaying with setTimeout \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_perf_hooks/src/lib.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd0e652ba82ba2c39cf0d66695d879c96ac4ac11f413f60700f67f7bd9f0c21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Delaying with setTimeout \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_process/src/lib.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7410f6ed300dcb311f626f921963e0f486b899d737a816b9683a257f4f1edd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Delaying with setTimeout \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_process/src/lib.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac033f2a904bdfd96acd3c997484dd40157358aa32832ebe743cb2f3b231341"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: needed? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/writable/default_controller.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"070e3f3d27f6dba0a64cdcd29b9b2341fce129f16c5365a7208ed37df8068549"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should probably be fixed in the Url crate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_url/src/url_search_params.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8b4ce490dee636f2e3e5479eaf65bb06a09b1efeddd20d06153d8e4397f7d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO FB Open a bug \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/s3.e2e.test.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dc65bcd9e2e5225b3de7582551ddf08bfb97be61f566bc185d99d8d651a997"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //complete multipart upload // TODO FB bug here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/s3.e2e.test.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"44151bc7b942d5f41674b28293bd2be18274a6885e027e846594dee34c9ffda7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //validate multipart upload is aborted // TODO FB bug here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/s3.e2e.test.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc63b516f958ba82f7d6969163f8da43ab884c9284e5e894d6770f09e6922dcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO FB \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/s3.e2e.test.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"02afae9f18af6bddc3495020eb4da605cf6faa5a17062649dd75caf167f6db9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // expect(instant.toString()).toBe(\u00222021-08-01T10:40:12.345Z\u0022); // TODO: Expected value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/temporal.instant.test.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c44190c1f9ae91764b5d0fd945c11c9b2c369e675d69b18914e3bd9d0a0edd1"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 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 (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 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 \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent return types for decoder constructors across compression modules. Most return specific typed decoders (GzDecoder, DeflateDecoder, etc.), while zstd and brotli return a generic Result, and the streaming module uses a constructor pattern with a string encoding argument instead of a generic reader. This forces consumers to handle different initialization patterns and return types depending on the algorithm.: Unify decoder creation to return a specific, concrete decoder type for all algorithms. If a generic interface is needed, use a trait object or enum. Ensure the streaming decoder also accepts a reader or aligns its initialization with the non-streaming counterparts. (signatures: llrt_compression.gz.decoder(r: R): GzDecoder | llrt_compression.deflate.decoder(r: R): DeflateDecoder | llrt_compression.zlib.decoder(r: R): ZlibDecoder | llrt_compression.zstd.decoder(r: R): Result | llrt_compression.brotli.decoder(r: R): BrotliDecoder | llrt_compression.streaming.StreamingDecoder.new(encoding: str): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ade88477a94bb5e5c91841e3222b837e5bf9e48a13daf95b259554718cb54d63"}},{"ruleId":"D22","level":"warning","message":{"text":"Ambiguous naming and signature overlap in Encoder. \u0060encode\u0060 and \u0060encode_to_string\u0060 appear to perform similar encoding operations, but \u0060encode_to_string\u0060 explicitly includes a \u0060lossy\u0060 parameter while \u0060encode\u0060 does not. It is unclear if \u0060encode\u0060 defaults to lossy or lossless, or if it returns a different type (e.g., Vec\u003Cu8\u003E vs String).: Rename \u0060encode\u0060 to \u0060encode_to_bytes\u0060 if it returns bytes, or clarify the default behavior. If both return strings, unify into a single method with an optional \u0060lossy\u0060 parameter or distinct names like \u0060encode_lossy\u0060 and \u0060encode_strict\u0060. (signatures: llrt_encoding.Encoder.encode(bytes: \u0026[u8]): Result | llrt_encoding.Encoder.encode_to_string(bytes: \u0026[u8], lossy: bool): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b5738dd29ecf0f3ba7b90a5d0622bfc93261aa075690bde5a2333de2dc4cffc7"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent return types for hex and base64 encoding. \u0060bytes_to_hex\u0060 and \u0060bytes_to_b64\u0060 return \u0060u8\u0060 (likely a bug or internal representation), while \u0060bytes_to_hex_string\u0060 and \u0060bytes_to_b64_string\u0060 return \u0060String\u0060. This creates confusion about which function to use for actual string output.: Remove the \u0060u8\u0060 returning functions if they are not intended for public use, or rename them to indicate they return a specific internal type. Ensure all public encoding functions return \u0060String\u0060 or \u0060Vec\u003Cu8\u003E\u0060 consistently. (signatures: llrt_encoding.bytes_to_hex(bytes: \u0026[u8]): u8 | llrt_encoding.bytes_to_hex_string(bytes: \u0026[u8]): String | llrt_encoding.bytes_to_b64(bytes: \u0026[u8]): u8 | llrt_encoding.bytes_to_b64_string(bytes: \u0026[u8]): String)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fe5530963caa6d8294fd8402b927770bed96b93e38fd350b9ee4a49d67e5f950"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate Console implementation. There are two distinct \u0060Console\u0060 types in different modules (\u0060llrt_core.modules.console\u0060 and \u0060llrt_console\u0060) with identical method signatures. This suggests redundant code or a namespace collision that could confuse users about which console instance is active.: Consolidate into a single \u0060Console\u0060 type. If the duplication is intentional for different contexts (e.g., internal vs public), ensure the public API exposes only one entry point. (signatures: llrt_core.modules.console.Console.log(ctx: Ctx, args: Rest): Result | llrt_console.Console.log(ctx: Ctx, args: Rest): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ceb777353cf4022475cff473f949a82914bf9d601fc8806a1fc1920d94f815e"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent return types for string extraction. \u0060get_coerced_string_bytes\u0060 returns \u0060u8\u0060 (likely a pointer or handle), while \u0060get_string_bytes\u0060 returns a \u0060Result\u0060. This inconsistency makes it difficult to handle errors uniformly when extracting string data from values.: Unify return types. If both can fail, both should return \u0060Result\u0060. If one is guaranteed to succeed, document it clearly and consider renaming to indicate safety (e.g., \u0060get_string_bytes_unchecked\u0060). (signatures: llrt_utils.bytes.get_coerced_string_bytes(value: Value, offset: usize, length: usize): u8 | llrt_utils.bytes.get_string_bytes(value: Value, offset: usize, length: usize): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"422dd3a3380d32cccdfd5f23bdabcfc875db11507ba465f8ab079dc877dab323"}},{"ruleId":"D22","level":"warning","message":{"text":"Fragmented error throwing methods. There are four distinct methods for throwing errors from a Result, differentiated only by the type of error or message handling. This forces users to choose the correct method based on subtle distinctions rather than a single, flexible API.: Provide a single \u0060or_throw\u0060 method that accepts an optional message or error type, or use a builder pattern. Alternatively, document the specific use cases for each variant clearly to reduce cognitive load. (signatures: llrt_utils.result.ResultExt.or_throw(ctx: Ctx): Result | llrt_utils.result.ResultExt.or_throw_msg(ctx: Ctx, msg: str): Result | llrt_utils.result.ResultExt.or_throw_range(ctx: Ctx, msg: str): Result | llrt_utils.result.ResultExt.or_throw_type(ctx: Ctx, msg: str): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4066d7700bff68628ce5a0781a0408675904d82b071735e2309f77398a837bfe"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4b999bae28d8d8f96f9e9bfb2f537d6ae81f1438606f74f88af567bb712c16d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"775019cb6e6c083706c345f9f2e5c7799010cdb4d17a608e92fae9437b1e518f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9bf156a18161af8573ba3bbff9f16ad0f643cb43652fcfc3a08038ae915467f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d3b64d235d7f5cf5da919cc9599233aeeeeb59cb0b157e327e92333839d85bc"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1542ac657294a7960a3ca68607ef7a17d9ed3d2457fb06dcd777067445c6a3cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74e4d9d0be6b8e3d81f682a38fbea383bbb915e487a9f94dfff6f7f8d18c5700"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5df4dde36fcf3980f1e86321b51a3c8c69c69132563af718c50bf3a062225a19"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54d69dfe14d7faf2d810a9ce0d46377a616a6d9078e27eb1420812b11fb6d710"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"928c746cd4129f56e6bcdebda4b8aea4fa51f0e9b881092ede1de23c2257165d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad41e46693e006fbdad57420ea04147ec537b2aaa02735258afa04c9883cf6c0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e94764bcab929ac5d1ee620c2292e3f03e6cca4ef35c104fc08db455d9ec787"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ba0bcfd693e1dd9be2f9c1fd23a25a01ab2109c73253e8efec4de2369399c79"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e33793e439a33c562df51038e0c20d474421f7a43b1ea184fed7516aeb90981"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d68335f2a9cb4b0cdaf14ca1ce55026395e1fb0b25accdd6dc270f7d5dcc132d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"326c876bc89b068ce8cdc268511413b6f16f96bf079757358e5c0047132ac51d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e10dd1c37af22b497f72f89b2c46e91ef5c8fc9d8d3b51a11f187eb59b3d5d0b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15ad88b38fff2e6e26a2e5c51db46b5d95f5a0ab9ae8764a426454804472d49b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"703b990f6d9a60db46de372b4bc3713bc769740b61be7dfed2b23b523664ac12"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af124d1319ae313fb19f1e202367a85bc4a75eb673f6288a3384afca9f0abceb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc26593caf509b487cb3dff9d1a587737a02c72fc5e13e59c1a151f7d6412ad4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8109dce38defa2356a4dadc0d0de54d2a3068d55e0fa05a6643a42adc1a4628c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc1fa63a7fda7200fccfafce8e41075841b3b266b1f262f93d706132d313e16e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fbc6df3d72864219648f8a5e2a3fe4857d204776cc76785ab693bf45ade35c2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e3d019edd25de7cba0e7a7ed3e606d4ce34ca0bc12da96432c7dc35852852af"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64aee044c1f4dd4bb7a77441c8cfb2ad1960dbe2c5bbb6dcc4a3af1fa08e7b62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e37d8c3080d3f8e690d19a540a352f863a9d0d11f51431a4df4b2e0a9df4df9"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1447b888bba3736166cddb4cfaefaca2cf0aaf02882b66402e08e91a92c132b2"},"taxa":[{"id":"CWE-1321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf7ffdf7a29ab544b5fcd53debc4e66ddbaadb6ad677d27e2276077415059c46"},"taxa":[{"id":"CWE-1321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51836fa97a75469a9d55a40205b2c78b8d317237eb58035c56846428696b0d48"},"taxa":[{"id":"CWE-1321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c50d2b18469db8600cad7a797d6279f9764ae80036f4580014a1e900a9071de2"},"taxa":[{"id":"CWE-1321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"801f4e8b002133ccdd65cdd02e59166af2ca65d5404be91e70ea22f5afa3178f"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc120a5f99c4726daffbdb7bd76a2c619ca69e8e93e4e17dba397920b9713273"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bdf30e2ee14fde8db117211c2f55e0b39d0b03085533aae37d4c46c4eaceb5e"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbe44cba110203cc7b6e8f19001732e2ff9b8775bcae15fcb826e6845b969f5b"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60f771112382cf2d80c72557a2d1e605f0adcb114d2a76576a92bd106f346862"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bd4f9e73253be19c7541ece7355ba69018f70caa68866bf3330c8717ffcfbe8"},"properties":{"dependency":{"package":"tar","version":"6.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"676c9003412134ff5bcfd90d8b25990966c7bfc3e4c4f1a455a8e70a2897bdc7"},"properties":{"dependency":{"package":"form-data","version":"2.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef09c327cbc0ef52644d11a69406be9ca9438505f9496b4dd4e11cb482caebbc"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bd13983846abe3c5fe188361c3dde0a4fd149a729ce5f8bf4ea80b8e47014ef"},"properties":{"dependency":{"package":"minimatch","version":"9.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34539b3aab888520f49d61d0b3c466995675d555a132845f50d104e74a2e74bf"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a78c8e94c5c27a0aeb479d7d076c8ad94d415a254b94cb28929f26af44f21db3"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14663caaf2055c562e2cc4beda16519e730033a93d369945f10369b277ebf48d"},"properties":{"dependency":{"package":"nanoid","version":"3.3.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bcaa3aeb9aede7e9fa8341c54213e62f0656db09f0aaeaa66bc813801f5ed1a7"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.10.0-rc.18","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5524f25221308ec94b7206b58afaa59996104c20abaa242285d451f5344e44b"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1092cdc16bab90e26caa98781415518f2a1a0fec9b43d183894264e01dcc42b6"},"properties":{"dependency":{"package":"event-listener","version":"5.4.1","advisory":"RUSTSEC-2026-0221","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.4.14","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7706c7c4f6a6dfd3d8fb557e72a9c11999c556dbb7691e75009a731aa8732a75"},"properties":{"dependency":{"package":"ajv","version":"6.12.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2936c137d72aa0d7511fbabff53966159705879ebfffb3141e920a95d0a7ce83"},"properties":{"dependency":{"package":"qs","version":"6.5.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4f0bbdfda37ae26b43eebc3d0ab8f7c4cb674354d19e5130629c7a7bde876a9"},"properties":{"dependency":{"package":"tough-cookie","version":"2.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a1ffaf0bc0edf5aee2ffeb450c039839cf59e064728fb327d11dad6de04039b"},"properties":{"dependency":{"package":"request","version":"2.88.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7010e47eb7f76cb1f1446554163dceb83f7bf0881585f0d891c7ed61da5e9c87"},"properties":{"dependency":{"package":"fflate","version":"0.8.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8d8637da90203ae84ff605e08f0941c9d455a03751268ed9b4178a5b9fdf4f3"},"properties":{"dependency":{"package":"uuid","version":"3.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3ce7fa90cd0b457423b606f77339ac8407012dc2f1d04668666ee05459b0925"},"properties":{"dependency":{"package":"fflate","version":"0.8.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3335d307a116927fc3ff5e5909e8d2dc362bea0948ed03704d61c9e9a6b879da"},"properties":{"dependency":{"package":"diff","version":"4.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_intl/src/cldr_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"856f2c52958824275a6c901620804d4c5ce4a79226e0af51d993610ba652fa4e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fs/src/file_handle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7054c3a2ba4e2e4de51a6692d93e629cdcaa851613490ab657f1ab1ea59232df"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_dgram/src/socket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4765f181e41fd447763a38c341efe08a4f98de007ff936d046c3d77340aaeb"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_stream_web/src/writable/default_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c226b44f01072680520f9197708c5400dde222ecc502d08df5a593f4dcfc569c"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 17 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: modules/llrt_events/src/lib.rs, modules/llrt_intl/src/pattern_formatter.rs, modules/llrt_stream_web/src/readable/objects.rs, modules/llrt_stream_web/src/readable/reader.rs, modules/llrt_dgram/src/lib.rs, modules/llrt_string_decoder/src/lib.rs, libs/llrt_utils/src/any_of.rs, modules/llrt_stream_web/src/readable/controller.rs (and 9 more) (21 orphaned of 176 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 176 of the 261 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: clone.rs \u2194 console.rs: \u0060libs/llrt_utils/src/clone.rs\u0060 (context llrt_utils) and \u0060llrt_core/src/modules/console.rs\u0060 (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 \u2014 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) \u2014 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\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060b700f3d0\u0060 fix: Require primordials to be initialized from module once to avoid \u2026; \u0060b0a905d5\u0060 Update deps (#663) (at that commit the file was still \u0060llrt_core/src/utils/clone.rs\u0060); \u006007f96b4f\u0060 CJS import capability and refactor (#651) (at that commit the file was still \u0060llrt_core/src/utils/clone.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/llrt_utils/src/clone.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dd7bfae9bfb6eca0db3a6a82eab92538a5c7da65378b51cd8b48182b639480"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: vm.rs \u2194 require.rs: \u0060llrt_core/src/vm.rs\u0060 (context llrt_core) and \u0060llrt_modules/src/module/require.rs\u0060 (context llrt_modules) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 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) \u2014 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\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006063cbff71\u0060 refactor(require): further separation of npm-require and bytecode-req\u2026 (at that commit the file was still \u0060llrt_core/src/modules/require/mod.rs\u0060); \u0060d29013f8\u0060 refactor(require/module): further separation of require and module (#\u2026 (at that commit the file was still \u0060llrt_core/src/modules/require/mod.rs\u0060); \u006048b4b4b0\u0060 chore(core/vm): clean up initial process (#931) (at that commit the file was still \u0060llrt_core/src/modules/require/mod.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/vm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c97e4191097f8d949c88661a5a345fdc76572d60fe485741dc06d447b3deed"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: fetch.rs \u2194 lib.rs: \u0060modules/llrt_fetch/src/fetch.rs\u0060 (context llrt_fetch) and \u0060modules/llrt_net/src/lib.rs\u0060 (context llrt_net) sit in DIFFERENT parts of the tree yet change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 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) \u2014 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\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00609824e416\u0060 refactor: organize net module implementation (#489) (at that commit the files were still \u0060llrt_core/src/modules/http/fetch.rs\u0060 and \u0060llrt_core/src/modules/net/mod.rs\u0060); \u00609e8dc2ed\u0060 add support for extra ca certs (#470) (at that commit the files were still \u0060llrt_core/src/modules/http/fetch.rs\u0060 and \u0060llrt_core/src/modules/net/mod.rs\u0060); \u00606296878e\u0060 JS lambda runtime to Rust (#260) (at that commit the files were still \u0060src/http/fetch.rs\u0060 and \u0060src/net/mod.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/llrt_fetch/src/fetch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbca42096a20653351cff344a302c233fbf176fa4c1a8f31acf7ac26644189c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: index.d.ts \u2192 build.mjs, mod.rs, lib.rs: \u0060types/index.d.ts\u0060 changes together with 3 other files \u2014 \u0060build.mjs\u0060, \u0060llrt_core/src/modules/mod.rs\u0060, \u0060llrt_modules/src/lib.rs\u0060 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/index.d.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6da771795e3340ee1ec22cd63294ea140f3dc1d195cf033294e0bdf69d26f1"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"ruleId":"AX4","level":"error","message":{"text":"Dependency-rule violation: llrt_core (Domain) \u2192 llrt_build (Web): \u0060llrt_core\u0060 is a Domain project but references \u0060llrt_build\u0060, a Web project. The clean-architecture rule is that dependencies point INWARD \u2014 the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d802484a28c5db71aa7e4a89495456bd3fac42260f83d998a8d11b8c2a2b8a9c"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: LLRT runtime is Rust/QuickJS but README claims it\u0027s built in Rust with QuickJS \u2014 reported by the model that read the README against this repository; no term search was run for this one, so nothing here has been checked against the tree. Treat it as a reading to confirm, not as a measured contradiction: verify it against the code before acting on it, and if the footprint it describes does exist, this row is wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"343bbbd51ceb8de7a9ff88d79f7c797abf9b5921f8727b67b4d0f4f8a22c5e49"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 9/11 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060libs/llrt_test_tls\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P6","level":"note","message":{"text":"Changelog looks stale/thin: The changelog this check read carries 2 versioned entries, against a bar of 3. Counted as either an \u0060x.y.z\u0060 string or a version-shaped section heading (\u0060## [1.2.0]\u0060, \u0060## V14.x.x\u0060, \u0060## Updates in 8.0.x\u0060), whichever is the larger \u2014 so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read \u2014 release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository \u2014 are not counted here, and this row is about what is re-findable in the tree rather than about how often you release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9a74c249fe67853238d9c15085f7f97d31f51bb82455046aa10c2cef82f67b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): shims/@aws-crypto/crc32.js:3 \u00B7 shims/@aws-crypto/crc32c.js:3 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shims/@aws-crypto/crc32.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe12002aebc757d85cf4f3009e9d8d887b1ed3bc54312e5a6fdd21eee8c2269"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:515 \u00B7 llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:566 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-expect.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"454aefda8da3352630203753a7472f77b7f9c8a0d62451d55d1e0e346be9495b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): shims/@smithy/getAwsChunkedEncodingStream.js:36 \u00B7 shims/@smithy/getAwsChunkedEncodingStream.js:77 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shims/@smithy/getAwsChunkedEncodingStream.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1b13f89240e3872d088241abee46d4acdf411d75308647cbd1ebcc2650e0ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:79 \u00B7 llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:434 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-expect.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c902414ff67f1bf8eee6e041d7353112b1399a1e5f10b7cdc136a7c8e7e862f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): llrt_core/src/modules/js/stream.ts:89 \u00B7 llrt_core/src/modules/js/stream.ts:119 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/stream.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf3157d695f588dae7d9f19c3276e9e964436ae3d1d841a5ea442a7a75832e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:244 \u00B7 llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:257 \u00B7 llrt_core/src/modules/js/@llrt/expect/jest-expect.ts:270 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-expect.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fd9fe49aab8efb22e8567cb0f9e07cf80b59ab25ae1ee69c853e22975620dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lambda-server.js:107 \u00B7 lambda-server.js:123 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 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 \u2014 the whole function, component or branch these lines sit in \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lambda-server.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81e4a5da7cb2f36caa0520a110166b22695f91b4aae0daf33d7a8ca0c8b2913"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): llrt_core/src/modules/js/@llrt/expect/jest-asymmetric-matchers.ts:124 \u00B7 llrt_core/src/modules/js/@llrt/expect/jest-utils.ts:238 \u2014 the two spans are one implementation copied and then locally edited \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-asymmetric-matchers.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2397a92f902df98049947e8fa436187418332d1449b16c0255b8532d4928f5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): llrt_core/src/modules/js/@llrt/expect/jest-utils.ts:142 \u00B7 llrt_core/src/modules/js/@llrt/expect/jest-utils.ts:295 \u2014 the two spans are one implementation copied and then locally edited \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-utils.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0de2abf4b56989f79fa36b90cd60943a08237525105995de3b0e09db29dfa1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: llrt_core/src/modules/js/stream.ts:5 imports readable-stream/lib/_stream_readable.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/stream.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1772e4a7f95d5447aea364741249ef7912641dc55f96088944d63c534b1b64d1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: llrt_core/src/modules/js/stream.ts:7 imports readable-stream/lib/_stream_writable.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/stream.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3225543e94e9ec47f1f4954e93b7a1fc700ec645ee8f7441691c552c2a247608"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: llrt_core/src/modules/js/stream.ts:9 imports readable-stream/lib/_stream_duplex.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/stream.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ffa4c682f4eaf5a29ed1bad6bf334bbe6ba92cf8bffb5ffe381336d7b3a7aa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: llrt_core/src/modules/js/stream.ts:11 imports readable-stream/lib/_stream_transform.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/stream.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e526a1cfe9f2037d1409b180140b90023d24278e230b1d10d24c2389b40a1036"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: llrt_core/src/modules/js/stream.ts:13 imports readable-stream/lib/_stream_passthrough.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/stream.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"da34ce43225bbd6d42b9391fc8b0dc3719ea127fedb211a8f390ed44db555659"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: llrt_core/src/modules/js/stream.ts:15 imports readable-stream/lib/internal/streams/end-of-stream.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/stream.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3d7c198db86baa5eae4a0ec298e942e8b5baa998a71c981c10832b97d0d61b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: llrt_core/src/modules/js/stream.ts:17 imports readable-stream/lib/internal/streams/pipeline.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/stream.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a839fa4af54e7215e7419703e36153ed98012a834a79bf53d2082c28cbdbd64a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: llrt_core/src/modules/js/stream/promises.ts:4 imports readable-stream/lib/stream/promises.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/stream/promises.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e230ea709c3942afc3dc0af8c2bfa588af3cc451687a65dc003107d0cc413b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eq (cyclomatic 37, cognitive 37): 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-utils.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff814c90319d49cdba744ec84e02383ec38ef87bbd6186d2de493d707a85678e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function iterableEquality (cyclomatic 32, cognitive 72): 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-utils.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ba537ce3086fbfb9a1f3e42a652bb3d5e15b261b1b27a80ffe4d7206759def"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 36): (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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/dynamodb.e2e.test.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ea81e1209fb50f37fe873b5355e1eba3ad935d136b93e094c1fd03d1b652e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 27): (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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llrt_core/src/modules/js/@llrt/expect/jest-expect.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88a771a0424660cf9a6598bac7d334b837424a6c3dc5ed3bb3434479a001ba9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultEndpointResolver (cyclomatic 21, cognitive 22): 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afbaa6ebf671b42ecfac2b4dfcea10e003f6d86b4032515e98718ca06ad2316"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pull (cyclomatic 13, cognitive 32): 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shims/@smithy/getAwsChunkedEncodingStream.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79dfc7ce95e3cdba050bc591fd8e7c0c2a92244c1b283a968dab0bd972453ca"}},{"ruleId":"R3","level":"warning","message":{"text":"Large Files: 3 file(s) over 400 lines (counted as significant lines \u2014 blank lines excluded \u2014 over production source only, tests excluded), largest first: build.mjs (695), llrt_core/src/modules/js/@llrt/expect/jest-expect.ts (599), llrt_core/src/modules/js/@llrt/expect/jest-utils.ts (460)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cecee31b569df4f07e06db732f1ca037af27b5afef9023da51f9673d931a142f"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 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) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/import.test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da96e23faacaf57323aa21210716c541416e65f270599b7a8e986954fa9e144d"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027package.json\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/import.test.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a38de7f88db143709c9dc78d695c68fb2d0462374328dcadfe8f3ca4ec8e5a4"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@aws-sdk/client-acm\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1e672af34fd8735a2d8fa9fb333b8816af923a205530c66dfbb394ef9b8ceef2"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@aws-sdk/client-amplify\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0cb6a4d7c7c38b01da6c9b0195e2266267777c1698f3309739029b28b1f0fec3"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@aws-sdk/client-api-gateway\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"169c0a690dc70dfa08ebca60cd89578fbb46c3884a94fe4692b61d923fe5141d"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/2 NRT-eligible project(s) enable \u003CNullable\u003Eenable\u003C/Nullable\u003E (projects targeting a pre-C#-8 framework are excluded \u2014 NRTs aren\u0027t available there). NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1321","guid":"0367a99b-2a5d-7b52-a83b-6f4196022556","name":"CWE-1321","shortDescription":{"text":"CWE-1321"},"helpUri":"https://cwe.mitre.org/data/definitions/1321.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-457","guid":"b62874fe-6222-8b5b-8ade-9527ad1cbb4a","name":"CWE-457","shortDescription":{"text":"CWE-457"},"helpUri":"https://cwe.mitre.org/data/definitions/457.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":66,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}