{"$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":"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"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"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"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"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"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"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"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"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"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"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"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":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"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":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"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":"Url.resolveObject (cyclomatic 117): Url.resolveObject has cyclomatic complexity 117 (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":"ext/node/polyfills/url.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f54efb51257bd48e5d586c6c59e3856d4cf1b7df049d3a722602f50f3909c2"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.emitKeys (cyclomatic 112): utils.emitKeys has cyclomatic complexity 112 (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":"ext/node/polyfills/internal/readline/utils.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc7c7e1ca0f2ddee5f32fb49c8f2cd77e0bea44c04222867dfc9ac5112e590f"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::lint::ast_buffer::swc::serialize_expr (cyclomatic 106): deno::tools::lint::ast_buffer::swc::serialize_expr has cyclomatic complexity 106 (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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"e676dc6c9f80c905276273e3a2da8d33e617f60e42e924dc34f0a766b6387847"}},{"ruleId":"D1","level":"warning","message":{"text":"Glob.#iterateSubpatterns (cyclomatic 106): Glob.#iterateSubpatterns has cyclomatic complexity 106 (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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a04f05c40791238c3c3a412fef05c99a8e71d64c525869677fe33464e78916f"}},{"ruleId":"D1","level":"warning","message":{"text":"Url.urlParse (cyclomatic 106): Url.urlParse has cyclomatic complexity 106 (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":"ext/node/polyfills/url.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e37cc374285ad1d314f32ddbed02a7c8c563592cd188f7de43e1e039e775c5d"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::format_raw (cyclomatic 97): deno_web::console::inspect::format_raw has cyclomatic complexity 97 (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":"ext/web/console/inspect.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"0756974a63003329e4a16d7de77aa6c62c2864526fc2be3c473d33ff9b47acc0"}},{"ruleId":"D1","level":"warning","message":{"text":"comparisons.objectComparisonStart (cyclomatic 91): comparisons.objectComparisonStart has cyclomatic complexity 91 (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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccfb5ce79e998d274ce1c5e080e309972ee7a6df5d449446f2bc5711842b1a7"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_incoming.matchKnownFields (cyclomatic 90): _http_incoming.matchKnownFields has cyclomatic complexity 90 (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":"ext/node/polyfills/_http_incoming.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ec1c94c88ce789dda0c71027c37c8ab4b8b6cdba335979fc35a3daf2c52aae"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalNpmPackageInstaller::sync_resolution_with_fs (cyclomatic 89): LocalNpmPackageInstaller::sync_resolution_with_fs has cyclomatic complexity 89 (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/npm_installer/local.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f7f127363708a85d7de6bb325bd6abd294737c653be393686935309400c6c6"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_client.ClientRequest (cyclomatic 87): _http_client.ClientRequest has cyclomatic complexity 87 (threshold 15). Of this number, 86 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_client.js"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b8c5a73015e2218a30f2a12d90a14856fc60b86041f55504a8c146089ddb5b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::pipe::poll_pipe_handle (cyclomatic 86): deno_core::uv_compat::pipe::poll_pipe_handle has cyclomatic complexity 86 (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/core/uv_compat/pipe.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"902bd8f560086a1ba559b392da0ff19067cd051a1b151f24cbe8a025637525a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Glob.#addSubpatterns (cyclomatic 82): Glob.#addSubpatterns has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"335d132ad8cc3af79827c08b2f11a06da04e97a0f3c74f7642d2c9e7347d2239"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::pipe::poll_pipe_handle (cyclomatic 72): deno_core::uv_compat::pipe::poll_pipe_handle has cyclomatic complexity 72 (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/core/uv_compat/pipe.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"23783177c465dfab98a302c814a86d910f3792c118e21583dc062826ce7c5b95"}},{"ruleId":"D1","level":"warning","message":{"text":"Interface.[kTtyWrite] (cyclomatic 72): Interface.[kTtyWrite] has cyclomatic complexity 72 (threshold 15). Of this number, 71 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"62807d0cecb8c80314d3634f240b9b006d2545085fbcd79d3188977fbf9d5e23"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 72): (computed) has cyclomatic complexity 72 (threshold 15). Of this number, 71 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4585e581c343e0198f81c2d0da0624bc5ba5d7baccd37621b71a9381029bd4"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::run_subcommand (cyclomatic 71): deno::run_subcommand has cyclomatic complexity 71 (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":"cli/lib.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f0c1b302a575fd5ef5ba3ea69b52c2d32c051610ea7e7b57bc7fc1a2f80bea"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::tcp::poll_tcp_handle (cyclomatic 70): deno_core::uv_compat::tcp::poll_tcp_handle has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tcp.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a6cda3bdc23f9f4735fb539a137705be6dce962846b52f743fd8780376690c"}},{"ruleId":"D1","level":"warning","message":{"text":"eos (cyclomatic 70): eos has cyclomatic complexity 70 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 27 belong to 11 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/end-of-stream.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"951690d0179839ce0c7c52f3a667ea48c650df518806a42f655f2d375c3b9715"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_http::http_next::serve_http11_raw (cyclomatic 68): deno_http::http_next::serve_http11_raw has cyclomatic complexity 68 (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":"ext/http/http_next.rs"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"53480420a2f31d2d24b4d1e931bfc0f7fefbf256d4eb48790b90cbae0ee3cbb3"}},{"ruleId":"D1","level":"warning","message":{"text":"ChildProcess.#spawnInternal (cyclomatic 67): ChildProcess.#spawnInternal has cyclomatic complexity 67 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"912de09af815e1a6b4c3a6d44657fd320fbc6b8b1aaf675a52ff44ffc28b83c4"}},{"ruleId":"D1","level":"warning","message":{"text":"mainFetch (cyclomatic 62): mainFetch has cyclomatic complexity 62 (threshold 15). Of this number, 59 points are the body\u0027s own statements and 3 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eb8a34e6bb68a0a9666d9dd8bae79f373fcb413c3e9b28dfdc21cfe8cfb2b2"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_ffi::callback::do_ffi_callback (cyclomatic 61): deno_ffi::callback::do_ffi_callback has cyclomatic complexity 61 (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":"ext/ffi/callback.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e5505fdfef22a4e2c5ac66ddf33b6f67ccd8d6d12afcfef7fec255fbd3f576"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.pipelineImpl (cyclomatic 61): pipeline.pipelineImpl has cyclomatic complexity 61 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/pipeline.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fc86e0bc943f7bece09bc3c666bbc5a6c856d3a5f8a78df9b2aa4ae91eb83a"}},{"ruleId":"D1","level":"warning","message":{"text":"DenoCompileBinaryWriter::write_standalone_binary (cyclomatic 59): DenoCompileBinaryWriter::write_standalone_binary has cyclomatic complexity 59 (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":"cli/standalone/binary.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf66d04adb6fa98bcce875656de966870ec6b6ab2ec8e7a268ebb1007299b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::coverage::generate_coverage_report (cyclomatic 59): deno::tools::coverage::generate_coverage_report has cyclomatic complexity 59 (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":"cli/tools/coverage/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04d76cd3489fc8addf7723f2293235bae014e95e0cda70840f6c639c3679c60"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_crypto::supports_params_valid (cyclomatic 59): deno_crypto::subtle_crypto::supports_params_valid has cyclomatic complexity 59 (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":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7c9dd25abdc07698300c9502ed1cec35399eaccf70cae804e4d44b3a858642"}},{"ruleId":"D1","level":"warning","message":{"text":"01_require.Module._load (cyclomatic 59): 01_require.Module._load has cyclomatic complexity 59 (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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"476b80be8d9499c55689a59371d088f8555bb543df9f5d270672ed5b90337e81"}},{"ruleId":"D1","level":"warning","message":{"text":"OptionsParser::parse (cyclomatic 58): OptionsParser::parse has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: OptionsParser::set_boolean_field (cyclomatic 111) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/lib.rs"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a5f979545849ebd94db650b41dadfc20ec267fedca2ddb6864468218bdc39b"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeWorker.constructor (cyclomatic 58): NodeWorker.constructor has cyclomatic complexity 58 (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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1c3768e48229280e69923b6f0191d4386e548871bce654755095cb6a0e8c5c"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::tty::poll_tty_handle (cyclomatic 56): deno_core::uv_compat::tty::poll_tty_handle has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: deno_core::uv_compat::tty::get_vt100_fn_key (cyclomatic 137) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bcf4f6f81e7bf890ed10d238b07f3c8de61ea2540cb195b5961ac16700a3d2"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDependencyResolver::resolve_peers_of_node (cyclomatic 56): GraphDependencyResolver::resolve_peers_of_node has cyclomatic complexity 56 (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/npm/resolution/graph.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"1730172b2232add75fd628ef065fc31def3fdcf283091eed4321672768ac867d"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::apply_options (cyclomatic 54): deno_web::console::apply_options has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/mod.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63e0819a67769c39a48890db5cab4bf92f4fedcec7be3cf4cba7208ba9d79ff"}},{"ruleId":"D1","level":"warning","message":{"text":"keygen.createJob (cyclomatic 54): keygen.createJob has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ad23d05e2b4723783bfc7c78607496dc53388b93ecc18b32ae0b21946a989f"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::desktop::compile_desktop (cyclomatic 53): deno::tools::desktop::compile_desktop has cyclomatic complexity 53 (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":"cli/tools/desktop.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e550ce1947362305133efc63a280015baaada2d6ef343ad643d1e62ac2f3f7c8"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::fmt::get_typescript_config_builder (cyclomatic 53): deno::tools::fmt::get_typescript_config_builder has cyclomatic complexity 53 (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":"cli/tools/fmt.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"336be94ca8e0723d54993a8ee8fe175da51eb4ef04345b22821db862ad99240e"}},{"ruleId":"D1","level":"warning","message":{"text":"JsRuntime::poll_event_loop_inner (cyclomatic 52): JsRuntime::poll_event_loop_inner has cyclomatic complexity 52 (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/core/runtime/jsruntime.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b512d4bbe8af66af2e07cf96bbbfb4b149fb363b626f0bd1bab79677012088ea"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_ops::op2::signature::parse_type (cyclomatic 52): deno_ops::op2::signature::parse_type has cyclomatic complexity 52 (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":"libs/ops/op2/signature.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c323ae5465cf849e91147fddfd5754a9d0ba71ef181e1e8e6eda295fa57263b7"}},{"ruleId":"D1","level":"warning","message":{"text":"update_node_stream.transform (cyclomatic 52): update_node_stream.transform has cyclomatic complexity 52 (threshold 15). Most of this is not in the body itself: 5 of the 52 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 158, a function literal at line 418, a function literal at line 353, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/update_node_stream.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"289a4b0adae99feb6b369bdaf0f309197009655df131b412cc964a2d967da46b"}},{"ruleId":"D1","level":"warning","message":{"text":"06_streams.readableByteStreamTee (cyclomatic 52): 06_streams.readableByteStreamTee has cyclomatic complexity 52 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 32 belong to 10 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":3913}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0fcd8ee878dd122d896f3e51d05023cabb2319adbd43867475924a78342c33"}},{"ruleId":"D1","level":"warning","message":{"text":"_resolveFilename (cyclomatic 52): _resolveFilename has cyclomatic complexity 52 (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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa96691dec002e4bc8f02c3bcba6e313fc5888014b23dd4f3979537245328e4"}},{"ruleId":"D1","level":"warning","message":{"text":"compose (cyclomatic 52): compose has cyclomatic complexity 52 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 23 belong to 14 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/compose.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"52203b8eae7586204352580c7b50b64936f3f09e377c51b57aad810cbe051cae"}},{"ruleId":"D1","level":"warning","message":{"text":"primary.init (cyclomatic 51): primary.init has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 7 of the 51 points are its own statements and the rest belongs to 11 function items inside it that branch (queryServer, createWorkerProcess, a function literal at line 262, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/primary.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"da42db482fa0a52b25b177ff84af4415ace3c965a173ad03f5f8905c0f2537bd"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_cli_parser::parse::parse_args (cyclomatic 50): deno_cli_parser::parse::parse_args has cyclomatic complexity 50 (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/cli_parser/src/parse.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a32c23a86f488ac62ff86304414d76110fcd6e88f7cb5fe039aa44bfd8200ab"}},{"ruleId":"D1","level":"warning","message":{"text":"node_shim::translate_to_deno_args (cyclomatic 50): node_shim::translate_to_deno_args has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: OptionsParser::set_boolean_field (cyclomatic 111) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/lib.rs"},"region":{"startLine":3470}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75e1b73f0bd73f0419fee499ca7814a8a70515dfa3bbb3df7829bf510732d03"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDependencyResolver::run_dedup_pass (cyclomatic 50): GraphDependencyResolver::run_dedup_pass has cyclomatic complexity 50 (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/npm/resolution/graph.rs"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9dc332e75464fbb400434864dbb03a1bbd43e2fa66eda7288959d23be74d0d"}},{"ruleId":"D1","level":"warning","message":{"text":"PackumentIndexer::on_string (cyclomatic 49): PackumentIndexer::on_string has cyclomatic complexity 49 (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":"libs/npm/fast_registry_json.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ac11dc2d434f2372264884831de24c85a7a04dc46383a612297895c2e22f3c"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::error_fmt::format_error (cyclomatic 48): deno_web::console::error_fmt::format_error has cyclomatic complexity 48 (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":"ext/web/console/error_fmt.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d5ac2ffd630f5d32dd99633e3a88be83a81c0a8471c916bbc9265bd4ad6f04"}},{"ruleId":"D1","level":"warning","message":{"text":"readableStreamPipeTo (cyclomatic 48): readableStreamPipeTo has cyclomatic complexity 48 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 31 belong to 27 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf64b2f5f2e1fddda168df925dcaa3d8e3b8a97b1f73bcb96ff33ec1f16edfea"}},{"ruleId":"D1","level":"warning","message":{"text":"Console::table_impl (cyclomatic 47): Console::table_impl has cyclomatic complexity 47 (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":"ext/web/console/mod.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"2693622684398b57f55e57e398469bda2a8bcb13d262cba64cd2b2be48e91824"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_server.parserOnIncoming (cyclomatic 47): _http_server.parserOnIncoming has cyclomatic complexity 47 (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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6d57d1e4b83d4f7fea658c837f1efc98f4f8f2f8ec669198decb3026e39369"}},{"ruleId":"D1","level":"warning","message":{"text":"_tls_wrap.TLSSocket._init (cyclomatic 47): _tls_wrap.TLSSocket._init has cyclomatic complexity 47 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 24 belong to 8 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc001d256b8e1d6f271ddf4d133a0dc01dc7b2bc8ccd1f369c5f2acae464d0c"}},{"ruleId":"D1","level":"warning","message":{"text":"_win32.resolve (cyclomatic 47): _win32.resolve has cyclomatic complexity 47 (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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1531bcfd6d3b10b75c75c0669656dfbd9ec9ae63a54eca4b64726623dccd0d78"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 47): constructor has cyclomatic complexity 47 (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":"ext/fetch/23_request.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"259374bf2446e774340eae769099411f570cb3546cfa281ac546901e02664e05"}},{"ruleId":"D1","level":"warning","message":{"text":"Cipher::new (cyclomatic 46): Cipher::new has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (Decipher::new) 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":"ext/node_crypto/cipher.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c65927538fd91723b5d7623be88d5f083bcce73bf4b79f4b16137619c37e2ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Decipher::new (cyclomatic 46): Decipher::new has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (Cipher::new) 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":"ext/node_crypto/cipher.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d6aedf6c909ba1b11a6dd94eb9d8b7e85fe67a5c27b7f5e0e3050af6cbf368"}},{"ruleId":"D1","level":"warning","message":{"text":"_win32.normalize (cyclomatic 46): _win32.normalize has cyclomatic complexity 46 (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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39cfbaaec3f56091370f87f55acd2a141ea629872eae64677cf6831a3d3205d"}},{"ruleId":"D1","level":"warning","message":{"text":"JsError::inner_from_v8_exception (cyclomatic 45): JsError::inner_from_v8_exception has cyclomatic complexity 45 (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/core/error.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"a397559a5e6f75d30e15eeb8efc2b49a773745c56494e519585d38be795a9745"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 45): constructor has cyclomatic complexity 45 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 7 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/01_websocket.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8464569907db795554e6ed1fa7ba528549a13f9578c40d755b536cf672c72c7"}},{"ruleId":"D1","level":"warning","message":{"text":"Lockfile::set_workspace_config (cyclomatic 44): Lockfile::set_workspace_config has cyclomatic complexity 44 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/lockfile/lib.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc14c23f4636688ef5c152a445dd158fcebf8fa743e0d73af8bf122a0f93e0b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_ops::op2::dispatch_slow::from_arg (cyclomatic 44): deno_ops::op2::dispatch_slow::from_arg has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"libs/ops/op2/dispatch_slow.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43e7a0777fcfd2a34e38410fd3886af5d8464793f92ff5ab5f2ac871fbaa182"}},{"ruleId":"D1","level":"warning","message":{"text":"40_lint_selector.parseSelector (cyclomatic 43): 40_lint_selector.parseSelector has cyclomatic complexity 43 (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":"cli/js/40_lint_selector.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b8433bf978ec02bdf47dc8036e6b9547ea517a0e495061c9b8a353c4aed216"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize_encoding.slowCases (cyclomatic 43): normalize_encoding.slowCases has cyclomatic complexity 43 (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":"ext/node/polyfills/internal/normalize_encoding.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ac403fca1f9a0cc36c79cbbf8f2765b0cb4b83c4220d00f3aa21582ce64d6f"}},{"ruleId":"D1","level":"warning","message":{"text":"worker_threads.webMessagePortToNodeMessagePort (cyclomatic 43): worker_threads.webMessagePortToNodeMessagePort has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 10 of the 43 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 2110, a function literal at line 1983, a function literal at line 2027, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"2910e3bfc2350edd2507f0bde9cb4f1e18a6eb72dce13a60df3231cff8e1b407"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::lint::ast_buffer::swc::serialize_ts_type (cyclomatic 42): deno::tools::lint::ast_buffer::swc::serialize_ts_type has cyclomatic complexity 42 (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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab663ad8f557d63c5df0129a8085a2a7c140dc8a63c117fae165b3fda0161708"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_ec (cyclomatic 42): deno_crypto::subtle_import_key::import_key_ec has cyclomatic complexity 42 (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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6818834675157ccd4b6ff46343066070c00726d21509ab8f094e2903740cc68"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_process::create_command (cyclomatic 42): deno_process::create_command has cyclomatic complexity 42 (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":"ext/process/lib.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cbebe4e7c1f125dde3b3bf8e1868eb58a217feaed053d6e7d6959ba0526fbb"}},{"ruleId":"D1","level":"warning","message":{"text":"JsRuntimeInspectorState::poll_sessions (cyclomatic 42): JsRuntimeInspectorState::poll_sessions has cyclomatic complexity 42 (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/core/inspector.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"360bdd8a6159e59cc8fc88d9c6db64d4f12ce4bad6f21217fe6e7f2b82a84e4b"}},{"ruleId":"D1","level":"warning","message":{"text":"40_bench.benchMeasure (cyclomatic 42): 40_bench.benchMeasure has cyclomatic complexity 42 (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":"cli/js/40_bench.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2123ad23fd5b60ce59ed2f22d798358dfb79f84e56559c775d415488e0a0948b"}},{"ruleId":"D1","level":"warning","message":{"text":"ClientHttp2Session.request (cyclomatic 42): ClientHttp2Session.request has cyclomatic complexity 42 (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":"ext/node/polyfills/http2.ts"},"region":{"startLine":4684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4310eb329f7cdb2d681c17db714878fad39cfbdbec9c9dfd334878f8678d46"}},{"ruleId":"D1","level":"warning","message":{"text":"_win32.relative (cyclomatic 42): _win32.relative has cyclomatic complexity 42 (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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82a9d4491d0a93c1e6209f6eb524b90c307aca7cab3a5858cc4598a4e8484d5"}},{"ruleId":"D1","level":"warning","message":{"text":"setUpAsyncStub (cyclomatic 42): setUpAsyncStub has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 12 of the 42 points are its own statements and the rest belongs to 10 function items inside it that branch (async_op_0, async_op_1, async_op_2, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/00_infra.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82923933ce4ce4b40c0359a7b050210a08d27a6578e0db78676112caaa384ad"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_dotenv::parse_env_content_hook_impl (cyclomatic 41): deno_dotenv::parse_env_content_hook_impl has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dotenv/lib.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad335c0a635d08f697d159a5f4cf77f81e866a67ab2ed1e7da87bcc19ed12db"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect.isFullWidthCodePoint (cyclomatic 41): inspect.isFullWidthCodePoint has cyclomatic complexity 41 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"44610c80aa926c23c4b7f5ba330ff0aafc8d2c5a08a94374f178c11438f83ea5"}},{"ruleId":"D1","level":"warning","message":{"text":"_win32.parse (cyclomatic 41): _win32.parse has cyclomatic complexity 41 (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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cdb12967cb9e59de5cffe0acf48fcc1d798c1806ad785285cec6f39b4eac96"}},{"ruleId":"D1","level":"warning","message":{"text":"querystring.parse (cyclomatic 41): querystring.parse has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/querystring.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26a5713193539e9c81179be357a84b6f87d211e7d102b02d6231c5c34bd122c"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::verify_key_sync (cyclomatic 40): deno_crypto::verify_key_sync has cyclomatic complexity 40 (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":"ext/crypto/lib.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"0261eeeb8f8001199b74a1a25aa563ea5791a1436dd9e0ba67ff7a02351926f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Flags::to_permission_args (cyclomatic 40): Flags::to_permission_args has cyclomatic complexity 40 (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":"cli/args/flags.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0d1104dba67f7444994dfa6793aa3cddc750ccacf0a0a995fb0e98e1e9e562"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_outgoing.tryDirectEnd (cyclomatic 40): _http_outgoing.tryDirectEnd has cyclomatic complexity 40 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"192e30d75e6f01fdf19e2593b4a278e8dcbd7e6477f69f5ddba5d53dcad6a38b"}},{"ruleId":"D1","level":"warning","message":{"text":"tty.getColorDepth (cyclomatic 40): tty.getColorDepth has cyclomatic complexity 40 (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":"ext/node/polyfills/internal/tty.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d15c91a9ccb689afd3cdf223628c8e67465df681b6fd4b77d54bd1ce209fbb"}},{"ruleId":"D1","level":"warning","message":{"text":"Url.format (cyclomatic 40): Url.format has cyclomatic complexity 40 (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":"ext/node/polyfills/url.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e21481eb5ce016baec5f1ad2fc8f686017b3190bef54566deabf3dc7c66e95"}},{"ruleId":"D1","level":"warning","message":{"text":"worker_threads.internals.__initWorkerThreads (cyclomatic 40): worker_threads.internals.__initWorkerThreads has cyclomatic complexity 40 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 15 belong to 9 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"562ce54114407501f9e6b11ce69b1db9d34deb2434e500f2c8f6b7bf2e6ebf3a"}},{"ruleId":"D1","level":"warning","message":{"text":"createRespondWith::respondWith (cyclomatic 40): createRespondWith::respondWith has cyclomatic complexity 40 (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":"ext/http/01_http.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f660658778887d17bc12bf113545c0547192d63eedd3c4dfe2532aa34ed784f6"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::lsp::testing::collectors::visit_call_expr (cyclomatic 39): deno::lsp::testing::collectors::visit_call_expr has cyclomatic complexity 39 (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":"cli/lsp/testing/collectors.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7505a2e330a022322848359ea06681355fc7d1f5adbb879cf179e334d226ebe9"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_rsa (cyclomatic 39): deno_crypto::subtle_import_key::import_key_rsa has cyclomatic complexity 39 (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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"4293597f0d4e05f1ef6810c4921c7867e8fd22efb448bdfd0b306191acbf9c5c"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyObjectHandle::new_asymmetric_private_key_from_js (cyclomatic 39): KeyObjectHandle::new_asymmetric_private_key_from_js has cyclomatic complexity 39 (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":"ext/node_crypto/keys.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc84e37c4a11a83783c69b460fc5fef6f7031d5393fb89126ba0e48556d87667"}},{"ruleId":"D1","level":"warning","message":{"text":"HoistedNpmPackageInstaller::sync_resolution_with_fs (cyclomatic 39): HoistedNpmPackageInstaller::sync_resolution_with_fs has cyclomatic complexity 39 (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/npm_installer/hoisted.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5caf186046c6228f9d11fcd232fc7d2afbb95636259e4b1fd432c25ff2cc96b"}},{"ruleId":"D1","level":"warning","message":{"text":"01_http.createRespondWith.respondWith (cyclomatic 39): 01_http.createRespondWith.respondWith has cyclomatic complexity 39 (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":"ext/http/01_http.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"06542752f9c96b3d3af10e687cd6f40d8ad4d5458ec7484aade75db2a6af1213"}},{"ruleId":"D1","level":"warning","message":{"text":"http2.onSessionHeaders (cyclomatic 39): http2.onSessionHeaders has cyclomatic complexity 39 (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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c648796617f8cb286c2fc1146134589c2178a2075cdd48c4b9555375731eba8a"}},{"ruleId":"D1","level":"warning","message":{"text":"child.init (cyclomatic 39): child.init has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 5 of the 39 points are its own statements and the rest belongs to 18 function items inside it that branch (onconnection, a function literal at line 97, a function literal at line 88, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/child.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3798ae1750156e7a66b96552b8a6afdefdde0978c22fc5515b4ba33775cb71a3"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleRegistry::get_completions (cyclomatic 38): ModuleRegistry::get_completions has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/registries.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf363d7707b3ac8c90a944bdf506d786833934ca3b60ad9ec3d680c7a214d220"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::fmt_editorconfig::glob_to_regex_depth (cyclomatic 38): deno::tools::fmt_editorconfig::glob_to_regex_depth has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/fmt_editorconfig.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f174362c3e2c5f7b61340e8491a912e59b05a02e957dad6b1b190567d5645253"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_wrap_key::jwk_to_utf8 (cyclomatic 38): deno_crypto::subtle_wrap_key::jwk_to_utf8 has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_wrap_key.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4cf0afa7c11ecde51fcb1063235fa42d677ba17adc698c6e1326c93b1e5ab5"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::width::ansi_sequence_len (cyclomatic 38): deno_web::console::width::ansi_sequence_len has cyclomatic complexity 38 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/width.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"554b9da47a87e5560b31bb4443e124bd93f8d5b364dae0a412ebac046188764e"}},{"ruleId":"D1","level":"warning","message":{"text":"NpmInstallDepsProvider::from_workspace (cyclomatic 38): NpmInstallDepsProvider::from_workspace has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/package_json.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef48611ded62b3cd86670595256d132c51ff00180d5b402b53379d53cbb4e72"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertionError.constructor (cyclomatic 38): AssertionError.constructor has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/assertion_error.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3784737ae3fb20a1bc892eb6318dcc15e88e049bd95747b69a6ad2298ff2936"}},{"ruleId":"D1","level":"warning","message":{"text":"EszipV2::parse_with_version (cyclomatic 37): EszipV2::parse_with_version has cyclomatic complexity 37 (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/eszip/v2.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32fcd214830362a2d3912a6a13c790c54a04431a941738b6f773e4e3c357fc4"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_outgoing.tryDirectEmptyEnd (cyclomatic 37): _http_outgoing.tryDirectEmptyEnd has cyclomatic complexity 37 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7977cb2de6dabd0936f83daf48c9da532ac33d2d7b721defd9d6f89a60bdeb"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.fork (cyclomatic 37): child_process.fork has cyclomatic complexity 37 (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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abe82865df435a94b96338d3a5b85d1f0accb552018a1b56ca8f3a103560ab4"}},{"ruleId":"D1","level":"warning","message":{"text":"00_url.isSimpleSpecialHostCanonical (cyclomatic 37): 00_url.isSimpleSpecialHostCanonical has cyclomatic complexity 37 (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":"ext/web/00_url.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ca0693f13d51ec3eb4f6dd1d08be951ccb7fa7f050f422827169ce425e1633"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::transpile::restore_block_comment_newlines (cyclomatic 36): deno::tools::transpile::restore_block_comment_newlines has cyclomatic complexity 36 (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":"cli/tools/transpile.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab1341d9699c9c0bfc0ea5bbebcd7e8f911b878b0ca6da99abc782d0d431fa6"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentOptions::check_options (cyclomatic 36): EnvironmentOptions::check_options has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: OptionsParser::set_boolean_field (cyclomatic 111) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/lib.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9670fb9f590571374d9c3ae3f602f9fb0cbbb195b488189dbfa2916d3ed78d2"}},{"ruleId":"D1","level":"warning","message":{"text":"SecureContext.constructor (cyclomatic 36): SecureContext.constructor has cyclomatic complexity 36 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02c153a437e679bac81eb643b0209e4161e4178ec588cfaeb29457aecfbb5a0"}},{"ruleId":"D1","level":"warning","message":{"text":"from.from (cyclomatic 36): from.from has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 6 of the 36 points are its own statements and the rest belongs to 6 function items inside it that branch (nextSyncWithSyncValues, nextSyncWithAsyncValues, close, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/from.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc90b62a654e2ff8f0651b80b42537bcd89bcef07bf883de988c758406b253fc"}},{"ruleId":"D1","level":"warning","message":{"text":"net.Server.listen (cyclomatic 36): net.Server.listen has cyclomatic complexity 36 (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":"ext/node/polyfills/net.ts"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a5a49f317eeed43804b17dc8991a26d8ffa01e7affeee7b4f55e326fa2bac3"}},{"ruleId":"D1","level":"warning","message":{"text":"00_url.parseSimpleSpecialUrl (cyclomatic 36): 00_url.parseSimpleSpecialUrl has cyclomatic complexity 36 (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":"ext/web/00_url.js"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f943643aa21b564c32f5090e41099673c8d983f47e597cfb9761c017d89e032"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::pm::cache_deps::cache_top_level_deps (cyclomatic 35): deno::tools::pm::cache_deps::cache_top_level_deps has cyclomatic complexity 35 (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":"cli/tools/pm/cache_deps.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ac81763d434aea75f95ab176b06a72bc8557825dafd15acdc7f65950ba20dc"}},{"ruleId":"D1","level":"warning","message":{"text":"ZstdCompress::init (cyclomatic 35): ZstdCompress::init has cyclomatic complexity 35 (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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda44920af032f24ebbdc9b6d637439fe70d0d6ebc7d88b0bf9f57ded222ffb1"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::tls_wrap::build_client_config (cyclomatic 35): deno_node::ops::tls_wrap::build_client_config has cyclomatic complexity 35 (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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4895}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ac1eaea9d4c76bc832e45e8080eb0ed92f9cb532d9a25b0a17d2a73a2fc661"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_config::util::parse_iso8601_duration (cyclomatic 35): deno_config::util::parse_iso8601_duration has cyclomatic complexity 35 (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/config/util.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc52bbdb9d79c904796e149725c66dd624e73cdfa1d65c56dead63b6167e004"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::inspector::pump_inspector_session_messages (cyclomatic 35): deno_core::inspector::pump_inspector_session_messages has cyclomatic complexity 35 (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/core/inspector.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba871e68b392a5fe9210bf0549090f0b36a80a72a01830eaab3588196be08828"}},{"ruleId":"D1","level":"warning","message":{"text":"NpmRc::parse (cyclomatic 35): NpmRc::parse has cyclomatic complexity 35 (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/npmrc/lib.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce37a09af001263ba9cbb56448635bda45a5be0eea194261f7466356d6411de5"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.normalizeSpawnArguments (cyclomatic 35): child_process.normalizeSpawnArguments has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e463535bb17769ccfc2a6dff92443080728084d493b23b513ecd80e88cc988b"}},{"ruleId":"D1","level":"warning","message":{"text":"sig.verifyOneShot (cyclomatic 35): sig.verifyOneShot has cyclomatic complexity 35 (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":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"baec14aa941a62f2061b5b42f20389744578d94d851586c4359081052de9a493"}},{"ruleId":"D1","level":"warning","message":{"text":"util.updateSettingsBuffer (cyclomatic 35): util.updateSettingsBuffer has cyclomatic complexity 35 (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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7511c473b4ee1854d21213c8ee3d9ce72c06fe6a04a39c772c59e8ff7bec473"}},{"ruleId":"D1","level":"warning","message":{"text":"net._lookupAndConnect (cyclomatic 35): net._lookupAndConnect has cyclomatic complexity 35 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 12 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/net.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb809c0810d811c5bcd8b43fcbc67ed03a86cea4205411ca4ed4fa77e4e3f4ee"}},{"ruleId":"D1","level":"warning","message":{"text":"serverRequestInner (cyclomatic 35): serverRequestInner has cyclomatic complexity 35 (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":"cli/tsc/98_lsp.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1d0a4288c2f494ea54637cf44f7d6345fd4736e50258f4895d275f83f08842"}},{"ruleId":"D1","level":"warning","message":{"text":"TsResponseImportMapper::check_specifier (cyclomatic 34): TsResponseImportMapper::check_specifier has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs 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":"cli/lsp/analysis.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbcd6100e09bb2a5114e3588b11ba41f08502f8a7a3cd332d73a0610d3368a8"}},{"ruleId":"D1","level":"warning","message":{"text":"TestRun::exec (cyclomatic 34): TestRun::exec has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/lsp/testing/execution.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5efee23dde8831d04754e2878a91005918382a3355fd9b269cda811c5db967c"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::standalone::virtual_fs::vfs_as_display_tree (cyclomatic 34): deno::standalone::virtual_fs::vfs_as_display_tree has cyclomatic complexity 34 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 16 belong to 8 function items inside it that branch. 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":"cli/standalone/virtual_fs.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"066b223fa667d6aa4b3c1718755490ca6868550262497a566185c04480c6ddf7"}},{"ruleId":"D1","level":"warning","message":{"text":"denort_desktop::run_desktop (cyclomatic 34): denort_desktop::run_desktop 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":"cli/rt_desktop/lib.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41ebbc2dd9eea4854a3b93820bd9477ab34a1ac07f810f91cb4aa503a0368c5"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_derive_bits::run (cyclomatic 34): deno_crypto::subtle_derive_bits::run 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":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a77a273a5312b31f9d3661aee427bb147824c34ebdd0f8976941dad2538243"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::tls_wrap::build_server_config (cyclomatic 34): deno_node::ops::tls_wrap::build_server_config 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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":5397}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a8e70a0ca47ad6bf53235c70b9d3a63f794c662d955fbf78d815ee232c50d8"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::add_prototype_properties (cyclomatic 34): deno_web::console::inspect::add_prototype_properties 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":"ext/web/console/inspect.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce548c2a78d09ef637405df3d2fc35111ad66809d19580993137ea89d41eee7"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceResolver::resolve (cyclomatic 34): WorkspaceResolver::resolve 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":"libs/resolver/workspace.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa457b400be205f465b4fa0b94d1c2d427dd5127188cb8b083b56fc767ce2e66"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_resolver::npm_lockfile_import::package_lock_to_deno_lock_v5 (cyclomatic 34): deno_resolver::npm_lockfile_import::package_lock_to_deno_lock_v5 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":"libs/resolver/npm_lockfile_import.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea014752716067f04b934c0832485e23e375f4a882a8f489640697a27d8ceda"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_runtime::cpu_profiler::cpuprof::generate_markdown_report (cyclomatic 34): deno_runtime::cpu_profiler::cpuprof::generate_markdown_report has cyclomatic complexity 34 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/cpu_profiler/cpuprof.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc247a35da66099b1dda74883ad8f5501944c006368bf6a29d9eccca72b3548"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.spawnSync (cyclomatic 34): child_process.spawnSync has cyclomatic complexity 34 (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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebbe4cbb4d93e0ecebf285cfd77265177da571ed49cf7b279697dfbdb5be855"}},{"ruleId":"D1","level":"warning","message":{"text":"99_main.bootstrapMainRuntime (cyclomatic 34): 99_main.bootstrapMainRuntime has cyclomatic complexity 34 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 15 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/99_main.js"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0137f770306a956ef44155e861e09292014646e050aeb8d50cd710024972b70"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch (cyclomatic 34): dispatch 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":"ext/web/02_event.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"457ebeed8bcfcc3fa1338316e7fa4ede0915ab717a166a1c07aa0a65ce090b9c"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::clean::clean_except (cyclomatic 33): deno::tools::clean::clean_except has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/clean.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0176c7de3970bf6323e3e181f42be03be613cca9f58d091a6fde80fa3990805"}},{"ruleId":"D1","level":"warning","message":{"text":"Decipher::r#final (cyclomatic 33): Decipher::r#final has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa48656fbf4b9ceafb68a689eff7fd3dd4590117ab37401d5709dd4b86af3d17"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_runtime::fmt_errors::get_message_suggestions_inner (cyclomatic 33): deno_runtime::fmt_errors::get_message_suggestions_inner has cyclomatic complexity 33 (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":"runtime/fmt_errors.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"531e4c5b017693caf5951fae6a3b8dc8f7ff4e4aa58fd6f5c980d4e29adf4927"}},{"ruleId":"D1","level":"warning","message":{"text":"buffer.Buffer.fill (cyclomatic 33): buffer.Buffer.fill has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f16fdc4ea36049b8259dd8eaec78a29166057f0810ba7a5484ca5bf86fc94e9"}},{"ruleId":"D1","level":"warning","message":{"text":"interface.InterfaceConstructor (cyclomatic 33): interface.InterfaceConstructor has cyclomatic complexity 33 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7e40a4bb16d8082df064008ece2cfaa4586190da9b41fff1d94b25aa444509"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::pm::add (cyclomatic 32): deno::tools::pm::add 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":"cli/tools/pm/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b64ca6d22afd2f046d49d7456bf418b26337eff2912825f4432e87ffe8e976"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseSyncOptions::from_v8 (cyclomatic 32): DatabaseSyncOptions::from_v8 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":"ext/node_sqlite/database.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3699554a3131e1a5a33b2d72c14f307772878789f33896ccda759f3d34e838"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::format_property (cyclomatic 32): deno_web::console::inspect::format_property 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":"ext/web/console/inspect.rs"},"region":{"startLine":3528}}}],"partialFingerprints":{"codehealthFindingId/v1":"f849d3b41d423057cc1aeccdf76371a27c1a9eaaf3a7e32c4b1820c36719a052"}},{"ruleId":"D1","level":"warning","message":{"text":"PackageJson::load_from_value (cyclomatic 32): PackageJson::load_from_value has cyclomatic complexity 32 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 9 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/package_json/lib.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ad52d013b0a00bc970c6a1dfba3e478280b2f0dadc14e1ce6f6e54cc7147b7"}},{"ruleId":"D1","level":"warning","message":{"text":"readable.Readable.read (cyclomatic 32): readable.Readable.read has cyclomatic complexity 32 (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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b90819996a2bafcbfc5f335d786a5290e758332c8f346366a4c61e09daba79"}},{"ruleId":"D1","level":"warning","message":{"text":"table (cyclomatic 32): table has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/console/constructor.mjs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff400e2767e0a5a5c1004c9f55e7f62d2a8800c780bfbc269ba2e169333967ac"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 32): constructor has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 9 of the 32 points are its own statements and the rest belongs to 18 function items inside it that branch ((anonymous)::pull, a function literal at line 181, a function literal at line 188, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/02_websocketstream.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa0e1cd307d8fa973f1360e7bdb848d7a604b5d0c9bc5b68d7879543bc46350"}},{"ruleId":"D1","level":"warning","message":{"text":"createImageBitmap (cyclomatic 32): createImageBitmap has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 9 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 219). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/image/01_image.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3112b937a6fe6a6b50c1525955954f46184bbe68571993bf32056322266ffa"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionEntry::as_completion_item (cyclomatic 31): CompletionEntry::as_completion_item 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":"cli/lsp/tsc.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7222368ce93dbb526813649f196312e4fe6e32d9a41fce0a54f8b4e424680da"}},{"ruleId":"D1","level":"warning","message":{"text":"denort::run::run_with_options (cyclomatic 31): denort::run::run_with_options 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":"cli/rt/run.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7216eaf9339b027c3acf201a165976dfd86bcb8caba1b08a82ca92e90356ad"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::sign_key_sync (cyclomatic 31): deno_crypto::sign_key_sync has cyclomatic complexity 31 (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":"ext/crypto/lib.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa8044820768304d922fa86fbf5d2f2becd558060d17cd0e03fa4d7cced5578"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyObjectHandle::verify_prehashed (cyclomatic 31): KeyObjectHandle::verify_prehashed 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":"ext/node_crypto/sign.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd996a3e668838bbfcba601e188fded071a38bc05151e1ab66f790c7778f356"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_npm::fast_registry_json::pluck_versions_from_tokens (cyclomatic 31): deno_npm::fast_registry_json::pluck_versions_from_tokens has cyclomatic complexity 31 (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":"libs/npm/fast_registry_json.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee278d533663f7ac23e2c63cf82f550f097a2a83cde34db9b212054f9ddffb8d"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_agent.Agent (cyclomatic 31): _http_agent.Agent has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 14 of the 31 points are its own statements and the rest belongs to one function literal inside it that branches (line 185). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"539083a9d325e6f11edc0008d561d92aafe379f0445d621d1285a72b730770f7"}},{"ruleId":"D1","level":"warning","message":{"text":"https.openCONNECTTunnel (cyclomatic 31): https.openCONNECTTunnel has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 6 function items inside it that branch (onProxyReady::onData, onProxyReady, fail, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/https.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"c937f283587455198352e9e12547cce6512b6c7c37b76ff9a8cc3677030ce5c2"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect.formatWithOptionsInternal (cyclomatic 31): inspect.formatWithOptionsInternal 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":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9b652bdd7bafe1e58cd9d621153b4ffdc899ab511b9936b75d4adc1764e966"}},{"ruleId":"D1","level":"warning","message":{"text":"REPLServer.constructor (cyclomatic 31): REPLServer.constructor 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. This shape REPEATS in the file: 3 other methods here (REPLServer.constructor::_doComplete, REPLServer.constructor::showPreview, REPLServer.constructor::clearPreview) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"232cbfa3057702d21d04134425012215972bec2662bfbe4d34a1392b94b95e11"}},{"ruleId":"D1","level":"warning","message":{"text":"string_decoder.decode (cyclomatic 31): string_decoder.decode 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":"ext/node/polyfills/string_decoder.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb7f35de09e948f90d5b3c30ebcae64b7c98f7c9c617e0db5eafd29d9eda329"}},{"ruleId":"D1","level":"warning","message":{"text":"Inner::code_action (cyclomatic 30): Inner::code_action 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":"cli/lsp/language_server.rs"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f12b652a1579db06ad88d61e4a4dc877e062dbb5fd3435db0229bc2c12eeb9"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphWalker::resolve_pending (cyclomatic 30): GraphWalker::resolve_pending 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":"cli/type_checker.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7767156e4d73d930790576e9d07b5be5b30bd3dc8790acc531417786be595c4"}},{"ruleId":"D1","level":"warning","message":{"text":"jupyter_kernel.startJupyterKernel::checkIsComplete (cyclomatic 30): jupyter_kernel.startJupyterKernel::checkIsComplete 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. This shape REPEATS in the file: one other method here (jupyter_kernel.startJupyterKernel::handleExecute) 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":"cli/js/jupyter_kernel.js"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3e285f6bdc6220fb1793dccffe71bdf2c30190ed9fc7ec0b90f811d38a7dc9"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_server.resOnFinish (cyclomatic 30): _http_server.resOnFinish 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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b272c82e1ad52dd05b636dd01251bf248596e1ebe5f076dda287b2d9ab657ee"}},{"ruleId":"D1","level":"warning","message":{"text":"sig.signOneShot (cyclomatic 30): sig.signOneShot 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":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca0de33545bedb6aa8b80ec7da069f6f19f3958bab7b6a44b5a56b499e19640"}},{"ruleId":"D1","level":"warning","message":{"text":"readable.Readable.pipe (cyclomatic 30): readable.Readable.pipe has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 11 of the 30 points are its own statements and the rest belongs to 5 function items inside it that branch (pause, cleanup, onerror, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91105877563006454a71ed53d4790cfd386f1621275a30485b864c2f156e12a"}},{"ruleId":"D1","level":"warning","message":{"text":"FileReader.#readOperation (cyclomatic 30): FileReader.#readOperation has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 2 of the 30 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 165, 111, 244, \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":"ext/web/10_filereader.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3023b98b71f525a9b7ebbb9304acc8ca78e358dab551e3f35507dab83bd13299"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_http::http_next::write_h1_stream_response_shared (cyclomatic 29): deno_http::http_next::write_h1_stream_response_shared 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":"ext/http/http_next.rs"},"region":{"startLine":4338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df99d06adec0b12c2ce8458f54e257f99624bbfbbe2f2518be5f1d38692815b"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyObjectHandle::new_asymmetric_public_key_from_js (cyclomatic 29): KeyObjectHandle::new_asymmetric_public_key_from_js has cyclomatic complexity 29 (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":"ext/node_crypto/keys.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9632485b63756f1aab85c2b8854ee37a7fa4ab2ac6209d87339aa5fe68a0bac5"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node_crypto::keys::op_node_get_asymmetric_key_details (cyclomatic 29): deno_node_crypto::keys::op_node_get_asymmetric_key_details has cyclomatic complexity 29 (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":"ext/node_crypto/keys.rs"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2458cd119b2320be4862d0d69529bcfb9370504a69586ed3cabd70c03e41469"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::css::parse_css (cyclomatic 29): deno_web::console::css::parse_css 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":"ext/web/console/css.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f238bb00fb80650d0a39cb04dd4d052a7f0616542a185c635dd9f45175d64d6"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_cli_parser::convert::validate_permission_args (cyclomatic 29): deno_cli_parser::convert::validate_permission_args has cyclomatic complexity 29 (threshold 15). Of this number, 26 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. This is NOT this file\u0027s highest cyclomatic complexity: deno_cli_parser::convert::convert (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"841542d0d7fb5ef8df4ee648d2961e91b485c1dbb4f278ebee0355a0a8c84509"}},{"ruleId":"D1","level":"warning","message":{"text":"FilePatterns::split_by_base (cyclomatic 29): FilePatterns::split_by_base 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":"libs/config/glob/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2d27df7d9039d70019e5eb21f7e05f563c948f71b14d2c2c714c1cc0affbcd"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_config::workspace::discovery::discover_workspace_config_files_for_single_dir (cyclomatic 29): deno_config::workspace::discovery::discover_workspace_config_files_for_single_dir has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs 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":"libs/config/workspace/discovery.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a2fe49affb981bbf0b9ba49e4c759a075b6343ff18982a9c4c61d6bc9878de"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::tty::uv_tty_init (cyclomatic 29): deno_core::uv_compat::tty::uv_tty_init 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. This is NOT this file\u0027s highest cyclomatic complexity: deno_core::uv_compat::tty::get_vt100_fn_key (cyclomatic 137) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e584a98b346ca4fc967bb9e589a64b726244b90669ca49758fb28965c76cc4"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_ops::op2::signature::parse_attribute (cyclomatic 29): deno_ops::op2::signature::parse_attribute has cyclomatic complexity 29 (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":"libs/ops/op2/signature.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea66eb05a7564841ada4b7231e548f192888e3d9530389650f1f646010255109"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_resolver::pnpm_lockfile_import::pnpm_lock_to_deno_lock_v5 (cyclomatic 29): deno_resolver::pnpm_lockfile_import::pnpm_lock_to_deno_lock_v5 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":"libs/resolver/pnpm_lockfile_import.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c44534d99985ba828b1dabefbf9bde9c11d833c314f6f60990084a2ba66356"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_subprocess_windows::process::search_path_join_test (cyclomatic 29): deno_subprocess_windows::process::search_path_join_test has cyclomatic complexity 29 (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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb75144fa2d4619e9de63e3e73873e37fb477b0714ecddab40bf5a350cac7f84"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_subprocess_windows::process::search_path (cyclomatic 29): deno_subprocess_windows::process::search_path has cyclomatic complexity 29 (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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"733142136eebbf2228c910230ecedb2eb19d4190740751d55c661dedf5545ece"}},{"ruleId":"D1","level":"warning","message":{"text":"http2.setupHandle (cyclomatic 29): http2.setupHandle has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 14 of the 29 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 3641, socketOnData, a function literal at line 3562, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":3510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a487ec731cb74c8ab103d8713a171d9c0c4cc130102fa920ad590a38062aedb4"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::pm::why::why (cyclomatic 28): deno::tools::pm::why::why has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/why.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3080d5452e745dbc889bdfdd983d6c6b783e967f4ed72f676acb07766dd96427"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_decrypt::run (cyclomatic 28): deno_crypto::subtle_decrypt::run has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a2c43055c5c4a830f291dbfd777bfb2297c4eb0b2255fca477a2e32f4b2501"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_encrypt::run (cyclomatic 28): deno_crypto::subtle_encrypt::run has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_encrypt.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"661af9d8acc2592565c4e489357076e29be5c34720d6b88032060060edf96d82"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_image::bitmap::parse_args (cyclomatic 28): deno_image::bitmap::parse_args has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"ext/image/bitmap.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efce4ed6f10bed389fd97a1f5da01b9bc8fadc4c77126d48458fb8fff709b4a"}},{"ruleId":"D1","level":"warning","message":{"text":"Prime::generate_with_options (cyclomatic 28): Prime::generate_with_options has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/primes.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7247b3a43dc09b30741c59f2f5441662b638262b3d8a179edbec9d1e19a7e6"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::url::parse_simple_special_url (cyclomatic 28): deno_web::url::parse_simple_special_url has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/url.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea58327155d5e2d4c5cdce822a49eee74befbf30eecbe0c24ff753975c5f524"}},{"ruleId":"D1","level":"warning","message":{"text":"Workspace::diagnostics::check_all_configs (cyclomatic 28): Workspace::diagnostics::check_all_configs has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (Workspace::diagnostics::check_member_diagnostics) 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":"libs/config/workspace/mod.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c86aeb8d086893bef1a39157363c861bdfc22e68ed55009301645cf1089dab"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::io_error_to_uv (cyclomatic 28): deno_core::uv_compat::io_error_to_uv has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"libs/core/uv_compat.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f64d671f909642eec1106440a0c64f23fc87b8e040760354c98123a803a240"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::tty::tty_try_read_raw (cyclomatic 28): deno_core::uv_compat::tty::tty_try_read_raw has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: deno_core::uv_compat::tty::get_vt100_fn_key (cyclomatic 137) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c46cbc06b746dcec0ede733249a3e31a50bd9d4c785b1aa3597f6455e363f4"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_lockfile::transforms::transform3_to_4 (cyclomatic 28): deno_lockfile::transforms::transform3_to_4 has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/lockfile/transforms.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"919be63891bdc1197e61b7cab74fda151d69b75e56c110733f182c473575b2ba"}},{"ruleId":"D1","level":"warning","message":{"text":"PermissionsContainer::check_special_file (cyclomatic 28): PermissionsContainer::check_special_file has cyclomatic complexity 28 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":4602}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fbedb953d15c2f91711562c8d0dc998d43e07037808e278129098cea054da4"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_subprocess_windows::process::uv__kill (cyclomatic 28): deno_subprocess_windows::process::uv__kill has cyclomatic complexity 28 (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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5b791f7ddbcef1fa6b35635e8a1cd5e732e5eb39cacfe0287c74768d69e972"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.next (cyclomatic 28): Lexer.next has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/js/40_lint_selector.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed3a1adc9943afbba3364dde8bdd19f43f0468db83601b276f7c885415382d1"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.buildCommand (cyclomatic 28): child_process.buildCommand has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"d153edbe150ac5aff910c2b123c31c602076bea4e8d883fcbe8d01b4082e6baf"}},{"ruleId":"D1","level":"warning","message":{"text":"REPLServer._handleError (cyclomatic 28): REPLServer._handleError has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/repl.ts"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ed4a8349fed7d95d458caf333fc4d3221985fd040fc3e9d14dee4850471907"}},{"ruleId":"D1","level":"warning","message":{"text":"extractBody (cyclomatic 28): extractBody has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/22_body.js"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c0ae1ae6e11982c2606dce2dd35f36738793c59c7ba62f200d17506279b069"}},{"ruleId":"D1","level":"warning","message":{"text":"Inner::walk_workspace (cyclomatic 27): Inner::walk_workspace 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":"cli/lsp/language_server.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdd883fe9d9dc8202c09843bd79d8424d9dca702cedc2e44d617975c28dfdb5"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfiguredDepResolutions::new (cyclomatic 27): ConfiguredDepResolutions::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":"cli/lsp/resolver.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"13935afc3d1602cb171502486237854a4a8f6a458d732b9b0c5e8803fc619307"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::lsp::path_to_regex::lexer (cyclomatic 27): deno::lsp::path_to_regex::lexer 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":"cli/lsp/path_to_regex.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1525499dc1017025af3cd22672299ce85247604ffd9505078957d80848d94c09"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_process::op_spawn_sync (cyclomatic 27): deno_process::op_spawn_sync has cyclomatic complexity 27 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 7 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":"ext/process/lib.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f45633f9ec9cb8e4bb413b5c30a66e05e595a341cefed261dd99f1041155c4b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::error_fmt::get_duplicate_error_frame_ranges (cyclomatic 27): deno_web::console::error_fmt::get_duplicate_error_frame_ranges 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":"ext/web/console/error_fmt.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"338508d725bb546ce8878e352c5a426949ad864d8cb8fa07e2d421eec74c053e"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_config::workspace::discovery::resolve_workspace_for_config_folder (cyclomatic 27): deno_config::workspace::discovery::resolve_workspace_for_config_folder has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/discovery.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a958fd30daa5e7106ee6bbe8320c20d695b7cc3254aa21ae031b7694acbc921"}},{"ruleId":"D1","level":"warning","message":{"text":"LockfileContent::from_json (cyclomatic 27): LockfileContent::from_json has cyclomatic complexity 27 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/lockfile/lib.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0a89d3818e9bc3dd87170e99add49ad6d36649e430e18ae98a6a3e4d34c482"}},{"ruleId":"D1","level":"warning","message":{"text":"MacroConfig::from_metas (cyclomatic 27): MacroConfig::from_metas has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"libs/ops/op2/config.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9746aab057706d1cebae239b4a640d26f34e132142525aad943e44aa83339870"}},{"ruleId":"D1","level":"warning","message":{"text":"ByonmNpmResolver::resolve_pkg_json_and_alias_for_req (cyclomatic 27): ByonmNpmResolver::resolve_pkg_json_and_alias_for_req has cyclomatic complexity 27 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 10 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":"libs/resolver/npm/byonm.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2214eb4473b4d64bbff66be1487d79918a6be8cababa47986699dab0a1dd68"}},{"ruleId":"D1","level":"warning","message":{"text":"EventSource.#loop (cyclomatic 27): EventSource.#loop 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":"ext/fetch/27_eventsource.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e6ffaad19ffe34b158f0d066c426bfcd2e7626f63388df48e992fe8dfd75c8"}},{"ruleId":"D1","level":"warning","message":{"text":"http2.processRespondWithFD (cyclomatic 27): http2.processRespondWithFD has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 7 of the 27 points are its own statements and the rest belongs to 6 function items inside it that branch (readAndWrite, a function literal at line 2872, closeOwnedFd, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":2795}}}],"partialFingerprints":{"codehealthFindingId/v1":"e467eafcc16717592f521b6d8c0573ca7ff3ef92a0f3252a4a7d112135b797ea"}},{"ruleId":"D1","level":"warning","message":{"text":"duplexify.duplexify (cyclomatic 27): duplexify.duplexify has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/duplexify.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ccd8c4728ddf6592c2ce4b85003150f7b67831a09fd28963fbcf017045e0d5"}},{"ruleId":"D1","level":"warning","message":{"text":"operators.map (cyclomatic 27): operators.map has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 6 of the 27 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 146, 113, 134). 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":"ext/node/polyfills/internal/streams/operators.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3818bf459965d7c2679fd55a9d0b6f3ad7c60002a17f0dbc290c927508502058"}},{"ruleId":"D1","level":"warning","message":{"text":"comparisons.objEquiv (cyclomatic 27): comparisons.objEquiv 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ddfee5c4c855de1ab5ce480bc1bc8db5b8f8a23ae6a1e0994724bebf2a56c4"}},{"ruleId":"D1","level":"warning","message":{"text":"_win32.dirname (cyclomatic 27): _win32.dirname has cyclomatic complexity 27 (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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"e351d23f521ca762f216471eba1b5ca8a576efa0311b2897355614da564c2897"}},{"ruleId":"D1","level":"warning","message":{"text":"TextDecoder.decode (cyclomatic 27): TextDecoder.decode has cyclomatic complexity 27 (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":"ext/web/08_text_encoding.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4683161e7d517bc37736adbe6cefb5011e83d0d8b94cccbb1ae21ee04b19ee16"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::fmt_editorconfig::parse (cyclomatic 26): deno::tools::fmt_editorconfig::parse 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":"cli/tools/fmt_editorconfig.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57096a381681975db70f0b2d2d5d793004739538a53a0f0dc995e383c793c88"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::import_key::import_key_ec (cyclomatic 26): deno_crypto::import_key::import_key_ec 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":"ext/crypto/import_key.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"acba873c38a8c5ccc38a827b1e229d0e9bb3d8ef792e478e3dd66d342fdbcc48"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_generate_key::run (cyclomatic 26): deno_crypto::subtle_generate_key::run has cyclomatic complexity 26 (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":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e928099a02e5ce8136bfc1260af2f9702d2a63fbb84d2ac8a0053e59dab4a55"}},{"ruleId":"D1","level":"warning","message":{"text":"LibUvStreamWrap::writev (cyclomatic 26): LibUvStreamWrap::writev 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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4cf7a7a935e0e0aba4ddd253e767b687ee3673ee63d8a7f369570327acfbdb"}},{"ruleId":"D1","level":"warning","message":{"text":"WasiContext::poll_oneoff (cyclomatic 26): WasiContext::poll_oneoff has cyclomatic complexity 26 (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":"ext/node/ops/wasi.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"140efd7dbf2abce058019af8555cbed1db52f38dec0e9a8d9b07a67ba387fe76"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::get_constructor_name (cyclomatic 26): deno_web::console::inspect::get_constructor_name 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":"ext/web/console/inspect.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"901c5eaaa0d70af649f0d3bf53b10afb2a698e11ed77080f71cdce28f0492d78"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_cli_parser::convert::permission_args_parse (cyclomatic 26): deno_cli_parser::convert::permission_args_parse has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: deno_cli_parser::convert::convert (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6af18df43b9107729e297073090e7f4274fc33de2db27619e9785e9fb86e523"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_cli_parser::convert::apply_node_options (cyclomatic 26): deno_cli_parser::convert::apply_node_options has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: deno_cli_parser::convert::convert (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a8fb59024032dcae5ff41b31982886f26d967e1b6a3dae9963792e2f47ead0"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_cli_parser::help::render_help (cyclomatic 26): deno_cli_parser::help::render_help 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":"libs/cli_parser/src/help.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c37308ae4656056982492f108cebea60fb02ace34af7de955be8dd873de33de"}},{"ruleId":"D1","level":"warning","message":{"text":"RawDenoResolver::resolve (cyclomatic 26): RawDenoResolver::resolve 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":"libs/resolver/lib.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b756601485ea8a0cd2ff7f3416c68b512b488d42bc08e1e4c8914e7a6782e8"}},{"ruleId":"D1","level":"warning","message":{"text":"SloppyImportsResolver::resolve (cyclomatic 26): SloppyImportsResolver::resolve has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs 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":"libs/resolver/workspace.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f018da5ffafc6bcc5b704644060369577e44cbc6ae71fa70e1dd17a66ec16e"}},{"ruleId":"D1","level":"warning","message":{"text":"assert.expectedException (cyclomatic 26): assert.expectedException 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":"ext/node/polyfills/assert.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bb3f21e0f64a4a676d2dfd8719bf09700a3803fabd228455e1513f1abcda4c"}},{"ruleId":"D1","level":"warning","message":{"text":"fs.watch (cyclomatic 26): fs.watch has cyclomatic complexity 26 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs.ts"},"region":{"startLine":3474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2be98111911d09e5324e09daf2e7a8b113f672ee0a97b766daa92811a18c14"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.transformDenoShellCommand (cyclomatic 26): child_process.transformDenoShellCommand has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05262000fbe30e651c6222a630b8e46b7d98e536ed899fe065a5edcf1b994d9"}},{"ruleId":"D1","level":"warning","message":{"text":"net.Socket (cyclomatic 26): net.Socket 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":"ext/node/polyfills/net.ts"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"056cf0aa34af6b81121d5b9081f8afbe1925c23ed33ac50180a405309a518444"}},{"ruleId":"D1","level":"warning","message":{"text":"parseArgs (cyclomatic 26): parseArgs has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 8 of the 26 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 411, 356, 457). 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":"ext/node/polyfills/internal/util/parse_args/parse_args.js"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b75d4237b319fb7a3863862d17eaa31ef590f713699af940c493e099d1668ff"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::lsp::diagnostics::diagnose_resolution (cyclomatic 25): deno::lsp::diagnostics::diagnose_resolution 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":"cli/lsp/diagnostics.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a456239d13514d3cd5e35c26b84a058765ce7eba4884ddba534d2472a028d8"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::coverage::cover_files (cyclomatic 25): deno::tools::coverage::cover_files has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/tools/coverage/mod.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9dbcc44224332bcc3ea3405e369768d435d4343367211293eb1aa7993a4b92"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::desktop_devtools::run_unified_session (cyclomatic 25): deno::tools::desktop_devtools::run_unified_session 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":"cli/tools/desktop_devtools.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dee512a974ed91269310b5c228eb6851f866c70613dd2629a0f5a2532a892a0"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::installer::npm_compat::install_http_modules (cyclomatic 25): deno::tools::installer::npm_compat::install_http_modules 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":"cli/tools/installer/npm_compat.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1f51e776de4446737e0346d4639d2d384133438364cb2d81b66f37a353068b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::lint::ast_buffer::swc::serialize_module_decl (cyclomatic 25): deno::tools::lint::ast_buffer::swc::serialize_module_decl has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b090a86c4d941e6d67d44da86068a59387978a53d202a6fee9c3730529ddb4"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbeddedModuleLoader::load_default (cyclomatic 25): EmbeddedModuleLoader::load_default has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/rt/run.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ef983c5e0cad650f145c8100b632da48a8260125d5ed16ae143d0315b13629"}},{"ruleId":"D1","level":"warning","message":{"text":"DOMMatrixReadOnly::exec_css_transform (cyclomatic 25): DOMMatrixReadOnly::exec_css_transform has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"ext/web/geometry.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"172da5a253cced5370ce5191c9600aabfb6fae8ce14f0ec8220e60a5f20d7263"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect_args_impl (cyclomatic 25): deno_web::console::inspect_args_impl 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":"ext/web/console/mod.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"068526950d38a9bdff767fd2556e444b37b4eb65ef350766095f96ee438515b8"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceResolver::from_workspace (cyclomatic 25): WorkspaceResolver::from_workspace has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 4 function items inside it that branch (resolve_import_map, resolve_import_map::expand_catalog_specifiers::expand_entries, resolve_import_map::expand_catalog_specifiers, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/workspace.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba001131ea92d3781bbd660ab4ad08232253c4c39eb4a4e44f63f8536f5d5b3"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_subprocess_windows::process::spawn (cyclomatic 25): deno_subprocess_windows::process::spawn has cyclomatic complexity 25 (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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c92ed1aec0dd3cd404078149f499ef8231ab50d3ef66dc1d70177da6fe140bb"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_outgoing.write_ (cyclomatic 25): _http_outgoing.write_ has cyclomatic complexity 25 (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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5936538166ef554543e516ba1a45c631941e96192d6cd075d7eaf2b433d97a95"}},{"ruleId":"D1","level":"warning","message":{"text":"DiffieHellmanImpl.constructor (cyclomatic 25): DiffieHellmanImpl.constructor has cyclomatic complexity 25 (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":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"14db2f61b54765fdd37b4349a10aad812a50b0b3ad47eef3f0421431b526d942"}},{"ruleId":"D1","level":"warning","message":{"text":"_win32.basename (cyclomatic 25): _win32.basename has cyclomatic complexity 25 (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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea67dc27ea0576e831af37139645989ec185bd8da906da4024b149dec1e057f"}},{"ruleId":"D1","level":"warning","message":{"text":"URLSearchParams.constructor (cyclomatic 25): URLSearchParams.constructor 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":"ext/web/00_url.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"585105f74359f9e956f8f8d4bf7aba93857ea0c8634876b76294a27ec4c7a72c"}},{"ruleId":"D1","level":"warning","message":{"text":"on (cyclomatic 25): on has cyclomatic complexity 25 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 10 belong to 12 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_events.mjs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"27488e6e5dd6cc19755ef8c5cc245abcb7d5ff87a4616fc510f5f29f4bae5e4b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::pm::interactive_picker::select_items (cyclomatic 24): deno::tools::pm::interactive_picker::select_items 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":"cli/tools/pm/interactive_picker.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d304fe969034c5c1eb763292c71baf8b9ebbd5faced5fe90c36b8522d90dd1ff"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::transpile::transpile (cyclomatic 24): deno::tools::transpile::transpile 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":"cli/tools/transpile.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a0d4386f4c7b50bcdb9cfe25140436f625f4ce2f5e1880d38976d298fa02b3"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::x::run (cyclomatic 24): deno::tools::x::run 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":"cli/tools/x.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3a12569b6ecf4bec3645924e4dfa8e127fb7b5c26397ab9e1093e64f632859"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_get_public_key::run (cyclomatic 24): deno_crypto::subtle_get_public_key::run has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"ext/crypto/subtle_get_public_key.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e78ad45d3c98e236753cda895a1dec28fd31cc22037bce79c767c6448de4797"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::tls_wrap::parse_extensions (cyclomatic 24): deno_node::ops::tls_wrap::parse_extensions 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. This is NOT this file\u0027s highest cyclomatic complexity: deno_node::ops::tls_wrap::rustls_error_to_node_error (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4052}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a136734d7520128daf39042ebba232e53083a6fbeac8b118f7ed5b8963bb623"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_runtime::fmt_errors::format_js_error_inner (cyclomatic 24): deno_runtime::fmt_errors::format_js_error_inner 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":"runtime/fmt_errors.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dee1ecd26b094453874de89c11521ac8afdc34d2b6b598f12a07a5ce515362a"}},{"ruleId":"D1","level":"warning","message":{"text":"jupyter_kernel.startJupyterKernel::handleExecute (cyclomatic 24): jupyter_kernel.startJupyterKernel::handleExecute 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. This shape REPEATS in the file: one other method here (jupyter_kernel.startJupyterKernel::checkIsComplete) 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":"cli/js/jupyter_kernel.js"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"de180c530a44d94f8bfee063deb6d701af50147f4d1ec0b016533d09b0aa01d6"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_client.parserOnIncomingClient (cyclomatic 24): _http_client.parserOnIncomingClient has cyclomatic complexity 24 (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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6facbc349606ce10c6324e159116cae8cf925a26730ccb251f6baf28544de2"}},{"ruleId":"D1","level":"warning","message":{"text":"_posix.parse (cyclomatic 24): _posix.parse has cyclomatic complexity 24 (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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a0b0804cdcaf0848ac0acbddcc168529462f8924a0ccb7fb4e853038041666"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::resolve_flags_and_init (cyclomatic 23): deno::resolve_flags_and_init 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":"cli/lib.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fc81125c2f8283c9b189b2807f82fccf420a8b25811f3ac5b752542c3320d4"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::initialize_tunnel (cyclomatic 23): deno::initialize_tunnel 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":"cli/lib.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d8911c0a789a0bc5d8c93a3b55fd575039572e757c4952eb97e053514226c7"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::bump_version::bump_workspace_conventional (cyclomatic 23): deno::tools::bump_version::bump_workspace_conventional 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":"cli/tools/bump_version.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5c13087690f838dc2262fa0fae8dfc834a687312c2853bcb5aeb026997a507"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::bundle::html::attr_value (cyclomatic 23): deno::tools::bundle::html::attr_value has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/html.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12e8fdc69a91180523ed79dcf561adbf861cc167cb919d1cabe4eacdc2a7004"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::framework::detect_framework (cyclomatic 23): deno::tools::framework::detect_framework 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":"cli/tools/framework.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60f2d11851bd745c420f1a081235f280e83c12505640b90464ba13b7f0d92a9"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::installer::global::resolve_shim_data (cyclomatic 23): deno::tools::installer::global::resolve_shim_data 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":"cli/tools/installer/global.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2224133eb7dfd8f029d6121327a98bd3366f99d90569f65740fb450ef20e40"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tsc::tsconfig_gen::build_tsconfig (cyclomatic 23): deno::tsc::tsconfig_gen::build_tsconfig has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19a48c0acf1118956bb7274d2841e398aa8fbfa6b20aa456715089952caf407"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::derive_bits_sync (cyclomatic 23): deno_crypto::derive_bits_sync has cyclomatic complexity 23 (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":"ext/crypto/lib.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf840e9f1f37e7bc9f3b71693fe48d35ec4ac3cbdee1e29e397e6c2fd261e4a"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::export_key::export_key_ec (cyclomatic 23): deno_crypto::export_key::export_key_ec 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":"ext/crypto/export_key.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0404811c8c4bfa5d014ef0dc47eccf4a20fa06922074fe1a8f9d3ff75363f250"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_okp (cyclomatic 23): deno_crypto::subtle_import_key::import_key_okp 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. This is NOT this file\u0027s highest cyclomatic complexity: deno_crypto::subtle_import_key::aes_jwk_alg (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddc4e29f68a3b1b9926e07bab3afd5cb82dd5db525b481e88521c65236ee7a4"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_ffi::turbocall::compile_trampoline::convert (cyclomatic 23): deno_ffi::turbocall::compile_trampoline::convert has cyclomatic complexity 23 (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. This shape REPEATS in the file: one other method here (deno_ffi::turbocall::compile_trampoline) 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":"ext/ffi/turbocall.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51beba1446661911177620cd1e03a86cb46ad156cd443fea3d41d67672f2b2a"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_http::http_next::write_h1_stream_response (cyclomatic 23): deno_http::http_next::write_h1_stream_response 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":"ext/http/http_next.rs"},"region":{"startLine":4184}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d04c2d8ce166d0be248fc2f66695502dc3bcd5eaa5f0ec7000a0c375dac1f0"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::llhttp::binding::consume_read_callback (cyclomatic 23): deno_node::ops::llhttp::binding::consume_read_callback 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":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c69f948c0db89f05c602d9f33e4c1f73923e6cd5e89cc9182e65358e4e02db7"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::js_parse_float (cyclomatic 23): deno_web::console::js_parse_float 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":"ext/web/console/mod.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"081597b741a37ec3f30d0a1f249c208017d3a959e5a27cb12438485a68791bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"UvLoopInner::has_alive_handles (cyclomatic 23): UvLoopInner::has_alive_handles 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":"libs/core/uv_compat.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2bf56a2ebc6d1df859c86db66d05164c6227d561c41b0ed270b3ca676c9fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_ops::op2::generate_op2 (cyclomatic 23): deno_ops::op2::generate_op2 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":"libs/ops/op2/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fe9f3e7c6810f0d8617df4ecf514655127330cbaa672f2fc7c5ae45f3473ba"}},{"ruleId":"D1","level":"warning","message":{"text":"02_websocket.upgradeWebSocket (cyclomatic 23): 02_websocket.upgradeWebSocket has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/02_websocket.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1b6b6e4e8339dcd785a27857f5ad3db42c0a0fbd362143ecb15d6b677d3422"}},{"ruleId":"D1","level":"warning","message":{"text":"01_require.Module._findPath (cyclomatic 23): 01_require.Module._findPath 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"707e5ca1d009399945aafeb90de077770c57d01de704e1d3ed6c18f93d4cafca"}},{"ruleId":"D1","level":"warning","message":{"text":"Http2Stream._destroy (cyclomatic 23): Http2Stream._destroy 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":2532}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d4a7f65459c002f0ecdf30011ce3f6a9956de34e82a20d5a38dc7241f87f7e"}},{"ruleId":"D1","level":"warning","message":{"text":"buffer.Buffer.copy (cyclomatic 23): buffer.Buffer.copy 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4108f05e6ab5fa0e6269812f27c9c523747cc02cd32bf30da73eea9c4ec3ad"}},{"ruleId":"D1","level":"warning","message":{"text":"util.buildNgHeaderString (cyclomatic 23): util.buildNgHeaderString has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to one function item inside it that branches (processHeader). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1ebca56bfb3283041793e772c0cb264c328878de0e2d98bf90e7ea4d784a30"}},{"ruleId":"D1","level":"warning","message":{"text":"comparisons.keyCheck (cyclomatic 23): comparisons.keyCheck 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbf73eb5cf80b6e3fcc3b2b839077c251bee34aa60b342b45051cfdc348e892"}},{"ruleId":"D1","level":"warning","message":{"text":"net._lookupAndConnectMultiple (cyclomatic 23): net._lookupAndConnectMultiple has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1277, 1276). 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":"ext/node/polyfills/net.ts"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4006d3baa6671f131333db91c45d2326a514fb6513e25b73019f5b20f467643c"}},{"ruleId":"D1","level":"warning","message":{"text":"REPLServer.constructor::showPreview (cyclomatic 23): REPLServer.constructor::showPreview 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. This shape REPEATS in the file: 3 other methods here (REPLServer.constructor, REPLServer.constructor::_doComplete, REPLServer.constructor::clearPreview) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e416158065b7f437b460b15eaa4ebb7222c050a086eb53fb509bad2a29ef20f0"}},{"ruleId":"D1","level":"warning","message":{"text":"measure (cyclomatic 23): measure 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":"ext/web/15_performance.js"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e2799dcb07d7d7c25c0fc44cf209ef1c1edd1037a341ae421d00d53dcbbad5"}},{"ruleId":"D1","level":"warning","message":{"text":"bench (cyclomatic 23): bench 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":"cli/js/40_bench.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4d09890218f82efc442b37d809c1c51d830f31bfdf4f7fc9ea37d14a418457"}},{"ruleId":"D1","level":"warning","message":{"text":"request (cyclomatic 23): request 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":"ext/web/locks.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6738554078e381ace7a255494b5ec686677e057a84913bb5bef0730ca8b045c"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleGraphBuilder::build_graph_with_npm_resolution_and_build_options (cyclomatic 22): ModuleGraphBuilder::build_graph_with_npm_resolution_and_build_options has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/graph_util.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68bb5df02e9849e85866a5b71d59a6d8df3ffce85a4588e44914bb341e66d3d"}},{"ruleId":"D1","level":"warning","message":{"text":"Inner::did_change_watched_files (cyclomatic 22): Inner::did_change_watched_files has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68467b6a112dda3cd5a21a7e4000fd5b046634286f461391af45be8d2c9d5ac"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::compile::compile_inner (cyclomatic 22): deno::tools::compile::compile_inner has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/compile.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"019dff0e03d8f336bacb7b02a640a67e3a09b51101f34de2ed8b861d207e313b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::repl::editor::validate (cyclomatic 22): deno::tools::repl::editor::validate has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/editor.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6aabb87931f14411cfe82d2d3bca95f7ec05d7cf8e671b24b133fbdf697d68"}},{"ruleId":"D1","level":"warning","message":{"text":"AdvancedIpcDeserializerDelegate::read_host_object (cyclomatic 22): AdvancedIpcDeserializerDelegate::read_host_object has cyclomatic complexity 22 (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":"ext/node/ops/ipc.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"f412200e3df586a9abfb2d8ad6cbbdc60987d88969fdc652fca2ae31c3783014"}},{"ruleId":"D1","level":"warning","message":{"text":"WasiContext::fd_read (cyclomatic 22): WasiContext::fd_read has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3a96bcc3969824da42c22ebbe61348f33225f341291fd75419e5b02b6faaa8"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::stream_wrap::on_uv_read (cyclomatic 22): deno_node::ops::stream_wrap::on_uv_read has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"818f218dc9748b61cf58e0c1c30019df1f8e1e7cd3e0278695c98e047e44a4cb"}},{"ruleId":"D1","level":"warning","message":{"text":"AsymmetricPrivateKey::export_der (cyclomatic 22): AsymmetricPrivateKey::export_der has cyclomatic complexity 22 (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":"ext/node_crypto/keys.rs"},"region":{"startLine":2410}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8909abd1d2e2601b314adacb3dece62c75c46802355bd9f00df9a64142f685"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node_crypto::x509::op_node_x509_verify (cyclomatic 22): deno_node_crypto::x509::op_node_x509_verify has cyclomatic complexity 22 (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":"ext/node_crypto/x509.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8b2fbc081b31d47e7a047de191635d3683f7a638f5c3c29c0574897b1ad3cd"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageData::constructor (cyclomatic 22): ImageData::constructor 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":"ext/web/image_data.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"21382d4d52be2abda95ce6ab2570dfd63351ed20518817ccaa22a3f9b9404943"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::try_custom_inspect (cyclomatic 22): deno_web::console::inspect::try_custom_inspect has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"026284175a7e254eb8263a77511d41e523b7591621d75e99c7edf174a4d8b945"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::url::simple_special_host_is_canonical (cyclomatic 22): deno_web::url::simple_special_host_is_canonical has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/url.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1513550d7fcc04ae83ae9b021ae3f23c8058170bc821662dd31f2224379f6d66"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_cli_parser::parse::parse_long_flag (cyclomatic 22): deno_cli_parser::parse::parse_long_flag has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/parse.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"551a1bcdca12cd409b5f7f7c1675438877541f5a91555eb09730a7d0a0fc6496"}},{"ruleId":"D1","level":"warning","message":{"text":"Workspace::split_cli_args_by_deno_json_folder (cyclomatic 22): Workspace::split_cli_args_by_deno_json_folder has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/mod.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"4525abc00078bd69c5b524dda5040294d858201796fd26b3c9998e25e2a71a44"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleMap::new_module_from_js_source_with_pending (cyclomatic 22): ModuleMap::new_module_from_js_source_with_pending has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"f842a26c136150397158317a567e5472a2a3d658e84b382cbef1b5dec1ed5053"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_npm_installer::hoisted::compute_hoisted_layout (cyclomatic 22): deno_npm_installer::hoisted::compute_hoisted_layout has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"465ab11f97526da770971e794ea99673b6bd7c43eebd92239f0b9b65c8703575"}},{"ruleId":"D1","level":"warning","message":{"text":"Flags::parse (cyclomatic 22): Flags::parse 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":"libs/ops/op2/config.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fdde938e23a6a1ad3866d20403f4e227f542616ce650e5aa0bc7da3c084c1b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_resolver::patch_react_cves (cyclomatic 22): deno_resolver::patch_react_cves has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/lib.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c84e757657866aa56602cc1420da9922f96bf9ff92cd8ef89ea9a7f15d7208"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_resolver::bun_lockfile_import::bun_lock_to_deno_lock_v5 (cyclomatic 22): deno_resolver::bun_lockfile_import::bun_lock_to_deno_lock_v5 has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/bun_lockfile_import.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"70607cc2239d0c42ebee5e4268c251b7c072bbdabd8d4df0b8cdb10a2c42ead3"}},{"ruleId":"D1","level":"warning","message":{"text":"00_serve.mapToCallback.mapped (cyclomatic 22): 00_serve.mapToCallback.mapped has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/00_serve.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7019bf82939ba69309f3bc871c74db878f2140ce463194f4914afca406f2663"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomicOperation.[SymbolFor(\u0022Deno.privateCustomInspect\u0022)] (cyclomatic 22): AtomicOperation.[SymbolFor(\u0022Deno.privateCustomInspect\u0022)] has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/kv/01_db.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b071b6e05dd4185d2b51d4e7309c76213d1f6be056d271a870e5a73e66e80d6f"}},{"ruleId":"D1","level":"warning","message":{"text":"Socket.bind (cyclomatic 22): Socket.bind has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dgram.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2daa459af5ec96de8655c14477da65ad4abc1da28f40908855b7905ccdc2a0"}},{"ruleId":"D1","level":"warning","message":{"text":"dns.lookup (cyclomatic 22): dns.lookup has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fe2a3957e1a528feac0ef831dcc336b301d2cd1c82ea92e37bf809f29fbf55"}},{"ruleId":"D1","level":"warning","message":{"text":"https.Agent.getName (cyclomatic 22): https.Agent.getName 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":"ext/node/polyfills/https.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bbf22ef16c57d514f781b3b82d86a9dfa23513471e232cffa87cf04c7a9099"}},{"ruleId":"D1","level":"warning","message":{"text":"errors.createInvalidArgType (cyclomatic 22): errors.createInvalidArgType has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"53803d00a526265553dc954c49f21e25074b25396d417de1d7bdf0e12f48bf48"}},{"ruleId":"D1","level":"warning","message":{"text":"_posix.basename (cyclomatic 22): _posix.basename has cyclomatic complexity 22 (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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57021fbfea097c44b28ebbad9e670cf72396902c68c775a64dc0efe4e41e880"}},{"ruleId":"D1","level":"warning","message":{"text":"_win32.join (cyclomatic 22): _win32.join has cyclomatic complexity 22 (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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"873b03eb7c5712787ece6542f1a976614c2ac6d201be4c12057ee6389d2f6157"}},{"ruleId":"D1","level":"warning","message":{"text":"httpRedirectFetch (cyclomatic 22): httpRedirectFetch has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36ccfd83dce767ae1f0352cd5a0e62195e8bb416d69cbe33eb487d373fabb68"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::desktop::apply_desktop_config_to_flags (cyclomatic 21): deno::tools::desktop::apply_desktop_config_to_flags 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":"cli/tools/desktop.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5eb6a1c76ad292a52efcdaec5e9f1583166528578fb46d6938eb1391b236ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::info::add_npm_packages_to_json (cyclomatic 21): deno::tools::info::add_npm_packages_to_json 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":"cli/tools/info.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c56a1488effb99d6a4c99e2c8640d507a4947bf7d4777acb4680a9b7023d0a"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::upgrade::upgrade (cyclomatic 21): deno::tools::upgrade::upgrade 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":"cli/tools/upgrade.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d5235021517213d372b5b426c6891ccc99e835ffca2505f6567d79e2de45dc"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tsc::resolve_specifier_for_tsc (cyclomatic 21): deno::tsc::resolve_specifier_for_tsc 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":"cli/tsc/mod.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"24369581f4f8e71ac5372b74822c1233a95a5dbe803c9f59160bc0691ad09d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_ml_kem (cyclomatic 21): deno_crypto::subtle_import_key::import_key_ml_kem 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. This is NOT this file\u0027s highest cyclomatic complexity: deno_crypto::subtle_import_key::aes_jwk_alg (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde496b1a454c375dea350b48b3e244e63b032a94ef6e40e3bc0dad453a28dc5"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_kmac (cyclomatic 21): deno_crypto::subtle_import_key::import_key_kmac 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. This is NOT this file\u0027s highest cyclomatic complexity: deno_crypto::subtle_import_key::aes_jwk_alg (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bc64cd6ef5e42a12ff0b5e71b9becd5f0b92f71faacf32bccd42c91f413db1"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpRecordResponse::poll_frame (cyclomatic 21): HttpRecordResponse::poll_frame 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":"ext/http/service.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e1d37b7dffa77d3e284c458d85f4d6ca89a278f902a5489b071e17ab2e5e88"}},{"ruleId":"D1","level":"warning","message":{"text":"Http2Options::new (cyclomatic 21): Http2Options::new has cyclomatic complexity 21 (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":"ext/node/ops/http2/session.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"6780b70287aed0de7e02b201419c7558875678c68ea9806d5ea5099e02d0feab"}},{"ruleId":"D1","level":"warning","message":{"text":"ChainSearch::extend (cyclomatic 21): ChainSearch::extend 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. This is NOT this file\u0027s highest cyclomatic complexity: deno_node::ops::tls_wrap::rustls_error_to_node_error (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4386}}}],"partialFingerprints":{"codehealthFindingId/v1":"18766cf24bd6b73ea29fc78ec3922afd3373d2de472d81b38077460527eb3b76"}},{"ruleId":"D1","level":"warning","message":{"text":"WasiContext::path_open (cyclomatic 21): WasiContext::path_open has cyclomatic complexity 21 (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":"ext/node/ops/wasi.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e785bc90c9183897af13f83fbce667c92308764465a97232bf49e590f64aa0f"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::http2::session::on_stream_read_callback (cyclomatic 21): deno_node::ops::http2::session::on_stream_read_callback 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":"ext/node/ops/http2/session.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"add603fd1aeb61612888b3e3c0378c37122314336ca67d5c06b2eef7b7a429f0"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigFile::to_exports_config (cyclomatic 21): ConfigFile::to_exports_config has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (validate_key, validate_value). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/mod.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be25debd6386148381bc62098e98c90dae35dbd963a692a313c0dac68831a90"}},{"ruleId":"D1","level":"warning","message":{"text":"FileCollector::collect_file_patterns (cyclomatic 21): FileCollector::collect_file_patterns has cyclomatic complexity 21 (threshold 15). Of this number, 18 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":"libs/config/glob/collector.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"60eb975bf673c7f23ead47cd8d2999fa2851d7175162201ddbe7032997c33ed2"}},{"ruleId":"D1","level":"warning","message":{"text":"Workspace::config_folders_sorted_by_dependencies (cyclomatic 21): Workspace::config_folders_sorted_by_dependencies has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/mod.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ba8fae108d46b058b5f67e6f3359b520e1e1fa9eaa228861d10a8ac57756a"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_lockfile::transforms::transform4_to_5 (cyclomatic 21): deno_lockfile::transforms::transform4_to_5 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":"libs/lockfile/transforms.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"365a99a668e159a1c7c086532511a694c1643c989bb01cc66bcfa54e657c2c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_runtime::cpu_profiler::flamegraph::generate_flamegraph_svg (cyclomatic 21): deno_runtime::cpu_profiler::flamegraph::generate_flamegraph_svg has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/cpu_profiler/flamegraph.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"047558badfeb6f66ce7a4c8911fcc8639f8082b61c9b28939bceec0c3152b28a"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_runtime::web_worker::run_web_worker (cyclomatic 21): deno_runtime::web_worker::run_web_worker 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":"runtime/web_worker.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"398f3e446aa43e06f41d6f275dba73f653394c9314d51db1a622c4276f53d6f5"}},{"ruleId":"D1","level":"warning","message":{"text":"40_lint._dump (cyclomatic 21): 40_lint._dump 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":"cli/js/40_lint.js"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab57e3392273b8640aacff18c72b7c9692e0a9eb2ac46c31f402c81cfede5f8"}},{"ruleId":"D1","level":"warning","message":{"text":"TextLineStream.#handle (cyclomatic 21): TextLineStream.#handle 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":"ext/fetch/27_eventsource.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07d75416aed2fcc53c70057aa47598a31292734a82dac847fa53998317228cb"}},{"ruleId":"D1","level":"warning","message":{"text":"00_ffi.getTypeSizeAndAlignment (cyclomatic 21): 00_ffi.getTypeSizeAndAlignment 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":"ext/ffi/00_ffi.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce83947e046deb4ebe373d3321b4e5563bb7cdc8cecb52939c7b907d33054fbd"}},{"ruleId":"D1","level":"warning","message":{"text":"_tls_common.validateKeyStrength (cyclomatic 21): _tls_common.validateKeyStrength 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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ad6f089c23345d505e5ddfb48f4be31101e594af664a4be340d87166ef6197"}},{"ruleId":"D1","level":"warning","message":{"text":"Socket.send (cyclomatic 21): Socket.send has cyclomatic complexity 21 (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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebe221ed85fa0270de4a74844ed0769ccf11294dafb22e11c8b7827ce271017"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.getValidStdio (cyclomatic 21): child_process.getValidStdio 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8762324da397c7c6a0dc9e8aac204cc25649c3578d00c36e07b2a25b90e3085c"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.getIpcHandleInfo (cyclomatic 21): child_process.getIpcHandleInfo 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b9660aa83d338690e5a377347c6a50ca2c887ae05f5da8d63cd725df58c723"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretKeyObject.toCryptoKey (cyclomatic 21): SecretKeyObject.toCryptoKey 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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"0210c2453d6708fb57d2f01ec6fadb80378776fbbb74acc040aa2a751f8786c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Http2ServerResponse.writeHead (cyclomatic 21): Http2ServerResponse.writeHead 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":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"1201755aa5a1562227d805eea75f3ea8f17d662c761966a35dd487bccec74600"}},{"ruleId":"D1","level":"warning","message":{"text":"readable.fromList (cyclomatic 21): readable.fromList 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"99158c481099e1d0e8000c6893c92b0a34ce9824506559e493e3a22c767c302b"}},{"ruleId":"D1","level":"warning","message":{"text":"writable.onwrite (cyclomatic 21): writable.onwrite 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f43b1479bfdbfb9a2815bca04f1012fbaf216612869a3e6a8115cfdc4a6a458"}},{"ruleId":"D1","level":"warning","message":{"text":"process.internals.__bootstrapNodeProcess (cyclomatic 21): process.internals.__bootstrapNodeProcess has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/process.ts"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f1ae1f425c03fc2f66c44675bc0afe8d24168a28a51cd5f9cfc643128ea9b9"}},{"ruleId":"D1","level":"warning","message":{"text":"REPLServer.constructor::clearPreview (cyclomatic 21): REPLServer.constructor::clearPreview 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. This shape REPEATS in the file: 3 other methods here (REPLServer.constructor, REPLServer.constructor::_doComplete, REPLServer.constructor::showPreview) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a5fec0bf60f9d5d781ba2e1df71ae893e1dae2a8d72e20eae60fe42f95f71a"}},{"ruleId":"D1","level":"warning","message":{"text":"testing.run (cyclomatic 21): testing.run has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/testing.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f34a965cb54e504dccec552067de9dd0825070489a1b0238ea65e8325ef06d"}},{"ruleId":"D1","level":"warning","message":{"text":"testing.mockModule (cyclomatic 21): testing.mockModule has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/testing.ts"},"region":{"startLine":3347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a04d9ff5f332d83e4d1892c96bb918c049f281e5aba01ae4743afb419c7644"}},{"ruleId":"D1","level":"warning","message":{"text":"06_streams.readableByteStreamControllerPullInto (cyclomatic 21): 06_streams.readableByteStreamControllerPullInto 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":"ext/web/06_streams.js"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bee5070f102eb9f2ecee0c3fda9b1da9ad1e6f50e3bc9067957d33cef79d44c"}},{"ruleId":"D1","level":"warning","message":{"text":"LspScopedResolver::configured_auto_import_roots (cyclomatic 20): LspScopedResolver::configured_auto_import_roots 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":"cli/lsp/resolver.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0408de738a7c6b82fd5758ae371d850a162b522bbc1a7881a2bef0f4fce6f6"}},{"ruleId":"D1","level":"warning","message":{"text":"TestServer::new (cyclomatic 20): TestServer::new 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":"cli/lsp/testing/server.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d196ed64dc1a7d0f3c86996cdc0c40f78edc94c3f8685885d2ff3e169cbc05b3"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDisplayContext::build_module_info (cyclomatic 20): GraphDisplayContext::build_module_info 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":"cli/tools/info.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"20281db8912d7aa65e6d5906403de51ba2f56e6ad59466edaeacf81f4a1fe281"}},{"ruleId":"D1","level":"warning","message":{"text":"SpecifierUnfurler::unfurl_specifier (cyclomatic 20): SpecifierUnfurler::unfurl_specifier 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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e81250c836355ce7373d1fc00ae4f53d17d2817bc2c3058eb597298783903b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::lsp::path_to_regex::tokens_to_regex (cyclomatic 20): deno::lsp::path_to_regex::tokens_to_regex 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":"cli/lsp/path_to_regex.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"1659f3eb6a8d4d792e9d6f556aaebfed5a14c796603f54e92c97bc91d4ae2454"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::lsp::tsc::display_parts_to_string (cyclomatic 20): deno::lsp::tsc::display_parts_to_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. This is NOT this file\u0027s highest cyclomatic complexity: TscRequest::into_server_request (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9dad3802a405e1963db560c5ba0eb308c190d948a96b4f21400c6cd3526df2"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::coverage::merge::merge_range_tree_children (cyclomatic 20): deno::tools::coverage::merge::merge_range_tree_children has cyclomatic complexity 20 (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":"cli/tools/coverage/merge.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdf62e1a5929347e2aacc7b41fd954f86bc1e55c9f989b84bf8eba2f08bab45"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::installer::local::categorize_installed_npm_deps (cyclomatic 20): deno::tools::installer::local::categorize_installed_npm_deps 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":"cli/tools/installer/local.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"766586aa1a8d562475c03bcf9070873d5262b36093f958e8ca573dedc39c454a"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::installer::local::sync_types_command (cyclomatic 20): deno::tools::installer::local::sync_types_command 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":"cli/tools/installer/local.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1397763218f3d5ec1b9b7b72ab7c0df0f7619459855bda6dfdb912f09209fe7b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::pm::outdated::update (cyclomatic 20): deno::tools::pm::outdated::update 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":"cli/tools/pm/outdated/mod.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1adf4cf262db788d485e11a11a0b122c6525497c16bfb62619c484d31002ec"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tsc::load_for_tsc (cyclomatic 20): deno::tsc::load_for_tsc has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/mod.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cd0e30ee36934c6656c87b91bad983d697d8c2cfec2a234fdd30da48202ce1"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::util::console::filter_destructive_ansi (cyclomatic 20): deno::util::console::filter_destructive_ansi has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/console.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f07e9c86b41d0980f70ba7181421f715e0259d295228c2f1aba4411157966"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_fetch::op_fetch (cyclomatic 20): deno_fetch::op_fetch 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":"ext/fetch/lib.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d60ddc6ab54bf72f546b5c34b32d923b43086f0ef5f497c2da76a7b5b115eb"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSWrapInner::clear_out_process (cyclomatic 20): TLSWrapInner::clear_out_process 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. This is NOT this file\u0027s highest cyclomatic complexity: deno_node::ops::tls_wrap::rustls_error_to_node_error (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d17fb0aaba1b1a9f1f3d1659a8ca276895159757d3127369caae76f5cd61da"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::shell::scan_and_split (cyclomatic 20): deno_node::ops::shell::scan_and_split 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":"ext/node/ops/shell.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"313075220bf43ce33d45b8498db0e8944838a361ada28551e2f30492ac9f72de"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyObjectHandle::sign_prehashed (cyclomatic 20): KeyObjectHandle::sign_prehashed 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":"ext/node_crypto/sign.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"312d409326d9a080d70af1dac854dede732811784f4e9ce153813fef79645e63"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node_crypto::cipher::aes_unwrap_key (cyclomatic 20): deno_node_crypto::cipher::aes_unwrap_key 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":"ext/node_crypto/cipher.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bce71654d95bff08368e57fa18ec80922a0d2d7492cacd6eb100ec22ed2212"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node_crypto::keys::parse_rsa_pss_params (cyclomatic 20): deno_node_crypto::keys::parse_rsa_pss_params 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":"ext/node_crypto/keys.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4308f0ca474ae798f388ef30460bef4f9e4910bb86509d0ca0e29d8f174a96"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseSync::function (cyclomatic 20): DatabaseSync::function 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":"ext/node_sqlite/database.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1d0b98bc3520653d10f2a588223183ec505eafd4ba52764a252672beca090c"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::group_array_elements (cyclomatic 20): deno_web::console::inspect::group_array_elements 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":"ext/web/console/inspect.rs"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e2270133819494c99e45c90ee52802a6f020788ec529e21b656eaa703697a7"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_cli_parser::completions::get_candidates (cyclomatic 20): deno_cli_parser::completions::get_candidates 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/cli_parser/src/completions.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"716ee57d1fa8b5a5741f3104925cd9e936a6ceef66658e22cff7c847df3bed3a"}},{"ruleId":"D1","level":"warning","message":{"text":"JsRuntimeInspector::capture_network_event (cyclomatic 20): JsRuntimeInspector::capture_network_event 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/core/inspector.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa9150f315536fde17007bff0b19eb9cab86ae04a0068fad2eb1868d4363bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::runtime::bindings::initialize_deno_core_ops_bindings (cyclomatic 20): deno_core::runtime::bindings::initialize_deno_core_ops_bindings 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/core/runtime/bindings.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f6fbbdec721032d8b8672fde1c6adde88b4cf860b1fbac6e2d72263d65139e"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeResolver::resolve_package_target_string (cyclomatic 20): NodeResolver::resolve_package_target_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/node_resolver/resolution.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6440ec692e87bcdeab2394d63ea00a79c9227c16f23b886945dc6e959da17d34"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph::compute_all_npm_pkg_ids (cyclomatic 20): Graph::compute_all_npm_pkg_ids has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/graph.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d15ddfdf2510a22c614ece1a051a85195736f7cacd118850604388269103391"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDependencyResolver::find_peers_cache_hit_inner (cyclomatic 20): GraphDependencyResolver::find_peers_cache_hit_inner 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/npm/resolution/graph.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"785810faa8b6502f7ca01889d15abeae25fa59d3d01c1d8ee45c6b6a72a83b85"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_ops::op2::dispatch_fast::generate_dispatch_fast (cyclomatic 20): deno_ops::op2::dispatch_fast::generate_dispatch_fast has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: deno_ops::op2::dispatch_fast::map_arg_to_v8_fastcall_type (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/dispatch_fast.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3907aca22601a31c27a9102849110ddf16225466a9a28f3496028d45cf9b01c0"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchCtx.getAttrPathValue (cyclomatic 20): MatchCtx.getAttrPathValue has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint.js"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b4091b3ed1a39662d43dac369646e5330b15a7d5e6b554396e6b8728460327"}},{"ruleId":"D1","level":"warning","message":{"text":"30_fs.parseFileInfo (cyclomatic 20): 30_fs.parseFileInfo has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/30_fs.js"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"99201fe7d2018ab581459f657e11d5da2126db5251c061e9ecd0944b150c3bd9"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_agent.Agent.addRequest (cyclomatic 20): _http_agent.Agent.addRequest has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dbe08ea861b2a548fcc14ebd2ede2b221a91edd9c5c63f485b897539a09bdf"}},{"ruleId":"D1","level":"warning","message":{"text":"streams.createWritableStdioStream (cyclomatic 20): streams.createWritableStdioStream has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_process/streams.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2547f43d4b77380f515efb46ab7399e0bb9e2d3719a6ab04ed04ccb9fd9f685"}},{"ruleId":"D1","level":"warning","message":{"text":"streams.initStdin (cyclomatic 20): streams.initStdin has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_process/streams.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb91f8a39bc9ffdec5cd88f6992ec25e4cba541ef3c26882e64af1fe423bca1b"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.execFile (cyclomatic 20): child_process.execFile 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. This shape REPEATS in the file: one other method here (child_process.execFile::exithandler) 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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"743c81c5037091014e405736795615c323cd3c0a4e59306793bb227f0e450ee8"}},{"ruleId":"D1","level":"warning","message":{"text":"http2.doSendFileFD (cyclomatic 20): http2.doSendFileFD 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":2959}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07613510194ef2ef41eec39ff4a989d65cd8edcd123e1f7f219caa1b7788725"}},{"ruleId":"D1","level":"warning","message":{"text":"buffer.getEncodingOps (cyclomatic 20): buffer.getEncodingOps 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"937fb22226ff7cbad772b4f5a40de861f847891576fee88d053d1e2dd4334ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"util.prepareRequestHeadersArray (cyclomatic 20): util.prepareRequestHeadersArray 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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59f88b4e07947dad84604cd9d13378a5074eff909668c8ecaaa286907ff0ade"}},{"ruleId":"D1","level":"warning","message":{"text":"buffer.indexOfBuffer (cyclomatic 20): buffer.indexOfBuffer has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/buffer.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a031c6925f17c05ce4c2ea986d6f434fddcbc9b1f4613a2be4e6758a240794"}},{"ruleId":"D1","level":"warning","message":{"text":"net._createServerHandle (cyclomatic 20): net._createServerHandle 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":"ext/node/polyfills/net.ts"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd17f0540f64f5339c5681295391c66bb516c06d1a69a713753ec6e1163eca16"}},{"ruleId":"D1","level":"warning","message":{"text":"_util.normalizeString (cyclomatic 20): _util.normalizeString has cyclomatic complexity 20 (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":"ext/node/polyfills/path/_util.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ee2c006f51827b7ebebdc167953b970ae134b49ff49247cfa26b5532cc5c3a"}},{"ruleId":"D1","level":"warning","message":{"text":"REPLServer.constructor::_doComplete (cyclomatic 20): REPLServer.constructor::_doComplete 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. This shape REPEATS in the file: 3 other methods here (REPLServer.constructor, REPLServer.constructor::showPreview, REPLServer.constructor::clearPreview) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"b662351d2b2af82a128a687c6797e555b7a6254a37c972a949e380480df4f5d6"}},{"ruleId":"D1","level":"warning","message":{"text":"testing.runTapEntry (cyclomatic 20): testing.runTapEntry has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/testing.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba9565e101492049edb55ff12dc3e9536a4d07dd5ba14f7a6d1d385a6215aac"}},{"ruleId":"D1","level":"warning","message":{"text":"MessagePort.postMessage (cyclomatic 20): MessagePort.postMessage 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":"ext/web/13_message_port.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8fa845fab14e9fedfd414488dbafc10a8ec58fd0feac2f47bcb048617329d9"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 20): constructor 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":"ext/web/02_event.js"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"de74617e51b23ff257dd9a5d37036b13c46ba499c951fc4c69a1079bf3145d27"}},{"ruleId":"D1","level":"warning","message":{"text":"styleText (cyclomatic 20): styleText 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":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a13d29471a5341ac36ecb4c79f40c2535d08343cb3753a7e68cbbe27ffbcb2d"}},{"ruleId":"D1","level":"warning","message":{"text":"DenoDiagnostic::code (cyclomatic 19): DenoDiagnostic::code has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/lsp/diagnostics.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad87a3b1156582d68752849b5cc8badaf8040d9873adc408769ee3919e7c9c7"}},{"ruleId":"D1","level":"warning","message":{"text":"Inner::code_action_resolve (cyclomatic 19): Inner::code_action_resolve 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":"cli/lsp/language_server.rs"},"region":{"startLine":2451}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc59a5637743753bf140ded00a349df2b9af9c498a777464e180c1dbdf21061"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCollector::visit_var_decl (cyclomatic 19): TestCollector::visit_var_decl 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":"cli/lsp/testing/collectors.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"545d6929b40e035b13b137eb1b36025c42472ad10370ef6d46c54e65abbe70eb"}},{"ruleId":"D1","level":"warning","message":{"text":"CliModuleLoader::prepare_load (cyclomatic 19): CliModuleLoader::prepare_load 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":"cli/module_loader.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"1691ea41ebad7bba2815cf76c89fc1df84035c261aaf2c80efb9db4d6f0e8306"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDiagnosticsCollector::collect_diagnostics_for_graph (cyclomatic 19): GraphDiagnosticsCollector::collect_diagnostics_for_graph 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":"cli/tools/publish/graph.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdec65201e65a402830a1d3f5e3907343b3c74866bcca5e86eeb171cfe77b4d6"}},{"ruleId":"D1","level":"warning","message":{"text":"SpecifierUnfurler::unfurl_to_changes (cyclomatic 19): SpecifierUnfurler::unfurl_to_changes 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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"a542ff4a3bfd6333fad18a9833601ea15df7b5c713ee97b52b8b1b0d28b196b8"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsByFolderRealIterator::check_diagnostics_in_folder (cyclomatic 19): DiagnosticsByFolderRealIterator::check_diagnostics_in_folder has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/type_checker.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f22641a51974ae3dbe5b436d542162f5b906e317149eb8d1876139cfa921cf1"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::lsp::tsc::get_parameters_from_parts (cyclomatic 19): deno::lsp::tsc::get_parameters_from_parts 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. This is NOT this file\u0027s highest cyclomatic complexity: TscRequest::into_server_request (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":3919}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fc09decfa824803f576ce9fd26ed5d94348d2c496a3fcca2c90a9bb2289a18"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::lsp::tsc::op_script_names (cyclomatic 19): deno::lsp::tsc::op_script_names 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. This is NOT this file\u0027s highest cyclomatic complexity: TscRequest::into_server_request (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":5589}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee52ffc12e067b56dbccede8037d0acadc8dbb87c2f991c4202bb72f13162581"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::clean::clean_node_modules (cyclomatic 19): deno::tools::clean::clean_node_modules 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":"cli/tools/clean.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"068bc2607b2d167d93bd4bddbe7da141e4def325e40efbf6e0c0e8d747d40b66"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::installer::global::setup_config_dir (cyclomatic 19): deno::tools::installer::global::setup_config_dir has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/installer/global.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad4b141324d30620c45e61adcdd07c148a9a864ac6e81721236bf19d980e282"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::pack::unfurl::unfurl_dynamic_specifier (cyclomatic 19): deno::tools::pack::unfurl::unfurl_dynamic_specifier 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":"cli/tools/pack/unfurl.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd01796a05f204c947fd6b8bc2f75a4f220fe43c6207f5181f316a740f730d12"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::upgrade::upgrade_from_pr (cyclomatic 19): deno::tools::upgrade::upgrade_from_pr 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":"cli/tools/upgrade.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead793c8e5e2cd5749471b41cfefab07314b80fa919600d22c97ecee6680fe06"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::util::file_watcher::watch_recv (cyclomatic 19): deno::util::file_watcher::watch_recv 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":"cli/util/file_watcher.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"998178aa1d982c2eb06f48690e778a23243de3a915899e755295226e865998dd"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbeddedModuleLoader::resolve_inner (cyclomatic 19): EmbeddedModuleLoader::resolve_inner has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/rt/run.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae170d4526423b85a32bf322e22cf3c13312c816124f30bc20658904c3b94b6"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_export_key::export_ec (cyclomatic 19): deno_crypto::subtle_export_key::export_ec has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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. This is NOT this file\u0027s highest cyclomatic complexity: deno_crypto::subtle_export_key::rsa_jwk_alg (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7578872ec0f02b955778165217d2a7edf0d46ef000e03796f6705f88c512cc"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_sign::run (cyclomatic 19): deno_crypto::subtle_sign::run 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":"ext/crypto/subtle_sign.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"785b361c80c668f51b2e41fbc90deee3b17cc50d7559df6b3e1a3650706b7634"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_napi::js_native_api::napi_get_typedarray_info (cyclomatic 19): deno_napi::js_native_api::napi_get_typedarray_info 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":"ext/napi/js_native_api.rs"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f89c7ce4bbc2410e9958490f67c3ff1d1c89b57dc2ea7f8304f83350952865"}},{"ruleId":"D1","level":"warning","message":{"text":"ZlibInner::do_write (cyclomatic 19): ZlibInner::do_write 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. This is NOT this file\u0027s highest cyclomatic complexity: deno_node::ops::zlib::encoder_param (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c27ee08338f22e93568796a29d9f5ea14f0811386716d5021f471f4846f57df"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::http2::session::on_frame_recv_callback (cyclomatic 19): deno_node::ops::http2::session::on_frame_recv_callback 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":"ext/node/ops/http2/session.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a707eb5507fdc0295581e3aad269c74442986e3d628d3181f317e234512804"}},{"ruleId":"D1","level":"warning","message":{"text":"Cipher::encrypt (cyclomatic 19): Cipher::encrypt has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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. This shape REPEATS in the file: one other method here (Decipher::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":"ext/node_crypto/cipher.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"383dc20d80ba33c3e0e9a085962504b1ae3ca491b295f5f46dbeacd625116a40"}},{"ruleId":"D1","level":"warning","message":{"text":"Decipher::decrypt (cyclomatic 19): Decipher::decrypt has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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. This shape REPEATS in the file: one other method here (Cipher::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":"ext/node_crypto/cipher.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2471104cffe3a97dc14b3ba68b3cd746b9c002ec694b916ceb1f8fd088346dd"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::css::parse_css_color (cyclomatic 19): deno_web::console::css::parse_css_color 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":"ext/web/console/css.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8355690f0f99396bd458acc7755c54d64278fa3af3e8f3bc3aae657752cb99bd"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::format_value (cyclomatic 19): deno_web::console::inspect::format_value 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":"ext/web/console/inspect.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"820a4b5f5b7d20b71da16aa940fd1fe921b6a28d02f6a6fc0b10aff62f066b29"}},{"ruleId":"D1","level":"warning","message":{"text":"Workspace::diagnostics::check_member_diagnostics (cyclomatic 19): Workspace::diagnostics::check_member_diagnostics 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. This shape REPEATS in the file: one other method here (Workspace::diagnostics::check_all_configs) 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":"libs/config/workspace/mod.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0009dbf144a6382b8c6b305c21bdb1610ffef886ce7fd0c2f6bde87e2f06a103"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::modules::map::wasm::render_js_wasm_module (cyclomatic 19): deno_core::modules::map::wasm::render_js_wasm_module has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs 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":"libs/core/modules/map/wasm.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7a68d4d2d60523b4d675d8d55dbbc6f43197757d6ec09fadc9f6af572b5b7d"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::stream::write_pipe (cyclomatic 19): deno_core::uv_compat::stream::write_pipe 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":"libs/core/uv_compat/stream.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c4d10963bcf75db7867d501d496afaedcb8414a4707d2545d7d521d9630377"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::parse (cyclomatic 19): Args::parse has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"libs/dcore/src/main.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"033581a5d27d6ece84b94e6c85c84d53d77c7a239f18767acbab6c41bc2ad41a"}},{"ruleId":"D1","level":"warning","message":{"text":"EszipV2::from_graph::visit_module (cyclomatic 19): EszipV2::from_graph::visit_module has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v2.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2a49323adbbeacafc5d914f251747caad0df49756be1d46c6f4bd68c3fc02d"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedConn::poll_read_body_chunk_limited_inner (cyclomatic 19): SharedConn::poll_read_body_chunk_limited_inner 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":"libs/http_h1/conn.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c46bc5bd283372e2ea739c415b0871ce21d5cb0d3ed976538543a3ad235539"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_inspector_server::server (cyclomatic 19): deno_inspector_server::server has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"libs/inspector_server/lib.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85be3e903b72ca20d1b033f65a57b09d01e72d9656591145dfb62b6075b4d81"}},{"ruleId":"D1","level":"warning","message":{"text":"SerializedNpmResolutionSnapshot::dedup_equivalent_peer_variants (cyclomatic 19): SerializedNpmResolutionSnapshot::dedup_equivalent_peer_variants 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":"libs/npm/resolution/snapshot.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaaefa4b6a3e8bf932b91a5322134e5b88d2e4d40ebf16af8d90ff9224027f8"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_resolver::yarn_lockfile_import::yarn_lock_to_deno_lock_v5 (cyclomatic 19): deno_resolver::yarn_lockfile_import::yarn_lock_to_deno_lock_v5 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":"libs/resolver/yarn_lockfile_import.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3406a9514ee16bf823a2f22cef58f010f6e320a6eb542f3344725ddc31bb6d71"}},{"ruleId":"D1","level":"warning","message":{"text":"TtyPrompter::prompt (cyclomatic 19): TtyPrompter::prompt 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":"runtime/permissions/prompter.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"257f59eb1497f1e0b8e737873d706737681b56a223bc0a30df1ef0352a3e4ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_proxy.parseProxyUrl (cyclomatic 19): _http_proxy.parseProxyUrl 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":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b572269d0642dbce631d0445a216720dd4fb47bd525cfc65558b8de74017fd86"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_proxy.parseNoProxy (cyclomatic 19): _http_proxy.parseNoProxy 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":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a131f0507599c932efa89e9a84f45884a2dc09ac17a18df77c68d904f7b9d79"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_proxy.shouldBypassProxy (cyclomatic 19): _http_proxy.shouldBypassProxy 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":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ee3dda3610af81b4b781f6ea7e6493fbc4c77d0381b846ba2558c560576c1b"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_server.ServerResponse.writeHead (cyclomatic 19): _http_server.ServerResponse.writeHead 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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e892d410be162a698951e334c53b8ecd8d4aafac1dfccfafc562cfcee6840458"}},{"ruleId":"D1","level":"warning","message":{"text":"https.Agent.createConnection (cyclomatic 19): https.Agent.createConnection has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/https.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"085506088353ba6f455c5c16db0f1effb804ced40ebf649d90d54256c44e4f08"}},{"ruleId":"D1","level":"warning","message":{"text":"EventTarget.[kHybridDispatch] (cyclomatic 19): EventTarget.[kHybridDispatch] has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs 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":"ext/node/polyfills/internal/event_target.mjs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"956ed5123ef65087991dac78e36db9da2f42e2e440aade0cef352bf00d9224d2"}},{"ruleId":"D1","level":"warning","message":{"text":"stream_base_commons.onStreamRead (cyclomatic 19): stream_base_commons.onStreamRead 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":"ext/node/polyfills/internal/stream_base_commons.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0a38d867b40f34aff3b3b7a430be07c1dc6194999ba391f5fd2a6bb50ddb26"}},{"ruleId":"D1","level":"warning","message":{"text":"duplexify._duplexify (cyclomatic 19): duplexify._duplexify has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 380, onfinished, a function literal at line 396, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/duplexify.js"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0a8252e216e876ab324da61a2c1717f62774b255cde04ad4bfb017f44e34b3"}},{"ruleId":"D1","level":"warning","message":{"text":"comparisons.innerDeepEqual (cyclomatic 19): comparisons.innerDeepEqual has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"62af697445cce2c0e661691a7b57face7500b1ee9db4b84d14063f0ecc6ebc6f"}},{"ruleId":"D1","level":"warning","message":{"text":"adapters.newWritableStreamFromStreamWritable (cyclomatic 19): adapters.newWritableStreamFromStreamWritable has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0fc2e163f6db17cbd34d7365d146c28f0e93b03fa65107248583793d4f4d6f"}},{"ruleId":"D1","level":"warning","message":{"text":"_wrapHandle (cyclomatic 19): _wrapHandle 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ccad3a96198d063a15247da489fd2ddf82b494762687f2c603f5b4de145d58"}},{"ruleId":"D1","level":"warning","message":{"text":"onConnectSecure (cyclomatic 19): onConnectSecure 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed66b2b1e384f85de33cb83d56163000bfe1103c1c43f87606d83a150f37de6"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 19): (computed) has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs 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":"ext/node/polyfills/internal/event_target.mjs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e14a9e9f8680c94c8001d8588685374c62e664d94c186011f978b34881b8f0"}},{"ruleId":"D1","level":"warning","message":{"text":"get (cyclomatic 19): get has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd747e2570d418f4704cc99b5ce8bd63ae4a165418ea2133dca2aabde4c2a761"}},{"ruleId":"D1","level":"warning","message":{"text":"newStreamDuplexFromReadableWritablePair (cyclomatic 19): newStreamDuplexFromReadableWritablePair has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 23 function items inside it that branch (write, destroy, writev, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d536bb930af1a6b01a97650b7669347f22c34b007a16d4439a0128de0b154d"}},{"ruleId":"D1","level":"warning","message":{"text":"#release (cyclomatic 19): #release 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":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45e83fd1ac2c89dde701d43130883f847954293223a5317c614453fd268f872"}},{"ruleId":"D1","level":"warning","message":{"text":"DenoTestStepCollector::visit_var_decl (cyclomatic 18): DenoTestStepCollector::visit_var_decl 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":"cli/lsp/code_lens.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"daabc242202ae3b792936b17601ac6728c2c31f289ad8cae0a65fccccfe03405"}},{"ruleId":"D1","level":"warning","message":{"text":"TestStepCollector::visit_var_decl (cyclomatic 18): TestStepCollector::visit_var_decl 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":"cli/lsp/testing/collectors.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"4155a50c0c5990be5a0f624a43cc0f7afa40e97d1e9accc960873c0824115e02"}},{"ruleId":"D1","level":"warning","message":{"text":"DepManager::run_dependency_resolution (cyclomatic 18): DepManager::run_dependency_resolution 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":"cli/tools/pm/deps.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea2f2e2b7fb527d71aa2036debdb820c97047998528f6aa01da84b2008cff59"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::standalone::native_addons::collect_bundle_required_packages (cyclomatic 18): deno::standalone::native_addons::collect_bundle_required_packages 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":"cli/standalone/native_addons.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a020b43613d82439f5cabb5313e380c387a6dda5f9676b53574b58d42164283f"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::installer::global::rewrite_relative_import_map_paths (cyclomatic 18): deno::tools::installer::global::rewrite_relative_import_map_paths has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (rewrite_specifier_map, rewrite_to_absolute, rewrite_string_key). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/installer/global.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"2180995be97f2734d13311fc7a9fba1aa01a81dd7e95358b374ffdc52acb5c2f"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::repl::editor::highlight_line (cyclomatic 18): deno::tools::repl::editor::highlight_line has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/tools/repl/editor.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"186add39127544887f5f6ff32f8f51219b67bc6229c5dda413e256a9352c6e51"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopHmrRunner::handle_change (cyclomatic 18): DesktopHmrRunner::handle_change 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":"cli/rt/hmr.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"129f5426656b6d884b95c8956c60726ccffeec28f8cbd0d12f4b3d96a0f2b7e3"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_export_key::jwk_alg_for_symmetric (cyclomatic 18): deno_crypto::subtle_export_key::jwk_alg_for_symmetric has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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. This is NOT this file\u0027s highest cyclomatic complexity: deno_crypto::subtle_export_key::rsa_jwk_alg (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"501eb2f9b396e329990a01692c50d95ca4f895213118b0a0bfac498fec30e8b9"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_export_key::export_okp (cyclomatic 18): deno_crypto::subtle_export_key::export_okp has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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. This is NOT this file\u0027s highest cyclomatic complexity: deno_crypto::subtle_export_key::rsa_jwk_alg (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a0648b099459678cbef4b5af3acb5da9dc02c216f1559e2956269cc90e5984"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_verify::run (cyclomatic 18): deno_crypto::subtle_verify::run 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":"ext/crypto/subtle_verify.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"20674b6d5c183877c8739d7dfd6b706744c2984375766a4b2458a1149ab5c0ac"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_ffi::turbocall::compile_trampoline (cyclomatic 18): deno_ffi::turbocall::compile_trampoline 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. This shape REPEATS in the file: one other method here (deno_ffi::turbocall::compile_trampoline::convert) 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":"ext/ffi/turbocall.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c529274f37999e8e047daf311f7d991e6d0e63df116ee268ef5a0142da6f28d8"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_http::handle_error_otel (cyclomatic 18): deno_http::handle_error_otel has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"ext/http/lib.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"6295164511e0e746708cffd58f6e628af207047bd86d64d6066ddcae1221f03f"}},{"ruleId":"D1","level":"warning","message":{"text":"Http2Settings::init (cyclomatic 18): Http2Settings::init 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":"ext/node/ops/http2/session.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68ba3a15bdf9bbe5cf4ce3b1182c2fa9cacbed77e7ca192959b9beeb4eab542"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSWrapInner::dispatch_clear_out_callbacks (cyclomatic 18): TLSWrapInner::dispatch_clear_out_callbacks 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. This is NOT this file\u0027s highest cyclomatic complexity: deno_node::ops::tls_wrap::rustls_error_to_node_error (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3bf769fa03504bcf96d25f68c36fb6cb1223e0a548da799fe1a3ddaf184f02"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextifyScript::eval_machine (cyclomatic 18): ContextifyScript::eval_machine 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":"ext/node/ops/vm.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb1c272ffca516a6f4269cfdcb2c0cb835887800afb7828123235631629012c"}},{"ruleId":"D1","level":"warning","message":{"text":"WasiContext::fd_write (cyclomatic 18): WasiContext::fd_write 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":"ext/node/ops/wasi.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f99bce07208961b7494f0e28cc645a4b2dc8a6013726ddec4b29c11e8618fa"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseSync::deserialize (cyclomatic 18): DatabaseSync::deserialize 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":"ext/node_sqlite/database.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f328e2dcb0cbad1357964c5a0a2040b5d6a430130be3ee778bdbe1d7962e58"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::get_user_options (cyclomatic 18): deno_web::console::inspect::get_user_options 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":"ext/web/console/inspect.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"197ccf418bcb7d8c87bde1c0588fc21d65f86e2d3dd28f86a0315d64e1d7a4b8"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::get_keys (cyclomatic 18): deno_web::console::inspect::get_keys 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":"ext/web/console/inspect.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"76df7be7e71b0942dc987fa7855866e4b01e8b70f45a23bd7f0dae9e620a49ea"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::reduce_to_single_string (cyclomatic 18): deno_web::console::inspect::reduce_to_single_string 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":"ext/web/console/inspect.rs"},"region":{"startLine":3742}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84cbd7f2b5c4aa604cadbc765d3020bfeef1274e7c6df1675b9ed1423a1b3aa"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::css_stylesheet::split_top_level_rules (cyclomatic 18): deno_web::css_stylesheet::split_top_level_rules 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":"ext/web/css_stylesheet.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"950fe370b6d7ccdae60c8b4677725ecbf8280685698d875c3c1971b5075061a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Flags::otel_config (cyclomatic 18): Flags::otel_config has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/args/flags.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f14d06ec097f0e6b315d3f4f82cc4533babe9a6bb7ba1eae49d97acf8560617"}},{"ruleId":"D1","level":"warning","message":{"text":"JsRuntime::new_inner (cyclomatic 18): JsRuntime::new_inner 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":"libs/core/runtime/jsruntime.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36a048474a996279c420071fca181c8992eb03a615aa6f31bd73a4a1aa91531"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeActivityStats::diff (cyclomatic 18): RuntimeActivityStats::diff 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":"libs/core/runtime/stats.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9418a7e574c1af7fc35c5101039956614b05342ebebee7125ee596abc5ba37"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeResolver::finalize_resolution (cyclomatic 18): NodeResolver::finalize_resolution 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":"libs/node_resolver/resolution.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f743e765fc40fc59909e15f38cbf433c1e664961f0a130dc4cb4b9915d6fd700"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeResolver::path_to_declaration_path (cyclomatic 18): NodeResolver::path_to_declaration_path has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (probe_extensions). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ea7ade41a43e0a147cbeb58df3c2a7f6fd673330a8f826ecdfa06883f6c555"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDependencyResolver::drain_pending_parallel (cyclomatic 18): GraphDependencyResolver::drain_pending_parallel has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/graph.rs"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fba0d00818d79f45812601fd4759764a4f771f9e8527a0fe0df7872727f15b"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryInfoProviderInner::create_load_future (cyclomatic 18): RegistryInfoProviderInner::create_load_future has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_cache/registry_info.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c260d01e1da351be0003e0a8c47c4f9d24cae8769d87830fa40342372ab59cb"}},{"ruleId":"D1","level":"warning","message":{"text":"TarballCache::create_setup_future (cyclomatic 18): TarballCache::create_setup_future 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":"libs/npm_cache/tarball.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1888d9b7bab97aacaab65e9f22ec887a70cb33314ddc0719f2ca68a2befad9b5"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_resolver::npmrc::discover_npmrc (cyclomatic 18): deno_resolver::npmrc::discover_npmrc has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. 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":"libs/resolver/npmrc.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"704522f021c3509147e29b9501924d89ba4cd7f046e99bff970adeb790764a0a"}},{"ruleId":"D1","level":"warning","message":{"text":"40_lint.runPluginsForFile (cyclomatic 18): 40_lint.runPluginsForFile has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint.js"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9b91ea060796fdd5fdd54e3170f4dafb328dce3c9f2d16c3dab237cfb3ab5b"}},{"ruleId":"D1","level":"warning","message":{"text":"00_serve.fastSyncResponseOrStream (cyclomatic 18): 00_serve.fastSyncResponseOrStream 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":"ext/http/00_serve.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53374260e1e22d03ae9800bdfebe551d5223f0b30a764c750ec55d42849539b"}},{"ruleId":"D1","level":"warning","message":{"text":"00_serve.mapToNativeResponseCallback::finishOrReturnNative (cyclomatic 18): 00_serve.mapToNativeResponseCallback::finishOrReturnNative 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":"ext/http/00_serve.ts"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d1a7244b9ea1ca438d37e277204bd72a8ac844d381c1bbad75cdc349821298"}},{"ruleId":"D1","level":"warning","message":{"text":"00_serve.serveInner (cyclomatic 18): 00_serve.serveInner has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/00_serve.ts"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f709a418e8f13868b5340beb43bc5e9af6b2606abcfec47bae6970d0e73a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"01_require.Module.load (cyclomatic 18): 01_require.Module.load 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"5500a7c5250c91eeecf3687b53184b500855d1c0b393e47fcf129f6add5b06f7"}},{"ruleId":"D1","level":"warning","message":{"text":"_events.EventEmitter.emit (cyclomatic 18): _events.EventEmitter.emit 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2a1095920128cbd981d3fb42de2f489e65715cfb0ad064b2b164d151a1ca24"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_server.storeHTTPOptions (cyclomatic 18): _http_server.storeHTTPOptions 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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fa54b2a89dfc7cff94f528e3b50738329e32530a971a70586cedc3b483aa0a"}},{"ruleId":"D1","level":"warning","message":{"text":"_tls_wrap.connect (cyclomatic 18): _tls_wrap.connect 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"33203610c6a0f60e426ea202227724c25b4551b03509b3bb9019290f436dd189"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerHttp2Stream.respondWithFD (cyclomatic 18): ServerHttp2Stream.respondWithFD 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fed5b0990b69d255f3d5c6b3ee7afa0f0898068b548225208830df2f20c48f"}},{"ruleId":"D1","level":"warning","message":{"text":"http2.connect (cyclomatic 18): http2.connect 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":5345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e33b2544b3422886bf3a2259a7cd36b088c002e86b5565f0ca58f4be27461b7"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.findFirstNonFlagArg (cyclomatic 18): child_process.findFirstNonFlagArg has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdda51ce5e1f5f16484bbf607d7b0a3f21418be9c80a8892a5eec5fc3e0c6db"}},{"ruleId":"D1","level":"warning","message":{"text":"keys.parseKeyEncoding (cyclomatic 18): keys.parseKeyEncoding 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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a8f0c7b17211d90e3aa4c7114a1494a2c518e1f69945a702589b8e40bdfc09"}},{"ruleId":"D1","level":"warning","message":{"text":"parse_args.argsToTokens (cyclomatic 18): parse_args.argsToTokens 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":"ext/node/polyfills/internal/util/parse_args/parse_args.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0d62671630e28444416ad0d467396046075c0f95963b2ce288527dfcfd13c9"}},{"ruleId":"D1","level":"warning","message":{"text":"net._afterConnectImpl (cyclomatic 18): net._afterConnectImpl 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":"ext/node/polyfills/net.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af56e22b19bfb8ca00b7a9cbf928214bc289d35dca8513243980204bff8c287"}},{"ruleId":"D1","level":"warning","message":{"text":"_posix.relative (cyclomatic 18): _posix.relative has cyclomatic complexity 18 (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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c2be67c46068aadee0670b0c53369a719d9b17271c41158fb0545531abe388"}},{"ruleId":"D1","level":"warning","message":{"text":"_win32.extname (cyclomatic 18): _win32.extname has cyclomatic complexity 18 (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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a5c7c9b36c988642309c1a0a6cbf6902fb49a9dd73db1e25cbfa5d3575166f"}},{"ruleId":"D1","level":"warning","message":{"text":"worker_threads.moveMessagePortToContext (cyclomatic 18): worker_threads.moveMessagePortToContext has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 1796, dispatchMessageError, dispatchMessage, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"32683e49302090703961021d73b3df96321405c0d6524d3a9ef60a7c9aa751ad"}},{"ruleId":"D1","level":"warning","message":{"text":"02_event.innerInvokeEventListeners (cyclomatic 18): 02_event.innerInvokeEventListeners 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":"ext/web/02_event.js"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f0c68e1493a2a314e372ea582342510b3f255144c41a6405313f2fbf484b71"}},{"ruleId":"D1","level":"warning","message":{"text":"02_structured_clone.structuredClone (cyclomatic 18): 02_structured_clone.structuredClone has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"ext/web/02_structured_clone.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccde90c0d58e48b561314f9fd94ff096571f3fb3ce7bd9db5ee8de7390b7a38f"}},{"ruleId":"D1","level":"warning","message":{"text":"02_timers.listOnTimeout (cyclomatic 18): 02_timers.listOnTimeout 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":"libs/core/02_timers.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d873b3cf25aed985984563ec3a56075c0276efc55d9c5acc76fc08a0bd4f60f"}},{"ruleId":"D1","level":"warning","message":{"text":"stripTypeScriptTypes (cyclomatic 18): stripTypeScriptTypes 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"200268ec95a72dd8a176f92d8cc7c7967b6b5d3a809d409a79c0946c5b500e08"}},{"ruleId":"D1","level":"warning","message":{"text":"refresh (cyclomatic 18): refresh has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 26 function items inside it that branch (getNodesAndLinks, getNodesAndLinks::getNodeY, createGraph, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/tracing/app.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"884e97f2199b8b8aa7c0baf374377b7266c16804cf729afde77b03e835e13d40"}},{"ruleId":"D1","level":"warning","message":{"text":"createHttpClient (cyclomatic 18): createHttpClient 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":"ext/fetch/22_http_client.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8129caa7a4ee34bfe96ac8bfe73c5299cb328089cef10b8ab09d8f907a6c6d"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceSettings::from_raw_settings (cyclomatic 17): WorkspaceSettings::from_raw_settings has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/config.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"6046b4d7406419585a0e0af2c9b2f05f4e7d5a1bf63a257acff33f334b0f73bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler::to_path (cyclomatic 17): Compiler::to_path 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":"cli/lsp/path_to_regex.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"72648f4547307e2b70d4c7b5b8d203734f2791cd6730d88e48a39c14c3c8ebd9"}},{"ruleId":"D1","level":"warning","message":{"text":"TsServer::provide_code_actions (cyclomatic 17): TsServer::provide_code_actions 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":"cli/lsp/ts_server.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"628055f870eed128bc374054f863ee96f4e9b47058679ce5f88e3932ab420392"}},{"ruleId":"D1","level":"warning","message":{"text":"DenoCompileBinaryWriter::build_vfs_consolidating_global_npm_cache (cyclomatic 17): DenoCompileBinaryWriter::build_vfs_consolidating_global_npm_cache 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":"cli/standalone/binary.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecea3efc369aafa031bc781bd5625be40ad6eae634d140d0209e622ccf68b7e"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceLinter::lint_files (cyclomatic 17): WorkspaceLinter::lint_files has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/mod.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf34386d2e551b1f01f9e8b93185033292a0a216250b4db016e4bc7b1eb2a7c"}},{"ruleId":"D1","level":"warning","message":{"text":"DepManager::commit_changes (cyclomatic 17): DepManager::commit_changes 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":"cli/tools/pm/deps.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f2fb547f34e46747d572498d5ddc691790683811c3882dc16e40ff222a8513"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskRunner::run_tasks_in_parallel (cyclomatic 17): TaskRunner::run_tasks_in_parallel 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":"cli/tools/task.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ee95ca506358a4452e7160d09616aa00cdac587af1a0090db3237e9c82523f"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::args::flags_to_permissions_options (cyclomatic 17): deno::args::flags_to_permissions_options has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (handle_allow, handle_deny_or_ignore). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/args/mod.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f056680b333e92d7097b5a794f4f836de6f607c0471cae4da9e9c3a27eb48a"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::desktop::run_desktop_hmr (cyclomatic 17): deno::tools::desktop::run_desktop_hmr has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c65d87b1f078cb8b82c82e5b47f1c01133958dcd578406ac28feffd9e07483"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::desktop::create_windows_msi (cyclomatic 17): deno::tools::desktop::create_windows_msi has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"1410b16d7b3b0de060c66a83fa3136a20ae3956d547b04e75cda6620c3801020"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::desktop::msi_sort_tables_by_string_id (cyclomatic 17): deno::tools::desktop::msi_sort_tables_by_string_id 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":"cli/tools/desktop.rs"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95ad34e667ee6dcccd5147de5e12e90a6968d522b3372f30ea6dd7dd104a11d"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::pm::audit::npm::call_audits_api (cyclomatic 17): deno::tools::pm::audit::npm::call_audits_api has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/audit.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"772083dd0d46f9fcc3f5aaf2769f8a317c44d2a09a3433dc6c6e8a8f41c5b826"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::pm::audit::socket_dev::print_firewall_report_to (cyclomatic 17): deno::tools::pm::audit::socket_dev::print_firewall_report_to has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/tools/pm/audit.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbccbe3407cb770c41271d8a00443d5d3116c05df837ee3b3bd6820cb4b0018"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::publish::wasm::collect_import_records (cyclomatic 17): deno::tools::publish::wasm::collect_import_records 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":"cli/tools/publish/wasm.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"478224cd5f123569aa270e1829ec015a713ea88e15e364dda6ff6282b0b508a8"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::task::execute_script (cyclomatic 17): deno::tools::task::execute_script 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":"cli/tools/task.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf48afff13f877201b4654a55ba88db9fe0d6cdab924bd278f8f6c1d95cf338"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_export_key::jwk_to_object (cyclomatic 17): deno_crypto::subtle_export_key::jwk_to_object has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: deno_crypto::subtle_export_key::rsa_jwk_alg (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c37047c288c015975effc53b5b0e0b3999309f403c2c5977c47fb316817d5d4"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_ml_dsa (cyclomatic 17): deno_crypto::subtle_import_key::import_key_ml_dsa has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: deno_crypto::subtle_import_key::aes_jwk_alg (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cb9c7cb27440ad3ea12b6bf6006d8e014dda6817c6dfc09c419b8fc28088ba"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_fetch::create_http_client (cyclomatic 17): deno_fetch::create_http_client has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/lib.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"7086db818c02601c74dbf64969bf7dbf2561e481ac3219cc446721f3d486fa57"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::send_pending_data (cyclomatic 17): Session::send_pending_data 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":"ext/node/ops/http2/session.rs"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"326f93312143579d4e6cc94040c11e3834ae0060def5b0f5dd7b9afbf7f5b991"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::assert::get_first_expression (cyclomatic 17): deno_node::ops::assert::get_first_expression 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":"ext/node/ops/assert.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5dfac986ffc066e3ac07c6e5cbacdacdd43be5fe2cc664314b300cabfad470"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::ipc::impl_::serialize_v8_value (cyclomatic 17): deno_node::ops::ipc::impl_::serialize_v8_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":"ext/node/ops/ipc.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80e464652c5d7e4f461ee51f74ac86c3ab67e5dbecd2518cc230c7b4eaf5d83"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::v8::op_v8_query_objects_count (cyclomatic 17): deno_node::ops::v8::op_v8_query_objects_count has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"ext/node/ops/v8.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"781986d9edea0fa29459c864611d82e6f93387fcec66b440e9d11304f853667a"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementSync::bind_params (cyclomatic 17): StatementSync::bind_params 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":"ext/node_sqlite/statement.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46dbf9c424dc21589451b67427eda8aafd0418c13ad5de1a2d013f0fb4d1a52"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_telemetry::op_otel_metric_record3 (cyclomatic 17): deno_telemetry::op_otel_metric_record3 has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"ext/telemetry/lib.rs"},"region":{"startLine":3010}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc30f7eb825bb775c107afb0675ef0e94cdc92611996209162df1b52d9f91dd"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_cli_parser::convert::test_parse (cyclomatic 17): deno_cli_parser::convert::test_parse has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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. This is NOT this file\u0027s highest cyclomatic complexity: deno_cli_parser::convert::convert (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa2cb5b3421ce900bc2b0166f6d1496e7ddb3339c4bcffc86b2d5315e3d894c"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::runtime::bindings::upgrade_snapshotted_ops_with_fast_calls (cyclomatic 17): deno_core::runtime::bindings::upgrade_snapshotted_ops_with_fast_calls 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":"libs/core/runtime/bindings.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4c75f5a2d320dd250c295623c2d7aad31304bd3432c1d7391b8d755d9cd31a"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::uv_guess_handle (cyclomatic 17): deno_core::uv_compat::uv_guess_handle has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: deno_core::uv_compat::uv_error_message (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"1295e241f42f826aebcb2e31f9381073e8c0e9584e50b629eb500e49d1255897"}},{"ruleId":"D1","level":"warning","message":{"text":"CjsModuleExportAnalyzer::resolve (cyclomatic 17): CjsModuleExportAnalyzer::resolve 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":"libs/node_resolver/analyze.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4efe6975ebcd73025d076dd15a8cb226a6e4c2d066ab73dbcb88d31d80c1fb9"}},{"ruleId":"D1","level":"warning","message":{"text":"PackumentIndexer::on_operator (cyclomatic 17): PackumentIndexer::on_operator has cyclomatic complexity 17 (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":"libs/npm/fast_registry_json.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4963901967b985d7f85237de5f0fe399624cf0aeb58d3f64f5fdc2a728fcc09"}},{"ruleId":"D1","level":"warning","message":{"text":"NpmPackageVersionResolver::strongest_trust_evidence_before (cyclomatic 17): NpmPackageVersionResolver::strongest_trust_evidence_before 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":"libs/npm/resolution/common.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d0138e46f3d8ffe845fe10175e51970597ac6e641f94dccc1ece99494f4219"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedModuleLoader::load_prepared_module_or_defer_emit (cyclomatic 17): PreparedModuleLoader::load_prepared_module_or_defer_emit has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"libs/resolver/loader/module_loader.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b1836c2647ed3de1ee1f0bd3cc4c78de5efc5da85b8842405871b4488f1dba"}},{"ruleId":"D1","level":"warning","message":{"text":"ByonmNpmResolver::resolve_folder_in_root_node_modules (cyclomatic 17): ByonmNpmResolver::resolve_folder_in_root_node_modules 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":"libs/resolver/npm/byonm.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e94fe78a1f80d2968380d16de193e738a0d664e01519b7297d37001991c784"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_resolver::yarn_lockfile_import::parse_yarn_v1 (cyclomatic 17): deno_resolver::yarn_lockfile_import::parse_yarn_v1 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":"libs/resolver/yarn_lockfile_import.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c7840b9cc253d05978db8ac96a8e6dbb8f047980f3ec90000a813fb3a8c1a9"}},{"ruleId":"D1","level":"warning","message":{"text":"NetDescriptor::parse_inner (cyclomatic 17): NetDescriptor::parse_inner 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":"runtime/permissions/lib.rs"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abc1f645635559b55b5af578b69c574506d40b7cfc822b586bbd67018c4b18d"}},{"ruleId":"D1","level":"warning","message":{"text":"40_lint_selector.matchAttrValue (cyclomatic 17): 40_lint_selector.matchAttrValue has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint_selector.js"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c76eeb4e77e86c5ad8fdf5446e981ef7f86487a749aa0e8c140644b75391c22"}},{"ruleId":"D1","level":"warning","message":{"text":"97_ts_host.getModuleLiteralImportKind (cyclomatic 17): 97_ts_host.getModuleLiteralImportKind has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/97_ts_host.js"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"702c66c001e2f6d3e881865ec4851e026e570b3862612be09bca94daaf7657ed"}},{"ruleId":"D1","level":"warning","message":{"text":"MultipartParser.parse (cyclomatic 17): MultipartParser.parse 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":"ext/fetch/21_formdata.js"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9f41e6e7b497e12f2013c56a6f314d7a3ff72b5b7c62354a33be6484fbaca1"}},{"ruleId":"D1","level":"warning","message":{"text":"_http_client.onSocketNT (cyclomatic 17): _http_client.onSocketNT has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"979cc07ebb2f5f3c60559534c44f1d826378e99cd359c988e0060f723bfcc9eb"}},{"ruleId":"D1","level":"warning","message":{"text":"_tls_wrap.Server (cyclomatic 17): _tls_wrap.Server has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f3a69f905a91d445b25d2877fcf10c5e9b2a746a8452cda8848d4bb048d8ee"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.execFile::exithandler (cyclomatic 17): child_process.execFile::exithandler has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (child_process.execFile) 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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"291151904871be1f6de7a7b6a77aa626e937d503d94088418968c55f60a143b4"}},{"ruleId":"D1","level":"warning","message":{"text":"fs.writeFile (cyclomatic 17): fs.writeFile has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs.ts"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4657cf9bc1efb58f58b5e0f0326ab6e0a2d8962841223dd0d99b2101a57af9a"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerHttp2Stream.pushStream (cyclomatic 17): ServerHttp2Stream.pushStream has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafb17f60a6d3ede0fbe4b2c0bf035a4c486ae47390ee91c03deb0e415fbe2dc"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerHttp2Session.altsvc (cyclomatic 17): ServerHttp2Session.altsvc 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":4575}}}],"partialFingerprints":{"codehealthFindingId/v1":"250887ffe03fe57cc9bb34933716cabcf5f5523913a142e89d81d754a5f1e1b5"}},{"ruleId":"D1","level":"warning","message":{"text":"http2.closeStream (cyclomatic 17): http2.closeStream 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacfcc6446844837fe2305679cb7174a58da6f2c78f460ed376c86c0ab79fbba"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.createIpcHandle (cyclomatic 17): child_process.createIpcHandle 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8ccd13b1cb3c5bb9ecaccd74c9c27308be27c5996914c68521ae95327ff170"}},{"ruleId":"D1","level":"warning","message":{"text":"scrypt.check (cyclomatic 17): scrypt.check 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":"ext/node/polyfills/internal/crypto/scrypt.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17357716d1fdc7fe3c3ac4bd669a2076c3751d952d1a832b8d534b58165430c"}},{"ruleId":"D1","level":"warning","message":{"text":"streams.WriteStream (cyclomatic 17): streams.WriteStream has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da7d58ca35deb87dc96108423bd90875078a5c08df1ccb1bca149ea621f5a1e"}},{"ruleId":"D1","level":"warning","message":{"text":"address_override.startOverrideListener (cyclomatic 17): address_override.startOverrideListener has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 534, 552, 574, \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":"ext/node/polyfills/internal/http/address_override.js"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e63d81748905a14cb654aa04d7c158a14609793e0660068d6068e442ede9a2"}},{"ruleId":"D1","level":"warning","message":{"text":"warning.onWarning (cyclomatic 17): warning.onWarning has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/process/warning.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d7b9a4777466729fc85239e490193be7d83189fd3692f8e7b098f98c1840e6"}},{"ruleId":"D1","level":"warning","message":{"text":"destroy.errorOrDestroy (cyclomatic 17): destroy.errorOrDestroy 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":"ext/node/polyfills/internal/streams/destroy.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f37e2ffd19aa9bfc75b8b59b035596e97d8a7c731dbcad938c823466ba830c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Utf8Stream.constructor (cyclomatic 17): Utf8Stream.constructor has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9c8d7892006eb52004cdc638bdf057aee32ffa072f42687badf4db5895fe43"}},{"ruleId":"D1","level":"warning","message":{"text":"writable.WritableState (cyclomatic 17): writable.WritableState has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"57486e16e566e8844dbcbef5ec6df7690d46ecb2960687e354987351141dad50"}},{"ruleId":"D1","level":"warning","message":{"text":"writable._write (cyclomatic 17): writable._write 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb04a678846372899d12010bdf0216ff7ac3f488b28340ac86eead75d392f6f"}},{"ruleId":"D1","level":"warning","message":{"text":"comparisons.mapObjectEquiv (cyclomatic 17): comparisons.mapObjectEquiv 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"873a8af5f1cc8b71fb1c0608cb62b2a5e995d5fc0770d3a2d39923218a484013"}},{"ruleId":"D1","level":"warning","message":{"text":"WASI.constructor (cyclomatic 17): WASI.constructor has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/wasi.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccc1bbfa6aa7b4670dc1d98b61b0b3d241d1f01728268920e44fd3907a25bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"worker_threads.postMessageToThread (cyclomatic 17): worker_threads.postMessageToThread has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f31142f86fdec10f18bceee44c23a1513522c476bb2b403a60f52d01be09fe8"}},{"ruleId":"D1","level":"warning","message":{"text":"01_mimesniff.parseMimeType (cyclomatic 17): 01_mimesniff.parseMimeType has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/01_mimesniff.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"848292362dde91129416360c7098e0a720e52ef1f02659d056863566a1b94086"}},{"ruleId":"D1","level":"warning","message":{"text":"Event.composedPath (cyclomatic 17): Event.composedPath 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":"ext/web/02_event.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5328eaa17b96240ca876a8a7853ea0c59d720940e583488d792d0f19a2a187"}},{"ruleId":"D1","level":"warning","message":{"text":"PerformanceObserver.observe (cyclomatic 17): PerformanceObserver.observe 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":"ext/web/15_performance.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a5f76ebe96d8a883358eae67593486e32e201479ea8c990844f616de89d6b7"}},{"ruleId":"D1","level":"warning","message":{"text":"10_permissions.cache (cyclomatic 17): 10_permissions.cache has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/10_permissions.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54185d00aa45eb1bf3984446ed3c40b930836a5e3ae443bb0a098a2071efd2b"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 17): fetch has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 846, a function literal at line 904, a function literal at line 946, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e868ca4427b2596f725412a8844d238642adec25e44e56c1675a9528e7e0191"}},{"ruleId":"D1","level":"warning","message":{"text":"timerify (cyclomatic 17): timerify has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (timerified, a function literal at line 266). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/perf_hooks.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7aad4b844254e18cc6e1bb9539cfff44efd0413ffb7f33f615ce6d24319a83"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentModules::workspace_file_modules_by_scope (cyclomatic 16): DocumentModules::workspace_file_modules_by_scope has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: LanguageId::as_extension (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/documents.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a67e530aed6ce365226e95aabd5ef32c3b36362f364c4f497871fd4dbcac52f"}},{"ruleId":"D1","level":"warning","message":{"text":"Inner::initialize (cyclomatic 16): Inner::initialize 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":"cli/lsp/language_server.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5673c190d96fc319c60ce5cb5451096d5107828992a3964d45bfcc10890dcb"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionEntryDetails::as_completion_item (cyclomatic 16): CompletionEntryDetails::as_completion_item has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: TscRequest::into_server_request (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":3992}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82d0ee72bc759eedb8fb633e4c55369935003888ba0eb8db89d41bc5cc08aac"}},{"ruleId":"D1","level":"warning","message":{"text":"CliModuleLoader::load (cyclomatic 16): CliModuleLoader::load 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":"cli/module_loader.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3257e739cda4840930389671f6d44e3bcf3afbbdc947308a7cbb2b05957b483a"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::lsp::code_lens::find_test_fn_body (cyclomatic 16): deno::lsp::code_lens::find_test_fn_body has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/lsp/code_lens.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"654d380cecd712936f84d87387e0a68bd873206bbf9a23d618013183fc23e1d3"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::compile::get_module_roots_and_include_paths (cyclomatic 16): deno::tools::compile::get_module_roots_and_include_paths has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/compile.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec649a2c6442463866f41fbf738e0b1465b43639c4a26291404b914f4d6a1735"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::desktop::extract_laufey_archive (cyclomatic 16): deno::tools::desktop::extract_laufey_archive 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":"cli/tools/desktop.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"339594a4bc201f52094284c60a958667a66f50577a0916200c2538eebfa28fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::installer::npm_compat::generate_npm_cache_projects (cyclomatic 16): deno::tools::installer::npm_compat::generate_npm_cache_projects 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":"cli/tools/installer/npm_compat.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee8936c4e49e0e5470ff97a418dae8bb846181adce8aed8e4378f532e9c71dc"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::pm::approve_scripts::approve_scripts (cyclomatic 16): deno::tools::pm::approve_scripts::approve_scripts has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/approve_scripts.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cabe495a5fd663541c77ea21134acb9c7839e8e31ae3d9d99054617dd993da"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::pm::outdated::choose_new_version_req (cyclomatic 16): deno::tools::pm::outdated::choose_new_version_req 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":"cli/tools/pm/outdated/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9101aa1b335e8f273c752e01e76a184b71a166a1a54818e2634e04cbb7563995"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tools::publish::publish (cyclomatic 16): deno::tools::publish::publish 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":"cli/tools/publish/mod.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"78eb99431b6b526675cd693a329b0aa14fc51d0f5c7cb3e10e1c151963b849ef"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tsc::tsconfig_gen::strip_top_level_type_decls (cyclomatic 16): deno::tsc::tsconfig_gen::strip_top_level_type_decls has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"553ca73a68a5c9c4f8a4d2b6640d7e29884c954cbfe6ea68c3f49cfc063114ee"}},{"ruleId":"D1","level":"warning","message":{"text":"deno::tsc::tsconfig_gen::generate_npm_paths (cyclomatic 16): deno::tsc::tsconfig_gen::generate_npm_paths 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":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe4f66f0dc6b0738d57f9f56845fb83dbb1e3b9e2a0422db39c50cd03f49889"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopHmrRunner::run (cyclomatic 16): DesktopHmrRunner::run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/hmr.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb4e24cf2ba4eb46d4446724d7693f32473c1327b041f112dab2d68c72fee72"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbeddedModuleLoader::load (cyclomatic 16): EmbeddedModuleLoader::load has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"cli/rt/run.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c89a5c6bf7f5d3601f46a15f92455776b9dfc6817abf421d57171e82ff95811"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_http::http_next::write_h1_flat_response (cyclomatic 16): deno_http::http_next::write_h1_flat_response has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":3561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0e9b9eba2563c1e21baf5aab1f3471437c5c08522d8a54418429254bfbcf5b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_napi::js_native_api::napi_define_class (cyclomatic 16): deno_napi::js_native_api::napi_define_class has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: deno_napi::js_native_api::napi_create_typedarray (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97f473c15335664469420a3a654198739028819e6cb95759d0f3acef0a10f65"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_napi::js_native_api::napi_define_properties (cyclomatic 16): deno_napi::js_native_api::napi_define_properties has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: deno_napi::js_native_api::napi_create_typedarray (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5ca9efa864031aac240692aab4dad63fc5ff4b8712921e487d98e77e5253b6"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node::ops::vm::property_setter (cyclomatic 16): deno_node::ops::vm::property_setter 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":"ext/node/ops/vm.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ae495194492935f51a578e380a7bd02a07f9e35612d2adf4dad4ed24f0ecb8"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node_crypto::op_node_ecdh_compute_secret (cyclomatic 16): deno_node_crypto::op_node_ecdh_compute_secret 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":"ext/node_crypto/lib.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f4ac03e3ce66db10d8bcc35dcb881440716ce081e97a81eb708eca8b2b6960"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node_crypto::cipher::aes_wrap_key (cyclomatic 16): deno_node_crypto::cipher::aes_wrap_key has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Cipher::r#final (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e93dc3c7bc6c5b4f8de88372507d27b64ac76a090b8f6f70ced7a512758c0d1"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_node_crypto::keys::parse_legacy_encrypted_pem (cyclomatic 16): deno_node_crypto::keys::parse_legacy_encrypted_pem has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"ext/node_crypto/keys.rs"},"region":{"startLine":3680}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2eadaf6e9b7fd7d7e4155f7ddacf8632f8895d632e4a1e40940c5047e23886b"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_telemetry::console_exporter::format_span (cyclomatic 16): deno_telemetry::console_exporter::format_span has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/console_exporter.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"331a79f74ceb53f28e961654924cd4f5815fd244b068beb209f3ab70024399a3"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::format_primitive (cyclomatic 16): deno_web::console::inspect::format_primitive 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":"ext/web/console/inspect.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"18edd3c3d8a4de001022cb9f49b684db5be33635fb00caeb4261fa20c695de15"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_web::console::inspect::get_function_base (cyclomatic 16): deno_web::console::inspect::get_function_base 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":"ext/web/console/inspect.rs"},"region":{"startLine":2764}}}],"partialFingerprints":{"codehealthFindingId/v1":"931f7d7f93ae69e18c0508c352b9048c471b7b523a54f773d407c8f977b8f6b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Flags::config_path_args (cyclomatic 16): Flags::config_path_args has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/args/flags.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"913e73abb21dae5fa27fa4a92c05e7f543f6f5ec2eafa072d006def7e270abe8"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleMap::drain_dyn_imports (cyclomatic 16): ModuleMap::drain_dyn_imports 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/core/modules/map/dynamic.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d79b4b8df273189ad2e149b3a8eff88baf3e1e039f87e463ecfbb082241131"}},{"ruleId":"D1","level":"warning","message":{"text":"RecursiveModuleLoad::register_and_recurse_inner (cyclomatic 16): RecursiveModuleLoad::register_and_recurse_inner 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/core/modules/recursive_load.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0000d0eeb2faaf8ff0210e82f67436e270c69341befb9d5dfbd08d49924343"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::error::format_frame (cyclomatic 16): deno_core::error::format_frame 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/core/error.rs"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44c41229c329570b69f73b8051b7e45707e2849e362c6e75ee6bc8d644ceeb8"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::extension_set::into_sources_and_source_maps (cyclomatic 16): deno_core::extension_set::into_sources_and_source_maps 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/core/extension_set.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e988e00bb5c3e1685b9d126815bef8e190952e1d3db81ef3114123e3495c9b42"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::stream::uv_try_writev (cyclomatic 16): deno_core::uv_compat::stream::uv_try_writev 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/core/uv_compat/stream.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4e0259c3db78b7a145c38a54ff9c1f67dfe737de2130a40cc59f8f794c85b6"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_core::uv_compat::tty::uv_tty_set_mode (cyclomatic 16): deno_core::uv_compat::tty::uv_tty_set_mode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: deno_core::uv_compat::tty::get_vt100_fn_key (cyclomatic 137) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be940ca7c66ece2229ce25930cb531d0b1c5130974026e8358c05656152982f"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_ops::op2::dispatch_async::generate_dispatch_async (cyclomatic 16): deno_ops::op2::dispatch_async::generate_dispatch_async 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":"libs/ops/op2/dispatch_async.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4de2a24d198993b777e22bd11c67bcbc6fd01836067d31c9904c970e1fff1f"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_ops::op2::dispatch_slow::generate_dispatch_slow (cyclomatic 16): deno_ops::op2::dispatch_slow::generate_dispatch_slow 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":"libs/ops/op2/dispatch_slow.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e92ca7d55f5ef0eb238d8a045287ea2483bc3537f2aae492dd649660690bb0d"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_resolver::graph::get_import_prefix_missing_error (cyclomatic 16): deno_resolver::graph::get_import_prefix_missing_error 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/resolver/graph.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1865939e5499facc2fcf8dc573f8320b3af4238e54292dd64a55bbac6ec059"}},{"ruleId":"D1","level":"warning","message":{"text":"deno_subprocess_windows::process::append_bat_arg (cyclomatic 16): deno_subprocess_windows::process::append_bat_arg has cyclomatic complexity 16 (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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e07878a655b6f33e1d75fcded47ec01396ddb8262b8892ed0668b20b4d5e269"}},{"ruleId":"D1","level":"warning","message":{"text":"40_lint_selector.getFromRawValue (cyclomatic 16): 40_lint_selector.getFromRawValue has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: 40_lint_selector.compileSelector (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint_selector.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bce2a8dd40343e7d75e3627867bd0896e289b841a84ddef7ede9edff19ceb5d"}},{"ruleId":"D1","level":"warning","message":{"text":"01_cron.cron (cyclomatic 16): 01_cron.cron has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 165). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cron/01_cron.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"84561a761c8f8f254c6512ea3b6133d575e769984f4dc13da0c079f1f587c8f7"}},{"ruleId":"D1","level":"warning","message":{"text":"01_require.parseMappings (cyclomatic 16): 01_require.parseMappings 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"03850779d87182d5b5df43852ac35c49ca5228ad5092e1b89b0b712d64fe066e"}},{"ruleId":"D1","level":"warning","message":{"text":"_events.EventEmitter.removeListener (cyclomatic 16): _events.EventEmitter.removeListener 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d92c5305eb676c8768b2ff8d311ff496a277e222d6cc0b38adc158da149b32a"}},{"ruleId":"D1","level":"warning","message":{"text":"_tls_common.getProtocolRange (cyclomatic 16): _tls_common.getProtocolRange 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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2dcc6f569cee1f8c8c5bda1e9e73be327b5ec2d46bf804d00df96a6d108c8e"}},{"ruleId":"D1","level":"warning","message":{"text":"_tls_wrap.checkServerIdentity (cyclomatic 16): _tls_wrap.checkServerIdentity has cyclomatic complexity 16 (threshold 15). 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, 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d8839c88ccb9f0ef0f14f2d51af21db12d34f3e97aa7dd7cdf5c9d893c6893"}},{"ruleId":"D1","level":"warning","message":{"text":"http2.closeSession (cyclomatic 16): http2.closeSession has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":3819}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadea20a07542b1c584f88d4e609dfa6d4a04c7b207e7c36fc964096739b4733"}},{"ruleId":"D1","level":"warning","message":{"text":"buffer.bidirectionalIndexOf (cyclomatic 16): buffer.bidirectionalIndexOf 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"2951db70075e046955d80534ca4869b5be9b2ebbcdba05341abd440825aaf8f1"}},{"ruleId":"D1","level":"warning","message":{"text":"buffer.Buffer.hexSlice (cyclomatic 16): buffer.Buffer.hexSlice 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2fa5fe560d403efe8c293588fea6b629a9998a640dd2f82b8e82594af5c29d"}},{"ruleId":"D1","level":"warning","message":{"text":"ChildProcess.kill (cyclomatic 16): ChildProcess.kill 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5589b037b9be9d1946f5bfe6ce1b97fe45b6596ee3ea3b652c6fe36b15cd28f"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.normalizeStdioOption (cyclomatic 16): child_process.normalizeStdioOption has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"e446fa87173ad75749f16d2011d99fa17ca6defde44d42c8bef845d3fc0fb314"}},{"ruleId":"D1","level":"warning","message":{"text":"child_process.setupChannel::readLoop (cyclomatic 16): child_process.setupChannel::readLoop 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bd969d4e940acea760f3a897c4ecef11456064e8a2b256971a0a18bb684b59"}},{"ruleId":"D1","level":"warning","message":{"text":"cipher.Decipheriv (cyclomatic 16): cipher.Decipheriv has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"690b0db8600ae556d43f8364ff494e33242cda73f4b5ed753d9e44eeeaa1e9a5"}},{"ruleId":"D1","level":"warning","message":{"text":"hash.Hash (cyclomatic 16): hash.Hash 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":"ext/node/polyfills/internal/crypto/hash.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ae1add3841236616fedb1a0e84e7c17004977771a71636a6f99da48554ddc0"}},{"ruleId":"D1","level":"warning","message":{"text":"random.validateRandomPrimeJob (cyclomatic 16): random.validateRandomPrimeJob 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":"ext/node/polyfills/internal/crypto/random.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0878d7213f6e4ddaf1d6da49336caeacc9e664721ac836b95d9fd555c5db3e"}},{"ruleId":"D1","level":"warning","message":{"text":"MIMEParams.#parse (cyclomatic 16): MIMEParams.#parse 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":"ext/node/polyfills/internal/mime.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60883497fe12d8f86772a3d258bd41a96600c2db5e3078688bcbe9b08cc08f5"}},{"ruleId":"D1","level":"warning","message":{"text":"stream_base_commons.writevGeneric (cyclomatic 16): stream_base_commons.writevGeneric has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/stream_base_commons.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f35063025215da8a087238bbdcaa0dde67e554bc68e5fb939b91afaf16c1ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Utf8Stream.#openFile (cyclomatic 16): Utf8Stream.#openFile has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (fileOpened, a function literal at line 452, a function literal at line 505). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d9af77027a612cd6f1de2f843076dbfa07d86d9f485a794ffc3cf7fa1683e6"}},{"ruleId":"D1","level":"warning","message":{"text":"ChannelWrap.#resolve (cyclomatic 16): ChannelWrap.#resolve has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ChannelWrap.queryAny (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1cd394dd060469c054bf0135102dc36995ad7de1ebf7d1235129287f64a1a0"}},{"ruleId":"D1","level":"warning","message":{"text":"net._setupListenHandle (cyclomatic 16): net._setupListenHandle 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":"ext/node/polyfills/net.ts"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8dba9638b0f33cec0f1e3b4962c3682d4d9ec1d610901b45d36f188a223f63"}},{"ruleId":"D1","level":"warning","message":{"text":"repl.isRecoverableError (cyclomatic 16): repl.isRecoverableError 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"5059c0e83c891a32d97191197df0e3e8830f781bb25ab5a52e12c3b173a9c24a"}},{"ruleId":"D1","level":"warning","message":{"text":"MockTimers.enable (cyclomatic 16): MockTimers.enable 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":2644}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b026e192a4b19080294d22f88447bd5e55703c9ee19cff18fc14246227d9b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"timers.setIntervalAsync (cyclomatic 16): timers.setIntervalAsync has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/timers.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbdb5f769869b5b58e6a9470fb6474f5be7418843501f5aa5e9508c866aa4f1"}},{"ruleId":"D1","level":"warning","message":{"text":"url.formatWhatwg (cyclomatic 16): url.formatWhatwg 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":"ext/node/polyfills/url.ts"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13577f53e25d709d2faddb90f4ca59a4e2650b876755d382cd6bf6495493a22"}},{"ruleId":"D1","level":"warning","message":{"text":"url.pathToFileURL (cyclomatic 16): url.pathToFileURL 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":"ext/node/polyfills/url.ts"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c13a2e120c04089da2143d8f2a35c9a34d56a3e83b312408b437d1b344e3b2f"}},{"ruleId":"D1","level":"warning","message":{"text":"zlib.processCallback (cyclomatic 16): zlib.processCallback has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/zlib.js"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65424eb19bad85d32dbd9e1e18bbc8febdf4e4e6b06a11c2a7de57ad2e7da7a"}},{"ruleId":"D1","level":"warning","message":{"text":"06_streams.readableStreamDefaultTee (cyclomatic 16): 06_streams.readableStreamDefaultTee has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (chunkStepsMicrotask, a function literal at line 3887, pullAlgorithm, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":3727}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4cb249529c86422ff8b242cdf5b9fd704405288bd49482a30ed277026e52f1"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocket.[_eventLoop] (cyclomatic 16): WebSocket.[_eventLoop] 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":"ext/websocket/01_websocket.js"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d76aa3a67d65bc4b7bde05aceda1a6e7bbaad3a07b6567ad98b1455c2b273b4"}},{"ruleId":"D1","level":"warning","message":{"text":"flamegraph.search (cyclomatic 16): flamegraph.search 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":"runtime/cpu_profiler/flamegraph.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0d3c27230a4fbc89aa7732acff9d3547fd1996d4cd3246456d8f53b0df635c"}},{"ruleId":"D1","level":"warning","message":{"text":"writableStreamForRid (cyclomatic 16): writableStreamForRid has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 7 function items inside it that branch (write, tryClose, flushBuffer, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"65907bbbab67716dd19b686d9a8370b9ab95c3212c34fc506d11250ee3cce03d"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 16): (computed) 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":"ext/websocket/01_websocket.js"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde4148241fe922f00e29c374df8811feba99acf1e2c9f74ff8a6feac6455dc5"}},{"ruleId":"D1","level":"warning","message":{"text":"newReadableStreamFromStreamReadable (cyclomatic 16): newReadableStreamFromStreamReadable has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 8 function items inside it that branch (evaluateStrategyOrFallback, onData, a function literal at line 578, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9f79a6d40b12b78c5df78349a3b3eb4be3edead1d3ca6e0e03b510e5e6072a"}},{"ruleId":"D2","level":"warning","message":{"text":"Glob.#iterateSubpatterns (cognitive 275): Glob.#iterateSubpatterns has cognitive complexity 275 (threshold 15). Drivers by points: if/else 53 (177 pts), ternaries 8 (54 pts), boolean chains 37, loops 3 (7 pts) (nesting depth added 174). 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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"44731e62e931566f8a4b5f0ad01acfd614c7aa7091bcb3da5ffae317cecc2824"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::pipe::poll_pipe_handle (cognitive 208): deno_core::uv_compat::pipe::poll_pipe_handle has cognitive complexity 208 (threshold 15). Drivers by points: if/else 69 (168 pts), match/switch 7 (21 pts), boolean chains 12, loops 4 (7 pts) (nesting depth added 116). 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/core/uv_compat/pipe.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db5a1779f7b024a8d22d77a998d0fda3ce6819f55820746cba5764d595ee183"}},{"ruleId":"D2","level":"warning","message":{"text":"OptionsParser::parse (cognitive 205): OptionsParser::parse has cognitive complexity 205 (threshold 15). Drivers by points: if/else 59 (159 pts), loops 7 (34 pts), boolean chains 9, match/switch 1 (3 pts) (nesting depth added 129). 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/node_shim/lib.rs"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a437e3f78025a02da55b74c0059646462dc36ee5ba74809c48728449f3ff439"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalNpmPackageInstaller::sync_resolution_with_fs (cognitive 188): LocalNpmPackageInstaller::sync_resolution_with_fs has cognitive complexity 188 (threshold 15). Drivers by points: if/else 53 (128 pts), loops 19 (25 pts), match/switch 8 (18 pts), boolean chains 17 (nesting depth added 91). To reduce it, split the body into named stages: move each independent 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/npm_installer/local.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8bb23d2db8e4872209921f48f0767444b69325ea96e401d14ee6d3eadae527"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http::http_next::serve_http11_raw (cognitive 184): deno_http::http_next::serve_http11_raw has cognitive complexity 184 (threshold 15). Drivers by points: if/else 42 (139 pts), match/switch 9 (29 pts), boolean chains 15, loops 1 (nesting depth added 117). 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":"ext/http/http_next.rs"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"937ad7d46784c02d1b1ff49e7946650735b09edbc62a5d149ef7ed187f35c115"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleRegistry::get_completions (cognitive 170): ModuleRegistry::get_completions has cognitive complexity 170 (threshold 15). Drivers by points: if/else 31 (132 pts), loops 4 (16 pts), match/switch 4 (15 pts), boolean chains 7 (nesting depth added 124). To reduce it, split the body into named stages: move each independent 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":"cli/lsp/registries.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f107370b6ead2f95b3a7f841928e66b2b342f6e2a95d4b273a9f775fed498"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::format_raw (cognitive 170): deno_web::console::inspect::format_raw has cognitive complexity 170 (threshold 15). Drivers by points: if/else 76 (136 pts), boolean chains 21, match/switch 7 (12 pts), loops 1 (nesting depth added 65). To reduce it, split the body into named stages: move each independent 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":"ext/web/console/inspect.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96b7a5980b53f8998016f4224ed4b56cecdcfd23c842c68523ae4b01647e1a4"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::tty::poll_tty_handle (cognitive 167): deno_core::uv_compat::tty::poll_tty_handle has cognitive complexity 167 (threshold 15). Drivers by points: if/else 39 (122 pts), match/switch 4 (24 pts), boolean chains 11, loops 3 (10 pts) (nesting depth added 110). 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/core/uv_compat/tty.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffddde4bff942f106fc6c38644f59debd8b0c95deaec73a26755d14ed8860387"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::tcp::poll_tcp_handle (cognitive 161): deno_core::uv_compat::tcp::poll_tcp_handle has cognitive complexity 161 (threshold 15). Drivers by points: if/else 41 (100 pts), loops 10 (31 pts), match/switch 5 (18 pts), boolean chains 12 (nesting depth added 93). 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/core/uv_compat/tcp.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae38b6c00f5298adab40df67191d27d73d022db90264031dde0125a097480e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Url.resolveObject (cognitive 152): Url.resolveObject has cognitive complexity 152 (threshold 15). Drivers by points: if/else 48 (85 pts), boolean chains 53, loops 6 (12 pts), ternaries 1 (2 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent 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":"ext/node/polyfills/url.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a7b4451fc7c2baf445bf6eacfd8c5720df31eddf97bba4e20f8313ed011216"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::coverage::generate_coverage_report (cognitive 146): deno::tools::coverage::generate_coverage_report has cognitive complexity 146 (threshold 15). Drivers by points: if/else 38 (102 pts), loops 12 (28 pts), boolean chains 16 (nesting depth added 80). To reduce it, split the body into named stages: move each independent 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":"cli/tools/coverage/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2910fa769fa454f506100f354db9d9bbcb0557353f3526ac6c9883398fa9e87b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::pipe::poll_pipe_handle (cognitive 146): deno_core::uv_compat::pipe::poll_pipe_handle has cognitive complexity 146 (threshold 15). Drivers by points: if/else 49 (112 pts), match/switch 6 (19 pts), boolean chains 14, loops 1 (nesting depth added 76). 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/core/uv_compat/pipe.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c67b4463c72a3a6e044889049d578f66dba4a33c5ff2537ec0ba77ddc724bfc"}},{"ruleId":"D2","level":"warning","message":{"text":"Glob.#addSubpatterns (cognitive 143): Glob.#addSubpatterns has cognitive complexity 143 (threshold 15). Drivers by points: if/else 39 (101 pts), boolean chains 35, loops 3 (7 pts) (nesting depth added 66). 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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71656b2358e7ca015daa2b179bbe0fb86018a25338e0d23b6d786a3e420b221"}},{"ruleId":"D2","level":"warning","message":{"text":"Url.urlParse (cognitive 141): Url.urlParse has cognitive complexity 141 (threshold 15). Drivers by points: if/else 56 (107 pts), boolean chains 21, match/switch 2 (6 pts), loops 3 (4 pts), ternaries 2 (3 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent 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":"ext/node/polyfills/url.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"14300cbfe8f0723bce67028c97916222909d0a9a1ea937a3cf8de58516e19ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"JsRuntimeInspectorState::poll_sessions (cognitive 137): JsRuntimeInspectorState::poll_sessions has cognitive complexity 137 (threshold 15). Drivers by points: if/else 23 (101 pts), match/switch 6 (18 pts), loops 5 (15 pts), boolean chains 3 (nesting depth added 100). 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/core/inspector.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"44856d4e58f9f5c9a4774bf572fa80c30111dbf715f45e3bb39eda407c31206e"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDependencyResolver::resolve_peers_of_node (cognitive 129): GraphDependencyResolver::resolve_peers_of_node has cognitive complexity 129 (threshold 15). Drivers by points: if/else 33 (78 pts), loops 17 (38 pts), boolean chains 7, match/switch 2 (6 pts) (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":"libs/npm/resolution/graph.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea84c8a1bfe229df55c27ac93750817bd38a355bb7112ad6d732a27cef994b5"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmInstallDepsProvider::from_workspace (cognitive 129): NpmInstallDepsProvider::from_workspace has cognitive complexity 129 (threshold 15). Drivers by points: if/else 28 (100 pts), match/switch 3 (14 pts), loops 4 (9 pts), boolean chains 6 (nesting depth added 88). 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/npm_installer/package_json.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc1c0721d3982463b2d12f7493ef2a7f80723c9b968b7146b01fa03dff47d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientRequest (cognitive 129): ClientRequest has cognitive complexity 129 (threshold 15). Drivers by points: if/else 56 (83 pts), boolean chains 27, ternaries 4 (11 pts), error handling 2 (5 pts), loops 1 (3 pts) (nesting depth added 39). Of this number, 125 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_client.js"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"03845d985833d69c4bbca85225208b26a5079afaf05c098b866263c156718e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Lockfile::set_workspace_config (cognitive 127): Lockfile::set_workspace_config has cognitive complexity 127 (threshold 15). Drivers by points: if/else 28 (92 pts), loops 10 (25 pts), boolean chains 5, match/switch 1 (5 pts) (nesting depth added 83). Of this number, 125 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/lockfile/lib.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"88681e60c3784bdccaece9a540c646514e1c6376a8978509ae072fbc90f8cee1"}},{"ruleId":"D2","level":"warning","message":{"text":"JsError::inner_from_v8_exception (cognitive 124): JsError::inner_from_v8_exception has cognitive complexity 124 (threshold 15). Drivers by points: if/else 31 (87 pts), match/switch 5 (16 pts), loops 4 (13 pts), boolean chains 8 (nesting depth added 76). 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/core/error.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fee40bf3b0cae6dec0727672153833a95c9e4d56157899fbdaac745c4eb219"}},{"ruleId":"D2","level":"warning","message":{"text":"parse (cognitive 124): parse has cognitive complexity 124 (threshold 15). Drivers by points: if/else 37 (116 pts), ternaries 4 (5 pts), boolean chains 2, loops 1 (nesting depth added 80). 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":"ext/node/polyfills/querystring.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5423256fd02b48a3ce24abfefc46c508c626076b0f6c1fbf5fa11309d343baba"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::error_fmt::format_error (cognitive 121): deno_web::console::error_fmt::format_error has cognitive complexity 121 (threshold 15). Drivers by points: if/else 40 (95 pts), match/switch 7 (13 pts), boolean chains 7, loops 2 (6 pts) (nesting depth added 65). 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":"ext/web/console/error_fmt.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff29bf6b8f2a8d3d3acbd724d6aae363debb64e05e15e6e3ba8d5397338bf8c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::parse::parse_args (cognitive 120): deno_cli_parser::parse::parse_args has cognitive complexity 120 (threshold 15). Drivers by points: if/else 30 (78 pts), loops 9 (22 pts), boolean chains 12, match/switch 2 (8 pts) (nesting depth added 67). 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/cli_parser/src/parse.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f14e4132af199ad044399728edc50ee935297807103b0279d3362c3e764c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"benchMeasure (cognitive 119): benchMeasure has cognitive complexity 119 (threshold 15). Drivers by points: if/else 28 (86 pts), loops 8 (24 pts), boolean chains 6, ternaries 3 (nesting depth added 74). To reduce it, split the body into named stages: move each independent 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":"cli/js/40_bench.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"244a4c2161231b76b179571d4b135fdac05be989de189d21105ed1dd5afab5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoCompileBinaryWriter::write_standalone_binary (cognitive 115): DenoCompileBinaryWriter::write_standalone_binary has cognitive complexity 115 (threshold 15). Drivers by points: if/else 34 (69 pts), match/switch 14 (31 pts), loops 11 (13 pts), boolean chains 2 (nesting depth added 54). To reduce it, split the body into named stages: move each independent 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":"cli/standalone/binary.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec997533599ff6ef67acf63f9f5bfa27d3108c6ea1fcb4c07da2dce381bf03e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::fmt_editorconfig::glob_to_regex_depth (cognitive 113): deno::tools::fmt_editorconfig::glob_to_regex_depth has cognitive complexity 113 (threshold 15). Drivers by points: if/else 18 (61 pts), loops 8 (33 pts), match/switch 3 (11 pts), boolean chains 8 (nesting depth added 76). 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":"cli/tools/fmt_editorconfig.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"3344a074f7356ec204f4af3a65baf8d8ca2680fecbcba7c34a3a0fb5b9fcf236"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::add_prototype_properties (cognitive 113): deno_web::console::inspect::add_prototype_properties has cognitive complexity 113 (threshold 15). Drivers by points: if/else 30 (101 pts), loops 4 (9 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 77). 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":"ext/web/console/inspect.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e15b1986c90cf26013a8876ed15f4b2cdeb885a31b6c4cff3334440399bab4d"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_incoming.matchKnownFields (cognitive 113): _http_incoming.matchKnownFields has cognitive complexity 113 (threshold 15). Drivers by points: if/else 38 (75 pts), boolean chains 37, match/switch 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent 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":"ext/node/polyfills/_http_incoming.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b835ab54738c6c0c812ad5760bc6be40bc97380fb381f18e788db63ca0002c8"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.pipelineImpl (cognitive 113): pipeline.pipelineImpl has cognitive complexity 113 (threshold 15). Drivers by points: if/else 44 (91 pts), boolean chains 18, loops 2, ternaries 1 (2 pts) (nesting depth added 48). Of this number, 90 points are the body\u0027s own statements and 23 belong to 3 function items inside it that branch. 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":"ext/node/polyfills/internal/streams/pipeline.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37cf696ec6c7189d7d9e4c91d8ff5a8e8c524a3ca54ec9ea84b04a9ded48e49"}},{"ruleId":"D2","level":"warning","message":{"text":"_win32.resolve (cognitive 108): _win32.resolve has cognitive complexity 108 (threshold 15). Drivers by points: if/else 27 (72 pts), boolean chains 19, loops 4 (16 pts), ternaries 1 (nesting depth added 57). 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0423cbb766f56313b1c5f0ccc64c3a78ef3851a5f0cad36fb81392920d457369"}},{"ruleId":"D2","level":"warning","message":{"text":"ChildProcess.#spawnInternal (cognitive 106): ChildProcess.#spawnInternal has cognitive complexity 106 (threshold 15). Drivers by points: if/else 45 (81 pts), boolean chains 13, ternaries 5, loops 3 (4 pts), error handling 2 (3 pts) (nesting depth added 38). Of this number, 88 points are the body\u0027s own statements and 18 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"259ba668cbd398cb32ce7a3b5a0dffba44bfff1b2c286843c81f2ec3ced5933c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::cache_deps::cache_top_level_deps (cognitive 105): deno::tools::pm::cache_deps::cache_top_level_deps has cognitive complexity 105 (threshold 15). Drivers by points: if/else 27 (86 pts), loops 4 (12 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 69). To reduce it, split the body into named stages: move each independent 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":"cli/tools/pm/cache_deps.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1294b9592464353e134b1795c9b571a6e34f0a8f52bbc651d8e630fe2ed92db"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDependencyResolver::run_dedup_pass (cognitive 105): GraphDependencyResolver::run_dedup_pass has cognitive complexity 105 (threshold 15). Drivers by points: if/else 28 (71 pts), loops 18 (30 pts), boolean chains 4 (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":"libs/npm/resolution/graph.rs"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"97549d5d897bde6bb09395ba903a037d8bbfb9f323e680b1239b3c9652b2e058"}},{"ruleId":"D2","level":"warning","message":{"text":"comparisons.objectComparisonStart (cognitive 105): comparisons.objectComparisonStart has cognitive complexity 105 (threshold 15). Drivers by points: if/else 45 (72 pts), boolean chains 29, ternaries 2 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d736580fa91e55c1d78e78fbae4facbc130d5bf070756b730400e3ec9fabc3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_dotenv::parse_env_content_hook_impl (cognitive 104): deno_dotenv::parse_env_content_hook_impl has cognitive complexity 104 (threshold 15). Drivers by points: if/else 36 (80 pts), loops 6 (14 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dotenv/lib.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"da298199b5100af99ce5dfdcbcc6aeb6f7ead06ccc0ebf377bb238f4fb390373"}},{"ruleId":"D2","level":"warning","message":{"text":"_win32.parse (cognitive 104): _win32.parse has cognitive complexity 104 (threshold 15). Drivers by points: if/else 31 (83 pts), loops 4 (16 pts), boolean chains 5 (nesting depth added 64). 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"4001aaa2e8e1c6bc89d34741c5b56e5a5f0d8156700bb580c9d199d9ee313046"}},{"ruleId":"D2","level":"warning","message":{"text":"_load (cognitive 104): _load has cognitive complexity 104 (threshold 15). Drivers by points: if/else 39 (84 pts), boolean chains 14, loops 1 (3 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 48). 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6083e46928eaf8abd86d1ff0e630658cb251b02c1016f79978e50e8c197b58"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_lockfile::transforms::transform3_to_4 (cognitive 103): deno_lockfile::transforms::transform3_to_4 has cognitive complexity 103 (threshold 15). Drivers by points: if/else 21 (77 pts), loops 8 (26 pts) (nesting depth added 74). 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/lockfile/transforms.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d69a3a985dd66cb6bfc10cf860f07fb2943d8aa1884d6a833fcb27924a93ec"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::testing::collectors::visit_call_expr (cognitive 102): deno::lsp::testing::collectors::visit_call_expr has cognitive complexity 102 (threshold 15). Drivers by points: if/else 19 (71 pts), match/switch 7 (24 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 73). To reduce it, split the body into named stages: move each independent 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":"cli/lsp/testing/collectors.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"892c7782a17d8047ae6cd047d89d4c363f40243e74e1c703dffdfad0414899b3"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeWorker.constructor (cognitive 101): NodeWorker.constructor has cognitive complexity 101 (threshold 15). Drivers by points: if/else 31 (68 pts), loops 5 (12 pts), boolean chains 10, ternaries 2 (9 pts), error handling 1 (2 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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da1017fb2493e8d0e9be0f4c9ffb334152fe5c3e50231325f5922a2e8985200"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop::compile_desktop (cognitive 99): deno::tools::desktop::compile_desktop has cognitive complexity 99 (threshold 15). Drivers by points: if/else 39 (68 pts), match/switch 9 (15 pts), boolean chains 8, loops 2 (8 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent 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":"cli/tools/desktop.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d06c5cb75846c8dce2be415d0541b44ba6d67f02f5505c9c15de51825d6049f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::apply_options (cognitive 97): deno_web::console::apply_options has cognitive complexity 97 (threshold 15). Drivers by points: if/else 25 (75 pts), loops 4 (14 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 64). To reduce it, split the body into named stages: move each independent 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":"ext/web/console/mod.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a444d4339471434038d353741a0e2ce0ce73c17f010e2b1969ae713cc930cca"}},{"ruleId":"D2","level":"warning","message":{"text":"40_lint_selector.parseSelector (cognitive 97): 40_lint_selector.parseSelector has cognitive complexity 97 (threshold 15). Drivers by points: if/else 29 (82 pts), loops 3 (7 pts), match/switch 1 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 61). 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":"cli/js/40_lint_selector.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13258165a8504447ff7f4df18be5e465829643e345b9ecb4b2ed4ec02515f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"mainFetch (cognitive 94): mainFetch has cognitive complexity 94 (threshold 15). Drivers by points: if/else 39 (60 pts), boolean chains 14, error handling 3 (8 pts), ternaries 3 (8 pts), match/switch 1 (2 pts), other 2 (nesting depth added 32). Of this number, 90 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d56232e226181dc9c37ad9649e238aa13b94225f13deaa2c7ea7f04484a398"}},{"ruleId":"D2","level":"warning","message":{"text":"keygen.createJob (cognitive 93): keygen.createJob has cognitive complexity 93 (threshold 15). Drivers by points: if/else 44 (86 pts), boolean chains 4, ternaries 1 (2 pts), match/switch 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent 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":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e63fc04bd77ac26cb575b8da4589c3aaee965b243cee05c249402b8bb7ba30"}},{"ruleId":"D2","level":"warning","message":{"text":"compose (cognitive 93): compose has cognitive complexity 93 (threshold 15). Drivers by points: if/else 29 (53 pts), error handling 5 (16 pts), boolean chains 9, ternaries 3 (8 pts), loops 3 (7 pts) (nesting depth added 44). Of this number, 34 points are the body\u0027s own statements and 59 belong to 14 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/compose.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd9fd39ac2b9da6386a58a6548bfea5b6b1f7ba51ddcef7a95a3956cf46f83c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ops::op2::signature::parse_type (cognitive 92): deno_ops::op2::signature::parse_type has cognitive complexity 92 (threshold 15). Drivers by points: if/else 18 (46 pts), match/switch 15 (44 pts), boolean chains 2 (nesting depth added 57). 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/ops/op2/signature.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"057cff6123554c6581f3cd17480440333a9805129beb02c977571b0173204012"}},{"ruleId":"D2","level":"warning","message":{"text":"_init (cognitive 91): _init has cognitive complexity 91 (threshold 15). Drivers by points: if/else 34 (74 pts), boolean chains 13, ternaries 2 (4 pts) (nesting depth added 42). Of this number, 19 points are the body\u0027s own statements and 72 belong to 11 function items inside it that branch. 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"416ac23133fa5755bf6257f090cfcb8e920ba85fa2cb0c880589a398c2f65901"}},{"ruleId":"D2","level":"warning","message":{"text":"Console::table_impl (cognitive 90): Console::table_impl has cognitive complexity 90 (threshold 15). Drivers by points: if/else 24 (41 pts), match/switch 11 (27 pts), loops 7 (15 pts), boolean chains 7 (nesting depth added 41). To reduce it, split the body into named stages: move each independent 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":"ext/web/console/mod.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f063a0500f0cae4031768f34c853ac37417d33f1f8cfac8862cfbeb96eb2c6cc"}},{"ruleId":"D2","level":"warning","message":{"text":"http2.onSessionHeaders (cognitive 88): http2.onSessionHeaders has cognitive complexity 88 (threshold 15). Drivers by points: if/else 34 (78 pts), boolean chains 6, loops 1 (4 pts) (nesting depth added 47). 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"91652cc07ca9531d1995e6d4bf2337503e8d9c8165f6bfa8252f6da1fbf83651"}},{"ruleId":"D2","level":"warning","message":{"text":"_win32.normalize (cognitive 88): _win32.normalize has cognitive complexity 88 (threshold 15). Drivers by points: if/else 24 (54 pts), boolean chains 14, loops 4 (14 pts), ternaries 4 (6 pts) (nesting depth added 42). 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27fd8dfe450e3a91e2c8a6d859fcfb04d9cd50225cacfd43c526cb26e03de85"}},{"ruleId":"D2","level":"warning","message":{"text":"_win32.dirname (cognitive 88): _win32.dirname has cognitive complexity 88 (threshold 15). Drivers by points: if/else 22 (70 pts), loops 4 (16 pts), boolean chains 2 (nesting depth added 60). 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"839c7d8cd62f327beb80829845b91400776b61021aaac3f5e43c3348af6fa557"}},{"ruleId":"D2","level":"warning","message":{"text":"JsRuntime::poll_event_loop_inner (cognitive 87): JsRuntime::poll_event_loop_inner has cognitive complexity 87 (threshold 15). Drivers by points: if/else 41 (72 pts), boolean chains 11, loops 2, match/switch 1 (2 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":"libs/core/runtime/jsruntime.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc95b7211c679ae9b9e59feed726c8d6694c612cde4ef04224fd8834fc44f43"}},{"ruleId":"D2","level":"warning","message":{"text":"_resolveFilename (cognitive 87): _resolveFilename has cognitive complexity 87 (threshold 15). Drivers by points: if/else 26 (47 pts), loops 5 (17 pts), boolean chains 11, error handling 2 (6 pts), ternaries 3 (5 pts), other 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"9757dd06e506fa92b9e5eb592cb89e30010f70d3d759ea00dfe7d1d52fd93a27"}},{"ruleId":"D2","level":"warning","message":{"text":"createRespondWith::respondWith (cognitive 87): createRespondWith::respondWith has cognitive complexity 87 (threshold 15). Drivers by points: if/else 29 (63 pts), error handling 5 (12 pts), boolean chains 7, loops 1 (3 pts), other 1, ternaries 1 (nesting depth added 43). 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":"ext/http/01_http.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c952d35ce1dc77b9297f5462a3c2c97c6e9a5cce5e34d85d28ab5c0cc0dc2f9"}},{"ruleId":"D2","level":"warning","message":{"text":"01_http.createRespondWith.respondWith (cognitive 86): 01_http.createRespondWith.respondWith has cognitive complexity 86 (threshold 15). Drivers by points: if/else 29 (63 pts), error handling 5 (12 pts), boolean chains 7, loops 1 (3 pts), ternaries 1 (nesting depth added 43). 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":"ext/http/01_http.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c857d428cb1f07e7411c0b9d4204ed3692b144942e8f0c4942c5abfdd36e677c"}},{"ruleId":"D2","level":"warning","message":{"text":"99_main.bootstrapMainRuntime (cognitive 86): 99_main.bootstrapMainRuntime has cognitive complexity 86 (threshold 15). Drivers by points: if/else 24 (60 pts), ternaries 3 (12 pts), boolean chains 7, error handling 1 (5 pts), loops 1 (2 pts) (nesting depth added 50). Of this number, 40 points are the body\u0027s own statements and 46 belong to one function literal inside it that branches. 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":"runtime/js/99_main.js"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"1728112fd9e06b9482c220496f1e54ec46da5832a4aa6dc284431c2896b8c03e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_crypto::supports_params_valid (cognitive 83): deno_crypto::subtle_crypto::supports_params_valid has cognitive complexity 83 (threshold 15). Drivers by points: if/else 21 (51 pts), boolean chains 21, match/switch 6 (11 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07a285d67256ed4efa09ef23ec94d8ae2c488cde2e61ee9220a8df964a40aa2"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::diagnostics::diagnose_resolution (cognitive 82): deno::lsp::diagnostics::diagnose_resolution has cognitive complexity 82 (threshold 15). Drivers by points: if/else 15 (58 pts), match/switch 6 (20 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 58). 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":"cli/lsp/diagnostics.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d68454d923bc5b9a7549008abe7c755f99cccadbd69356e29498537fd3910f"}},{"ruleId":"D2","level":"warning","message":{"text":"node_shim::translate_to_deno_args (cognitive 80): node_shim::translate_to_deno_args has cognitive complexity 80 (threshold 15). Drivers by points: if/else 45 (70 pts), boolean chains 7, loops 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/lib.rs"},"region":{"startLine":3470}}}],"partialFingerprints":{"codehealthFindingId/v1":"1362ba6988541c31e133ca41a76f1828693c77ce4198bce97008fd14a385134b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientHttp2Session.request (cognitive 80): ClientHttp2Session.request has cognitive complexity 80 (threshold 15). Drivers by points: if/else 36 (58 pts), loops 5 (16 pts), boolean chains 5, error handling 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":4684}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f41aa151d4b8543688a78606da6cbfec79de5ac9231aca385ef309210b6b087"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::run_subcommand (cognitive 79): deno::run_subcommand has cognitive complexity 79 (threshold 15). Drivers by points: if/else 25 (59 pts), match/switch 6 (17 pts), boolean chains 3 (nesting depth added 45). 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":"cli/lib.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db1ef0fe558eac0c60fd997fbc7c9182ae2376ec961bdf07c267c4c106dd281"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 79): constructor has cognitive complexity 79 (threshold 15). Drivers by points: if/else 25 (52 pts), boolean chains 17, loops 2 (6 pts), ternaries 1 (4 pts) (nesting depth added 34). 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":"ext/node/polyfills/internal/assert/assertion_error.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6a38d6ee0944cfee02c2079b45e724f401bd40c7388204e7b1665aa1a8f714"}},{"ruleId":"D2","level":"warning","message":{"text":"string_decoder.decode (cognitive 78): string_decoder.decode has cognitive complexity 78 (threshold 15). Drivers by points: if/else 25 (65 pts), loops 2 (8 pts), boolean chains 5 (nesting depth added 46). 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":"ext/node/polyfills/string_decoder.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e3cccff9551cc9b159cd19b9769bef502f1484a977be20c8f321f5c659e9aa"}},{"ruleId":"D2","level":"warning","message":{"text":"FileReader.#readOperation (cognitive 78): FileReader.#readOperation has cognitive complexity 78 (threshold 15). Drivers by points: if/else 18 (55 pts), error handling 3 (14 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 52). Most of this is not in the body itself: 1 of the 78 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 165, 111, 244, \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":"ext/web/10_filereader.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c51db53c6a2ca7b4d27065d60a98d552e512d14d0d0593067dd0d0faf234cf"}},{"ruleId":"D2","level":"warning","message":{"text":"emitKeys (cognitive 77): emitKeys has cognitive complexity 77 (threshold 15). Drivers by points: if/else 25 (55 pts), boolean chains 12, ternaries 2 (6 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 36). 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":"ext/node/polyfills/internal/readline/utils.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"806ffd60e64a4a0860b38ad38c8afe7ae3331815628c34d0d25a99640a68273b"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceResolver::resolve (cognitive 76): WorkspaceResolver::resolve has cognitive complexity 76 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 4 (10 pts), match/switch 4 (10 pts), boolean chains 7 (nesting depth added 40). 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/resolver/workspace.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfa59b962d72c5ede8c7862a013a6b4338f662832a6c32dc016316645ebe395"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 75): constructor has cognitive complexity 75 (threshold 15). Drivers by points: if/else 31 (50 pts), error handling 4 (8 pts), boolean chains 7, loops 2 (6 pts), other 3, ternaries 1 (nesting depth added 27). Of this number, 58 points are the body\u0027s own statements and 17 belong to 5 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":"ext/websocket/01_websocket.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc84506eaac9f4b0a3c3a12b6e8a614fb61f5f29c264cf825fc607285474e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_process::create_command (cognitive 74): deno_process::create_command has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (51 pts), match/switch 7 (12 pts), loops 4 (6 pts), boolean chains 5 (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":"ext/process/lib.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3b814482cfd76880dfde69b12503a882084d48801a4c869844de9c138420cf"}},{"ruleId":"D2","level":"warning","message":{"text":"HoistedNpmPackageInstaller::sync_resolution_with_fs (cognitive 74): HoistedNpmPackageInstaller::sync_resolution_with_fs has cognitive complexity 74 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 12 (15 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 34). To reduce it, split the body into named stages: move each independent 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/npm_installer/hoisted.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bcd9eeece272bc87580ee0b3252a2f334d47972d8f24aff51d23ea20c45601"}},{"ruleId":"D2","level":"warning","message":{"text":"eos (cognitive 74): eos has cognitive complexity 74 (threshold 15). Drivers by points: if/else 36 (42 pts), boolean chains 30, other 2 (nesting depth added 6). Of this number, 46 points are the body\u0027s own statements and 28 belong to 11 function items inside it that branch. 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":"ext/node/polyfills/internal/streams/end-of-stream.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b19f0ea16f80d74c4851385741c4edcdfbae7fd1337c997f298836cc5dcd26f"}},{"ruleId":"D2","level":"warning","message":{"text":"TsResponseImportMapper::check_specifier (cognitive 73): TsResponseImportMapper::check_specifier has cognitive complexity 73 (threshold 15). Drivers by points: if/else 26 (61 pts), boolean chains 6, loops 2 (5 pts), match/switch 1 (nesting depth added 38). Of this number, 72 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"cli/lsp/analysis.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9bce910c52350ff38ef69a91590eb882769d048ea2441a53181914cdfbd460"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::tls_wrap::build_server_config (cognitive 72): deno_node::ops::tls_wrap::build_server_config has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (40 pts), loops 5 (16 pts), match/switch 4 (11 pts), boolean chains 5 (nesting depth added 37). To reduce it, split the body into named stages: move each independent 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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":5397}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50e1e759b3a94c2505b2586b3872a1c940c6191ab7f95f143185651bc65b75f"}},{"ruleId":"D2","level":"warning","message":{"text":"worker_threads.internals.__initWorkerThreads (cognitive 72): worker_threads.internals.__initWorkerThreads has cognitive complexity 72 (threshold 15). Drivers by points: if/else 22 (58 pts), loops 2 (10 pts), boolean chains 3, error handling 1 (nesting depth added 44). Of this number, 64 points are the body\u0027s own statements and 8 belong to 9 function items inside it that branch. 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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6402f7c9de4aa1ed57ea5816acc294778be1b00af77f7ed0daabd280883466"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::error_fmt::get_duplicate_error_frame_ranges (cognitive 71): deno_web::console::error_fmt::get_duplicate_error_frame_ranges has cognitive complexity 71 (threshold 15). Drivers by points: if/else 17 (52 pts), loops 6 (14 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent 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":"ext/web/console/error_fmt.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c93b5783ebb7a9087a1b706dc6dc6b2473627bc4b24cbddff38934d8d7be032"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmRc::parse (cognitive 71): NpmRc::parse has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (41 pts), match/switch 5 (23 pts), boolean chains 6, loops 1 (nesting depth added 45). 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/npmrc/lib.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5271e4999c7a54532bf0282be330dd71f880b576b947322aae50630a5782d67"}},{"ruleId":"D2","level":"warning","message":{"text":"denort_desktop::run_desktop (cognitive 70): denort_desktop::run_desktop has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (51 pts), boolean chains 7, loops 3 (6 pts), match/switch 4 (6 pts) (nesting depth added 34). 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":"cli/rt_desktop/lib.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b5b636f0bfad8948c519c4080a7e3b05f27a0f68f5a467785b9b97e2c7a350"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfiguredDepResolutions::new (cognitive 69): ConfiguredDepResolutions::new has cognitive complexity 69 (threshold 15). Drivers by points: if/else 19 (55 pts), loops 6 (13 pts), boolean chains 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent 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":"cli/lsp/resolver.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fce3bc2f22abcbff92dd4b6ca3aeeaf9000dcad9f632f00846cf6679f5fa06"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect_args_impl (cognitive 69): deno_web::console::inspect_args_impl has cognitive complexity 69 (threshold 15). Drivers by points: if/else 18 (59 pts), match/switch 1 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 46). 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":"ext/web/console/mod.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b899ddf1f19e04d1f95fd7c032bcc8880192572cef636c536ba37b846c7184a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::get_constructor_name (cognitive 69): deno_web::console::inspect::get_constructor_name has cognitive complexity 69 (threshold 15). Drivers by points: if/else 19 (59 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 43). 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":"ext/web/console/inspect.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c2b17ab50340fa64b9a0925aecdc5ddf375097ed74f8c95103dba905b91174"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::tsc::display_parts_to_string (cognitive 67): deno::lsp::tsc::display_parts_to_string has cognitive complexity 67 (threshold 15). Drivers by points: if/else 17 (58 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 44). 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":"cli/lsp/tsc.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ec3ebb2f3f2042766a88c1a71e030e85f6754e16ee04a535354cdf39a5b55d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ffi::callback::do_ffi_callback (cognitive 67): deno_ffi::callback::do_ffi_callback has cognitive complexity 67 (threshold 15). Drivers by points: if/else 41 (61 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent 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":"ext/ffi/callback.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2df9369661508af3e5b12d2c7b89ab8ada3c6ed72474bcf6877121b9ae0e18a"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyObjectHandle::verify_prehashed (cognitive 67): KeyObjectHandle::verify_prehashed has cognitive complexity 67 (threshold 15). Drivers by points: if/else 27 (60 pts), match/switch 3 (7 pts) (nesting depth added 37). 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":"ext/node_crypto/sign.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70e17cabd8b87f59deaf51afd0eac2961b960589dafbafff6302193a463d5a9"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_server.parserOnIncoming (cognitive 66): _http_server.parserOnIncoming has cognitive complexity 66 (threshold 15). Drivers by points: if/else 28 (41 pts), boolean chains 14, ternaries 4 (8 pts), loops 1 (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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1b8a949d1bcdc8b1dad7422e9793aa8816ddd229ae8f0d8839c76cdb50d718"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::transpile::restore_block_comment_newlines (cognitive 65): deno::tools::transpile::restore_block_comment_newlines has cognitive complexity 65 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 4 (14 pts), boolean chains 10, match/switch 2 (5 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent 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":"cli/tools/transpile.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42be05ddac52e9d9071986d1af3da8823821e263bac3bf6ff9bbf53904a3524"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::format_property (cognitive 65): deno_web::console::inspect::format_property has cognitive complexity 65 (threshold 15). Drivers by points: if/else 31 (54 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent 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":"ext/web/console/inspect.rs"},"region":{"startLine":3528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a169610630cbdf8f2bf093a2cba542f489ad58833f8d8754909609059349a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Interface.[kTtyWrite] (cognitive 65): Interface.[kTtyWrite] has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (43 pts), boolean chains 10, match/switch 4 (8 pts), loops 1 (4 pts) (nesting depth added 27). Of this number, 61 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eae43f233cc4391a1bacfd82dc64d2ccf88830ca22a94d6cc1dadc8ddabb19b"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 65): (computed) has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (43 pts), boolean chains 10, match/switch 4 (8 pts), loops 1 (4 pts) (nesting depth added 27). Of this number, 61 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"738874d6db469e6fd2fd175a21cf5770087bc52351dac85a9db919b0cc2aaf6e"}},{"ruleId":"D2","level":"warning","message":{"text":"formatWithOptionsInternal (cognitive 65): formatWithOptionsInternal has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (53 pts), match/switch 1 (5 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 39). 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":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"298332ffd02e4d49ab000275a0a7da4405022852dabd98f282dc1422df4d3ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"serverRequestInner (cognitive 65): serverRequestInner has cognitive complexity 65 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 6 (16 pts), ternaries 3 (9 pts), error handling 2 (5 pts), boolean chains 2, other 2, match/switch 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent 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":"cli/tsc/98_lsp.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee24fc0047c7431f717875141e56115447dad434281dae49835db3bb99de938"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphWalker::resolve_pending (cognitive 64): GraphWalker::resolve_pending has cognitive complexity 64 (threshold 15). Drivers by points: if/else 15 (42 pts), match/switch 3 (9 pts), loops 3 (8 pts), boolean chains 5 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/type_checker.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4a7406321f96f6088347fb174f3974158866119eb1360d1f3b73a72b334e28"}},{"ruleId":"D2","level":"warning","message":{"text":"Prime::generate_with_options (cognitive 64): Prime::generate_with_options has cognitive complexity 64 (threshold 15). Drivers by points: if/else 27 (57 pts), loops 2 (4 pts), boolean chains 3 (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":"ext/node_crypto/primes.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea2935880404f5147027b05ffa104a4763e58a5abc18884dd4ec83ab5a4c5cd"}},{"ruleId":"D2","level":"warning","message":{"text":"_win32.relative (cognitive 64): _win32.relative has cognitive complexity 64 (threshold 15). Drivers by points: if/else 26 (47 pts), loops 7 (8 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 23). 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d3277a570cabfe8127a7a307b55dd379dbd8ea45f9d021781be7748f4f9117"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionEntry::as_completion_item (cognitive 63): CompletionEntry::as_completion_item has cognitive complexity 63 (threshold 15). Drivers by points: if/else 26 (54 pts), boolean chains 5, loops 1 (3 pts), match/switch 1 (nesting depth added 30). 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":"cli/lsp/tsc.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca4600d8ba7045b3d9bb0896d4dbc05a9448460246d536e58b413e97b1a6329"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm::fast_registry_json::pluck_versions_from_tokens (cognitive 63): deno_npm::fast_registry_json::pluck_versions_from_tokens has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (52 pts), boolean chains 8, match/switch 1 (2 pts), loops 1 (nesting depth added 33). 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":"libs/npm/fast_registry_json.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b38b6572a13f206f8ebb5a44b60f88e8199f11abf21d1e80111d5e94d97bf69"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::npm_lockfile_import::package_lock_to_deno_lock_v5 (cognitive 63): deno_resolver::npm_lockfile_import::package_lock_to_deno_lock_v5 has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (42 pts), loops 7 (12 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/npm_lockfile_import.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"811d9c329c6b0c72469a7cea85249b0538e8461c601f29cafc12fca180cff558"}},{"ruleId":"D2","level":"warning","message":{"text":"util.updateSettingsBuffer (cognitive 63): util.updateSettingsBuffer has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 2 (7 pts), match/switch 1 (5 pts), boolean chains 4 (nesting depth added 38). 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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07c59afe4cff96c640716bd6780777ef4a779d4deff6b66cfb6578f1936d68a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_runtime::cpu_profiler::cpuprof::generate_markdown_report (cognitive 62): deno_runtime::cpu_profiler::cpuprof::generate_markdown_report has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (41 pts), loops 13 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 21). Of this number, 48 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/cpu_profiler/cpuprof.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"790bb2bbffaaf6dd27ed869f9255c6b4df40280f92092804e026e877cfd850cb"}},{"ruleId":"D2","level":"warning","message":{"text":"setUpAsyncStub (cognitive 62): setUpAsyncStub has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (41 pts), error handling 10 (20 pts), match/switch 1 (nesting depth added 30). Most of this is not in the body itself: 2 of the 62 points are its own statements and the rest belongs to 10 function items inside it that branch (async_op_0, async_op_1, async_op_2, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/00_infra.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b293d3b6239379b15ca7f973f5e9655c299596dc79631fb072b4c624ba5d59c"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 62): constructor has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (37 pts), error handling 4 (12 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (3 pts), other 2, ternaries 1 (2 pts) (nesting depth added 31). Most of this is not in the body itself: 10 of the 62 points are its own statements and the rest belongs to 18 function items inside it that branch ((anonymous)::pull, a function literal at line 181, a function literal at line 188, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/02_websocketstream.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea2a63892bb05034f3c39dfbe25b671eede33516e89dd04ab5692528eaead30"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::tty::tty_try_read_raw (cognitive 61): deno_core::uv_compat::tty::tty_try_read_raw has cognitive complexity 61 (threshold 15). Drivers by points: if/else 23 (47 pts), match/switch 2 (6 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"b494a453c26621b6052a9314071530fdea38be29f79971a6d7e38504a1ed5ecd"}},{"ruleId":"D2","level":"warning","message":{"text":"PackumentIndexer::on_string (cognitive 61): PackumentIndexer::on_string has cognitive complexity 61 (threshold 15). Drivers by points: if/else 28 (41 pts), boolean chains 16, match/switch 2 (4 pts) (nesting depth added 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":"libs/npm/fast_registry_json.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57331a1b86f7c771efc710e210b1887cf7a8c1cdf9fade12bcdc9e833c131fe"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_rsa (cognitive 60): deno_crypto::subtle_import_key::import_key_rsa has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (46 pts), loops 2 (6 pts), match/switch 5, boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"144eb2aa3de9be6541e66290280bbb84cd56faa73c29e3c59c6d0cec3830d8b6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_ec (cognitive 60): deno_crypto::subtle_import_key::import_key_ec has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (42 pts), match/switch 7 (9 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf00a40669b913eb2ec8697c0c0aa82affc833b9ecaaa4c868954d28071f0bd"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::tls_wrap::build_client_config (cognitive 60): deno_node::ops::tls_wrap::build_client_config has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (41 pts), match/switch 4 (8 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4895}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b180665647be32c45bfad5aeb045ec991e446c90b65b09b4f942cb17f612ad6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_subprocess_windows::process::search_path (cognitive 60): deno_subprocess_windows::process::search_path has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 10, loops 4 (10 pts) (nesting depth added 30). 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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"10214a6462cdb9bede2d3332afb998a1f52d484ced1dad9b76429b1ad39a0d36"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch (cognitive 60): dispatch has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (36 pts), boolean chains 13, loops 4 (8 pts), ternaries 1 (2 pts), other 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent 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":"ext/web/02_event.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d1f3c6cd1f387e589615a586900026e2cc465ee9016375bda78933b2130ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"Cipher::new (cognitive 59): Cipher::new has cognitive complexity 59 (threshold 15). Drivers by points: if/else 29 (54 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Decipher::new) 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":"ext/node_crypto/cipher.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce14d5dd9622fae19cdc7d5f36c7947299b7358ff6178468f4fb1b3897c8d883"}},{"ruleId":"D2","level":"warning","message":{"text":"Decipher::new (cognitive 59): Decipher::new has cognitive complexity 59 (threshold 15). Drivers by points: if/else 29 (54 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Cipher::new) 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":"ext/node_crypto/cipher.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c908e313da3fe127c1b8f84b806b513fbb770d3618888e8d7abaaa95681cdb3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Workspace::split_cli_args_by_deno_json_folder (cognitive 59): Workspace::split_cli_args_by_deno_json_folder has cognitive complexity 59 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 6 (15 pts), match/switch 2 (7 pts), boolean chains 5 (nesting depth added 37). To reduce it, split the body into named stages: move each independent 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/config/workspace/mod.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5641eb3d145b0d20ea7a511ceeec2ec36b8036e430ae3a5cb2b352359dca39"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::pnpm_lockfile_import::pnpm_lock_to_deno_lock_v5 (cognitive 59): deno_resolver::pnpm_lockfile_import::pnpm_lock_to_deno_lock_v5 has cognitive complexity 59 (threshold 15). Drivers by points: if/else 20 (45 pts), loops 7 (13 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/pnpm_lockfile_import.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c4b45393f3ee6b63de481095ef0b5036d56c3e428cfda804c55b63fb85dca1"}},{"ruleId":"D2","level":"warning","message":{"text":"jupyter_kernel.startJupyterKernel::checkIsComplete (cognitive 59): jupyter_kernel.startJupyterKernel::checkIsComplete has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 4 (10 pts), boolean chains 7 (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. This shape REPEATS in the file: one other method here (jupyter_kernel.startJupyterKernel::handleExecute) 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":"cli/js/jupyter_kernel.js"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d59ffff6ebee5114b166d01be3a823a03fd69c8f444a025bfa8dd02d2f9899"}},{"ruleId":"D2","level":"warning","message":{"text":"_win32.basename (cognitive 59): _win32.basename has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (52 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 33). 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5267ae3fe8ba1210337951ad7340e6eb67d1f27c1fdfd56f12f335639834f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 59): constructor has cognitive complexity 59 (threshold 15). Drivers by points: if/else 32 (41 pts), boolean chains 11, other 4, error handling 1 (3 pts) (nesting depth added 11). 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":"ext/fetch/23_request.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"36edbffbf780ec95852c69b4d8cb8c0c6274cf3b5387aa5950c7a7d6369786fc"}},{"ruleId":"D2","level":"warning","message":{"text":"TestServer::new (cognitive 58): TestServer::new has cognitive complexity 58 (threshold 15). Drivers by points: if/else 11 (40 pts), loops 4 (8 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/testing/server.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e04bf1eb9ed88ccbf841e6adc15812e61857acbb80aade4da7bb248a122f57"}},{"ruleId":"D2","level":"warning","message":{"text":"assert.expectedException (cognitive 58): assert.expectedException has cognitive complexity 58 (threshold 15). Drivers by points: if/else 22 (47 pts), boolean chains 4, ternaries 1 (4 pts), loops 1 (3 pts) (nesting depth added 30). 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":"ext/node/polyfills/assert.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdec04c130463458da33a4f1fa062ac9793d5210be9c037a82fa5cb24a53871"}},{"ruleId":"D2","level":"warning","message":{"text":"REPLServer._handleError (cognitive 58): REPLServer._handleError has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 2 (8 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 32). Of this number, 55 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf7cfb45f1731ebe1950fa7230be151c80a4ff07fee5d75a269d7f7abde2060"}},{"ruleId":"D2","level":"warning","message":{"text":"06_streams.readableByteStreamTee (cognitive 58): 06_streams.readableByteStreamTee has cognitive complexity 58 (threshold 15). Drivers by points: if/else 36 (40 pts), ternaries 8, boolean chains 6, error handling 2 (4 pts) (nesting depth added 6). Of this number, 23 points are the body\u0027s own statements and 35 belong to 10 function items inside it that branch. 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":"ext/web/06_streams.js"},"region":{"startLine":3913}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59945a79f684a7ef8bd66b20cade83bd33a97bcc38455112752458f6bd024b3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_wrap_key::jwk_to_utf8 (cognitive 57): deno_crypto::subtle_wrap_key::jwk_to_utf8 has cognitive complexity 57 (threshold 15). Drivers by points: if/else 37 (55 pts), loops 1 (2 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":"ext/crypto/subtle_wrap_key.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dab737112aa7642ccc2ade732520a01814c782db9cdc42a6e0efb8bfe2ba4a"}},{"ruleId":"D2","level":"warning","message":{"text":"EszipV2::parse_with_version (cognitive 57): EszipV2::parse_with_version has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (30 pts), match/switch 7 (16 pts), loops 6 (9 pts), boolean chains 2 (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":"libs/eszip/v2.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd40077c1a0debdf282625d8cd6e7436475ac175ad55292088e58256719085d"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::code_action (cognitive 56): Inner::code_action has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (42 pts), match/switch 3 (8 pts), boolean chains 5, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent 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":"cli/lsp/language_server.rs"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab795bb61a0595c891e4d7f3cf7d85f8e5230b0b1c72147358c9961b3a8e010b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tsc::tsconfig_gen::generate_jsr_paths (cognitive 56): deno::tsc::tsconfig_gen::generate_jsr_paths has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (42 pts), loops 2 (7 pts), match/switch 2 (7 pts) (nesting depth added 40). 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":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"6273f67e1aef4a934fb59236799d8f4083765844850b0915015653a6abe61d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_config::workspace::discovery::discover_workspace_config_files_for_single_dir (cognitive 56): deno_config::workspace::discovery::discover_workspace_config_files_for_single_dir has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (44 pts), match/switch 5 (8 pts), boolean chains 3, loops 1 (nesting depth added 26). Of this number, 55 points are the body\u0027s own statements and 1 belongs 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":"libs/config/workspace/discovery.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3bb4651c46177a618a2446d0db8c7ce2f6477986f657b27e8041397ef20bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::inspector::pump_inspector_session_messages (cognitive 56): deno_core::inspector::pump_inspector_session_messages has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (44 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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/core/inspector.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e2821d37fa31e1ab543b35595afcc44c4538079d9c00f79a999abee8269337"}},{"ruleId":"D2","level":"warning","message":{"text":"SerializedNpmResolutionSnapshot::dedup_equivalent_peer_variants (cognitive 56): SerializedNpmResolutionSnapshot::dedup_equivalent_peer_variants has cognitive complexity 56 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 10 (26 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/snapshot.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f52d723b39f8b71759f13469f2c8a18571418b9f59860adfaae0f2db860ae09"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_subprocess_windows::process::uv__kill (cognitive 56): deno_subprocess_windows::process::uv__kill has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 4 (14 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 31). 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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63c04940c755634cf20a896e93c61268a2b58735b8c74aa5c4a6a602b95d3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::walk_workspace (cognitive 55): Inner::walk_workspace has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 6 (9 pts), boolean chains 4, match/switch 1 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b247edc1613f4e1386f9a4a2b92d868a97ebc47819f37d098b386bdf5fd23b"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize_encoding.slowCases (cognitive 55): normalize_encoding.slowCases has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (46 pts), boolean chains 8, match/switch 1 (nesting depth added 23). 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":"ext/node/polyfills/internal/normalize_encoding.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d819418524615507841683be90abdbd416d12c4e7112b126a95f803cd204aaae"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::path_to_regex::lexer (cognitive 54): deno::lsp::path_to_regex::lexer has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (40 pts), loops 3 (7 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent 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":"cli/lsp/path_to_regex.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3d7d759e10224da3504370b91a05ec24d21e3beab52b7d15f4711645d7673b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::fmt::get_typescript_config_builder (cognitive 54): deno::tools::fmt::get_typescript_config_builder has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 14 (28 pts), if/else 23 (25 pts), boolean chains 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/fmt.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b7a3f18dfd3311f77513e7f3db39299c50124d9dedce7a9dc822eb7222efd6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tsc::tsconfig_gen::generate_npm_paths (cognitive 54): deno::tsc::tsconfig_gen::generate_npm_paths has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (41 pts), loops 2 (6 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent 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":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6d8e4ce8c32848768c59e4c567f0163a928ebb9c3fbad98b9707686bd229d6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http::http_next::write_h1_stream_response_shared (cognitive 54): deno_http::http_next::write_h1_stream_response_shared has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (40 pts), match/switch 4 (9 pts), boolean chains 4, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent 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":"ext/http/http_next.rs"},"region":{"startLine":4338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5f3e9caa8ad88fa53abcf09acf405b1e2b2ef87f7d25deb9b326ae342dc747"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementSync::bind_params (cognitive 54): StatementSync::bind_params has cognitive complexity 54 (threshold 15). Drivers by points: if/else 10 (40 pts), loops 4 (12 pts), boolean chains 2 (nesting depth added 38). 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":"ext/node_sqlite/statement.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c52fd5e4c8cc3ff1ac3ae1e732657a0a3d6376e3bd4dd2a6ab46205b209141c"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageJson::load_from_value (cognitive 54): PackageJson::load_from_value has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (33 pts), loops 5 (10 pts), match/switch 8 (10 pts), boolean chains 1 (nesting depth added 20). Of this number, 41 points are the body\u0027s own statements and 13 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/package_json/lib.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c904b21c9b4c64b6522470f99b71bb21ac67974304a233cf4b7fcd86c472c688"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::path_to_regex::tokens_to_regex (cognitive 53): deno::lsp::path_to_regex::tokens_to_regex has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (41 pts), match/switch 3 (9 pts), boolean chains 2, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/path_to_regex.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edada0111d29be76e294d836531572701479cf39484ca10e4e2267723646533"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::coverage::merge::merge_range_tree_children (cognitive 53): deno::tools::coverage::merge::merge_range_tree_children has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 9 (20 pts), match/switch 1 (2 pts) (nesting depth added 29). 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":"cli/tools/coverage/merge.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a257c0cf32eb710d9d4cad823de115c0e3e554e7fb0493f68e7635b942ad3a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::add (cognitive 53): deno::tools::pm::add has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (36 pts), match/switch 5 (11 pts), boolean chains 3, loops 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b90a1e8aa24b3e8c18afae3257476fa3d5e4085f2ff5a926768731b09ea325"}},{"ruleId":"D2","level":"warning","message":{"text":"LockfileContent::from_json (cognitive 53): LockfileContent::from_json has cognitive complexity 53 (threshold 15). Drivers by points: loops 10 (23 pts), if/else 10 (22 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 27). Of this number, 45 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/lockfile/lib.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9351e50fa4a473b507ced1b973ce3d5a45e4a4b42dc90325b5d3ff0b095fd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"40_lint.runPluginsForFile (cognitive 53): 40_lint.runPluginsForFile has cognitive complexity 53 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 6 (12 pts), error handling 2 (9 pts), ternaries 3 (7 pts) (nesting depth added 35). Of this number, 42 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint.js"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce5e9ad7a26a984a981e37c6a84321f05586e4fe101fa42ff3df514768a9ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"_posix.basename (cognitive 53): _posix.basename has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (46 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 30). 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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"91155ae6be1661d88cde46386237658053b4df0d8e7099fcee2b6d7223108ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"from (cognitive 53): from has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (35 pts), error handling 4 (7 pts), boolean chains 6, loops 3, ternaries 1 (2 pts) (nesting depth added 16). Most of this is not in the body itself: 5 of the 53 points are its own statements and the rest belongs to 10 function items inside it that branch (nextSyncWithSyncValues, nextSyncWithAsyncValues, nextAsync, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/from.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"88855c4574524798f0481c326be8c72d5f29b5e1d2151400e6c2eddacd58caef"}},{"ruleId":"D2","level":"warning","message":{"text":"DepManager::commit_changes (cognitive 52): DepManager::commit_changes has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (40 pts), match/switch 3 (9 pts), loops 2, boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent 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":"cli/tools/pm/deps.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c763f943f7d22d6da190d425d9ddba332aff040b66826010707918c0b00c4a8"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::width::ansi_sequence_len (cognitive 52): deno_web::console::width::ansi_sequence_len has cognitive complexity 52 (threshold 15). Drivers by points: loops 10 (20 pts), boolean chains 17, if/else 10 (15 pts) (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":"ext/web/console/width.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"20250410c614c526b2fc29826faf722b1192a69479714d32fffa914718400bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.normalizeSpawnArguments (cognitive 52): child_process.normalizeSpawnArguments has cognitive complexity 52 (threshold 15). Drivers by points: if/else 33 (45 pts), boolean chains 4, loops 3 (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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea18dc699675c7fff39515614f8df56225fa5e02b44b076c2cd8c969ee71738"}},{"ruleId":"D2","level":"warning","message":{"text":"update_node_stream.transform (cognitive 52): update_node_stream.transform has cognitive complexity 52 (threshold 15). Drivers by points: if/else 26 (35 pts), boolean chains 12, ternaries 2 (4 pts), loops 1 (nesting depth added 11). Most of this is not in the body itself: 4 of the 52 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 158, a function literal at line 292, a function literal at line 418, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/update_node_stream.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05f4cc9aee1a62d8e4699c87c49657f62bc0dcce7a6f3ad5a725cba78913f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedModuleLoader::load_default (cognitive 51): EmbeddedModuleLoader::load_default has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 10 (28 pts), if/else 13 (22 pts), boolean chains 1 (nesting depth added 27). 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":"cli/rt/run.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f8c90af2126f7985bb81107bc0c5e842530a1d0017348ecb66c081bc345aed"}},{"ruleId":"D2","level":"warning","message":{"text":"WasiContext::fd_read (cognitive 51): WasiContext::fd_read has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (35 pts), match/switch 4 (10 pts), loops 3 (6 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":"ext/node/ops/wasi.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10f2d48a1054af845d678a10b213d67c6924e09a725eeca6bbd1a8ad0580401"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::reduce_to_single_string (cognitive 51): deno_web::console::inspect::reduce_to_single_string has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (48 pts), boolean chains 3 (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":"ext/web/console/inspect.rs"},"region":{"startLine":3742}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a6862ac9da71ee1d9d7889d8226b2b258016cdec1b550505e6baa71b58274d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::convert::validate_permission_args (cognitive 51): deno_cli_parser::convert::validate_permission_args has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 7 (14 pts), boolean chains 6 (nesting depth added 23). Of this number, 45 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80b9762706b898151b126f75875dcbbe9eb1683e07534dc5b43d9d9aaaefe67"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_config::workspace::discovery::resolve_workspace_for_config_folder (cognitive 51): deno_config::workspace::discovery::resolve_workspace_for_config_folder has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4 (14 pts), loops 6 (12 pts), boolean chains 5 (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":"libs/config/workspace/discovery.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"68584553b9c16a21e28294d6abf3331932be997440a92ca20067492e016e05d2"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_runtime::fmt_errors::format_js_error_inner (cognitive 51): deno_runtime::fmt_errors::format_js_error_inner has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 4 (11 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/fmt_errors.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0cfe8f9ec24e27b3450fec9d42983b22b28e122b2359fd0d7cbbbbc48fe35e"}},{"ruleId":"D2","level":"warning","message":{"text":"TestStepCollector::visit_var_decl (cognitive 50): TestStepCollector::visit_var_decl has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (34 pts), match/switch 2 (8 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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":"cli/lsp/testing/collectors.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2e295f0cd6d821a13d10e3af3b41d6d28a91818d8050796e4d018fc1521ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"denort::run::run_with_options (cognitive 50): denort::run::run_with_options has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (36 pts), match/switch 7 (10 pts), loops 2 (3 pts), boolean chains 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":"cli/rt/run.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e800f3299b88e075144a4e8d77d50b154cc4419f6b7752459b833f28182c6af"}},{"ruleId":"D2","level":"warning","message":{"text":"LibUvStreamWrap::writev (cognitive 50): LibUvStreamWrap::writev has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (44 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a31f8bc7dde7f3b1c57261f978bc5d3e9ad1a949810724ddf002ace874010c0"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::tty::uv_tty_init (cognitive 50): deno_core::uv_compat::tty::uv_tty_init has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (39 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent 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/core/uv_compat/tty.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"629d5fa09691537bb74c414005c4b8d89b0337fc8c561612747d4642c58c3661"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_lockfile::transforms::transform4_to_5 (cognitive 50): deno_lockfile::transforms::transform4_to_5 has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 4 (12 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/lockfile/transforms.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"27199c1d2a1ce12d70a940cc18b71757ae17d72f557055df0aaf256869f84554"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 50): constructor has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 4 (11 pts), boolean chains 8 (nesting depth added 26). To reduce it, split the body into named stages: move each independent 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":"ext/web/00_url.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c416e4c00b4f122c8ce97b73768c578603b5f96867d6bf2aa7e6744da287d0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler::to_path (cognitive 49): Compiler::to_path has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (34 pts), loops 2 (6 pts), match/switch 2 (5 pts), boolean chains 4 (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":"cli/lsp/path_to_regex.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"86951d5eafaf7e73523e2576bc322285d5dba483e6dd721d25f133cfb62bc71e"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCollector::visit_var_decl (cognitive 49): TestCollector::visit_var_decl has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (38 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent 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":"cli/lsp/testing/collectors.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7dcbf4133b64f0a760c7199413f494f8aea3a6628fec8122e8e306b57170d7"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::compile::compile_inner (cognitive 49): deno::tools::compile::compile_inner has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (38 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/compile.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b428c8cc1a7f8d5e9cfcb7a3ce6882311e4dabd8cdf14935861a2aa829a2fb70"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::url::parse_simple_special_url (cognitive 49): deno_web::url::parse_simple_special_url has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 7, loops 4 (6 pts), match/switch 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent 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":"ext/web/url.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f566b791c21e32eea790186f8a10aa794a1bcbba505522baa82fd632ce7acdae"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::help::render_help (cognitive 49): deno_cli_parser::help::render_help has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 4 (8 pts), match/switch 2 (6 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":"libs/cli_parser/src/help.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b51a9ed93b6b22df5bfbe330455ba46f027f2ef93ef5ef46c254de27185ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"FilePatterns::split_by_base (cognitive 49): FilePatterns::split_by_base has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (34 pts), loops 5 (6 pts), boolean chains 5, match/switch 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":"libs/config/glob/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"584a5f6e514a5bef5aef94dcbeecde66a9d4c5593d9005436d896bcdbde6a090"}},{"ruleId":"D2","level":"warning","message":{"text":"Workspace::diagnostics::check_all_configs (cognitive 49): Workspace::diagnostics::check_all_configs has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (33 pts), loops 4 (9 pts), boolean chains 7 (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. This shape REPEATS in the file: 2 other methods here (Workspace::diagnostics, Workspace::diagnostics::check_member_diagnostics) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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":"libs/config/workspace/mod.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffd32e4f8b81ac5c25c69b8cdc9a500488b4c97e3969f223a298029fbb22c9c"}},{"ruleId":"D2","level":"warning","message":{"text":"SecureContext.constructor (cognitive 49): SecureContext.constructor has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (33 pts), ternaries 4 (8 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent 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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e52aef43a2ba1e50f353e52b81ae6861b67328459e9bedd9a5ca0db5d5252b"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.fork (cognitive 49): child_process.fork has cognitive complexity 49 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/child_process.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd39c3f6d8e1ff8baa49cd9eea51765964fd7f328cccfa9ed0452c8fa2f856f"}},{"ruleId":"D2","level":"warning","message":{"text":"sig.verifyOneShot (cognitive 49): sig.verifyOneShot has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 10, ternaries 3 (5 pts), error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0037fc8eddb308dbb5c2452363838344d7acab044d21c98b4504a08fed957f77"}},{"ruleId":"D2","level":"warning","message":{"text":"comparisons.objEquiv (cognitive 49): comparisons.objEquiv has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 3 (7 pts), boolean chains 6 (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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1ef89154246f7f7f8952ef4e26efe30ad10f910d2bd282e515c64f314a1cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"getColorDepth (cognitive 49): getColorDepth has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 7, match/switch 2 (3 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/tty.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffcfdea2db5f21f4b61a9f25b3fc64c887a85da9313480f938b5735e8dae94d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::http2::session::on_stream_read_callback (cognitive 48): deno_node::ops::http2::session::on_stream_read_callback has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (45 pts), boolean chains 3 (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":"ext/node/ops/http2/session.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"baffc0b5e23f2080ac84e1bed30261eacab52f7d4a3d53ae44371a43fffc90ab"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::tls_wrap::parse_extensions (cognitive 48): deno_node::ops::tls_wrap::parse_extensions has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4052}}}],"partialFingerprints":{"codehealthFindingId/v1":"f906754cf6a2b882423d7ab2f5d5e1596a7dd5d5b63f8bafed728e35a70e4de6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::css::parse_css (cognitive 48): deno_web::console::css::parse_css has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 4 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent 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":"ext/web/console/css.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ca2451f639ee9333735ffdd8780f8b2062219d3b623423ca8dde11c5c9b571"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_runtime::cpu_profiler::flamegraph::generate_flamegraph_svg (cognitive 48): deno_runtime::cpu_profiler::flamegraph::generate_flamegraph_svg has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 6 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 23). Of this number, 37 points are the body\u0027s own statements and 11 belong to one function item inside it that branches. 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":"runtime/cpu_profiler/flamegraph.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff23db44071986628aed681cf2ded39104e36cc9d7b05c91f643952df7012a7"}},{"ruleId":"D2","level":"warning","message":{"text":"fill (cognitive 48): fill has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 8, loops 3 (7 pts), ternaries 2 (3 pts) (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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc179584653ffc412ff8ab931bfb24233a85473d6c5e008df471ebc85ef73c10"}},{"ruleId":"D2","level":"warning","message":{"text":"table (cognitive 48): table has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 5 (12 pts), boolean chains 11, ternaries 2 (3 pts) (nesting depth added 16). Of this number, 45 points are the body\u0027s own statements and 3 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/console/constructor.mjs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c40d0cab8f57671eb545c1e1b6bea738e21461ddc3a0c447b82b5ffb9e2d89"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::interactive_picker::select_items (cognitive 47): deno::tools::pm::interactive_picker::select_items has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 3 (7 pts), match/switch 2 (5 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":"cli/tools/pm/interactive_picker.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"57215f69ebd92f3f3dafebe332fd5eff1255784d4cc31edf5ba950b21760c34c"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeResolver::resolve_package_target_string (cognitive 47): NodeResolver::resolve_package_target_string has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 4 (16 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"02befe1ad2d598ea047fe34e3e3a79f5e831dabdd82d5b98322bb23242002863"}},{"ruleId":"D2","level":"warning","message":{"text":"parseSimpleSpecialUrl (cognitive 47): parseSimpleSpecialUrl has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 11, loops 4 (5 pts) (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":"ext/web/00_url.js"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"17237c562d81e91adb181bec053545a3cc5be34d33d6dc8080edc469f313b8e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::code_action_resolve (cognitive 46): Inner::code_action_resolve has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (43 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":2451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77d565a7109077e5998af5a3b4a4d5221e5338983bf79a8e40f50d40bd1a446"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::info::add_npm_packages_to_json (cognitive 46): deno::tools::info::add_npm_packages_to_json has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 4 (9 pts), boolean chains 4 (nesting depth added 26). 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":"cli/tools/info.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d9838973e47b5ce45643cbc15e6d1ae5e3c1d4b3efedcdfbf8fb4a685c31ab"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextifyScript::eval_machine (cognitive 46): ContextifyScript::eval_machine has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (44 pts), boolean chains 2 (nesting depth added 23). 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":"ext/node/ops/vm.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"74750615918eb8524acab7ff93196d7f5acf6ec74440e180c25382282905c98e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::modules::map::wasm::render_js_wasm_module (cognitive 46): deno_core::modules::map::wasm::render_js_wasm_module has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 7 (14 pts) (nesting depth added 22). Of this number, 45 points are the body\u0027s own statements and 1 belongs 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":"libs/core/modules/map/wasm.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffd39611ee9ce7121ecebf199e27af4b56ce42515f55a467c2e4809c31e40fc"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::runtime::bindings::initialize_deno_core_ops_bindings (cognitive 46): deno_core::runtime::bindings::initialize_deno_core_ops_bindings has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 7 (17 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":"libs/core/runtime/bindings.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65965d3bfecf2ca69e61569c746918cb61e7d180ba43cb22ac2096f5c5a7d19"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDependencyResolver::drain_pending_parallel (cognitive 46): GraphDependencyResolver::drain_pending_parallel has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 5 (9 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 27). Of this number, 36 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/graph.rs"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b01fb39780038a99a7789919533614c6cc1401e8fa92f7ad2051eda174a8df"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_server.resOnFinish (cognitive 46): _http_server.resOnFinish has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 8, ternaries 2 (5 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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"988a330a9cc874a22591b2832c4aaa26d5aef6b9127417859416f3b2a33a08f8"}},{"ruleId":"D2","level":"warning","message":{"text":"_win32.join (cognitive 46): _win32.join has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 23). 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e9f8d2478e767013c6ce6b3f514de77406c831a325f57bcf8be30757fda714"}},{"ruleId":"D2","level":"warning","message":{"text":"InterfaceConstructor (cognitive 46): InterfaceConstructor has cognitive complexity 46 (threshold 15). Drivers by points: if/else 25 (35 pts), boolean chains 10, ternaries 1 (nesting depth added 10). Of this number, 34 points are the body\u0027s own statements and 12 belong to 10 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c257884f33717d85e3395a4e18b619069d14d413f7ff0663fd0f0938a6e8cd30"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::tsc::op_script_names (cognitive 45): deno::lsp::tsc::op_script_names has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 8 (14 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent 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":"cli/lsp/tsc.rs"},"region":{"startLine":5589}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0470071a1e75234ff5e3c9cf61eb8b70b1df2a71cb155cff764018618d408cd"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::clean::clean_except (cognitive 45): deno::tools::clean::clean_except has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 4 (11 pts), loops 5 (6 pts), boolean chains 4 (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":"cli/tools/clean.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4ac540530f5d6389beb8666e1f757347b0cb1a9b9436685f96db0728559694"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::outdated::update (cognitive 45): deno::tools::pm::outdated::update has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 4 (8 pts), boolean chains 4, match/switch 1 (2 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":"cli/tools/pm/outdated/mod.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2748c10c955ff10140febb7ede69d3ac1572ba95f9437dc3b11537e2e575018f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_okp (cognitive 45): deno_crypto::subtle_import_key::import_key_okp has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 25). 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a71eb6f71481c63c20cffb57393641d88195d9befae466b9c74c7c24cde70e7"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::group_array_elements (cognitive 45): deno_web::console::inspect::group_array_elements has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 6 (15 pts), boolean chains 3 (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":"ext/web/console/inspect.rs"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca552225357c377e55840632628fed6143f541d6b64e062fed0a8ab34543b73e"}},{"ruleId":"D2","level":"warning","message":{"text":"comparisons.keyCheck (cognitive 45): comparisons.keyCheck has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 6, loops 1 (4 pts) (nesting depth added 23). 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d294a4355ca488aa02afaea69af2409c80e047a2a2c43e4c537554bdaad89cba"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::why::why (cognitive 44): deno::tools::pm::why::why has cognitive complexity 44 (threshold 15). Drivers by points: loops 13 (21 pts), if/else 14 (20 pts), boolean chains 3 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/why.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c835c4ce007f07cdbdeb246884916e1bf98256b2ab2ba657055c5ff65a9a69d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_config::util::parse_iso8601_duration (cognitive 44): deno_config::util::parse_iso8601_duration has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 3 (6 pts), boolean chains 5, match/switch 2 (3 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":"libs/config/util.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4096d9b8b63dcf98a35f8e9a92c333886937282fe27475bc21a7d65648eb9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDependencyResolver::find_peers_cache_hit_inner (cognitive 44): GraphDependencyResolver::find_peers_cache_hit_inner has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 4 (7 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent 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/npm/resolution/graph.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6631ec70ecc4437895c1ba76ac75cfc574e142b49cd849832780f0a3f60eb0e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::bun_lockfile_import::bun_lock_to_deno_lock_v5 (cognitive 44): deno_resolver::bun_lockfile_import::bun_lock_to_deno_lock_v5 has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 3 (6 pts), match/switch 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":"libs/resolver/bun_lockfile_import.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd3fb49aaa38acfc062a5f100692e3f9b9e93c7154cbb7f7c689ddb671331bb"}},{"ruleId":"D2","level":"warning","message":{"text":"sig.signOneShot (cognitive 44): sig.signOneShot has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 7, ternaries 3 (5 pts), error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e15799163168b03938e09ff18e9f3c29361cc1aecc965748be8f868ad4e0b74"}},{"ruleId":"D2","level":"warning","message":{"text":"readable.fromList (cognitive 44): readable.fromList has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (33 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ed7907d11a811fc00a186fd142147a4a5de9ab9eaff1c14434c6f6cfe28c77"}},{"ruleId":"D2","level":"warning","message":{"text":"Url.format (cognitive 44): Url.format has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 15, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/url.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff52bfd87e895af9394e12e1110ebb6a93ff1495509924e9792e75a06d9d5781"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 44): read has cognitive complexity 44 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 7, ternaries 2 (4 pts), error handling 1 (2 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"039fa243e7b2a1587bcd6dea2b5b689b2da8a6deb8d1335f0edc025fca582bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"isSimpleSpecialHostCanonical (cognitive 44): isSimpleSpecialHostCanonical has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 13, loops 3 (4 pts) (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":"ext/web/00_url.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3938d76f1eb2f864a7e8f6303ce438fba619701e80fa573d043960f55b505cf"}},{"ruleId":"D2","level":"warning","message":{"text":"removeEventListener (cognitive 44): removeEventListener has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 2 (9 pts), boolean chains 2 (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":"ext/web/03_abort_signal.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1219c7a84062d45c2fb604cbdac3ea6bcdbd5c281d01a201b0f5b3668e4a7282"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::bundle::html::attr_value (cognitive 43): deno::tools::bundle::html::attr_value has cognitive complexity 43 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 7 (16 pts), boolean chains 9 (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":"cli/tools/bundle/html.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dc08f31cbdbbecd6bd840caef2125fa3493317fa7a167e7068b9d443a458e8"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::npm_compat::install_http_modules (cognitive 43): deno::tools::installer::npm_compat::install_http_modules has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 3 (7 pts), boolean chains 5, loops 3 (4 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":"cli/tools/installer/npm_compat.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d08faf4ade5b147bdc69504aca6313b38c6bbc2a4b175ba5811984e61fd3809"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::publish::publish_order::build_pkg_deps (cognitive 43): deno::tools::publish::publish_order::build_pkg_deps has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/publish_order.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e0f1ac29415e4670fe06ed915de60a5f994e61422a220fd07a5903f465d21a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::import_key::import_key_ec (cognitive 43): deno_crypto::import_key::import_key_ec has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (34 pts), match/switch 5 (9 pts) (nesting depth added 26). 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":"ext/crypto/import_key.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"25be7d788ba6ba18fb150f5652dad9b4400e4b3130d14c3f950cece4f4131515"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyObjectHandle::new_asymmetric_private_key_from_js (cognitive 43): KeyObjectHandle::new_asymmetric_private_key_from_js has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 7 (17 pts) (nesting depth added 23). 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":"ext/node_crypto/keys.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9a83bc8d1d817ffae1c93551ef92c67d7dbaca171739ccbc2eaa7d9a605687"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSync::prepare (cognitive 43): DatabaseSync::prepare has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (42 pts), boolean chains 1 (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":"ext/node_sqlite/database.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31e54b794546fcdf6a364734af71a1b1e5b341fdb3ebafe0dcda14a87dcf903"}},{"ruleId":"D2","level":"warning","message":{"text":"SloppyImportsResolver::resolve (cognitive 43): SloppyImportsResolver::resolve has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (31 pts), match/switch 5 (9 pts), boolean chains 2, loops 1 (nesting depth added 18). Of this number, 42 points are the body\u0027s own statements and 1 belongs 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":"libs/resolver/workspace.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4725c8da388a8d1933542c46c23ef295a5ac7999b83a2a42b66cea2637a2598"}},{"ruleId":"D2","level":"warning","message":{"text":"EventSource.#loop (cognitive 43): EventSource.#loop has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 3, match/switch 1 (3 pts), error handling 2, loops 1, ternaries 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/27_eventsource.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9f503a752a7c9a20c5db5d2d0acac82fa44111e9702505a2a191c4ed96c2ed"}},{"ruleId":"D2","level":"warning","message":{"text":"_util.normalizeString (cognitive 43): _util.normalizeString has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 3, loops 1 (nesting depth added 22). 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":"ext/node/polyfills/path/_util.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0edea4af935ce5198fbbbdc13ee34e5ee6e197bab7259624033d33a730a561"}},{"ruleId":"D2","level":"warning","message":{"text":"bench (cognitive 43): bench has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 2, other 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_bench.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c996fed50d6fdefa2898531fe12e98e5360066bf52f910f18301877f11aeba96"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoTestCollector::visit_var_decl (cognitive 42): DenoTestCollector::visit_var_decl has cognitive complexity 42 (threshold 15). Drivers by points: if/else 5 (24 pts), match/switch 2 (9 pts), loops 2 (6 pts), boolean chains 3 (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":"cli/lsp/code_lens.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adc62f4b41f59ab4937bea14f26cf6f94e896bd46f9ea9f103bd04b6ef911c3"}},{"ruleId":"D2","level":"warning","message":{"text":"HmrRunner::run (cognitive 42): HmrRunner::run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (31 pts), loops 3 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/run/hmr.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df1ee505437ba63f5084ca7a6dd171f12b4c1db948847c8460277d74643ef9d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::get_keys (cognitive 42): deno_web::console::inspect::get_keys has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 4 (10 pts), match/switch 2 (4 pts) (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":"ext/web/console/inspect.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda7dd17dbb086c9eb0b1378b113aa8c337267a213a3989dfc6205dc69b2da5c"}},{"ruleId":"D2","level":"warning","message":{"text":"ByonmNpmResolver::resolve_folder_in_root_node_modules (cognitive 42): ByonmNpmResolver::resolve_folder_in_root_node_modules has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 1 (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":"libs/resolver/npm/byonm.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbef7d7c4ec5744539a886b0b5032e3222abbd900570d51aa8d44852775d7079"}},{"ruleId":"D2","level":"warning","message":{"text":"PermissionsContainer::check_special_file (cognitive 42): PermissionsContainer::check_special_file has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 10 (nesting depth added 11). Of this number, 28 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":4602}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf736d67abe2e328927cf4eceb29f8700290264254ac5466600c4f578902c440"}},{"ruleId":"D2","level":"warning","message":{"text":"net.Server.listen (cognitive 42): net.Server.listen has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 15 (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":"ext/node/polyfills/net.ts"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be56425f1783974713db2554d18c92903c0cbaffc97460585a3d511b0205819"}},{"ruleId":"D2","level":"warning","message":{"text":"_findPath (cognitive 42): _findPath has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/01_require.js"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e57b738ba9fe73a0f45ef0880efd5aeac2307f2160ecd9bef54d678be8f180"}},{"ruleId":"D2","level":"warning","message":{"text":"extractBody (cognitive 42): extractBody has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 6, ternaries 1 (2 pts), other 1 (nesting depth added 12). Of this number, 35 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/22_body.js"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b3fb8db1edf1cbbf44df98e0db5653dfa1b55d59f4bdfe83e6f726160f02be"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecifierUnfurler::unfurl_specifier (cognitive 41): SpecifierUnfurler::unfurl_specifier has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 10 (33 pts), if/else 4 (8 pts) (nesting depth added 27). 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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"af68958242d8e993121085f5dfd80bb73aa542465796d2523a4a23a397311470"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop::extract_laufey_archive (cognitive 41): deno::tools::desktop::extract_laufey_archive has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (4 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":"cli/tools/desktop.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35ada39e2405f1e2537c59b0e02a3da7ee1d430234d8ee3bd6703e295576596"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pack::unfurl::unfurl_dynamic_specifier (cognitive 41): deno::tools::pack::unfurl::unfurl_dynamic_specifier has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (34 pts), boolean chains 6, match/switch 1 (nesting depth added 24). 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":"cli/tools/pack/unfurl.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"928e5e0fe213fe9153ec3a828aee33aab93dfaee293a41a06eff4c21df62d794"}},{"ruleId":"D2","level":"warning","message":{"text":"jupyter_kernel.startJupyterKernel::handleExecute (cognitive 41): jupyter_kernel.startJupyterKernel::handleExecute has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 14, error handling 2 (6 pts), ternaries 1 (4 pts) (nesting depth added 15). 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. This shape REPEATS in the file: one other method here (jupyter_kernel.startJupyterKernel::checkIsComplete) 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":"cli/js/jupyter_kernel.js"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e68f3c1d9244e19df8c7799709504e85da4d7837906594f51c058faea849a9"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomicOperation.[SymbolFor(\u0022Deno.privateCustomInspect\u0022)] (cognitive 41): AtomicOperation.[SymbolFor(\u0022Deno.privateCustomInspect\u0022)] has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 2 (5 pts), match/switch 1 (4 pts), boolean chains 3, loops 3, ternaries 1 (2 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":"ext/kv/01_db.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9089bbbfc562039a2118417ade17c17fc592141f4bcfffb66343beac9ee30f"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.buildCommand (cognitive 41): child_process.buildCommand has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 4, error handling 1 (4 pts), ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4470afba1fdc93f608d86f372aa3d51d77eddcfdc38ed731758c6b32f6464a"}},{"ruleId":"D2","level":"warning","message":{"text":"writable.onwrite (cognitive 41): writable.onwrite has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 5, ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e4b8d38116db99b23078b7129eafc884d589144bd4a2cdb601f4d817160df3"}},{"ruleId":"D2","level":"warning","message":{"text":"LspScopedResolver::configured_auto_import_roots (cognitive 40): LspScopedResolver::configured_auto_import_roots has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (29 pts), boolean chains 4, loops 2 (4 pts), match/switch 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":"cli/lsp/resolver.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"8921f08a5ca464918239df92fac357fc95ea0dbc9f1995d55c6b2edafc9e3844"}},{"ruleId":"D2","level":"warning","message":{"text":"DepManager::run_dependency_resolution (cognitive 40): DepManager::run_dependency_resolution has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 4 (9 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent 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":"cli/tools/pm/deps.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"304b28fab46e6f6d3188fd91ad68fbff98584f31a2bb12c61f74ed1b374476cc"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::x::run (cognitive 40): deno::tools::x::run has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 3, match/switch 3, 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":"cli/tools/x.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a261e528a0ad9eb44124a86868062b74348970793e7adac0593d247b0339a201"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpRecordResponse::poll_frame (cognitive 40): HttpRecordResponse::poll_frame has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (30 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 24). 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":"ext/http/service.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"979b380c88114712e21f3c01fa97adb3876c5ddc06702108e46518bff5d40c86"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSWrapInner::clear_out_process (cognitive 40): TLSWrapInner::clear_out_process has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 3 (10 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"b994f8c01aa15d1bcba3b0b20957fa190d29251b302f1f0a253fc8f9b7339c52"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::convert::apply_node_options (cognitive 40): deno_cli_parser::convert::apply_node_options has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 4 (9 pts), match/switch 4 (9 pts), boolean chains 5 (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":"libs/cli_parser/src/convert.rs"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dec20912b4683e4841f479bbf7219eaeaadf8b95b2e6ac83b20795466bab68"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentOptions::check_options (cognitive 40): EnvironmentOptions::check_options has cognitive complexity 40 (threshold 15). Drivers by points: if/else 28 (33 pts), boolean chains 7 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/lib.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"4434c84d0f23a50627820d239412bae37197861b7a0b9fd69a694c7c3894985b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm_installer::hoisted::compute_hoisted_layout (cognitive 40): deno_npm_installer::hoisted::compute_hoisted_layout has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 7 (9 pts), boolean chains 4, match/switch 1 (2 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":"libs/npm_installer/hoisted.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b20a74d4ce4fe4eb1605c6e5c9ef8978db27e98412ac8c8feedb505a74a75b1"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_subprocess_windows::process::spawn (cognitive 40): deno_subprocess_windows::process::spawn has cognitive complexity 40 (threshold 15). Drivers by points: if/else 26 (35 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). 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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f5a0b416351ebf07d7320260337edd9a8923c5257f0127f6651b961f239f52"}},{"ruleId":"D2","level":"warning","message":{"text":"stream_base_commons.onStreamRead (cognitive 40): stream_base_commons.onStreamRead has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (36 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 20). 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":"ext/node/polyfills/internal/stream_base_commons.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c3c0d1dbd96692f525735b7fb6384480b2a559f403f08a419ca64096e4ef76"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoCompileBinaryWriter::build_vfs_consolidating_global_npm_cache (cognitive 39): DenoCompileBinaryWriter::build_vfs_consolidating_global_npm_cache has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 4 (9 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 22). 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":"cli/standalone/binary.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"651fa309b7e1be4f7da98d08dd2d14256d9db97920597dc80ef2c32d1d90aac5"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pack::package_json::convert_exports (cognitive 39): deno::tools::pack::package_json::convert_exports has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 2 (6 pts) (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":"cli/tools/pack/package_json.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"32238f60326b186f73f707f64869acb255e5d8a89ff61a845bff9c97a305d568"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tsc::tsconfig_gen::strip_top_level_type_decls (cognitive 39): deno::tsc::tsconfig_gen::strip_top_level_type_decls has cognitive complexity 39 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 4 (11 pts), match/switch 1 (6 pts), boolean chains 5 (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":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"203334dfd36d401e54a1f333cbac1d6c3f1f52a203540478cd9418190dd523c1"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_derive_bits::run (cognitive 39): deno_crypto::subtle_derive_bits::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (33 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e91da8603958453afae5e512c74b31c3042454ad844e346aafcb7662bc8908c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::llhttp::binding::consume_read_callback (cognitive 39): deno_node::ops::llhttp::binding::consume_read_callback has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (34 pts), boolean chains 5 (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":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"e217527b2a838364de9fea59a1ba7fdd14f77fbbb5d5bd119f592a2a1a01d35d"}},{"ruleId":"D2","level":"warning","message":{"text":"FileCollector::collect_file_patterns (cognitive 39): FileCollector::collect_file_patterns has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (6 pts), boolean chains 3, match/switch 2 (nesting depth added 17). Of this number, 37 points are the body\u0027s own statements and 2 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":"libs/config/glob/collector.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde6b0f44d71b09e8399f9dbc667275153e6f726d993d5c2318d289276076fc"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedConn::poll_read_body_chunk_limited_inner (cognitive 39): SharedConn::poll_read_body_chunk_limited_inner has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 4 (10 pts), boolean chains 1, loops 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":"libs/http_h1/conn.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a761e5eb22aa1afe8a8de95b2c65a209ce26520228086c0b4ad7281b9213be"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ops::op2::dispatch_slow::from_arg (cognitive 39): deno_ops::op2::dispatch_slow::from_arg has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 4 (13 pts) (nesting depth added 19). 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/ops/op2/dispatch_slow.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ce4ae266ec4d6bd7afc7d3ea15c11348bc9c2ceda25962b3a732da14aa67d3"}},{"ruleId":"D2","level":"warning","message":{"text":"RawDenoResolver::resolve (cognitive 39): RawDenoResolver::resolve has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 5 (10 pts), boolean chains 3 (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":"libs/resolver/lib.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ec504176058a6a66c57c21617158c927d58cf704d08c25789373ea1ed96d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::patch_react_cves (cognitive 39): deno_resolver::patch_react_cves has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 3 (4 pts), match/switch 2, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/lib.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8c61154960e2bfb8ba8569fc9568591fec684d80974aa44136b6e1e406da98"}},{"ruleId":"D2","level":"warning","message":{"text":"parse_args.argsToTokens (cognitive 39): parse_args.argsToTokens has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 2 (4 pts), boolean chains 3 (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":"ext/node/polyfills/internal/util/parse_args/parse_args.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2011c76414236e72634ae9ee80b5a533c33433ed1238e10bbf11351d837810e9"}},{"ruleId":"D2","level":"warning","message":{"text":"writeHead (cognitive 39): writeHead has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 5 (16 pts), boolean chains 5 (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":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8813380642e964eb4469eaeadc2d7e536b2b8f4fa23af6f22ecfd49a500a88"}},{"ruleId":"D2","level":"warning","message":{"text":"parseArgs (cognitive 39): parseArgs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (24 pts), other 6, ternaries 2 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). Most of this is not in the body itself: 7 of the 39 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 411, 356, 457). 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":"ext/node/polyfills/internal/util/parse_args/parse_args.js"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29c5ecb5ea89ab47ca6e3f8ddad80a754259cd5d8ee50b4380bab0648bb5027"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoTestStepCollector::visit_var_decl (cognitive 38): DenoTestStepCollector::visit_var_decl has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 2 (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":"cli/lsp/code_lens.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b69ed80beaa01e80cdc0528f1f5cdf4c90d170d1812abd5ee96a24fd6f4f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop_devtools::run_unified_session (cognitive 38): deno::tools::desktop_devtools::run_unified_session has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 5 (9 pts), loops 6 (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":"cli/tools/desktop_devtools.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"276e6ae8375866dca1ecaaa2f6f7487e05cce21336b7fd9e9d38bf7d2e69242e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_kmac (cognitive 38): deno_crypto::subtle_import_key::import_key_kmac has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 2 (6 pts), boolean chains 5, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"af438e41b8c99afb1bd692aafc45db945c6f9ce582775cb70010b8dfe8e67662"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_napi::js_native_api::napi_define_properties (cognitive 38): deno_napi::js_native_api::napi_define_properties has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a58bfbcf47e0932c4b546c31ec1088274949eb6c61da54f6ad19e3c4cabf3c"}},{"ruleId":"D2","level":"warning","message":{"text":"WasiContext::poll_oneoff (cognitive 38): WasiContext::poll_oneoff has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 6 (16 pts), boolean chains 3, loops 2 (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":"ext/node/ops/wasi.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcb75337cfe085289cc04e4d0292355d0c0ff6ad0cdd43a2511a363599e68ed"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSyncOptions::from_v8 (cognitive 38): DatabaseSyncOptions::from_v8 has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 13, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0a47d1e41492fd4e23f11791e71670d3ba7c5401c2249856219137a53c4e54"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::try_custom_inspect (cognitive 38): deno_web::console::inspect::try_custom_inspect has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ba16e0dc85fc56b2ec126f401828180c299794fd60eb93a27ba2473f054a09"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceResolver::from_workspace (cognitive 38): WorkspaceResolver::from_workspace has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 5 (8 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). None of this is in the body itself: all 38 points belong to 4 function items inside it that branch (resolve_import_map, resolve_import_map::expand_catalog_specifiers::expand_entries, resolve_import_map::expand_catalog_specifiers, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/workspace.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc76cc3c766f4100468e3b727f643cbd3f1b07456a776d244565b0162a385a90"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_server.ServerResponse.writeHead (cognitive 38): _http_server.ServerResponse.writeHead has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 3 (9 pts), boolean chains 3 (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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6d54828adcece529ef73fd4533ea81ab329300d123f7ff213181ec1af0b739"}},{"ruleId":"D2","level":"warning","message":{"text":"REPLServer.constructor::_doComplete (cognitive 38): REPLServer.constructor::_doComplete has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (22 pts), error handling 3 (10 pts), loops 1 (3 pts), ternaries 1 (2 pts), boolean chains 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. This shape REPEATS in the file: 5 other methods here (REPLServer.constructor, REPLServer.constructor::defaultEval, REPLServer.constructor::_doComplete::completionGroupsLoaded, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"0156ba4338eab13dc35dc19412b11fb9f3be8125847cfd0ea3187f3f273d8e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"duplexify (cognitive 38): duplexify has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (25 pts), ternaries 4 (8 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 12). Of this number, 28 points are the body\u0027s own statements and 10 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/duplexify.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf622071a25ce621344fde89a95d36e755d21637ae594925f390a6169af98741"}},{"ruleId":"D2","level":"warning","message":{"text":"TsServer::provide_code_actions (cognitive 37): TsServer::provide_code_actions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 4 (10 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 22). 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":"cli/lsp/ts_server.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4e33ec9c927e5637d296bf5ffbfdd8a97a3c6a2d104405586c724b1307dc23"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDisplayContext::build_module_info (cognitive 37): GraphDisplayContext::build_module_info has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 8 (13 pts), loops 2 (8 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/info.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c0120ea7f93a1987a83a1f9fca8909b067f16a309950ec2706617f5be2df5d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::fmt_editorconfig::parse (cognitive 37): deno::tools::fmt_editorconfig::parse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/fmt_editorconfig.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fc38a5b89179e430459c20c8098d151cfc5750cc7ca79d7598bb622e116fcd"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::stream_wrap::on_uv_read (cognitive 37): deno_node::ops::stream_wrap::on_uv_read has cognitive complexity 37 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"8276657b9614f8f4650772b104d6763997b7da3dab9abe5d0dbd219ac63ca214"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::runtime::bindings::upgrade_snapshotted_ops_with_fast_calls (cognitive 37): deno_core::runtime::bindings::upgrade_snapshotted_ops_with_fast_calls has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/bindings.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a29e9bc20554a0f1fdfb3e0ea2e75d6026e3a8daf9868d4782b994f3a109756"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_runtime::fmt_errors::get_message_suggestions_inner (cognitive 37): deno_runtime::fmt_errors::get_message_suggestions_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 10 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/fmt_errors.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff98ef266d7955006508ce762f0d8c821adbed3be3a2ba508a19e54d02623137"}},{"ruleId":"D2","level":"warning","message":{"text":"errors.createInvalidArgType (cognitive 37): errors.createInvalidArgType has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (33 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2f0a7d096b07abf7f143f6d56ea692fd2894d9292cd7a26e51cd8c8cc83a50"}},{"ruleId":"D2","level":"warning","message":{"text":"operators.map (cognitive 37): operators.map has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 3 (4 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 13). Most of this is not in the body itself: 5 of the 37 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 146, 113, 134). 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":"ext/node/polyfills/internal/streams/operators.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0d761943c762bdbf9591757b23afb03740bde79332a4b7e96924c91b8716a0"}},{"ruleId":"D2","level":"warning","message":{"text":"isFullWidthCodePoint (cognitive 37): isFullWidthCodePoint has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 37. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e839facc2e503ff3de1b3e11ea32b02e4ebcc6828f4ce1a3444e1d6d41e41cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"#release (cognitive 37): #release has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (25 pts), error handling 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44cff4496d7792a284ed6310c1b21611de3672a066e6bb70ed7e883350fa28b"}},{"ruleId":"D2","level":"warning","message":{"text":"parse (cognitive 37): parse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 4, loops 1 (nesting depth added 20). 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":"ext/fetch/21_formdata.js"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1025af7610af495306db2e0a06a2003403aaa84bca34e0fd3af4bf1e06c79db"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::completions::get_import_completions (cognitive 36): deno::lsp::completions::get_import_completions has cognitive complexity 36 (threshold 15). Drivers by points: if/else 4 (21 pts), match/switch 5 (15 pts) (nesting depth added 27). 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":"cli/lsp/completions.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a48f3ffe7861947e6ddbeb9b7b123ac76a13f5cb00353a4698b28110a7deba"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::bump_version::bump_workspace_conventional (cognitive 36): deno::tools::bump_version::bump_workspace_conventional has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 6 (9 pts), match/switch 3 (4 pts), boolean chains 2 (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":"cli/tools/bump_version.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b75e460a66612ef21c1ef0e761bd9340403e1f0991f1f1d0106ebd06e8aecdc"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::upgrade::upgrade (cognitive 36): deno::tools::upgrade::upgrade has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (33 pts), boolean chains 2, 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":"cli/tools/upgrade.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"48163b6a78d2dc0aa2b3ab284f663dc8b609fe35fe1917c616d8a639013db951"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tsc::tsconfig_gen::build_tsconfig (cognitive 36): deno::tsc::tsconfig_gen::build_tsconfig has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 5 (13 pts), loops 4 (7 pts), boolean chains 2 (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":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"940c4f2f92ac1ab16d601a83915a47a8969f974fae42bf039558052f1998fbde"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http::http_next::write_h1_stream_response (cognitive 36): deno_http::http_next::write_h1_stream_response has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 4 (9 pts), boolean chains 4, loops 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":"ext/http/http_next.rs"},"region":{"startLine":4184}}}],"partialFingerprints":{"codehealthFindingId/v1":"367b217305834d1fa3d21a86d5159cab4566a7650c092aafac6c90921a9f078d"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::compute_all_npm_pkg_ids (cognitive 36): Graph::compute_all_npm_pkg_ids has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 8 (13 pts), boolean chains 5, match/switch 1 (3 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":"libs/npm/resolution/graph.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e59a60ee15dbe1ff6e35bde7adc62b1190eb99583811f30569970562f19541"}},{"ruleId":"D2","level":"warning","message":{"text":"LaxSingleProcessFsFlag::lock (cognitive 36): LaxSingleProcessFsFlag::lock has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 5 (18 pts), if/else 3 (11 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 25). 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/npm_installer/flag.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e22db0e809d9c4afb4b46e9c3adfaa60950056b2dfc6597d8cf0d94b4c4481e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_runtime::web_worker::run_web_worker (cognitive 36): deno_runtime::web_worker::run_web_worker has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 2, match/switch 1 (2 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":"runtime/web_worker.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"75737567053416349e7d12c99868c79f4924d131b932a8906c7320fb682ff685"}},{"ruleId":"D2","level":"warning","message":{"text":"40_lint.traverse (cognitive 36): 40_lint.traverse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 3 (7 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":"cli/js/40_lint.js"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"301aafab8f97cd8cb36d3a61134613ffbaa782f6b8a854fe57377d705d8d7ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.watch (cognitive 36): fs.watch has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 5 (8 pts), error handling 3 (5 pts), boolean chains 4 (nesting depth added 10). Of this number, 24 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs.ts"},"region":{"startLine":3474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7418d05d77d71cbbf96180910f33e5edcf40d87de6edc08a9d89ca015f86828"}},{"ruleId":"D2","level":"warning","message":{"text":"https.openCONNECTTunnel (cognitive 36): https.openCONNECTTunnel has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 6, error handling 4 (5 pts), ternaries 1 (nesting depth added 5). Most of this is not in the body itself: 14 of the 36 points are its own statements and the rest belongs to 6 function items inside it that branch (onProxyReady::onData, onProxyReady, fail, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/https.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c71241463b4f0f514eb5906847cf4b31b9898c29afe2ace1ba64f3c4512773"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.transformDenoShellCommand (cognitive 36): child_process.transformDenoShellCommand has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 4, error handling 1, ternaries 1 (nesting depth added 13). Of this number, 28 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"73401e16ce3f291effbe75282040983e952fefe47006bf8aabf5226b738eafd9"}},{"ruleId":"D2","level":"warning","message":{"text":"net._lookupAndConnect (cognitive 36): net._lookupAndConnect has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 9 (nesting depth added 4). Of this number, 22 points are the body\u0027s own statements and 14 belong to 5 function items inside it that branch. 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":"ext/node/polyfills/net.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfbdd4d5ca2a93b97bb472a5fbb58b08dcac16cf92d48b49a065f4848bb05cb"}},{"ruleId":"D2","level":"warning","message":{"text":"createImageBitmap (cognitive 36): createImageBitmap has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (25 pts), other 5, ternaries 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). Most of this is not in the body itself: 10 of the 36 points are its own statements and the rest belongs to one function literal inside it that branches (line 219). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/image/01_image.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21673b1ec91be07eef8208c7378adec7770fbfde61c60b6e9b5ff334cf3225e"}},{"ruleId":"D2","level":"warning","message":{"text":"PublishPreparer::build_and_check_graph_for_publish (cognitive 35): PublishPreparer::build_and_check_graph_for_publish has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 4 (11 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/mod.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc3b2491492100a8c03b62856681d3154417be67182c00b1aeebd54d29b37a4"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecifierUnfurler::unfurl_to_changes (cognitive 35): SpecifierUnfurler::unfurl_to_changes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 4 (10 pts), loops 5, boolean chains 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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f4756e1613a86b68c37051d1c4e783994a11f32a5f906d3b18f71ae5dfb063"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::local::categorize_installed_npm_deps (cognitive 35): deno::tools::installer::local::categorize_installed_npm_deps has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 4 (6 pts), match/switch 2 (6 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":"cli/tools/installer/local.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa500a538bc20b40995496d5e5bd700a1c79db5cb0f67195e234d0bffea23066"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::transpile::transpile (cognitive 35): deno::tools::transpile::transpile has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 6, loops 2, 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":"cli/tools/transpile.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"97870c4bd9e9cd26aaa57eccb72a66dd2f29fe7fa9630e24df0d9a46a03306cf"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopHmrRunner::run (cognitive 35): DesktopHmrRunner::run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (10 pts), match/switch 3 (10 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent 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":"cli/rt/hmr.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f3cf50c789685f64100ad15234dd60931cb4dae65537f34d6edd1ca54ccbdd"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::export_key::export_key_ec (cognitive 35): deno_crypto::export_key::export_key_ec has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 7 (11 pts) (nesting depth added 16). 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":"ext/crypto/export_key.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5b3c6020cbd4ac758b4ab5bb2e1f596f424bddd6f405ff9d19fee18efa1df0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSWrap::writev (cognitive 35): TLSWrap::writev has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent 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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ae91ab228f0e82c27e5d2dc125f001dcae47f60ccbfb0cc913bd0649c3c8e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleMap::drain_dyn_imports (cognitive 35): ModuleMap::drain_dyn_imports has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 5 (16 pts), loops 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":"libs/core/modules/map/dynamic.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b436ab6868f419bae9eb507229c9067d5200a23e9f267d6cf99fbfe0f7abd8"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleMap::new_module_from_js_source_with_pending (cognitive 35): ModuleMap::new_module_from_js_source_with_pending has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"285d081fc05ffc1070b03dc60840b10fcd2d2cda3bad2672147082207737c756"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::pipe::uv_pipe_open (cognitive 35): deno_core::uv_compat::pipe::uv_pipe_open has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 4 (13 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":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"36789c67e6ea838733c0fe9b5ead4c17acaa09592c584fa510d8c7d53832b7d6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::stream::write_pipe (cognitive 35): deno_core::uv_compat::stream::write_pipe has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 3 (8 pts), match/switch 2 (7 pts), boolean chains 3 (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":"libs/core/uv_compat/stream.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b3292facbab7d4fea888a695f12df928e5447291ebb24520a139d8bc48ee70"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmPackageVersionResolver::strongest_trust_evidence_before (cognitive 35): NpmPackageVersionResolver::strongest_trust_evidence_before has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/common.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"147b0f70e3c3756d6de67fcc8d4fbe0282028c11abeaa39f54288a63101d9f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChannelWrap.#resolve (cognitive 35): ChannelWrap.#resolve has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (30 pts), error handling 1 (2 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b487ae190e0e41a0bd782131a6f7f7c65d2457463107765bd68e97db8a3b5a7"}},{"ruleId":"D2","level":"warning","message":{"text":"_posix.parse (cognitive 35): _posix.parse has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 4, loops 1 (nesting depth added 11). 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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1446d9447d39a22ba6d04933ad47c71788f71efe9e694dd84c9d27b0413afb"}},{"ruleId":"D2","level":"warning","message":{"text":"process.internals.__bootstrapNodeProcess (cognitive 35): process.internals.__bootstrapNodeProcess has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (7 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 15). Of this number, 32 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/process.ts"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6eec9d851427de8e26f0b8bd5ccbd44831c16211dd62cdde353fe728c63c347"}},{"ruleId":"D2","level":"warning","message":{"text":"pipe (cognitive 35): pipe has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 9, ternaries 2 (4 pts) (nesting depth added 6). Most of this is not in the body itself: 13 of the 35 points are its own statements and the rest belongs to 9 function items inside it that branch (pause, onerror, onunpipe, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"31516388d8fe802b7176702c00a36ac110522066b7d8bc6144557d6405cc18fa"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleGraphBuilder::build_graph_with_npm_resolution_and_build_options (cognitive 34): ModuleGraphBuilder::build_graph_with_npm_resolution_and_build_options has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (9 pts), boolean chains 6, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/graph_util.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"accd4b68b90daaca0b28ae1931e3804b3e7560d6f8648332ba745fe77ecbeef3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::standalone::native_addons::collect_bundle_required_packages (cognitive 34): deno::standalone::native_addons::collect_bundle_required_packages has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 6 (9 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/standalone/native_addons.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a1ee06ced5dca07c7b0407248280cc7d83d9964098f9b07dd54557279a0d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmRegistryReadPermissionChecker::ensure_read_permission (cognitive 34): NpmRegistryReadPermissionChecker::ensure_read_permission has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 20). 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":"cli/lib/npm/permission_checker.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0723bd4e2d7908f8f09ba2c02e60c9ca5d692abe89fc2692dbc05b6a204fcccc"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_encrypt::run (cognitive 34): deno_crypto::subtle_encrypt::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 3 (5 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":"ext/crypto/subtle_encrypt.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc13ce3a4a5410d1c78e0b2beb65389ebc9bb0c8eb76911cfc02b1f780f1d98"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_fetch::op_fetch (cognitive 34): deno_fetch::op_fetch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (10 pts), boolean chains 3, loops 1 (2 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":"ext/fetch/lib.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f605a2505c0f380014b0445b25d8abbb4a57b55f7e3812f68553f4e68b2a3d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ZlibInner::do_write (cognitive 34): ZlibInner::do_write has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (2 pts) (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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5879a5333f9cb0ebfa70036cade399cf98b7d23d1995f2cc9ebb9157229f21"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSync::function (cognitive 34): DatabaseSync::function has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 2 (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":"ext/node_sqlite/database.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"314f9ad3f9a8367d4ae7f7f53f078f9d7f22edecf7dbc38294e1cb963405af58"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::url::simple_special_host_is_canonical (cognitive 34): deno_web::url::simple_special_host_is_canonical has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 8, loops 2 (3 pts), match/switch 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":"ext/web/url.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3597d9ff13fa85bb235c7d8e937a4b032c2eba2ec13b0f179e0f50d8bd1933"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ops::op2::generate_op2 (cognitive 34): deno_ops::op2::generate_op2 has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 4, loops 3, match/switch 2 (3 pts) (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":"libs/ops/op2/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2198faeada9b18178d390b67d7b4035c6febfe7093a5b72cc9eda0a27d5f7634"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_subprocess_windows::process::search_path_join_test (cognitive 34): deno_subprocess_windows::process::search_path_join_test has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 16 (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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"032bf2d481c1058acf2e83843294e7ee50726f79992d36267ae4eb04783097f7"}},{"ruleId":"D2","level":"warning","message":{"text":"02_websocket.upgradeWebSocket (cognitive 34): 02_websocket.upgradeWebSocket has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 11 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/02_websocket.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4315789c3ab00b07b967f375b29a98089d0b890cb93d89847c994e6229a5dec2"}},{"ruleId":"D2","level":"warning","message":{"text":"dns.lookup (cognitive 34): dns.lookup has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eecea9c9753c2dbda0b80ba5625c81f8d6f9abb13f4c0f7e46e00144204a2ec"}},{"ruleId":"D2","level":"warning","message":{"text":"comparisons.partialObjectMapEquiv (cognitive 34): comparisons.partialObjectMapEquiv has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (30 pts), boolean chains 3, loops 1 (nesting depth added 21). 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fa4727c617895e912abf6209f1d522b3feec4cbe0bdf7707dbf831e0c4a88d"}},{"ruleId":"D2","level":"warning","message":{"text":"net.Socket (cognitive 34): net.Socket has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 6 (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":"ext/node/polyfills/net.ts"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"25764878d2f33d1e765663273eb4e3b4854bc3dbf4bc24133b995b910dde86f1"}},{"ruleId":"D2","level":"warning","message":{"text":"postMessage (cognitive 34): postMessage has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 3, loops 1 (2 pts) (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":"ext/web/13_message_port.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e8b827ff7766b7b08d6453965bac39330a885b07c3db03e610a8d513a2e2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionEntry::get_filter_text (cognitive 33): CompletionEntry::get_filter_text has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 19). 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":"cli/lsp/tsc.rs"},"region":{"startLine":4367}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c9da6dab86b71ca5b9ebc48b11789b876fcb9e6462d3da6764f562c98ab9fe"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::lint::ast_buffer::swc::serialize_expr (cognitive 33): deno::tools::lint::ast_buffer::swc::serialize_expr has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 14 (30 pts), if/else 2 (3 pts) (nesting depth added 17). 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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fcdfc2ede404e8bb2e27426539d3e5914aa9e9e549eabcf7e1c894b24a5f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::repl::editor::validate (cognitive 33): deno::tools::repl::editor::validate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 4 (9 pts), boolean chains 2, 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":"cli/tools/repl/editor.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85a151a2dda418b20a7da814ad3b24c007c8881104cdf55a86ad59dc5bf3d7b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::upgrade::upgrade_from_pr (cognitive 33): deno::tools::upgrade::upgrade_from_pr has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (27 pts), loops 3 (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":"cli/tools/upgrade.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcda92c33f97cca518e2fefdbf93588f0465d259791c98a361562e873ddf3e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::verify_key_sync (cognitive 33): deno_crypto::verify_key_sync has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 14 (28 pts), if/else 2 (5 pts) (nesting depth added 17). 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":"ext/crypto/lib.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d94db2201069624ff4566b6862f05d356d0faab9d027fd0fb9330d87ce7719"}},{"ruleId":"D2","level":"warning","message":{"text":"40_lint._dump (cognitive 33): 40_lint._dump has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 5 (8 pts), ternaries 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint.js"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"496fdc3e885f5fb30875205da9a8cba59b0dddc19943ace3d84ba88a84b76d65"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer.Buffer.copy (cognitive 33): buffer.Buffer.copy has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24 (30 pts), boolean chains 3 (nesting depth added 6). 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"11205871580994a2261797747b7b069d741d1fbada662ba5f6aa6744ae31f40d"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.spawnSync (cognitive 33): child_process.spawnSync has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 12, ternaries 10, if/else 7 (9 pts), error handling 1, loops 1 (nesting depth added 2). 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3b5b48a5561c59ad7fcd1893275ade8fc8a1cc3d2bd495d5e80b46ee70cb0d"}},{"ruleId":"D2","level":"warning","message":{"text":"scrypt.check (cognitive 33): scrypt.check has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/scrypt.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c2c2df34ed1acc04ae2e6c07239196af3595d0d86ad914e808bee109b220b9"}},{"ruleId":"D2","level":"warning","message":{"text":"parseNoProxy (cognitive 33): parseNoProxy has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8083b06cf1cfca20c549a45629891fdc34f698a8c5d13f6a15abc9cc6d0d59d"}},{"ruleId":"D2","level":"warning","message":{"text":"request (cognitive 33): request has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 5, other 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":"ext/web/locks.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82cd1f98ddd6dc37328b7d688b90747f62af6ae6b087df40397ecfd84adec46"}},{"ruleId":"D2","level":"warning","message":{"text":"TestRun::exec (cognitive 32): TestRun::exec has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (10 pts), loops 3 (5 pts) (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":"cli/lsp/testing/execution.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0807a4fc229af5d0bd1b4d0091832941571f20861a6ee7867e41bdaeeca2a6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::path_to_regex::parse (cognitive 32): deno::lsp::path_to_regex::parse has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/path_to_regex.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70efbc61004019fd5bbdc2b25f1017e7b656ae0e26a1f83e38c9cd1cecb35c9"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::outdated::choose_new_version_req (cognitive 32): deno::tools::pm::outdated::choose_new_version_req has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 4 (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":"cli/tools/pm/outdated/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e630adfe37a354a80d8b7d9cd8daca4ce2e290e6d3e64ded30fe6bb10fe02b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::publish::wasm::collect_import_records (cognitive 32): deno::tools::publish::wasm::collect_import_records has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). 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":"cli/tools/publish/wasm.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ed55321f433dc9049436666559efdfef14b6430628abdd3af0c23b636a62cf"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_decrypt::run (cognitive 32): deno_crypto::subtle_decrypt::run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 3 (5 pts), boolean chains 3 (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":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8af0f61cc17e5ef18c219a4732636348062ad66f65883ff2b7eb66478cb80d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_ml_kem (cognitive 32): deno_crypto::subtle_import_key::import_key_ml_kem has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 3 (4 pts) (nesting depth added 16). 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7a4bf61a58d3c60fd5021a5dd359b898c5bc31cdba928877a17ed6ddf366b7"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::shell::scan_and_split (cognitive 32): deno_node::ops::shell::scan_and_split has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 10, loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/shell.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec5c8bb6bd72ef7807a9f7e8e3584f6e5676bf2cb15a98fa6eae9851fd77504"}},{"ruleId":"D2","level":"warning","message":{"text":"Decipher::r#final (cognitive 32): Decipher::r#final has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 1, 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":"ext/node_crypto/cipher.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f528bfb32f9ef857d5ecfbfc8be292a9275c60be04d986600c6a3a3638bae8"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node_crypto::cipher::aes_unwrap_key (cognitive 32): deno_node_crypto::cipher::aes_unwrap_key has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 4, loops 1 (3 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"01aa315a6fd38c1bb1375b40c53c97e067078dead6c74cb5482e74e6be4a3605"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageData::constructor (cognitive 32): ImageData::constructor has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 6). 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":"ext/web/image_data.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1ee92dac90d98dc2b432640d35abe7299cb13a790b950ae8e1fa3944b5bf8d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::js_parse_float (cognitive 32): deno_web::console::js_parse_float has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 10, loops 3 (6 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":"ext/web/console/mod.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88e3176525bebe04b6b289fc1c4a587583c94e3dfa41f902d0668bb66c3aed7"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::format_value (cognitive 32): deno_web::console::inspect::format_value has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"b755dc2342e69014e0218806d8f2e6a7b50e7e0f96802fcdef27038f521caa47"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::css_stylesheet::split_top_level_rules (cognitive 32): deno_web::css_stylesheet::split_top_level_rules has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (7 pts), boolean chains 4 (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":"ext/web/css_stylesheet.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"114e794d8dd32b9919fcb8081a877a3764e456e65350694f41ba21abd41ed0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeActivityStats::diff (cognitive 32): RuntimeActivityStats::diff has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 9 (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":"libs/core/runtime/stats.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a7b000a3f68f69cacc0da9fc38a8e28452146af6a8f96061eb2018dd33ead0"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::extension_set::into_sources_and_source_maps (cognitive 32): deno_core::extension_set::into_sources_and_source_maps has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 6 (11 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/extension_set.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"639760c7ce80d021f72fa0cee4b99eb8edd3e1bcfd4babb8f6a55b597a37a28e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_dotenv::apply_value_substitution (cognitive 32): deno_dotenv::apply_value_substitution has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dotenv/lib.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b56982032ab7e5438fc6e2998acc7eea3d065ab6547d5c43589ef710bcaa9bb"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeResolver::finalize_resolution (cognitive 32): NodeResolver::finalize_resolution has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 5 (6 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35a0e0a59c525aaf76266b36c9a9a448c1c70f8ead863d7d0df8ba9b27530b7"}},{"ruleId":"D2","level":"warning","message":{"text":"BinEntries::for_each_entry (cognitive 32): BinEntries::for_each_entry has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 2 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/bin_entries.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2bee7ff74c190011aedd8a42a4694f0d182635c06ad6c8ba9c6c29a2535b56"}},{"ruleId":"D2","level":"warning","message":{"text":"http2.setupHandle (cognitive 32): http2.setupHandle has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (nesting depth added 10). Most of this is not in the body itself: 15 of the 32 points are its own statements and the rest belongs to 6 function items inside it that branch (socketOnData, a function literal at line 3619, a function literal at line 3562, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":3510}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bde0c3d701363bc1b4f4927493b113358638f6a717d1207dd5b5d0fe97197f"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffieHellmanImpl.constructor (cognitive 32): DiffieHellmanImpl.constructor has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 7 (nesting depth added 6). 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":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"04360224fabcec11a961a6a9f1f20226f556443e59a2d7d47883c1b0b73ebaf1"}},{"ruleId":"D2","level":"warning","message":{"text":"comparisons.mapEquiv (cognitive 32): comparisons.mapEquiv has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 4, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa1bfb0d311f06515e9103bf0ab16a0b80ed6f733f3bb4c53f6828606827bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"querystring.stringify (cognitive 32): querystring.stringify has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 2 (6 pts), boolean chains 2, ternaries 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":"ext/node/polyfills/querystring.js"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f190d6eee27e8ab9f2d98ac662c20224846260d02392e74e6fbad248ece6f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"REPLServer.constructor::defaultEval (cognitive 32): REPLServer.constructor::defaultEval has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, error handling 1 (3 pts), loops 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. This shape REPEATS in the file: 5 other methods here (REPLServer.constructor, REPLServer.constructor::_doComplete, REPLServer.constructor::_doComplete::completionGroupsLoaded, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cf539adcfd0d77e4f1ee0da1b4848de46f4ae8b69a903cd626d2a09404d622"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent (cognitive 32): Agent has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 16, if/else 13 (15 pts), ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 14 of the 32 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 185, 214). 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":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"016ec04eccd5b4789558d60ba303cadae0e3969073beb5efa2cfbe996c411a57"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionEntryDetails::as_completion_item (cognitive 31): CompletionEntryDetails::as_completion_item has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":3992}}}],"partialFingerprints":{"codehealthFindingId/v1":"429fc508d98078f10dc1e7f40eb9c82f90d2317e062114351895877eae1fa2d2"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoCompileBinaryWriter::fill_npm_vfs (cognitive 31): DenoCompileBinaryWriter::fill_npm_vfs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 17). Of this number, 30 points are the body\u0027s own statements and 1 belongs 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":"cli/standalone/binary.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"c093b14a0cb94a39c0c1b29bb48b1915dfdfea0f0956e64de324dfdffcdb8584"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDiagnosticsCollector::collect_diagnostics_for_graph (cognitive 31): GraphDiagnosticsCollector::collect_diagnostics_for_graph has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (8 pts), boolean chains 2, match/switch 1 (2 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":"cli/tools/publish/graph.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b318585da9fbd1bfd93ee309d7a7f59ede1b736a51c04417f8c882efefa6108d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::resolve_flags_and_init (cognitive 31): deno::resolve_flags_and_init has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 4 (8 pts), boolean chains 2 (nesting depth added 9). 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":"cli/lib.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"8787cf8de4d33c9be0efaae2a552e9fcab2be72fe857fb2599dfe0b437e33c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::tsc::parse_code_actions (cognitive 31): deno::lsp::tsc::parse_code_actions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (5 pts) (nesting depth added 19). 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":"cli/lsp/tsc.rs"},"region":{"startLine":3622}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac011b557e519cb56ef69a324c6a985c1037f2f53e7d56dfef3fb7e732e5f42"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::tsc::get_parameters_from_parts (cognitive 31): deno::lsp::tsc::get_parameters_from_parts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":3919}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8de2ff760c3e7fd71e9c7dd66759fbd4e8a78fb333fa0c7112c0e7bdbc8f5c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::local::sync_types_command (cognitive 31): deno::tools::installer::local::sync_types_command has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 4 (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":"cli/tools/installer/local.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7009ddde07d2623e367d274545a4f9453aa35e7de53a470f06de06be747aff6d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::repl::run_json (cognitive 31): deno::tools::repl::run_json has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 19). 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":"cli/tools/repl/mod.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e2917812d1a5c59ed81a705f01c1ad25359496abc8af7e2f0622938bf448fa"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tsc::load_for_tsc (cognitive 31): deno::tsc::load_for_tsc has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 4 (8 pts) (nesting depth added 12). Of this number, 30 points are the body\u0027s own statements and 1 belongs 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":"cli/tsc/mod.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"862e1a2732520a3369c44ba7548ffb8480e7e7d4d5badf328ebfa7b94a99d3b0"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::util::file_watcher::watch_recv (cognitive 31): deno::util::file_watcher::watch_recv has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (8 pts), match/switch 3 (8 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":"cli/util/file_watcher.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a360aed170a50eeac657fdda3935b572d7f1230fa6a493685999e785a667b83e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::http2::session::on_frame_recv_callback (cognitive 31): deno_node::ops::http2::session::on_frame_recv_callback has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbba06e199a89abc904721dfc121e5f47a3ee7e9fb5e98b4999c5a066c5d422"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::udp::resolve_ipv6_interface (cognitive 31): deno_node::ops::udp::resolve_ipv6_interface has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 21). 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":"ext/node/ops/udp.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc0347f415d6bf0fbeb121efe7d9fe566d86af70e21e587a555d133da2c550a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cache_dir::local::url_to_local_sub_path (cognitive 31): deno_cache_dir::local::url_to_local_sub_path has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, match/switch 4 (7 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 5 function items inside it that branch (short_hash, should_hash_part, has_forbidden_chars, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cache_dir/local.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4259377955735de00164c8051a380254f614739066fcb262fd7270dee7ef8c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::completions::get_candidates (cognitive 31): deno_cli_parser::completions::get_candidates has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 8, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/completions.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0efb553bed40911d6a06256f8c269aeba4a608cbf2343b8988f638375a980e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::parse::parse_long_flag (cognitive 31): deno_cli_parser::parse::parse_long_flag has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, loops 1 (4 pts), match/switch 3 (4 pts) (nesting depth added 11). 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/cli_parser/src/parse.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"8750c52f98035dc9e2cfa17a28094202569462580fd82a6980a39b7beaac0a16"}},{"ruleId":"D2","level":"warning","message":{"text":"RecursiveModuleLoad::register_and_recurse_inner (cognitive 31): RecursiveModuleLoad::register_and_recurse_inner has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (7 pts), loops 3 (5 pts), boolean chains 4 (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":"libs/core/modules/recursive_load.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c69790811b489af5440988db5614654dd9cda06701ee713111b2a14f289a3b0"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm_installer::local::remove_stale_member_symlinks (cognitive 31): deno_npm_installer::local::remove_stale_member_symlinks has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/local.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9ee5fe94c2736df34e4e7c76b392e765633194a55c54e34ae3e347b8fd440e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ops::op2::object_wrap::generate_impl_ops (cognitive 31): deno_ops::op2::object_wrap::generate_impl_ops has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 1, match/switch 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":"libs/ops/op2/object_wrap.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7028865c3cd414ade20ecef0af72ced8d42e684de455c92c74f07193f9ac55b2"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ops::op2::signature::parse_generics (cognitive 31): deno_ops::op2::signature::parse_generics has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/signature.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bc9999105dec6757ebe7132b1c7a6ad7360b84b6a058d2c3ab6cc1961b7e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmReqResolver::resolve_if_for_npm_pkg (cognitive 31): NpmReqResolver::resolve_if_for_npm_pkg has cognitive complexity 31 (threshold 15). Drivers by points: if/else 3 (15 pts), match/switch 6 (15 pts), boolean chains 1 (nesting depth added 21). 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/resolver/npm/mod.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11ba92a98c9683a095320bc57f523ce4c7f8f306493e5a12b84e880a190d3fc"}},{"ruleId":"D2","level":"warning","message":{"text":"01_require.Module.load (cognitive 31): 01_require.Module.load has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (20 pts), error handling 2 (6 pts), boolean chains 3, loops 1 (2 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0bec46ffca72ff311b1bc8210cdd5dcb381b9df9851009b28f690679644f96"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket.send (cognitive 31): Socket.send has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22 (28 pts), boolean chains 3 (nesting depth added 6). 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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd477ab6b06e1fe369cb9f1a77438b41c6b1e467c7217473adb3f4ca752f280"}},{"ruleId":"D2","level":"warning","message":{"text":"comparisons.partialObjectSetEquiv (cognitive 31): comparisons.partialObjectSetEquiv has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 1 (nesting depth added 21). 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b47f1f324ac79f067919a0e0dafa604555aed661bb89ae3ee02ba9c0682e69d"}},{"ruleId":"D2","level":"warning","message":{"text":"REPLServer.constructor (cognitive 31): REPLServer.constructor has cognitive complexity 31 (threshold 15). Drivers by points: if/else 106 (159 pts), boolean chains 56, error handling 7 (19 pts), loops 8 (18 pts), ternaries 9 (13 pts), match/switch 1 (2 pts) (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 5 other methods here (REPLServer.constructor::defaultEval, REPLServer.constructor::_doComplete, REPLServer.constructor::_doComplete::completionGroupsLoaded, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cad02966a212430f1984db1b6a610ccd973da8dc57a001d4408a3ced52653b"}},{"ruleId":"D2","level":"warning","message":{"text":"_duplexify (cognitive 31): _duplexify has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 11). Most of this is not in the body itself: 4 of the 31 points are its own statements and the rest belongs to 11 function items inside it that branch (_read, _destroy, onfinished, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/duplexify.js"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7338a14b10df8deb69e3d52f2fe52bd842272422c187f3fb979609e40bb70d57"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::registries::get_completion_type (cognitive 30): deno::lsp::registries::get_completion_type has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (27 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/registries.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5e6035908ab6f610aeef23bbf2b151357484af6e7f6177509416fb031391af"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::testing::execution::as_queue_and_filters (cognitive 30): deno::lsp::testing::execution::as_queue_and_filters has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (3 pts), boolean chains 2 (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":"cli/lsp/testing/execution.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aeee94a3c46ba09051ab4215db1478431974902d0626b91173d13c0c9f62ce"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::tsc::find_mergeable_named_import (cognitive 30): deno::lsp::tsc::find_mergeable_named_import has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 2 (3 pts), boolean chains 2 (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":"cli/lsp/tsc.rs"},"region":{"startLine":3749}}}],"partialFingerprints":{"codehealthFindingId/v1":"05abe22e4535d3bec71195005c10c3c34ef398adeaee69f895655871d2e582d9"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::standalone::virtual_fs::vfs_as_display_tree (cognitive 30): deno::standalone::virtual_fs::vfs_as_display_tree has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (18 pts), match/switch 7 (8 pts), loops 4 (nesting depth added 3). Most of this is not in the body itself: 10 of the 30 points are its own statements and the rest belongs to 8 function items inside it that branch (analyze_dir, file_size::add_offset_to_size, dir_size, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/standalone/virtual_fs.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b28044815a98ab028dec42b81cdfae576519cbe384dc1f3efaab57b547d2a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::coverage::cover_files (cognitive 30): deno::tools::coverage::cover_files has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 6 (12 pts), boolean chains 3, loops 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":"cli/tools/coverage/mod.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b442c3e62e8cbb82cdffd234d8767565f85b6d484182ed7208cfa1bb0c084af"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::npm_compat::generate_npm_cache_projects (cognitive 30): deno::tools::installer::npm_compat::generate_npm_cache_projects has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 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":"cli/tools/installer/npm_compat.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b064d4f8f0a6e8b1688ca874ea32835ec4b53f92748b4deda58ab891e43257f1"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::task::execute_script (cognitive 30): deno::tools::task::execute_script has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/task.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"93becfed6bd426573a2af5443e792ce7899c4047b64d4dc591934a14e8215577"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::type_checker::get_leading_comments (cognitive 30): deno::type_checker::get_leading_comments has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (11 pts), match/switch 1 (2 pts), boolean chains 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":"cli/type_checker.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c5ffc3c68669db00e832f663f538e63d4c737e2f46867e3ebafc414b0345e7"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::derive_bits_sync (cognitive 30): deno_crypto::derive_bits_sync has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 7 (15 pts) (nesting depth added 17). 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":"ext/crypto/lib.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbd89d0a4507b9d6ebe09d6f59f122e759a069971835e2b0d5c0b6731028374"}},{"ruleId":"D2","level":"warning","message":{"text":"ProxyConnector::call (cognitive 30): ProxyConnector::call has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 2 (5 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":"ext/fetch/proxy.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"364b46f31b7adbbc2f5db62c89f64fb732c1fce818d533ab5b9e9b143c075d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::error_fmt::improve_stack (cognitive 30): deno_web::console::error_fmt::improve_stack has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (6 pts), boolean chains 4 (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":"ext/web/console/error_fmt.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ce395c90ed34e58258b919dc9a18f055e063ba97b0a57038842724a4835608"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::format_special_array (cognitive 30): deno_web::console::inspect::format_special_array has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":3028}}}],"partialFingerprints":{"codehealthFindingId/v1":"482b12f0248b40dcb8df96c319a33db822a61485b523c8d2ce0765c0e8856a02"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::stream::uv_try_writev (cognitive 30): deno_core::uv_compat::stream::uv_try_writev has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), match/switch 2, boolean chains 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":"libs/core/uv_compat/stream.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ebe43a47d7e10c7f3052c1c076af5e1b83ee7dae2bc5bd44b30bf892a6dadf"}},{"ruleId":"D2","level":"warning","message":{"text":"CjsModuleExportAnalyzer::resolve (cognitive 30): CjsModuleExportAnalyzer::resolve has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/analyze.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fb8da3c93e3b57b7c1e16e485a91c33623240e4e067404202a4ac57c37127c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::yarn_lockfile_import::yarn_lock_to_deno_lock_v5 (cognitive 30): deno_resolver::yarn_lockfile_import::yarn_lock_to_deno_lock_v5 has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 4 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/yarn_lockfile_import.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a42d1d2ebdc34228d08f598c995443f9a6a80537f60eb49ef34d42dff3300f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::yarn_lockfile_import::parse_yarn_v1 (cognitive 30): deno_resolver::yarn_lockfile_import::parse_yarn_v1 has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 2 (7 pts), boolean chains 1, loops 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":"libs/resolver/yarn_lockfile_import.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b528a4023fab435bd0cd0440052a49fbce83f029242e62ee92ee1c3808acbf7f"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_proxy.shouldBypassProxy (cognitive 30): _http_proxy.shouldBypassProxy has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 5, loops 1, ternaries 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":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bec8518041eed9322e1c17dfed65d9b7d07834e4b98fcd8a79b8bd4fa572611"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.createIpcHandle (cognitive 30): child_process.createIpcHandle has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 4 (9 pts), error handling 2 (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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f156b30fb95e0156c7f4feb417a7f6c43285f13b6a32b5807d8c56a1e300c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.setupChannel::readLoop (cognitive 30): child_process.setupChannel::readLoop has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f5595e9b37afe8f0122a133334962666f8163efc7787cadd90080d86e34a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretKeyObject.toCryptoKey (cognitive 30): SecretKeyObject.toCryptoKey has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 5, ternaries 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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c40b19e0196a757152a188c0975b4828f8b71e74796cd662141e795989723c4"}},{"ruleId":"D2","level":"warning","message":{"text":"net._createServerHandle (cognitive 30): net._createServerHandle has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 5, error handling 1 (2 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":"ext/node/polyfills/net.ts"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"59faba61817262ee7c829d65d852565b5c7da19b4445e05662d7b18ae894909b"}},{"ruleId":"D2","level":"warning","message":{"text":"testing.runTapEntry (cognitive 30): testing.runTapEntry has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 3 (7 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 10). Of this number, 28 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d920c8345feb4dffcd080a7ee44b654e6fe307589aba18718a824e2ce9dc3c"}},{"ruleId":"D2","level":"warning","message":{"text":"decode (cognitive 30): decode has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 9 (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":"ext/web/08_text_encoding.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4290af31898a431af72389336c3e4519f7dff05bfcf76246bbd72cf379c15133"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskRunner::run_tasks_in_parallel (cognitive 29): TaskRunner::run_tasks_in_parallel has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/task.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"020b31eecfd28ff24f71147557c737ef91ddd8cd33999ca4ed78fdb0154e1c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchEnvTracker::load_env_file_inner (cognitive 29): WatchEnvTracker::load_env_file_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (22 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 20). 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":"cli/util/env.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"625490cee391ca85847476e2c791a8819d527c35a9172f2a374369f54d260f33"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop::apply_desktop_config_to_flags (cognitive 29): deno::tools::desktop::apply_desktop_config_to_flags has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f020dac5f0e687374cb65fd4d98e76df632f77723b832e3e046a4d09b930fa55"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::publish::collect_excluded_module_diagnostics (cognitive 29): deno::tools::publish::collect_excluded_module_diagnostics has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (6 pts), match/switch 2 (4 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":"cli/tools/publish/mod.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d81444cf4b785bda92cf9b5d552a6598cf64e45752733b22726986ac3480c65"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::repl::editor::highlight_line (cognitive 29): deno::tools::repl::editor::highlight_line has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 5 (12 pts), boolean chains 2, loops 1 (nesting depth added 17). 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":"cli/tools/repl/editor.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"99de0f8cd23761a6bac0635c30c9cf1bb62f709d3e3d52aac83d2ec0d74d5f48"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalCronHandler::cron_loop (cognitive 29): LocalCronHandler::cron_loop has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (3 pts), match/switch 1 (2 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":"ext/cron/local.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5214966ba1634547b08e40e27c98fd0ca84e83845cd8518197e31e673b72198"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSWrapInner::dispatch_clear_out_callbacks (cognitive 29): TLSWrapInner::dispatch_clear_out_callbacks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28cc8ec936a3f9023c68b03291fa1501883869ec49ac987cf4c3af9ef2bea19"}},{"ruleId":"D2","level":"warning","message":{"text":"WasiContext::fd_write (cognitive 29): WasiContext::fd_write has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (8 pts), match/switch 3 (6 pts) (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":"ext/node/ops/wasi.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ad6bbcad2c4ed6c3e6eef09303c132f478d0b7a4cbfd39cf0cf2caa8bf2b05"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::assert::get_first_expression (cognitive 29): deno_node::ops::assert::get_first_expression has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 1, 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":"ext/node/ops/assert.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"187d12224ddae297fb212c6ff2ca3f7353a5ab90a1be213cdb06e30e42524ea6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::format_primitive (cognitive 29): deno_web::console::inspect::format_primitive has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a40024401600156db3cf82aff6f2c6ce56b70b39c45018a606099379193595a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::parse::resolve_subcommand (cognitive 29): deno_cli_parser::parse::resolve_subcommand has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 5, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/parse.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"87591e68e327bc103ec3f66d57119f6e859234b81acbb505249bbe5338afc89b"}},{"ruleId":"D2","level":"warning","message":{"text":"UvLoopInner::has_alive_handles (cognitive 29): UvLoopInner::has_alive_handles has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 7, loops 7 (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/core/uv_compat.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0408e222bd756a0c8617a2a7040804795640c9e142d6d12d498243bc78934f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::error::format_frame (cognitive 29): deno_core::error::format_frame has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4 (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":"libs/core/error.rs"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33e60786b2f785e616fa6a388f252ace1708d005cfd57fa0b8130953774556d"}},{"ruleId":"D2","level":"warning","message":{"text":"EszipV2::from_graph::visit_module (cognitive 29): EszipV2::from_graph::visit_module has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (7 pts), match/switch 4 (7 pts) (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. This shape REPEATS in the file: one other method here (EszipV2::from_graph) 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":"libs/eszip/v2.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"34200a189aa1439d4294233fb000543866c3f57849e6222aaf6f6a06c4ced89d"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedConn::poll_next_request_with (cognitive 29): SharedConn::poll_next_request_with has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dc4414de1e49c1b707e7f24976b63e16f5190f06ecbb15953bdb6bcb904b49"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ops::op2::dispatch_fast::generate_dispatch_fast (cognitive 29): deno_ops::op2::dispatch_fast::generate_dispatch_fast has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24, boolean chains 4, match/switch 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":"libs/ops/op2/dispatch_fast.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"208b76fad6a1b3352ba42fe68b065a189ef62db415f957b13125b396eaa243b7"}},{"ruleId":"D2","level":"warning","message":{"text":"00_serve.mapToCallback.mapped (cognitive 29): 00_serve.mapToCallback.mapped has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (24 pts), error handling 2 (3 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":"ext/http/00_serve.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"355251ca5041b48a084a6154a8c3e6ad0d2e0572a2a2f63e9fa6823a1b521e69"}},{"ruleId":"D2","level":"warning","message":{"text":"00_serve.serveInner (cognitive 29): 00_serve.serveInner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (20 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 7). Most of this is not in the body itself: 11 of the 29 points are its own statements and the rest belongs to 4 function items inside it that branch (onListen, a function literal at line 1364, a function literal at line 1319, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/00_serve.ts"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9b47056619889932fc6cdcce4471c368ae47ba2cb89a26f061549b14ea9c05"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.getIpcHandleInfo (cognitive 29): child_process.getIpcHandleInfo has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 3 (6 pts), boolean chains 5 (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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a633343c883d52aa5704ccc6ee0edf7d1627b6444c2abacbc5130302d104908"}},{"ruleId":"D2","level":"warning","message":{"text":"EventTarget.[kHybridDispatch] (cognitive 29): EventTarget.[kHybridDispatch] has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 10). Of this number, 28 points are the body\u0027s own statements and 1 belongs 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":"ext/node/polyfills/internal/event_target.mjs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ccb520a97b942dce91a854dd70242d33c4bb2922f1d98568381f1d071745d1"}},{"ruleId":"D2","level":"warning","message":{"text":"net._setupListenHandle (cognitive 29): net._setupListenHandle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/net.ts"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"120e5cd43175b9cc0407a4e9748725f13c6562b29b83cbcbb5647d310b1fd91c"}},{"ruleId":"D2","level":"warning","message":{"text":"REPLServer.createContext (cognitive 29): REPLServer.createContext has cognitive complexity 29 (threshold 15). Drivers by points: error handling 5 (12 pts), if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). Of this number, 26 points are the body\u0027s own statements and 3 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d247f413e1247f68391ad112e5a271229c162a6189b2bf9bd8df947cb0fb18e"}},{"ruleId":"D2","level":"warning","message":{"text":"Event.composedPath (cognitive 29): Event.composedPath has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 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":"ext/web/02_event.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"475dae1cc38d7b2609bc5fdeef5acb0f4727f34b19676f27a6d82fc47c41869f"}},{"ruleId":"D2","level":"warning","message":{"text":"02_event.innerInvokeEventListeners (cognitive 29): 02_event.innerInvokeEventListeners has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/02_event.js"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fd96750f32360e377aa24bfad9da685ea90d742fc552fcf44036a027114411"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocket.[_eventLoop] (cognitive 29): WebSocket.[_eventLoop] has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), error handling 1 (4 pts), ternaries 1 (3 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/01_websocket.js"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"3494f4a7fd35dfd9643a1e6b42c48782dd0ffe3b865f2acbd16c1d471ae2054b"}},{"ruleId":"D2","level":"warning","message":{"text":"02_timers.listOnTimeout (cognitive 29): 02_timers.listOnTimeout has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/02_timers.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e41168968d24fd911e512ee811859f6028af573b35405c1ac75bc63d28514e0"}},{"ruleId":"D2","level":"warning","message":{"text":"parseMappings (cognitive 29): parseMappings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 5, ternaries 1 (5 pts), loops 1 (nesting depth added 15). 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd3dcf408ae4bdaac27f51591fb52cbceef3df3090556cc5ef9fe19fc762730"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 29): (computed) has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), error handling 1 (4 pts), ternaries 1 (3 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/01_websocket.js"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"85128045369d3ae2c2cbc1631c75a5af2e1eecf9bc551165f9f60fd774dfc286"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 29): (computed) has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 10). Of this number, 28 points are the body\u0027s own statements and 1 belongs 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":"ext/node/polyfills/internal/event_target.mjs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"892026585f2afa2163e860cdfe7cac1a5b4af692ceef5a6d24d8dae7a2bc9805"}},{"ruleId":"D2","level":"warning","message":{"text":"startOverrideListener (cognitive 29): startOverrideListener has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 6 (11 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 12). Most of this is not in the body itself: 2 of the 29 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 534, 552, 574, \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":"ext/node/polyfills/internal/http/address_override.js"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"044ed4a633f40efd0642dc6eabb86c82c0e951ea9b135b2212698483321aa465"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceSettings::from_raw_settings (cognitive 28): WorkspaceSettings::from_raw_settings has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 1 (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 2 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":"cli/lsp/config.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cf5fa0ff551316922c8d3c08aba3f3bfd04f10d1ccff229407e0547a9e034c"}},{"ruleId":"D2","level":"warning","message":{"text":"NavigationTree::collect_document_symbols (cognitive 28): NavigationTree::collect_document_symbols has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (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":"cli/lsp/tsc.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"f247ff6739f623ce2ebd431da7c671b8321496b1f5bc28d443754fc367f3bbad"}},{"ruleId":"D2","level":"warning","message":{"text":"CliModuleLoader::prepare_load (cognitive 28): CliModuleLoader::prepare_load has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 5 (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":"cli/module_loader.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab2056fb414bafd2a5bfc134637449e86f997f16f377be7adab1b68252253a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Transform::visit_mut_program (cognitive 28): Transform::visit_mut_program has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 7 (22 pts), if/else 2 (4 pts), loops 1 (2 pts) (nesting depth added 18). 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":"cli/util/extract.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a873afdc3dbd3597ccb722989ff348ddfd54e912eb6b16a1fff3150f6c79e0"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::global::rewrite_relative_import_map_paths (cognitive 28): deno::tools::installer::global::rewrite_relative_import_map_paths has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 3 function items inside it that branch (rewrite_specifier_map, rewrite_to_absolute, rewrite_string_key). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/installer/global.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18466d311d6fc540df8d43d81638819efc6574128d38e11f7d12bbefe5902a2"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::publish::get_auth_headers (cognitive 28): deno::tools::publish::get_auth_headers has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 5 (11 pts), match/switch 2 (4 pts) (nesting depth added 16). 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":"cli/tools/publish/mod.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9bb72fcd8437cd1107a1dcb13aa99fa8fdbe930f5f48697ae35d72cd502e7f"}},{"ruleId":"D2","level":"warning","message":{"text":"denort_desktop::v8_to_laufey_value (cognitive 28): denort_desktop::v8_to_laufey_value has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt_desktop/lib.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"429b6beb7f78b080aead0597b188aaafba418e1180d5f49f5c2b89996cf87beb"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeResolver::resolve_package_target_inner (cognitive 28): NodeResolver::resolve_package_target_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2dcf0ffea395beafa67df06fedbff32bc0dc4e4a92744d00428048dca56577"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeResolver::legacy_main_resolve (cognitive 28): NodeResolver::legacy_main_resolve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"31591c66b7aa53637b64c9e83872656c6bd5c47bb1d32f44314d107db4ad563a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::pnpm_lockfile_import::collect_importer_specifiers (cognitive 28): deno_resolver::pnpm_lockfile_import::collect_importer_specifiers has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (4 pts), loops 2 (3 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":"libs/resolver/pnpm_lockfile_import.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d8811774d52138d941ec776c48b4ad5b6594d474bfb1058418a2e625b568f1"}},{"ruleId":"D2","level":"warning","message":{"text":"01_cron.cron (cognitive 28): 01_cron.cron has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 2 (5 pts), error handling 1 (2 pts) (nesting depth added 12). Most of this is not in the body itself: 8 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 165). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cron/01_cron.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"901f98443732f4629915030f07e1a9f757bc08dfbe4b55039bd6d283fa97ac74"}},{"ruleId":"D2","level":"warning","message":{"text":"TextLineStream.#handle (cognitive 28): TextLineStream.#handle has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/27_eventsource.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11f8381e467787632c12056164e5d852c4f3614e9a534d947d95aa26b88c75c"}},{"ruleId":"D2","level":"warning","message":{"text":"_events.EventEmitter.emit (cognitive 28): _events.EventEmitter.emit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (17 pts), error handling 2 (5 pts), boolean chains 4, loops 1 (2 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d086e3b2de43dc918ef9cc17ec289334e4a0cedda606f2eae4179efce52771e7"}},{"ruleId":"D2","level":"warning","message":{"text":"_tls_wrap.checkServerIdentity (cognitive 28): _tls_wrap.checkServerIdentity has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 3 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b5af35c421e0ac5d166114ae259dfd33257f147eff1a898224a14fe49c37a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Http2Stream._destroy (cognitive 28): Http2Stream._destroy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":2532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b754eb811ef5283238a91dc96c9a659d64d272805e3d5cbde8f3969865c4a6b8"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.getValidStdio (cognitive 28): child_process.getValidStdio has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c59d9363bd42a1ae9891f5d97c9f70cea6cffe5fa68c6705922b75d0ab68a2"}},{"ruleId":"D2","level":"warning","message":{"text":"util.prepareRequestHeadersArray (cognitive 28): util.prepareRequestHeadersArray has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdb382f300a98fede2a62cd0ba0c8b11795652e2a8483916259cb902271036f"}},{"ruleId":"D2","level":"warning","message":{"text":"MIMEParams.#parse (cognitive 28): MIMEParams.#parse has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/mime.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"081fbef7d6106be4ccbd7e1cc7f96f4cb6bf42bc9edfbb24ee630dbea91f5b7a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::analysis::import_map_lookup_inner (cognitive 27): deno::lsp::analysis::import_map_lookup_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 4, match/switch 1 (4 pts), loops 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":"cli/lsp/analysis.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce26d9f02dfb01d5300016d6590f273f6c3950cb4f2891cf41d10de3cd56f0e3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::testing::collectors::parse_test_context_param (cognitive 27): deno::lsp::testing::collectors::parse_test_context_param has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 3 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/testing/collectors.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f66565d5e53399ccaa0ba50e4136d72c056f4ac5b277a09a33a18c834813fd"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::coverage::ignore_directives::parse_range_ignore_directives (cognitive 27): deno::tools::coverage::ignore_directives::parse_range_ignore_directives has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/coverage/ignore_directives.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0040597bc996ddac8b7eedaf6e96f936481b2a1b6bf31ad8cb40bde83290570"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::doc::doc (cognitive 27): deno::tools::doc::doc has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/doc.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a11124418e42a8439977922186e7d614e09979e1ef1f59a0df47023cea7911"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pack::pack (cognitive 27): deno::tools::pack::pack has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f19706fb3ef6531a0bb015b6a96dae678bdfedd9db1698f207dd58cd18edc39"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedModuleLoader::load (cognitive 27): EmbeddedModuleLoader::load has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 8 (11 pts), boolean chains 1 (nesting depth added 11). 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":"cli/rt/run.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"96acec847a517438be8406bd5c20cb18e81b570af94dd92c820c6b33331eaccd"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::node_interop::build_algorithm_dict_from_v8 (cognitive 27): deno_crypto::node_interop::build_algorithm_dict_from_v8 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3 (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":"ext/crypto/node_interop.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dd3ebde66c17f993286b9f797c7fb111d14a6acfa6991448e8a1038293cf9b"}},{"ruleId":"D2","level":"warning","message":{"text":"BiPipeRead::recv_with_fd (cognitive 27): BiPipeRead::recv_with_fd has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (9 pts), match/switch 1 (2 pts), boolean chains 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":"ext/io/bi_pipe.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6785c1a98887d1d1146bb43730fdf361c78603e54fd7fe4129863e13b30574d0"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_napi::js_native_api::napi_define_class (cognitive 27): deno_napi::js_native_api::napi_define_class has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (3 pts), match/switch 2 (3 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":"ext/napi/js_native_api.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3170327692d26a593c8637f09a438985f95537a694c08654c230dc5c56f1e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Http2Settings::init (cognitive 27): Http2Settings::init has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 1 (2 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":"ext/node/ops/http2/session.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd42d2bc0725af9482a5617f14796388bbfc4a007130ff48b48f7bb06a3258d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::send_pending_data (cognitive 27): Session::send_pending_data has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (5 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1ddaf10749471371e3f83dfbf7a89b2c4849cb2c3f628e124d67ed94104728"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_process::op_spawn_sync (cognitive 27): deno_process::op_spawn_sync has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 4 (5 pts), boolean chains 3, loops 2 (3 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. This shape REPEATS in the file: one other method here (deno_process::op_spawn_sync::read_with_limit) 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":"ext/process/lib.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"261142e90b0842d7a70c018fde94c0ebaba8b78442aab7028f30129047fa95d3"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoPeriodicReader::new (cognitive 27): DenoPeriodicReader::new has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (5 pts), match/switch 2 (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":"ext/telemetry/lib.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4547617d9644ff6ff0e15a005f611922273b69c1b29df1467c9cdf021526e1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Workspace::config_folders_sorted_by_dependencies (cognitive 27): Workspace::config_folders_sorted_by_dependencies has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (7 pts), match/switch 3 (6 pts), boolean chains 5 (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":"libs/config/workspace/mod.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"027ad2d6fa2230d2d47700c8f2da9436a912a438b020094ea7ee00d8ee4ea770"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ops::op2::dispatch_slow::generate_dispatch_slow (cognitive 27): deno_ops::op2::dispatch_slow::generate_dispatch_slow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 25, boolean chains 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":"libs/ops/op2/dispatch_slow.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7f15e3349635da20aac61b51b2791837bb1a00e210ac996b432a72fd7b1ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"NetDescriptor::parse_inner (cognitive 27): NetDescriptor::parse_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 1, 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":"runtime/permissions/lib.rs"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb8320a34ac16cb9d30251af2e51bb1d6abc7c3fd44236f64265cd42068f8aa"}},{"ruleId":"D2","level":"warning","message":{"text":"26_fetch.handleWasmStreaming (cognitive 27): 26_fetch.handleWasmStreaming has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), error handling 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 1077). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d34efa59aad54a7522f6196e40b56c7ebe348927881bf84042a46271c37ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"Kv.watch (cognitive 27): Kv.watch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 14). Of this number, 25 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":"ext/kv/01_db.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"108406ea34b6e778108e16419fe8621b7d04f5b157ac2cc857f6d95276f27e32"}},{"ruleId":"D2","level":"warning","message":{"text":"_events.EventEmitter.removeListener (cognitive 27): _events.EventEmitter.removeListener has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 3, loops 1 (2 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae723911de4839dab8ae5643a7db3b396633ce4d0088c523d6eb733fdc243753"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.execFile (cognitive 27): child_process.execFile has cognitive complexity 27 (threshold 15). Drivers by points: if/else 38 (50 pts), boolean chains 9, ternaries 4 (8 pts), error handling 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. This shape REPEATS in the file: one other method here (child_process.execFile::exithandler) 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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b5c431ab4144a8acfe06f725eea97347938df1ad617632d870fdde1a6c5014"}},{"ruleId":"D2","level":"warning","message":{"text":"https.Agent.createConnection (cognitive 27): https.Agent.createConnection has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (nesting depth added 8). Of this number, 25 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":"ext/node/polyfills/https.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4248503fcf0cab1abe0f59ad7f60b3bfdd588c0be8b676a64ce225721f37e7e6"}},{"ruleId":"D2","level":"warning","message":{"text":"child.init (cognitive 27): child.init has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 5, loops 1 (nesting depth added 3). Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to 18 function items inside it that branch (onconnection, _disconnect::checkWaitingCount, _disconnect, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/child.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcef3c7a989a1dd063177b124d44cb45680bce510896573d2592a5e9d1330cc"}},{"ruleId":"D2","level":"warning","message":{"text":"comparisons.setObjectEquiv (cognitive 27): comparisons.setObjectEquiv has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2c459fc787463e6ab9378b007431b5108118cbefbb62a981d1074a4a03cd71"}},{"ruleId":"D2","level":"warning","message":{"text":"comparisons.mapObjectEquiv (cognitive 27): comparisons.mapObjectEquiv has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf38de097f2b1e65b431ef909b1b47f661154a567b707d102f4799079127b667"}},{"ruleId":"D2","level":"warning","message":{"text":"net._lookupAndConnectMultiple (cognitive 27): net._lookupAndConnectMultiple has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, loops 2 (nesting depth added 7). None of this is in the body itself: all 27 points belong to 2 function literals inside it that branch (lines 1277, 1276). 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":"ext/node/polyfills/net.ts"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"256c7b9054920504f70e3e649941cc2ba6aa49b3c430cbbcb37878b904de4ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"REPLServer.constructor::clearPreview (cognitive 27): REPLServer.constructor::clearPreview has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6 (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. This shape REPEATS in the file: 5 other methods here (REPLServer.constructor, REPLServer.constructor::defaultEval, REPLServer.constructor::_doComplete, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc96046cbb866c91b61d3938bf8b103cf8c1e0f0c763c0b36a11ff79da5369e"}},{"ruleId":"D2","level":"warning","message":{"text":"testing.run (cognitive 27): testing.run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), error handling 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 10 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/testing.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c566d709e8938acc06415f9b2cdbcbebed160ef531831e6a2c16a2ffd4a01a8"}},{"ruleId":"D2","level":"warning","message":{"text":"03_abort_signal.createDependentAbortSignal (cognitive 27): 03_abort_signal.createDependentAbortSignal has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (9 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":"ext/web/03_abort_signal.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e9c1628a45119c85fffcc9c86abd1a6a85f044631df6d9a18dc8b8ec0a17a0"}},{"ruleId":"D2","level":"warning","message":{"text":"processCallback (cognitive 27): processCallback has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 2 (nesting depth added 10). Of this number, 14 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/zlib.js"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3ea117fa4181a3b570c0d98f2054f715bc33063f6f81d30e7bcdfb76b8ea75"}},{"ruleId":"D2","level":"warning","message":{"text":"on (cognitive 27): on has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 4, loops 2 (3 pts), other 2, ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 13 of the 27 points are its own statements and the rest belongs to 12 function items inside it that branch (next, eventHandler, errorHandler, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_events.mjs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fc6419473bc14df8657a9ed1bd21df3dd399633cc9c2b2a00ed2b8afe58b27"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpClientAdapter::send_no_follow (cognitive 26): HttpClientAdapter::send_no_follow has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). Of this number, 24 points are the body\u0027s own statements and 2 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":"cli/file_fetcher.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0998e8ccf2f08a77838e1d262c764313a735ed16737a90227a6047b7bd6f0c69"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::did_change_watched_files (cognitive 26): Inner::did_change_watched_files has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, match/switch 3 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f246daac2f01733b0c66f284e54077d5cee5759ef7292642cc16984b4738da57"}},{"ruleId":"D2","level":"warning","message":{"text":"DepManager::load_latest_versions (cognitive 26): DepManager::load_latest_versions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/deps.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63c41c33ad4b8f36c197ff17738eaa8a039ffa1961744b6f694d527be0737d6"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecifierUnfurler::try_unfurl_dynamic_dep (cognitive 26): SpecifierUnfurler::try_unfurl_dynamic_dep has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (3 pts) (nesting depth added 16). 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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5971a0e87e6dc917bd784b894e6fec7c51519dd867ff6718f39640648f00e5"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::code_lens::find_test_fn_body (cognitive 26): deno::lsp::code_lens::find_test_fn_body has cognitive complexity 26 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 4 (11 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 16). 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":"cli/lsp/code_lens.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9603dbf28ad48972e2ccfe264902c32dc81588b2a52603aaf7bbcbacec15240c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::registries::validate_config (cognitive 26): deno::lsp::registries::validate_config has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (8 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":"cli/lsp/registries.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1e9ec368b82d6a4966210ce6b94eb9582b67ee81e34e4b383755edd40d3cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::standalone::native_addons::find_byonm_native_addon_packages (cognitive 26): deno::standalone::native_addons::find_byonm_native_addon_packages has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (6 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":"cli/standalone/native_addons.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d08af459e3a46079998844d205fd6b29591f692893c3d1fa5ac3f7ef78b492"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::info::info (cognitive 26): deno::tools::info::info has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 6 (10 pts) (nesting depth added 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. 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":"cli/tools/info.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e989a438f9049e9fe0aff873787fd1fa06ac86142e7a8ff2735251acde906e8"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::remove (cognitive 26): deno::tools::pm::remove has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (7 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/mod.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4ad40960276064db6a3b5a4b2f7c9de2f9a029b75fee2dff491e35138c5de7"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::publish::publish (cognitive 26): deno::tools::publish::publish has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/mod.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"779232a387169b2fd2d65921f1e9e4ea5d9c29a38a833d97a2beed3789643b53"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tsc::resolve_specifier_for_tsc (cognitive 26): deno::tsc::resolve_specifier_for_tsc has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 6 (9 pts), boolean chains 4 (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":"cli/tsc/mod.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7a98d8086521b5ef25b2f4af1f2cd4f727220aaa2c1772836f33cdb973d0d2"}},{"ruleId":"D2","level":"warning","message":{"text":"ChainSearch::extend (cognitive 26): ChainSearch::extend has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 5 (9 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4386}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce9c455c7aef9b8a371063fb79c4de128b81afd8b2861476659f93bb7c7fb2c"}},{"ruleId":"D2","level":"warning","message":{"text":"WasiContext::path_open (cognitive 26): WasiContext::path_open has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 4 (7 pts), boolean chains 4 (nesting depth added 6). 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":"ext/node/ops/wasi.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"68817c04c4e3b0ad07eb168ca751a64a8854d44fa6e69fb01927349aef13fac3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node_crypto::op_node_ecdh_compute_secret (cognitive 26): deno_node_crypto::op_node_ecdh_compute_secret has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 1 (nesting depth added 15). 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":"ext/node_crypto/lib.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"945869ebe43d7b4fbdcf073419f51e55a906a5b1c8214edee3a6168fe631abda"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSync::deserialize (cognitive 26): DatabaseSync::deserialize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"47241d6ed0c64c673bc8c20b2f21f220aa9cf58585d2db57d107c83055d4563c"}},{"ruleId":"D2","level":"warning","message":{"text":"IpcJsonStream::read_msg_and_raw_fd (cognitive 26): IpcJsonStream::read_msg_and_raw_fd has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/ipc.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dbcedd81e2ed1cccba0805c449b1f92ddf1bca886a103f8aebaecd0c7f1f52"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::get_user_options (cognitive 26): deno_web::console::inspect::get_user_options has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 5, loops 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ba1577ba45090e9d569d31d638a32c0b7af3356444c6b5093ce530ddefcb47"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::tcp::uv_listen (cognitive 26): deno_core::uv_compat::tcp::uv_listen has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 4 (12 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tcp.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9068fe7e922ce61534d2e10417232607fdb59366ab3270a8b017da8f8f81793f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesVersions::map (cognitive 26): TypesVersions::map has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dd772e2077fab90679b06808a20a5c62bb6a69cfaf5c3b7531ac47cb01ef39"}},{"ruleId":"D2","level":"warning","message":{"text":"PackumentIndexer::on_operator (cognitive 26): PackumentIndexer::on_operator has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). 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":"libs/npm/fast_registry_json.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f1b0a716666c7096daf516599ac3b01df5393775221c869dbb77682ac48544"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDependencyResolver::apply_dedup_mappings (cognitive 26): GraphDependencyResolver::apply_dedup_mappings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 6 (10 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":"libs/npm/resolution/graph.rs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"48302981748de55a53ee4a0df8be7d7857e0950cf2a418db01966e5f81c97af4"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ops::op2::dispatch_async::generate_dispatch_async (cognitive 26): deno_ops::op2::dispatch_async::generate_dispatch_async has cognitive complexity 26 (threshold 15). Drivers by points: if/else 23, boolean chains 3. 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":"libs/ops/op2/dispatch_async.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71e861e7fe9f50e0fd46ed1cd2035bec55d1b6a604a5f9b2d8fa16bd189cef2"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_client.onSocketNT (cognitive 26): _http_client.onSocketNT has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 8 (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8c647a2edec1e4f49f52a98813c4bc740903e711c2c666013ac8090330c6e5"}},{"ruleId":"D2","level":"warning","message":{"text":"_tls_common.getProtocolRange (cognitive 26): _tls_common.getProtocolRange has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 4 (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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"df031148c9e336a76edb0f1de053688932f42a1cdb5ddf3692b0762d1901a9a6"}},{"ruleId":"D2","level":"warning","message":{"text":"net._afterConnectImpl (cognitive 26): net._afterConnectImpl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 6 (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":"ext/node/polyfills/net.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc437a9741327b38ce4007f014c4514f4c7f219fc518f1cd06b85116162ab5ce"}},{"ruleId":"D2","level":"warning","message":{"text":"testing.mockModule (cognitive 26): testing.mockModule has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4, loops 1 (2 pts), ternaries 2 (nesting depth added 5). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":3347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eeba2782917629624ddd1405355b7d5227a199ca2b131f08be478e495991cc"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrapWorkerRuntime (cognitive 26): bootstrapWorkerRuntime has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 2 (4 pts), loops 1 (2 pts), other 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/99_main.js"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9caad19eab89195e95c7e0042676cdf966166d85e3ca29d834c55b0fba9a8bde"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 26): constructor has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, other 4, loops 1 (2 pts), ternaries 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":"ext/web/02_event.js"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49d975b89b2e3d6ae1713bdd34c3e9c56896da181c14402f40f9a2ec2e22e7f"}},{"ruleId":"D2","level":"warning","message":{"text":"httpRedirectFetch (cognitive 26): httpRedirectFetch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, loops 2 (4 pts), other 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":"ext/fetch/26_fetch.js"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"e206e9b10dd6baa01eab8663f4d21c88b6d19e64501893b150ea2ed8b4a5c8d3"}},{"ruleId":"D2","level":"warning","message":{"text":"styleText (cognitive 26): styleText has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, loops 2, other 2, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"02da54d169ed82b79aff6abdbff6fffd7a49c1094d36f01405c7815e4ce8a0df"}},{"ruleId":"D2","level":"warning","message":{"text":"measure (cognitive 26): measure has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 10, other 1, ternaries 1 (nesting depth added 2). 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":"ext/web/15_performance.js"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc238318abb0c11ce3481dbf6146f91d0123f19a776d9317dfbefcf97048443"}},{"ruleId":"D2","level":"warning","message":{"text":"addRequest (cognitive 26): addRequest has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 5, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 5). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"033519686fa5ff662304eea94d8a7b7a2eda3db4f388110f902c306ddc141fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"printMyersDiff (cognitive 26): printMyersDiff has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/myers_diff.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6993a428dc6ee76547c15812a3e5ec7cdf5dbd9f95334caa91530e1bbb9270eb"}},{"ruleId":"D2","level":"warning","message":{"text":"TsServer::provide_references (cognitive 25): TsServer::provide_references has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 16). 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":"cli/lsp/ts_server.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb2b7f58a58e30a4cc8ceb3ece5fa1c4f39ac116e20acbee9c7a7c25554693d"}},{"ruleId":"D2","level":"warning","message":{"text":"DrawThread::maybe_start_draw_thread (cognitive 25): DrawThread::maybe_start_draw_thread has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (5 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":"cli/util/draw_thread.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c31985b6b8b4d2ec9dc697cb00de7fca2d578c8764275c13c8e78138e764ca"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::tsc::get_tag_documentation (cognitive 25): deno::lsp::tsc::get_tag_documentation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"873ebca6d084a956b9f12207ed16834edf20ee64881140529198829b510e6e54"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::bump_version::parse_commit (cognitive 25): deno::tools::bump_version::parse_commit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 6). 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":"cli/tools/bump_version.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"d731f249c794e1dc1ed7fa7d8820d5a09681515b501829e2e538411c1beb31ec"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::bundle::prepare_inputs (cognitive 25): deno::tools::bundle::prepare_inputs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 6 (12 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c976ecfbe4512f38e6b2ed38d569544d3e136de988ea6b86d9f19250d2ed67"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::framework::strip_comments (cognitive 25): deno::tools::framework::strip_comments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (9 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/framework.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"a421ed8afeca4065574d226a6aa6ac8065d31fb56ab11f9387c8ec91a65b9f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::upgrade::try_delta_upgrade (cognitive 25): deno::tools::upgrade::try_delta_upgrade has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/upgrade.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34a2fdce719fd54f7a1ae8576ab24faad6fb4557d5c83a08b0dde316f119cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::ipc::impl_::serialize_v8_value (cognitive 25): deno_node::ops::ipc::impl_::serialize_v8_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/ipc.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a531abff5ee96ba5be447bbbe24cb5fa6a8aaaefec91e80c664c7abdb79b875"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalCacheManifest::insert_data (cognitive 25): LocalCacheManifest::insert_data has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cache_dir/local.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"797e268572b578d4d29a2796ba76a6eee426e446ca616be4dc8ad56d9f2c0dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::convert::permission_args_parse (cognitive 25): deno_cli_parser::convert::permission_args_parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 24, boolean chains 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":"libs/cli_parser/src/convert.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"03898f0766b7043d661f9474a9df3ca3220971ff53aed2e0b52571bfaeb502a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigFile::to_exports_config (cognitive 25): ConfigFile::to_exports_config has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (validate_key, validate_value). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/mod.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75904cfa07c81fb78dc70fe868c283af1443f1177789c47e2076e36fc36d78a"}},{"ruleId":"D2","level":"warning","message":{"text":"JsRuntimeInspector::capture_network_event (cognitive 25): JsRuntimeInspector::capture_network_event has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/inspector.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce37ad8aca537db3ec32524097d0b8f0d49dacd39c6c62018f3a8bea2ac72cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::stream::uv_writev_owned (cognitive 25): deno_core::uv_compat::stream::uv_writev_owned has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 15). 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/core/uv_compat/stream.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"c645db2ce4d377dd6ccc9625c2d2e790c99b775949ac1f4270826a6d0a4ad8d3"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDependencyResolver::auto_install_missing_peers (cognitive 25): GraphDependencyResolver::auto_install_missing_peers has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (5 pts), match/switch 2 (4 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":"libs/npm/resolution/graph.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a36af2be2ad8afbb2c3c27e04f48c8fd8680e0019e63c90f9420a14a143ad25"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm_installer::local::cleanup_unused_packages (cognitive 25): deno_npm_installer::local::cleanup_unused_packages has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/local.rs"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e565dcf2d88c19f9fdd735ffb3661f467668497493b078dcaab891d6adcdbafc"}},{"ruleId":"D2","level":"warning","message":{"text":"Flags::parse (cognitive 25): Flags::parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21 (22 pts), match/switch 1 (2 pts), boolean chains 1 (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":"libs/ops/op2/config.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a34589de873f5f5b73c2ece7b49df3985660cdce47623b12db3ba38b0a2ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"IsCjsResolver::check_based_on_pkg_json (cognitive 25): IsCjsResolver::check_based_on_pkg_json has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 3 (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":"libs/resolver/cjs/mod.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61d6c84efe6d366d4fa2b2020088b182a4e7431f181a212ff3594441a78afd6"}},{"ruleId":"D2","level":"warning","message":{"text":"ByonmNpmResolver::resolve_pkg_json_and_alias_for_req (cognitive 25): ByonmNpmResolver::resolve_pkg_json_and_alias_for_req has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 5, loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ByonmNpmResolver::resolve_pkg_json_and_alias_for_req::resolve_alias_from_pkg_json) 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":"libs/resolver/npm/byonm.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f81457b9746b9e77bed9afe314ae24accbdbf86940fc2ee6159e9414d91323"}},{"ruleId":"D2","level":"warning","message":{"text":"TtyPrompter::prompt (cognitive 25): TtyPrompter::prompt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (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":"runtime/permissions/prompter.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce8e2bdf937a604416951feecb0ebe679e013c85a6b7abbb4b678c6bb5cde7f"}},{"ruleId":"D2","level":"warning","message":{"text":"00_serve.fastSyncResponseOrStream (cognitive 25): 00_serve.fastSyncResponseOrStream has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/00_serve.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b0758e5ad8aa4e9accfab744539b0e92f8fc5f1c688fffb533e0fff1d9022b"}},{"ruleId":"D2","level":"warning","message":{"text":"_events._listenerCount (cognitive 25): _events._listenerCount has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (4 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 15). 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81421395e18ab94eef14b8d77e27167668cf0a2b0c82f9d5f2f73a701bb5f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_agent.Agent.removeSocket (cognitive 25): _http_agent.Agent.removeSocket has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). Of this number, 22 points are the body\u0027s own statements and 3 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":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c92c38ff173f829d09bda5c7d55a4cd8225de35dded18b52e4fd9a1473a40cb"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_client.parserOnIncomingClient (cognitive 25): _http_client.parserOnIncomingClient has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 6, ternaries 1 (2 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94645bff6c809eb98c6a90192de903eeb7385ef5ff7b4c866fb180b14e5482a"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_outgoing.write_ (cognitive 25): _http_outgoing.write_ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 4 (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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"88301f15d451db87e6a13e56aa6f166ca4201d66040dfcd4f26a492f3226e50f"}},{"ruleId":"D2","level":"warning","message":{"text":"assert.ifError (cognitive 25): assert.ifError has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (4 pts), boolean chains 3 (nesting depth added 13). 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":"ext/node/polyfills/assert.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb66bece1b35d21a3d5c259676288e0f8fafe4d681b82c582c74ca239362223b"}},{"ruleId":"D2","level":"warning","message":{"text":"http2.processRespondWithFD (cognitive 25): http2.processRespondWithFD has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6, ternaries 4, error handling 2 (nesting depth added 1). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 6 function items inside it that branch (readAndWrite, a function literal at line 2872, closeOwnedFd, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":2795}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21e028b6eab2b5967721f99a2b8eb895820cff84af183b37d7d14c1a1c0549f"}},{"ruleId":"D2","level":"warning","message":{"text":"keys.parseKeyEncoding (cognitive 25): keys.parseKeyEncoding has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6 (nesting depth added 10). 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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"692f96d6c05c311c7070de4adf8fbfced113ddbb9d746a497cf663acbdd8bed0"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect.inspect (cognitive 25): inspect.inspect has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"837bfa9603e8424f60842d9048984731aa5ee86bfdeb81a28669bc8dbc0bdace"}},{"ruleId":"D2","level":"warning","message":{"text":"_posix.relative (cognitive 25): _posix.relative has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 9). 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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa8f6a9fc4a618b8c28dfc2bdb89c7fa1a27b4f64cb557cfaf4ccb8cbfaedb7"}},{"ruleId":"D2","level":"warning","message":{"text":"listenerCount (cognitive 25): listenerCount has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (4 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 15). 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31e30a25aa9c6612f329bcc3189c32d8c1f1fdeb0f65a893eb0d10d8f057b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"_write (cognitive 25): _write has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 1 (3 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf6bd29149338f5f6cbbc5a881c0bf8c308ba80aef862e4c666be9ca985fa23"}},{"ruleId":"D2","level":"warning","message":{"text":"exec (cognitive 25): exec has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), ternaries 3 (4 pts), match/switch 1 (2 pts), other 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/01_urlpattern.js"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53d0ce0ca79face439fc3ef477953235a86d095b0d3a02df39c5e0348c7a2a1"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 25): constructor has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 12). Of this number, 21 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/ffi/00_ffi.js"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13eda36682571235dd50ad4c2136b91413e933d338e00fb05c4c5e699549ed6"}},{"ruleId":"D2","level":"warning","message":{"text":"parseMimeType (cognitive 25): parseMimeType has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, loops 1 (nesting depth added 8). Of this number, 24 points are the body\u0027s own statements and 1 belongs to 5 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":"ext/web/01_mimesniff.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5b4c41a00ee4cec12ba31472fde77934d69b84c670346082124269c94294bd"}},{"ruleId":"D2","level":"warning","message":{"text":"createHttpClient (cognitive 25): createHttpClient has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 5, match/switch 1 (3 pts), other 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":"ext/fetch/22_http_client.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dd278ac32bbc7b1ec6630f1fdd119da8f8fe9e576436052202844efbd7c0f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigTree::refresh (cognitive 24): ConfigTree::refresh has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/config.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5999519fcc6ac624731f95232bc6e4f184dcb7afa36d4e0c3e360234db2705"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::initialize_tunnel (cognitive 24): deno::initialize_tunnel has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 3, boolean chains 2, loops 1 (2 pts) (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":"cli/lib.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66f106376fc92bd88fb408d8e3f243d267cb3f9b81f3034011d4309fe33c973"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::compile::get_module_roots_and_include_paths (cognitive 24): deno::tools::compile::get_module_roots_and_include_paths has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 8). Of this number, 12 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/compile.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc981f0de4ddd36bae02c57b7744655f2f24b1f68fce777144c859030786a424"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop::package_linux_app_dir (cognitive 24): deno::tools::desktop::package_linux_app_dir has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 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":"cli/tools/desktop.rs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba64f1ed2a12a6983ed558417dc7d88fc5ea7909fd5327c797164f8fee1f0e3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop::codesign_macos_bundle (cognitive 24): deno::tools::desktop::codesign_macos_bundle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 3 (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":"cli/tools/desktop.rs"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff987d71b4e6b5f8f699334db16246b7dc79a0d532f1031cb63f08119aa1a11"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop::msi_sort_tables_by_string_id (cognitive 24): deno::tools::desktop::msi_sort_tables_by_string_id has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 6, boolean chains 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":"cli/tools/desktop.rs"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76603219ec20d875d9a6b885044a7e3927a1d3f03ba1079b4bd919016a1d34a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::global::setup_config_dir (cognitive 24): deno::tools::installer::global::setup_config_dir has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"cli/tools/installer/global.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"47070219811f64d69b5ae83589b12827b63023a15e0b6f74a90c749ca1ad4798"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::global::resolve_shim_data (cognitive 24): deno::tools::installer::global::resolve_shim_data has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (19 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 3). 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":"cli/tools/installer/global.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8b2f1af89e295e1afd20af2d782c2d3d92919fbd70b0d721e09f8a1b56ebdd"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::deps::add_deps_from_catalogs (cognitive 24): deno::tools::pm::deps::add_deps_from_catalogs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (7 pts), boolean chains 1, 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":"cli/tools/pm/deps.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"807519fadd02d4b779b3e40273ed65f617e8ffbc6d04af65c83af66a08352712"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::util::console::filter_destructive_ansi (cognitive 24): deno::util::console::filter_destructive_ansi has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 5, loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/console.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c14390334286a65ef00a9d747acc347a3d7093a64c00e4061fe971cf7c3ac4"}},{"ruleId":"D2","level":"warning","message":{"text":"WasiContext::fd_pread (cognitive 24): WasiContext::fd_pread has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c75e7393e257265b1b0287f6d2a502a48d47946167ca29983bc124691886f5"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::llhttp::binding::on_headers_complete (cognitive 24): deno_node::ops::llhttp::binding::on_headers_complete has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 2, match/switch 1 (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":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"332ae819e946937fc66a1007ef298da90e79c724d1b3d218a493987b60312268"}},{"ruleId":"D2","level":"warning","message":{"text":"IpcAdvancedStream::read_msg_bytes_and_raw_fd (cognitive 24): IpcAdvancedStream::read_msg_bytes_and_raw_fd has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/ipc.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2950d3c005323a386d8b1e0102d5e50e595e461573cfcbab524f15c2fba9e91"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::css::parse_css_color (cognitive 24): deno_web::console::css::parse_css_color has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 5 (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":"ext/web/console/css.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf28fc691340e931018c60d16978293623b011022dbed1c56974b658e9bc85e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::convert::serialize_command_def (cognitive 24): deno_cli_parser::convert::serialize_command_def has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, loops 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":"libs/cli_parser/src/convert.rs"},"region":{"startLine":3328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f1726e2b8b36001015992fe7b20021bb3ea897e9610cd2fb711ec62da40c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::parse::parse_short_flag (cognitive 24): deno_cli_parser::parse::parse_short_flag has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/parse.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"284c34f32402773c4448903a2b5352a60d74759c81990c5ca2f9e22f2e2cfbcc"}},{"ruleId":"D2","level":"warning","message":{"text":"Workspace::diagnostics (cognitive 24): Workspace::diagnostics has cognitive complexity 24 (threshold 15). Drivers by points: if/else 43 (69 pts), boolean chains 13, loops 6 (11 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (Workspace::diagnostics::check_member_diagnostics, Workspace::diagnostics::check_all_configs) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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":"libs/config/workspace/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f2e5b0ed6a4fd2fdb2c3c01193a860a1a620302d75ae9f4990c181f238073e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_config::workspace::discovery::resolve_auto_link_config_folders (cognitive 24): deno_config::workspace::discovery::resolve_auto_link_config_folders has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 5 (8 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/discovery.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d373290ff21ed2beb3c1e2bac93277bddfb20ae545c07146c2c2598d7f13be55"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::tty::uv_tty_set_mode (cognitive 24): deno_core::uv_compat::tty::uv_tty_set_mode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), match/switch 2, 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":"libs/core/uv_compat/tty.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3bc0d089e1d9c63ba3ce45eed456ef2e96f9e7c68748580692895e448e3b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::tty::write_tty (cognitive 24): deno_core::uv_compat::tty::write_tty has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"265ba413596fe624876188375ce49ff6a77943bfefa7873f44ab7e49889c54a0"}},{"ruleId":"D2","level":"warning","message":{"text":"_tls_common.validateKeyStrength (cognitive 24): _tls_common.validateKeyStrength has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed3d62fefbf397831abfa39e1f4123fbfa2071e8b5481fce41df51af5a18727"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket.bind (cognitive 24): Socket.bind has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 4, ternaries 1 (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. 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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7389e11d026247bfc83c12678b0950e80f6020e7bf9a81a89de3406f1871a8"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer.getEncodingOps (cognitive 24): buffer.getEncodingOps has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 11). 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"d095063fb18f6a9bc685bf46d73a40acf7aa4a24ed2bd265cb0ba3ff0dc04630"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.getDirents (cognitive 24): utils.getDirents has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 1 (4 pts), loops 2 (4 pts) (nesting depth added 14). Of this number, 16 points are the body\u0027s own statements and 8 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":"ext/node/polyfills/internal/fs/utils.mjs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea87f9268df60f09a34bb458e7ea0ba129b235ab1e05194a7f3bb52c8814c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Utf8Stream.#openFile (cognitive 24): Utf8Stream.#openFile has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (nesting depth added 6). Most of this is not in the body itself: 8 of the 24 points are its own statements and the rest belongs to 3 function items inside it that branch (fileOpened, a function literal at line 452, a function literal at line 505). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc032d2d2a59ed196ab8a4faf4b6852fb229fc226020829cf3aabbe60cc05df"}},{"ruleId":"D2","level":"warning","message":{"text":"PerformanceObserver.observe (cognitive 24): PerformanceObserver.observe has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/15_performance.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0fdb0473ac1e6c4c14b72dbb504ab32871edb5f41942ff10f4821548d8d5de"}},{"ruleId":"D2","level":"warning","message":{"text":"clearBuffer (cognitive 24): clearBuffer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (7 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 2 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb56956cbc21f74887a72c03644e004e9752e4cc4b1c618ef7b92caaf97c9cd0"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleGraphBuilder::npm_peer_dep_importers (cognitive 23): ModuleGraphBuilder::npm_peer_dep_importers has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (6 pts) (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":"cli/graph_util.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2165e3a621ff4f5c0b60c4730a33616016d731e017489c989979e1ca6034735"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentModules::workspace_file_modules_by_scope (cognitive 23): DocumentModules::workspace_file_modules_by_scope has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 3 (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":"cli/lsp/documents.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dde626da6859b33f3a6eb3bb9d2716c075e663b181631307db86451e8b84bae"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::args::flags_to_permissions_options (cognitive 23): deno::args::flags_to_permissions_options has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 5 (7 pts) (nesting depth added 5). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (handle_allow, handle_deny_or_ignore). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/args/mod.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6ff36225800a2a56bd9aec9aa4192500032531d2de7851015f8bfe4832ab53"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::framework::detect_framework (cognitive 23): deno::tools::framework::detect_framework has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 10 (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":"cli/tools/framework.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9375eaad90f8ed0b6ed78e502401da10cb0a8f744d7b4973d66fbfa43e6df6"}},{"ruleId":"D2","level":"warning","message":{"text":"VfsBuilder::ensure_canonical_dir_inner (cognitive 23): VfsBuilder::ensure_canonical_dir_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lib/standalone/virtual_fs.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d266e54c72d18e797bc551c6459d47d085e336b8dc7ba3fea3a51ce407a35e04"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_lib::args::get_root_cert_store (cognitive 23): deno_lib::args::get_root_cert_store has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lib/args.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b23dc44132b5fb1d996dff8347cc926d70afbddd3f7590754ea7538cba69f3"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopHmrRunner::handle_change (cognitive 23): DesktopHmrRunner::handle_change has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/hmr.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fdcf77e4e1f80f87ba2068a134d63070815468080279a59078c9e5ed6fc626"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_ml_dsa (cognitive 23): deno_crypto::subtle_import_key::import_key_ml_dsa has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (4 pts) (nesting depth added 11). 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"f536246160e5ea528b2cd19d78d8a944aa55b2943cac6f81e8889607fdc713c4"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http::http_next::op_http_get_request_headers (cognitive 23): deno_http::http_next::op_http_get_request_headers has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 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":"ext/http/http_next.rs"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"492d83f056bc7f46716d4a0a382a855aaac09dbb2de3a1e1f94aea62356b8da0"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiBackendDbHandler::open (cognitive 23): MultiBackendDbHandler::open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (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":"ext/kv/dynamic.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd2795bfa5308d6757018d29ce9ee1f20516029691e279a3f1e5090560bdd5f"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeServerCertVerifier::verify_server_cert (cognitive 23): NodeServerCertVerifier::verify_server_cert has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (4 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4623}}}],"partialFingerprints":{"codehealthFindingId/v1":"361496a0560c8e80a41a2e77770b6f228e88e92e8b254432b517a11a909173c0"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyObjectHandle::sign_prehashed (cognitive 23): KeyObjectHandle::sign_prehashed has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). 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":"ext/node_crypto/sign.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc058a350db47c8f43b3d2f9943aeb2adc408dc9454031aec76f1954286cdfe"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node_crypto::cipher::aes_wrap_key (cognitive 23): deno_node_crypto::cipher::aes_wrap_key has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, 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":"ext/node_crypto/cipher.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0491cbadcbe5bd7f5a2b189d47fc74a05b413ddf488f21ec509f7db7b8e276a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::error_fmt::match_null_proto_error_start (cognitive 23): deno_web::console::error_fmt::match_null_proto_error_start has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (6 pts), boolean chains 4 (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":"ext/web/console/error_fmt.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f723bd1ed2031345a524b64b1d3f60cb2c6aef1f89932c3d966bfccb0f90a867"}},{"ruleId":"D2","level":"warning","message":{"text":"Flags::config_path_args (cognitive 23): Flags::config_path_args has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (resolve_single_folder_path, resolve_multiple_files). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/args/flags.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7bb5e671339d3e5b06000351d922d24de19f2c27c889c56153def197338c10"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::convert::default_parse (cognitive 23): deno_cli_parser::convert::default_parse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5 (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":"libs/cli_parser/src/convert.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc12e2c8f2393da1ea3288981441f4b9dce0f22e03fea96fe9017651f1048f00"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleMap::resolve_callback (cognitive 23): ModuleMap::resolve_callback has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 pts), boolean chains 3 (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":"libs/core/modules/map.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"547136c0d7ac92effd2e27d01edf91571a00478c87525630a95885411dde71d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::parse (cognitive 23): Args::parse has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (10 pts), boolean chains 1, loops 1 (nesting depth added 12). 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/dcore/src/main.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b817a5344febe356d2484277f48e01ba8a6b9ab3e6894aba8a03965e969e9e01"}},{"ruleId":"D2","level":"warning","message":{"text":"Protocol::chunked_body_chunk (cognitive 23): Protocol::chunked_body_chunk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (5 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":"libs/http_h1/protocol.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02a6680c94bdcdda1eb9776c94eeb15e9cd193133b772b0df8a34db1334ce41"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDependencyResolver::add_peer_deps_to_path (cognitive 23): GraphDependencyResolver::add_peer_deps_to_path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), match/switch 2 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/graph.rs"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aa82eff2733545bbb7d54a3f28d2a1446364c85324e6c0bafdf9c6ce9e60d4"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm_installer::hoisted::cleanup_hoisted_packages (cognitive 23): deno_npm_installer::hoisted::cleanup_hoisted_packages has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 14). Of this number, 22 points are the body\u0027s own statements and 1 belongs 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":"libs/npm_installer/hoisted.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"89989b951023f00f99f2c7a251c456decb44234252f4264bddf48d43472dfd2e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::emit::ensure_no_import_assertion (cognitive 23): deno_resolver::emit::ensure_no_import_assertion has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 12). Of this number, 22 points are the body\u0027s own statements and 1 belongs 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":"libs/resolver/emit.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0eb3eca7ef50c6f01930af81205af00107ed5f9f1f968c852332297dcf8b8f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::graph::get_import_prefix_missing_error (cognitive 23): deno_resolver::graph::get_import_prefix_missing_error has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/graph.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"6821cbbb1ab1a3f1d5558dba6ba862e748788446b4517bd4c7498edd9eb5cee0"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.next (cognitive 23): Lexer.next has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint_selector.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f328e6b407c35e7a3b225d6801b752c9698a354358576777f81208aca040b1"}},{"ruleId":"D2","level":"warning","message":{"text":"97_ts_host.getModuleLiteralImportKind (cognitive 23): 97_ts_host.getModuleLiteralImportKind has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 8). Of this number, 21 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":"cli/tsc/97_ts_host.js"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"5baba60a9c64014bc3160dd86903f2db2f873530c0dd02ba91037e0d819cea56"}},{"ruleId":"D2","level":"warning","message":{"text":"23_response.initializeAResponse (cognitive 23): 23_response.initializeAResponse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (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":"ext/fetch/23_response.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c94951ef73ed74de3c6e24bd1c3840d41826f272386101bb772f1f44db101fc"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_server.storeHTTPOptions (cognitive 23): _http_server.storeHTTPOptions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, boolean chains 3. 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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1f119446f93cd9b831bdce503e00c5f5b2fe6addabd4a0d830844d8f1362be"}},{"ruleId":"D2","level":"warning","message":{"text":"http2.doSendFileFD (cognitive 23): http2.doSendFileFD has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 3 (5 pts), boolean chains 4 (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":"ext/node/polyfills/http2.ts"},"region":{"startLine":2959}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba2c0f80c1900798b545a7b570d5ee61965f0ac4eaf944dcbfe43a5e03a75a4"}},{"ruleId":"D2","level":"warning","message":{"text":"blocklist.parseIPInfo (cognitive 23): blocklist.parseIPInfo has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/blocklist.mjs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5460f2d60f8aa50c7f1597808ccbfb0220ffe898d51c5a2b3aa390097cb3ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"ChildProcess.kill (cognitive 23): ChildProcess.kill has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 3 (6 pts), boolean chains 3, ternaries 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3329d4eb858db4f7ff56d4627601b00afc1dcf6001d7b4249f05fe3833d50c"}},{"ruleId":"D2","level":"warning","message":{"text":"testing.runTapTop (cognitive 23): testing.runTapTop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 3 (8 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/testing.ts"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f04ae65779f41c435793e5d06d55fafaa8626c92130e5b7812c84d8e815327f"}},{"ruleId":"D2","level":"warning","message":{"text":"flamegraph.search (cognitive 23): flamegraph.search has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/cpu_profiler/flamegraph.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a67c33ce4607bf3518a355f2db40a182777e1c1968a9628267ef47a44a590a"}},{"ruleId":"D2","level":"warning","message":{"text":"_addHeaderLine (cognitive 23): _addHeaderLine has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_incoming.js"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae95bfb7bf62e45e44f077f4a1bb537076f7d1963f3e1d367f6d85b15d0063b7"}},{"ruleId":"D2","level":"warning","message":{"text":"AddRmPackageReq::parse (cognitive 22): AddRmPackageReq::parse has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 6 (10 pts), loops 1 (nesting depth added 9). Of this number, 14 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. 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":"cli/tools/pm/mod.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"0712a0992aa60459a46c8882af141654f0bac64751cd8c58d3d15bcfb867f652"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskRunner::run_all_tasks (cognitive 22): TaskRunner::run_all_tasks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/task.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a166d47f62d55582698896efe3352e477de6fcd2a86802406c1f2ed14b3859d"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsByFolderRealIterator::check_diagnostics_in_folder (cognitive 22): DiagnosticsByFolderRealIterator::check_diagnostics_in_folder has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, loops 3 (nesting depth added 2). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"cli/type_checker.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f228e8c4fff2f6ed598c30f511abbed49f110570f6034c5f041d12491b872ee"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::analysis::fix_ts_import_changes (cognitive 22): deno::lsp::analysis::fix_ts_import_changes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/analysis.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfb94d703d8bdc1bf1273b443a84040377c39c3f8a69cd3a5ca0ee7f2283311"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::bundle::html::inject_scripts_and_css (cognitive 22): deno::tools::bundle::html::inject_scripts_and_css has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 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":"cli/tools/bundle/html.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd72d85734a06024baa346d646f296a8e422b724b804d45a4b047e7aa04cc6bb"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop::run_desktop_hmr (cognitive 22): deno::tools::desktop::run_desktop_hmr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 4, match/switch 1 (2 pts) (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":"cli/tools/desktop.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f2a3179e8b4ff75d1d88634199f1ec3627f11b1caeb985a6efbec0a13d9d16"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::global::install_global (cognitive 22): deno::tools::installer::global::install_global has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (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":"cli/tools/installer/global.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4b76445e43934240d31da20c9a22679dd33c9e665173218c36d22637b0886d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::util::extract::extract_markdown_fenced_blocks (cognitive 22): deno::util::extract::extract_markdown_fenced_blocks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (4 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":"cli/util/extract.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eafc498a7a0e5a48b3397243b3bbc2b3bb41afce4a7922c3acf63a65d1bbae5"}},{"ruleId":"D2","level":"warning","message":{"text":"SocketCronHandler::socket_task (cognitive 22): SocketCronHandler::socket_task has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 4 (9 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cron/socket.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f627f5d5f2ed134b8bb817d5df746e4da6c7848fa49a22751b311db9a6f2f2"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_generate_key::run (cognitive 22): deno_crypto::subtle_generate_key::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef8c51d9680f543073723efe5aacb0737538c2239034fc4091572a8d93b2690"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http::parse_serve_address (cognitive 22): deno_http::parse_serve_address has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 3 (6 pts) (nesting depth added 12). 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":"ext/http/lib.rs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80d7332c0d02049c06a4771bf89c85d04fc967bc2f89e56c7fe26905ff0850e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::fs::op_node_cp_on_link (cognitive 22): deno_node::ops::fs::op_node_cp_on_link has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, 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. This shape REPEATS in the file: one other method here (deno_node::ops::fs::op_node_cp_on_link_sync) 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":"ext/node/ops/fs.rs"},"region":{"startLine":3112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6248ac1346c2869497051dd1c14e4243dca8cc1b94c1309c33532f89d5def9"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::fs::op_node_cp_on_link_sync (cognitive 22): deno_node::ops::fs::op_node_cp_on_link_sync has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, 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. This shape REPEATS in the file: one other method here (deno_node::ops::fs::op_node_cp_on_link) 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":"ext/node/ops/fs.rs"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ada0ad537727e4e5224d4627c370b96e1ab814f4d656da1f89eb8a36a6439b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::v8::op_v8_query_objects_count (cognitive 22): deno_node::ops::v8::op_v8_query_objects_count has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 7 (8 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/v8.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"107c4e180e9b4b7dbbc210db3edc84c828d676a610253b5ad30e83bb9d226117"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::vm::property_definer (cognitive 22): deno_node::ops::vm::property_definer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2, match/switch 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":"ext/node/ops/vm.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d49b022aaec76d44aff52e837068053d099912f5ae22040771c3b30a68a16dc"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::vm::op_vm_compile_function (cognitive 22): deno_node::ops::vm::op_vm_compile_function has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), loops 2 (4 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":"ext/node/ops/vm.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7dd40c2c25115ba0c7b75e678d1e1d62d4918bd04e94f9fc8d36ebc9200ea40"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_telemetry::console_exporter::format_span (cognitive 22): deno_telemetry::console_exporter::format_span has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (9 pts), match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/console_exporter.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bdd399268e0c6f4c15b234a5f8d43ff07778336b78c8f992f45e29842a9336"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::convert::test_parse (cognitive 22): deno_cli_parser::convert::test_parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, match/switch 6 (10 pts), boolean chains 1 (nesting depth added 4). 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":"libs/cli_parser/src/convert.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a3c8d4df7d0c2395137d77e7df4d393303cbfdb0908eacaf9952bc6084eef1"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigFile::dependencies (cognitive 22): ConfigFile::dependencies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/mod.rs"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"a201e69a455bc6682d4b6a554b396dcc768922cfeb6c2198e6f80778bbeabf87"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleMap::mod_evaluate (cognitive 22): ModuleMap::mod_evaluate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (3 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":"libs/core/modules/map/evaluation.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9808b45e1577d9db13eb325a5c8b5d73df82887f04f6aff746240482b3053e71"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::ops_builtin_v8::op_serialize (cognitive 22): deno_core::ops_builtin_v8::op_serialize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), match/switch 3, 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":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"78165d1e592d31be7df84853f2d3c75fa8a6e2ba2e8437e573382ea2ad191572"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::tty::select_thread_main (cognitive 22): deno_core::uv_compat::tty::select_thread_main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"646e51b76699f64fe40fa6e86eeafd6b489357c5b35fab7254b9651f4aa787b5"}},{"ruleId":"D2","level":"warning","message":{"text":"LockfilePackageGraph::from_lockfile (cognitive 22): LockfilePackageGraph::from_lockfile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 5 (7 pts), match/switch 3 (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":"libs/lockfile/graphs.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f5e4cafb69feaa8a1d45e66a70082d4483ffc9b80281bfeafd74fbff6f7779"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryInfoProviderInner::create_load_future (cognitive 22): RegistryInfoProviderInner::create_load_future has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (6 pts), boolean chains 5 (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":"libs/npm_cache/registry_info.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0214bc14d5fc2a2cd0872a7ceb0a035bafa7e531fea1f3371c98803da5a6555"}},{"ruleId":"D2","level":"warning","message":{"text":"TarballCache::create_setup_future (cognitive 22): TarballCache::create_setup_future has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_cache/tarball.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"536d3b54b89cc5a930cc1744f75da230d50080895d4304220118079976f9843a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_subprocess_windows::process::append_bat_arg (cognitive 22): deno_subprocess_windows::process::append_bat_arg has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, loops 2 (nesting depth added 6). 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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a9af4bcf27916ad79e7466aea2c8c134ecf07f41c18fc80d3150a79a514948"}},{"ruleId":"D2","level":"warning","message":{"text":"01_cron.formatToCronSchedule (cognitive 22): 01_cron.formatToCronSchedule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4 (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":"ext/cron/01_cron.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2d6b3c049580e5bec84b2d94db0e4f4babb8840bb16d77c5e6be37829ab8e1"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMap.#parseMap (cognitive 22): SourceMap.#parseMap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 8, loops 2 (5 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f86cff59bf8a15e7fa46744f6e55e4af60dfa96d7dea40c50a43c8fffe281ff"}},{"ruleId":"D2","level":"warning","message":{"text":"http2.hasNonZeroContentLength (cognitive 22): http2.hasNonZeroContentLength has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff1a498ddcd136e2aec8120610c311dc84038d26b7646f7a948ebbd104cbbc5"}},{"ruleId":"D2","level":"warning","message":{"text":"keys.getKeyObjectHandleFromJwk (cognitive 22): keys.getKeyObjectHandleFromJwk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 1 (2 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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"929c6b89be6823699a35b7de9b7f4355a6a7c88845f3af5c0c18ee16f47fbe89"}},{"ruleId":"D2","level":"warning","message":{"text":"random.validateRandomPrimeJob (cognitive 22): random.validateRandomPrimeJob has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/random.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc0c2a7fc815ea6ffe4a1b838e54db97690f3d1327bd036e56b767c0bd68168"}},{"ruleId":"D2","level":"warning","message":{"text":"duplex.Duplex (cognitive 22): duplex.Duplex has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (22 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":"ext/node/polyfills/internal/streams/duplex.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82c05d96e38c7481f91985480bebed15f35f1e23d41fe87b276342d0ceeecf1"}},{"ruleId":"D2","level":"warning","message":{"text":"tls_wrap.wrap (cognitive 22): tls_wrap.wrap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, ternaries 2 (nesting depth added 7). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 2 function items inside it that branch (pump, flushEncOut). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/tls_wrap.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e625a6b7507e36e0afa37ab7e0247ec55d8106f30b50072986589cde9f75f8"}},{"ruleId":"D2","level":"warning","message":{"text":"net.Socket._destroy (cognitive 22): net.Socket._destroy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). Of this number, 20 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":"ext/node/polyfills/net.ts"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"7923d92df14ad480bce1fdd044750bc686753938eb17d9248c5b42fbffffec33"}},{"ruleId":"D2","level":"warning","message":{"text":"REPLServer.constructor::showPreview (cognitive 22): REPLServer.constructor::showPreview has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 5, error handling 1, ternaries 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. This shape REPEATS in the file: 5 other methods here (REPLServer.constructor, REPLServer.constructor::defaultEval, REPLServer.constructor::_doComplete, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e726ab3807269b1effeb7694c905e5b6f51b804a54da9c27d066c8719b73aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Blob.slice (cognitive 22): Blob.slice has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 1, loops 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":"ext/web/09_file.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8fb24e89881e54690894de5cd0e1d86fbf7c046b0c68f21b0da1a1692a650d"}},{"ruleId":"D2","level":"warning","message":{"text":"createWritableStdioStream (cognitive 22): createWritableStdioStream has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, ternaries 4, error handling 1, loops 1 (nesting depth added 2). Most of this is not in the body itself: 4 of the 22 points are its own statements and the rest belongs to 18 function items inside it that branch (write, value, getColumns, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_process/streams.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c9a426437759137af5714432123c048ba02a711a73b754e15d619e94aa320b"}},{"ruleId":"D2","level":"warning","message":{"text":"initStdin (cognitive 22): initStdin has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 6 (9 pts), boolean chains 2, match/switch 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 7 belong to 14 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_process/streams.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39ea1392b7e97007ff1dbc805b6d6667438bfc10e082216dad7afb4b30c92e8"}},{"ruleId":"D2","level":"warning","message":{"text":"errorOrDestroy (cognitive 22): errorOrDestroy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 8, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/destroy.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48068faf0d9a6196589e5d545e9f771a15ad48fe861a161e9b2a60adcaffe72"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleGraphCreator::create_publish_graph (cognitive 21): ModuleGraphCreator::create_publish_graph has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"cli/graph_util.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"c348ea9e6f111fd6c5aaab6b3466df1cdea559d5f0cc4f082975b72ff2c0fba7"}},{"ruleId":"D2","level":"warning","message":{"text":"TsServer::provide_will_rename_files (cognitive 21): TsServer::provide_will_rename_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (5 pts), match/switch 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":"cli/lsp/ts_server.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c60b23ed45d0afe72e005c648d90f2d841f87d631151dc5f28a34249e63131a"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostic::fmt_source_line (cognitive 21): Diagnostic::fmt_source_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (2 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":"cli/tsc/diagnostics.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e5ec90e536e736a573bdf8eacf56bcbaa3de208315b044ea2b58aa148049e3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::analysis::try_reverse_map_package_json_exports::try_reverse_map_package_json_exports_inner (cognitive 21): deno::lsp::analysis::try_reverse_map_package_json_exports::try_reverse_map_package_json_exports_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/analysis.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"89008e80ce9d322f01552735ab4b5c6102496f11cbe452d41ba90912fb4197b0"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::testing::execution::collect_test_task_env_files (cognitive 21): deno::lsp::testing::execution::collect_test_task_env_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/testing/execution.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"263f25bfdd7f74af262fe044d254744ce051e0893b9b7d8a6ff6542915999fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop::build_deb_data_tar (cognitive 21): deno::tools::desktop::build_deb_data_tar has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (5 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":"cli/tools/desktop.rs"},"region":{"startLine":4063}}}],"partialFingerprints":{"codehealthFindingId/v1":"54de7acc2fc88ef102012fa3badbf6fa5a13bacbac102089d177b0db53f925b5"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::task::get_available_tasks (cognitive 21): deno::tools::task::get_available_tasks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/task.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cade6b858def3639580d5117842062436fa65635522d3c1336164a6da44c76e5"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ffi::turbocall::compile_trampoline (cognitive 21): deno_ffi::turbocall::compile_trampoline has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20 (28 pts), loops 5, match/switch 3 (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. This shape REPEATS in the file: one other method here (deno_ffi::turbocall::compile_trampoline::convert) 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":"ext/ffi/turbocall.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83862538e6595755c009d6f8c5016ba3e91e1669138db5d2c5fe54784ce1413"}},{"ruleId":"D2","level":"warning","message":{"text":"Http2Options::new (cognitive 21): Http2Options::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, match/switch 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":"ext/node/ops/http2/session.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0146a2d93aad7014a7cccd54c060710d92c8acd4158ea38b5796224f5d85ea"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::css::css_to_ansi (cognitive 21): deno_web::console::css::css_to_ansi has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/css.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67f377d61b6a41ebf94a54a3f69aa0dd370dec688278e006223711cccc17969"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::get_class_base (cognitive 21): deno_web::console::inspect::get_class_base has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":2664}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74c6159b95a3a572a6036ab3328e0fd4fba849c8280bfec35a1534396807b6a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::get_function_base (cognitive 21): deno_web::console::inspect::get_function_base has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4 (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":"ext/web/console/inspect.rs"},"region":{"startLine":2764}}}],"partialFingerprints":{"codehealthFindingId/v1":"077bd88b3c679bb7684988e6389743d3293be0d508be33fdfe0479329dcd97af"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::completions::generate_zsh (cognitive 21): deno_cli_parser::completions::generate_zsh has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (5 pts), boolean chains 3 (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/cli_parser/src/completions.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e477f9b45144bd4e5a09b2d36fee8d9e93547553ee810c938754c17dc75da65e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::completions::generate_fish (cognitive 21): deno_cli_parser::completions::generate_fish has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (6 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":"libs/cli_parser/src/completions.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c530043571963ababba55ab6993e9ea05afb12f837da1d63d8cc6327ce34831"}},{"ruleId":"D2","level":"warning","message":{"text":"JsRuntime::new_inner (cognitive 21): JsRuntime::new_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (17 pts), loops 2 (3 pts), boolean chains 1 (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":"libs/core/runtime/jsruntime.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af55ad16d9b16a7fd24039c824d4bfe08ce750d2635347741892546d745c6bc"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeActivityStats::dump (cognitive 21): RuntimeActivityStats::dump has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (9 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":"libs/core/runtime/stats.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22e64c36124d8e5cc1b140d946c9b525f27b5490790ecccf7f818449dfde7e8"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmOverrides::get_override_for (cognitive 21): NpmOverrides::get_override_for has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/overrides.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6334b5b6185f79d6887992b8f37c5c1509ff1a561619ccaf2ead9d4c8d72fdaf"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm::resolution::graph::tarjan_scc::strongconnect (cognitive 21): deno_npm::resolution::graph::tarjan_scc::strongconnect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/graph.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe14aac31233ec838fe215b5fb56c6a3ae9608dd3ad3906123ada7935016699"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ops::op2::signature::parse_attribute (cognitive 21): deno_ops::op2::signature::parse_attribute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/signature.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d68d62ed185737cd4639844f4b3523279187230847dd78bccebeeadb0bc068f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ops::op2::signature::parse_cppgc (cognitive 21): deno_ops::op2::signature::parse_cppgc has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 4 (7 pts), boolean chains 2 (nesting depth added 9). 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/ops/op2/signature.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de6ede2a1835131a9fe9212832bb5054244885bcb58f6e2ff43819db992b0a9"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageJsonDepValue::parse (cognitive 21): PackageJsonDepValue::parse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 2 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":"libs/package_json/lib.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2130f6c9424b62a4652f82d2e06b81bceebafd9915f2070eb514f0e05d94101e"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskCache::get_cache_filename (cognitive 21): DiskCache::get_cache_filename has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 4 (9 pts), loops 1 (2 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":"libs/resolver/cache/disk_cache.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03b816f9081a9d90bf7d51a68fd3b676009affc54a683c15dd5b09cbb300ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoGraphLoader::load_or_cache (cognitive 21): DenoGraphLoader::load_or_cache has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 6 (10 pts) (nesting depth added 9). 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/resolver/file_fetcher.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd56a167df9e4188e0cb4aaa46b540bc43283b81a79cec157b68374656c8e339"}},{"ruleId":"D2","level":"warning","message":{"text":"40_lint_selector.getFromRawValue (cognitive 21): 40_lint_selector.getFromRawValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 9). 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":"cli/js/40_lint_selector.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1312ae03faafc96658245a63960e1df49a56a6a56bbf918c0140a1732395a61e"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_proxy.parseProxyUrl (cognitive 21): _http_proxy.parseProxyUrl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (6 pts), boolean chains 3, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79065d5404561ed6f42dc6201416937e03cb263bc3270c46a59196ee4196238"}},{"ruleId":"D2","level":"warning","message":{"text":"_tls_common.normalizeKeyPem (cognitive 21): _tls_common.normalizeKeyPem has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 1 (3 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5277e1c748f5341f104a09041f4b174b260a422c15765fe971e9117a4563df"}},{"ruleId":"D2","level":"warning","message":{"text":"https.Agent.getName (cognitive 21): https.Agent.getName has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, boolean chains 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":"ext/node/polyfills/https.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"561602b68cc71e4b9662916dc90583bc83402f3fb10ee16d5aa4731a6d36f9a0"}},{"ruleId":"D2","level":"warning","message":{"text":"querystring.encodeStr (cognitive 21): querystring.encodeStr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 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":"ext/node/polyfills/internal/querystring.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d66da3fd1b56dd863bcce9bcf64a94e8fd7ad878bb40d71fc179b6c93b3f3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"net._internalConnect (cognitive 21): net._internalConnect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/net.ts"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8be2759c61f3dfe3928225865e6c10842857caaeb90fc603985ec745e3d7376"}},{"ruleId":"D2","level":"warning","message":{"text":"testing.fileSnapshot (cognitive 21): testing.fileSnapshot has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 3 (4 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96cf0d69cde32b55851780119f8c29cde57ad370e1f48c0710bde4ed9f5dff8"}},{"ruleId":"D2","level":"warning","message":{"text":"trace_events.writeMainTraceFile (cognitive 21): trace_events.writeMainTraceFile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 4 (6 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/trace_events.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda6c44dfdc77815f866638422463beea3bd74d4a4264264b72ade1aef886af9"}},{"ruleId":"D2","level":"warning","message":{"text":"url.formatWhatwg (cognitive 21): url.formatWhatwg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4 (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":"ext/node/polyfills/url.ts"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"156527780e9b8cf6788725a28fa5a17d4665f057ca596a59d3a570538fb011cb"}},{"ruleId":"D2","level":"warning","message":{"text":"url.pathToFileURL (cognitive 21): url.pathToFileURL has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/url.ts"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"edadc838fd766d84dedc3d04416b2e5d8d12cffa4203866c92a47ae616114cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeWorker.#pollControl (cognitive 21): NodeWorker.#pollControl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"225265816d168dc5a8f5c9001eab01b5f3ad207283ee7cfe72470f26a1efa482"}},{"ruleId":"D2","level":"warning","message":{"text":"zlib.processChunkSync (cognitive 21): zlib.processChunkSync has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/zlib.js"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"239f9ac9d34de3a31a7f367f534e2f859bdd31159081e61827889cc79fd4ef32"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSSocket (cognitive 21): TLSSocket has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, ternaries 2 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bccab860dc38b4e603b91c8f648d0a5a34a25bc6ade5d8cb51b767dce89eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"_wrapHandle (cognitive 21): _wrapHandle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 2 (3 pts), other 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4bd7ec8198165dcb0d5780b061ca87f5e80224e791f5d27b432a1b622df7b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Zlib (cognitive 21): Zlib has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/zlib.js"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"978890c8f2048d82035680a0eba0151f52b77c233d48602213693bdb0dd649bc"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 21): fetch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), loops 1 (2 pts), other 1 (nesting depth added 4). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 846, a function literal at line 904, a function literal at line 946, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4433c8eff691f5f8ac9b65b4cc850bf468901b946e6e2fcd9044ed1641d594"}},{"ruleId":"D2","level":"warning","message":{"text":"fillHeaderList (cognitive 21): fillHeaderList has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/20_headers.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8da511ee303ff421b6b87afb6ed1bd353f40f54946b2305ffed1d154b2dc8a"}},{"ruleId":"D2","level":"warning","message":{"text":"CliModuleLoader::load (cognitive 20): CliModuleLoader::load has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe7199c54c21dfa7f99ea532581b868d05a4e150ad77955b8e2373db15048b3"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeTree::normalize (cognitive 20): RangeTree::normalize has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). 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":"cli/tools/coverage/range_tree.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66c8fa20771c4e403f0ab78d0b8acc7c2d761f1cb845a199ffab42cef105db1"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceLinter::lint_files (cognitive 20): WorkspaceLinter::lint_files has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 2). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"cli/tools/lint/mod.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc147fd4180b834b63b24a6a0de64512bfe49fee73ff4511571239357d9625c"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestedVersion::from_upgrade_flags (cognitive 20): RequestedVersion::from_upgrade_flags has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (20 pts) (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":"cli/tools/upgrade.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a409330e2bbcaeb9750d0d38e8864508df4b8a2af16d0ab9dc9da409353a9b6d"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphWalker::add_unresolved_dts_entrypoint_imports (cognitive 20): GraphWalker::add_unresolved_dts_entrypoint_imports has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 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":"cli/type_checker.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b758eaa4139b6de1221345c43ef4f3f079d4a9dcd99ae2ce81c64abcaf47ea5a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::bundle::wasm::render_js_wasm_module (cognitive 20): deno::tools::bundle::wasm::render_js_wasm_module has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 6 (10 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":"cli/tools/bundle/wasm.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"edff790314463c5eaa8cf60095e7be3abd8b91ae6b71a37a2c77eefb81ea611c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::compile::compile_binary (cognitive 20): deno::tools::compile::compile_binary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/compile.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea0bf25b54d727f1923a24d23589cf5842a586671df3c2be18832b7c5964611"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::fmt::format (cognitive 20): deno::tools::fmt::format has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 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":"cli/tools/fmt.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"29871fe50109b6e65ae2ff5fc80716bf1211adba93c0ae4d53d384b0c9274380"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::npm_compat::workspace_member_paths (cognitive 20): deno::tools::installer::npm_compat::workspace_member_paths has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), match/switch 1 (2 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":"cli/tools/installer/npm_compat.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"8112b79d8338c4f687f507984c412d06bf6ee28e377e49a776cc2ce41e8278dc"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::npm_compat::expand_member_patterns (cognitive 20): deno::tools::installer::npm_compat::expand_member_patterns has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/installer/npm_compat.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92b0f07a3803de0417a0ee35536ba26220122c45cfa9fa6a1bf1739dc25ff28"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::unlink (cognitive 20): deno::tools::pm::unlink has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 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":"cli/tools/pm/mod.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3777d65cfd28d1ff989374c4690b32f1b3491685705fa98e977680e6deae526"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::upgrade::upgrade_from_branch (cognitive 20): deno::tools::upgrade::upgrade_from_branch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 2 (3 pts) (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":"cli/tools/upgrade.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"da044e64c3e238f85256d9c1fb6f33a152254dc3853786ff0e01ffab646a34c3"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageBitmapRenderingContext::transfer_from_image_bitmap (cognitive 20): ImageBitmapRenderingContext::transfer_from_image_bitmap has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (4 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":"ext/canvas/bitmaprenderer.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1148dae8c6d5e44eb8cc698d31ee57754b325f5b8b7520a389bd1f6418d03e05"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::algorithm::compute_key_length (cognitive 20): deno_crypto::algorithm::compute_key_length has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (4 pts), boolean chains 2 (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":"ext/crypto/algorithm.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b8b276f86990d2d5e8dfe0c29f3de0af588b38742f97bc177416975cb73c68"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_import_key::import_key_slh_dsa (cognitive 20): deno_crypto::subtle_import_key::import_key_slh_dsa has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2849f29c0e5ddb611adce58fb4328ccdd9777a2f9aa041f8e4d8dff744c9332"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_napi::js_native_api::napi_get_typedarray_info (cognitive 20): deno_napi::js_native_api::napi_get_typedarray_info has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19 (20 pts) (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":"ext/napi/js_native_api.rs"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"479f29a3552c2c0161b218a95530fb338c5dd3b241d23585925d4acfbefe7065"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSWrap::read_start (cognitive 20): TLSWrap::read_start has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4 (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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"588cf2b6272e1963213dfdb3b52f221de8bc39b11e7286ae80e9e40cfee319ec"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyObjectHandle::new_asymmetric_public_key_from_js (cognitive 20): KeyObjectHandle::new_asymmetric_public_key_from_js has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 4 (8 pts) (nesting depth added 9). 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":"ext/node_crypto/keys.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ebf34c852f89359034024d56901983be3dfa61322e1e43a02ad9266bfafcf9"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node_crypto::keys::dsa_generate_components (cognitive 20): deno_node_crypto::keys::dsa_generate_components has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/keys.rs"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0cce98cc9e921a83a2cef9bdc478fa333ce3016269bfa8d33509ee2fa9d360"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::error_fmt::get_stack_frames (cognitive 20): deno_web::console::error_fmt::get_stack_frames has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). 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":"ext/web/console/error_fmt.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07dbc026120056b4e711c6867d51eef091e82a861c9fefd37ca090bdac0280c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::inspect::sort_output (cognitive 20): deno_web::console::inspect::sort_output has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 pts), match/switch 2 (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":"ext/web/console/inspect.rs"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb3610c3cc41e20916e763d8d76e99b70a87e0240853d41bd2519075db17a65"}},{"ruleId":"D2","level":"warning","message":{"text":"Flags::to_permission_args (cognitive 20): Flags::to_permission_args has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 19, if/else 1. 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":"cli/args/flags.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"eece99216773b5f2186ba6d0a2005cf9374c2c1a33db2d0227bda5f4ff0889c7"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::pipe::uv_pipe_connect (cognitive 20): deno_core::uv_compat::pipe::uv_pipe_connect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 9). 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/core/uv_compat/pipe.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8b4b68d74df2a7b69599ff3ac1daa89070d46539f40acf8addfc53a5b9abbb"}},{"ruleId":"D2","level":"warning","message":{"text":"CjsModuleExportAnalyzer::analyze_reexports (cognitive 20): CjsModuleExportAnalyzer::analyze_reexports has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (6 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/analyze.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2294b63005b4fc88725ead4ea1a4a96d9afc667ae107ac67c07b8e747da9c98c"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeResolver::path_to_declaration_path (cognitive 20): NodeResolver::path_to_declaration_path has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 4). Most of this is not in the body itself: 9 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (probe_extensions). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"daff7d7aee5279b63b1f1025a56ca3c78cf9fe7cb5afd70935175cdfe25fd771"}},{"ruleId":"D2","level":"warning","message":{"text":"node_resolver::resolution::resolve_pkg_json_import (cognitive 20): node_resolver::resolution::resolve_pkg_json_import has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). 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/node_resolver/resolution.rs"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bdb4da7fa7d9e67d3637c7f52e3616b52f3b597789b28191ec8d106b242644"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm_cache::write_slim_version (cognitive 20): deno_npm_cache::write_slim_version has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, loops 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/npm_cache/lib.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"666e34e112589116eb6b63039df3961ead3e6a5aee94b5a77d124f6d0947e793"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm_cache::fs_util::hard_link_file (cognitive 20): deno_npm_cache::fs_util::hard_link_file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (20 pts) (nesting depth added 11). 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/npm_cache/fs_util.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1d102baa6fa20fbb186073a64ff70974fdeb56b5a764eb3ebec5a862d86d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm_installer::bin_entries::sort_by_depth (cognitive 20): deno_npm_installer::bin_entries::sort_by_depth has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/bin_entries.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c77b5b4397b28b97417c42be43883e846c1351db28252751cbf63f1e40cef8c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm_installer::lifecycle_scripts::compute_lifecycle_script_layers (cognitive 20): deno_npm_installer::lifecycle_scripts::compute_lifecycle_script_layers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (10 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":"libs/npm_installer/lifecycle_scripts.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"4114e0614fdf102a627211359cef99503e9cb7b63d45d28ed88ced247337c2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"ByonmNpmResolver::resolve_pkg_json_and_alias_for_req::resolve_alias_from_pkg_json (cognitive 20): ByonmNpmResolver::resolve_pkg_json_and_alias_for_req::resolve_alias_from_pkg_json has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ByonmNpmResolver::resolve_pkg_json_and_alias_for_req) 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":"libs/resolver/npm/byonm.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"825f2ff5caaaccae31b813799106ff1d461d66e665c91d7221c15d6afe97905a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceResolver::maybe_resolve_specifier_to_workspace_jsr_pkg (cognitive 20): WorkspaceResolver::maybe_resolve_specifier_to_workspace_jsr_pkg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (2 pts), match/switch 2 (nesting depth added 10). 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/resolver/workspace.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6522cb2779ade21c0e8fbaa56b46bef456b621436977090ffb89494af79459"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchCtx.getAttrPathValue (cognitive 20): MatchCtx.getAttrPathValue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 1 (2 pts), boolean chains 1, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint.js"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aec12cdc60c77ce8b8c24b09a6c80c456669375e93bef5972a2bc234140a966"}},{"ruleId":"D2","level":"warning","message":{"text":"_fs_readdir.readdir (cognitive 20): _fs_readdir.readdir has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), error handling 1 (2 pts), ternaries 2, boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 178). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_readdir.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"905e1a5619724d81797e442cf9f2f4418ff619820f4f01947c88325ece842882"}},{"ruleId":"D2","level":"warning","message":{"text":"crypto.hash (cognitive 20): crypto.hash has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/crypto.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"954bd97c95c8d2836b04c98e41f3843d47617e9259a920a146e2856bbd62d708"}},{"ruleId":"D2","level":"warning","message":{"text":"util.buildNgHeaderString::processHeader (cognitive 20): util.buildNgHeaderString::processHeader has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts), match/switch 1 (2 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9edcfc1f53ea6a7f2759a4a04645b762ab613aa0ec7178ad1df010ee8cf1a3"}},{"ruleId":"D2","level":"warning","message":{"text":"emitKeypressEvents.emitKeypressEvents::onData (cognitive 20): emitKeypressEvents.emitKeypressEvents::onData has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 1 (4 pts), loops 1 (3 pts), boolean chains 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":"ext/node/polyfills/internal/readline/emitKeypressEvents.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2e559b5aaf4fb2da94327d5c6706f95528e904cedcb7eacfcfe3629e0efd94"}},{"ruleId":"D2","level":"warning","message":{"text":"comparisons.innerDeepEqual (cognitive 20): comparisons.innerDeepEqual has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9 (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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8e5110005b271d162884da212efad1034e91bd5c95ca32b1514013c2f02335"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer.indexOfBuffer (cognitive 20): buffer.indexOfBuffer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, ternaries 3 (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":"ext/node/polyfills/internal_binding/buffer.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7e2c6e4ca4bb5d8d805714cdffe47a248ee9c6559dceda8071136cf4b1420a"}},{"ruleId":"D2","level":"warning","message":{"text":"_win32.extname (cognitive 20): _win32.extname has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (nesting depth added 7). 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b1b9a2b78238227d3f3a5b81aadae8020207ac7af04db9a2f950905587d503"}},{"ruleId":"D2","level":"warning","message":{"text":"repl._memory (cognitive 20): repl._memory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 7). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 563, countMatches). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/repl.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"09546c45b5f06202f6075c54793dbaec03b61613954b9f108bce0d867028a581"}},{"ruleId":"D2","level":"warning","message":{"text":"MockTimers.enable (cognitive 20): MockTimers.enable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 3 (4 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":2644}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f75ab82b4fb9af9a4d158ed6aeea84b5faa4e028faf971be96010b21368689"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeWorker.#pollMessages (cognitive 20): NodeWorker.#pollMessages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"5facac4c6a7a6b2d79fc2bd5da6b0764f2da7180e25d9001f9028e10b2eab6dd"}},{"ruleId":"D2","level":"warning","message":{"text":"06_streams.fastPipeTo (cognitive 20): 06_streams.fastPipeTo has cognitive complexity 20 (threshold 15). Drivers by points: error handling 4 (9 pts), if/else 6 (8 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"440a65af187fd8e820c3d2a413ac6a28f06b2b61f93e754fa9c6b85b4b110912"}},{"ruleId":"D2","level":"warning","message":{"text":"13_message_port.serializeJsMessageData (cognitive 20): 13_message_port.serializeJsMessageData has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/13_message_port.js"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9337510b6b3322fc24ece446e0171120f9331305388583d4ee25466c37207d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.#pollMessages (cognitive 20): Worker.#pollMessages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/11_workers.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1809b863690d2fe990ceb62987af6b238610eef88a0267b5944c04918a0be6"}},{"ruleId":"D2","level":"warning","message":{"text":"writableStreamForRid (cognitive 20): writableStreamForRid has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 4 (5 pts), error handling 2, other 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 7 function items inside it that branch (write, tryClose, flushBuffer, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d4454a81b06e7f68e62f56b554ac0494130dc0a79d7ba922f4ba4af17f49ae"}},{"ruleId":"D2","level":"warning","message":{"text":"_startEsmLoadLoop (cognitive 20): _startEsmLoadLoop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (2 pts), other 2 (nesting depth added 6). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 871). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/01_require.js"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e694d0a9074ed88114cd0e10deefbcda9375dd1685813b41c2c1ab82b314f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Server (cognitive 20): Server has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2, ternaries 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8876f2ea180f7d4902e0233c9b791593aa0a9231a9d38754c0426ced99689a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"newWritableStreamFromStreamWritable (cognitive 20): newWritableStreamFromStreamWritable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 657, write, close, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a17b7599ecbc84eaf3e14797c8a56cae7dc8e1c7658523f8c1c8fd4e4951597"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteStream (cognitive 20): WriteStream has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, ternaries 3 (5 pts), boolean chains 2 (nesting depth added 2). 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":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ccafdf3fe08e315fade47d154b8db6ca857eed97fb28e1475a8f4a7d880089"}},{"ruleId":"D2","level":"warning","message":{"text":"createErrDiff (cognitive 20): createErrDiff has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/assertion_error.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c28d907b61e90d236330411e871fa783438b4e17dadc606ba19140ee4a8a80e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 20): (anonymous) has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/11_workers.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f9d0ef83aa0fea9125b739aae7989a0ef3769f6322a414c1c23e4e50499aa2"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentModules::resolve (cognitive 19): DocumentModules::resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/documents.rs"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6b30e6febacdeb5f8cf190fd3a707d281e8f866d577ed08aa806cf39633060"}},{"ruleId":"D2","level":"warning","message":{"text":"RedirectResolver::resolve (cognitive 19): RedirectResolver::resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (3 pts), loops 2 (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":"cli/lsp/resolver.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cb8777cfbccfc1b17612ca7875e96f601bb7265a53ba23d5544e5e0ee77a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoPluginHandler::bundle_load (cognitive 19): DenoPluginHandler::bundle_load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/mod.rs"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"810734c9bf7b25b387d07c0cee84fafb42f62d098e3f1c513306a8336f1bad3b"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryNameAndUrl::resolve (cognitive 19): BinaryNameAndUrl::resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 2 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":"cli/tools/installer/global.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5d0c5e7d2284e2b43046c64d3bc034c20531057649f36e4691a1d04934c517"}},{"ruleId":"D2","level":"warning","message":{"text":"PackagePath::new (cognitive 19): PackagePath::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/paths.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f714caff738404c4cbd7ac9acd1b537ce258d6c3ae4a4454fa2b0fdcd31d021"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::graph_util::resolution_error_for_tsc_diagnostic (cognitive 19): deno::graph_util::resolution_error_for_tsc_diagnostic has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 3 (5 pts) (nesting depth added 10). 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":"cli/graph_util.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7c531699d7af6629eac3723e97342b7d3c5b2af1e11b06c69dfd0e4fadaf72"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::bump_version::rewrite_import_map (cognitive 19): deno::tools::bump_version::rewrite_import_map has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bump_version.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2b75f8da264b617c61b358509920d5e22a5abeae9fcca849605c7f3ac4373b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::bundle::html::find_next_tag (cognitive 19): deno::tools::bundle::html::find_next_tag has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/html.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2274f4a6780d863390126cb270d0b7002e94a0d3a61621a3b3654819764f1aff"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::clean::clean_node_modules (cognitive 19): deno::tools::clean::clean_node_modules has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 3, boolean chains 1, loops 1 (nesting depth added 2). 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":"cli/tools/clean.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2946a37c1eafe3fa02cb491769772e5d37d5565120ba64331cf4ff0045b77a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop::create_windows_msi (cognitive 19): deno::tools::desktop::create_windows_msi has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 6 (7 pts), boolean chains 2 (nesting depth added 3). 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":"cli/tools/desktop.rs"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e45f5000d9603c9d6994a3101f71ead6b595b3cf5a67d981dee9849472fa5be"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop_devtools::handle_request (cognitive 19): deno::tools::desktop_devtools::handle_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (8 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":"cli/tools/desktop_devtools.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fcc6e8ba7ed6a16fc9ce48d08cb3f23a4a180248cb4bdafd8afdcf9a94b748"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::print_install_report (cognitive 19): deno::tools::installer::print_install_report has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/installer/mod.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0fc6959cb201bc5b62761af1d0bdde1cd5236bc5c9a1f2bef78b9de85e6967"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::lint::ast_buffer::swc::serialize_module_decl (cognitive 19): deno::tools::lint::ast_buffer::swc::serialize_module_decl has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 4 (7 pts) (nesting depth added 9). 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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b777e76710089a57501b81d9ec4a93de5951f9788c602eb5f7a119031bcee7d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::lint::ast_buffer::swc::serialize_ts_type (cognitive 19): deno::tools::lint::ast_buffer::swc::serialize_ts_type has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 2 (3 pts) (nesting depth added 9). 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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce80f9a7c05fb9a1eb60ddb2a259f3a86a5ba7b4633f50d910d73993864b7ea7"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::lint::linter::apply_lint_fixes_and_relint (cognitive 19): deno::tools::lint::linter::apply_lint_fixes_and_relint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (6 pts), match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/linter.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee31f24cd2f2a5068b20a935451aebd87f2ce9499635461e75b9064e89b88944"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pack::collect_asset_files (cognitive 19): deno::tools::pack::collect_asset_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/mod.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ee0d35abe1dafd57210c78f529894a71c4d65915ba8ca90c63fb9f38b74932"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pack::npm_tarball::create_npm_tarball (cognitive 19): deno::tools::pack::npm_tarball::create_npm_tarball has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 6 (9 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":"cli/tools/pack/npm_tarball.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2503d4ec5574c4edfe840990e9f74c3585fbe275ba3ca3ee96da3882efbec726"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::audit::npm::call_audits_api (cognitive 19): deno::tools::pm::audit::npm::call_audits_api has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 5 (6 pts), match/switch 2 (3 pts) (nesting depth added 3). 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":"cli/tools/pm/audit.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cf0609f6f092c8ea425ebb6e52b8bd30101b3941d33f49ca6279eb0af2c7ec"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::type_checker::maybe_ts_suppression_comment (cognitive 19): deno::type_checker::maybe_ts_suppression_comment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 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":"cli/type_checker.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"217e52ad1faa8c9a696cdfff218d9b102a0edb2b9b44d0e9ee8487544be8dd2f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::util::windows::ensure_stdio_open (cognitive 19): deno::util::windows::ensure_stdio_open has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/windows.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0199081169e0eb1b58f56aecf9ff68b28bafd2388e32257669b3cbef7e000c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedModuleLoader::resolve_inner (cognitive 19): EmbeddedModuleLoader::resolve_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/run.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"087c657fbed0d2e485446fb16baa1247935d0a3414e07e39e110cd85e3e7bdfd"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_crypto::supports_inner (cognitive 19): deno_crypto::subtle_crypto::supports_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 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":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf59c90646fe70cccc18723f85f9cb893fb5026834f16b55da3b0b257678d23"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_sign::run (cognitive 19): deno_crypto::subtle_sign::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 pts), 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":"ext/crypto/subtle_sign.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"519f2966523ab34694d9aa14f24ebd9a3641605b5a2e299b108edaee77b6beab"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_fetch::proxy::tunnel (cognitive 19): deno_fetch::proxy::tunnel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/proxy.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"326f472ad6e552cec4b53911851f75a7208521b6244fc57a7bb32983a800d93a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http::http_next::is_normal_close (cognitive 19): deno_http::http_next::is_normal_close has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (19 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":"ext/http/http_next.rs"},"region":{"startLine":5626}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fe7325703cf564f2b856d8b0b8fde8c42513056e362e1d6153082c7fac177b"}},{"ruleId":"D2","level":"warning","message":{"text":"TsFn::call (cognitive 19): TsFn::call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/node_api.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"b892c419e5eda15efe8185530fe6ca7d9a9f8cb394e015d2b2af0f966e3b7e46"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_napi::js_native_api::create_external_string (cognitive 19): deno_napi::js_native_api::create_external_string has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 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":"ext/napi/js_native_api.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dd4a589d48914f060b1f5ba7f695580de3dacfc9c7299e1bccb57d75a40d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSWrap::start (cognitive 19): TLSWrap::start has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"300aae5a4a3ada5883778168e8586ded1a978732cdc34dfcd1dda02460238e93"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::util::op_node_call_is_from_dependency (cognitive 19): deno_node::ops::util::op_node_call_is_from_dependency has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/util.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d9e34c6457244aa24f9cf867189dd060ed022191601f168b0634b39bb5bba5"}},{"ruleId":"D2","level":"warning","message":{"text":"DOMMatrixReadOnly::from_matrix_inner (cognitive 19): DOMMatrixReadOnly::from_matrix_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"60886f11f5d1b0f760253e135949c80817937ec4a48db2a947204b935893525b"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalHttpCache::get (cognitive 19): LocalHttpCache::get has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 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":"libs/cache_dir/local.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"9423bea83d61b3f0873bd602a4966feee87f4690f49b0df2f25e5561a82323c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Flags::otel_config (cognitive 19): Flags::otel_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (6 pts), boolean chains 3 (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":"cli/args/flags.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a557946a18fd0d90d6d95e6295753443dde42d53a0676529fa4898fcc08d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::convert::escape_and_split_commas (cognitive 19): deno_cli_parser::convert::escape_and_split_commas has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (nesting depth added 10). 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/cli_parser/src/convert.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"204f9537720e16338e98a4a005719948e8cf09508394d2359873ffc16a8f5f41"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_config::workspace::discovery::handle_workspace_with_members (cognitive 19): deno_config::workspace::discovery::handle_workspace_with_members has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/discovery.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6ec1b98410ecb8c821e5c5066f9851fcd70ccdc8b1d9405ab4b1b93680c7a0"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_config::workspace::discovery::resolve_link_member_config_folders (cognitive 19): deno_config::workspace::discovery::resolve_link_member_config_folders has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (2 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":"libs/config/workspace/discovery.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"071f2517c594d9d95befb57a59bef8bf3e436669868094d11279e962126aec07"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::ops_builtin_v8::op_deserialize (cognitive 19): deno_core::ops_builtin_v8::op_deserialize has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 3 (4 pts), loops 1 (3 pts) (nesting depth added 9). 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/core/ops_builtin_v8.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca839e1867328b43dbb765276bbab74656ef9a30d8f7a5a2fa457b1eff76c56"}},{"ruleId":"D2","level":"warning","message":{"text":"EszipV2::into_bytes (cognitive 19): EszipV2::into_bytes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (8 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v2.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae566635d9c0ec7c303a87b342fc8a1fa59b1ca634391a54395f0db987dedf0"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedConn::poll_write_response_chunk_with (cognitive 19): SharedConn::poll_write_response_chunk_with has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 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":"libs/http_h1/conn.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ecb7d66acba4b1d633100f5d7981476b216b336dbcb3a21bf2c202c4b070c6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_inspector_server::parse_host_authority (cognitive 19): deno_inspector_server::parse_host_authority has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 2 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":"libs/inspector_server/lib.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b20fcbf9b08393e6fc90551dd620312efe94699bc0466d188d130fc904154a6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_inspector_server::server (cognitive 19): deno_inspector_server::server has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 2 (4 pts), loops 1 (nesting depth added 9). 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/inspector_server/lib.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2d77c3fe7731df29963ba7b8993d669ab5a082c452dba75770fa50d9155b04"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmOverrides::for_child (cognitive 19): NpmOverrides::for_child has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (3 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/npm/resolution/overrides.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a9f7fc74e71c6422bbaf7033d96c7ad794255775e70f9543431301ad9dd47c"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmResolutionSnapshot::as_valid_serialized_for_system (cognitive 19): NpmResolutionSnapshot::as_valid_serialized_for_system has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/snapshot.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"619b51898c396a8b432e97e89a8e915d0f6e43db00d0cb43b25896a90ff06711"}},{"ruleId":"D2","level":"warning","message":{"text":"DictionaryField::try_from (cognitive 19): DictionaryField::try_from has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (6 pts), loops 2 (4 pts) (nesting depth added 10). 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/ops/webidl/dictionary.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01f0237e0fda33f0b100f1f2c72cf03c4a0f7cb4ac81df12ca7a53bb7edfe6f"}},{"ruleId":"D2","level":"warning","message":{"text":"IsCjsResolver::get_known_mode_with_is_script (cognitive 19): IsCjsResolver::get_known_mode_with_is_script has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1, 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":"libs/resolver/cjs/mod.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4976f3eb8abb6e92dc510c0e2ff07d99a78bbe56bb6687ce83a8e5d47ea7b5"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::graph::format_deno_graph_error (cognitive 19): deno_resolver::graph::format_deno_graph_error has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/graph.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f04815efb862437737f6612595b585903672d89cb4bf1f08afd7cb9609ff202"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_subprocess_windows::process_stdio::uv_stdio_create (cognitive 19): deno_subprocess_windows::process_stdio::uv_stdio_create has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). 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":"runtime/subprocess_windows/src/process_stdio.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e8547237a54698ee56ddd5dc6a2b889bcdff0118adfc04c018fd91ab175256"}},{"ruleId":"D2","level":"warning","message":{"text":"00_serve.mapToNativeResponseCallback::finishOrReturnNative (cognitive 19): 00_serve.mapToNativeResponseCallback::finishOrReturnNative has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2 (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":"ext/http/00_serve.ts"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a635687381d4fa17cfeaf4c93e5be3ff494c4d12e7afba6099d94bf3316cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"KvListIterator.constructor (cognitive 19): KvListIterator.constructor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5 (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":"ext/kv/01_db.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"5247e4f78b3f11b6b4701eaf3b7f177b10c7b7f803c166140b83b34e614d92bd"}},{"ruleId":"D2","level":"warning","message":{"text":"01_require.executeEsmLoadHookChain (cognitive 19): 01_require.executeEsmLoadHookChain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (nextLoad). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/01_require.js"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c39d77405c1fd52727671b0a8bb68e6933a9d667d58cf5a6a217d1bb9deeb4"}},{"ruleId":"D2","level":"warning","message":{"text":"_events.EventEmitter.removeAllListeners (cognitive 19): _events.EventEmitter.removeAllListeners has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (4 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"019b46764fa3fd9818daceb2a756b6945bc27978c5a4f2375729fa9f69cee743"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_client.parseContentTypeFromRawHeaders (cognitive 19): _http_client.parseContentTypeFromRawHeaders has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 1, ternaries 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a8e97b8208bc2c0e60516f16ae523a398cde6843d56662776a145859e68023"}},{"ruleId":"D2","level":"warning","message":{"text":"_readline._ttyWriteDumb (cognitive 19): _readline._ttyWriteDumb has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_readline.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd1e4bd072be6776a773159ea5def189906b5d8353e185617b797bcc3686dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerHttp2Session.altsvc (cognitive 19): ServerHttp2Session.altsvc has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":4575}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c09d29aec16f9f8b8a4cdb4329aede548f64c51c6b79a27ed0f9d694ceecf65"}},{"ruleId":"D2","level":"warning","message":{"text":"myers_diff.backtrack (cognitive 19): myers_diff.backtrack has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/myers_diff.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e32d120039ec45b08f622207b8fc5abc70f421877ee253d9bb03d9fee791e5"}},{"ruleId":"D2","level":"warning","message":{"text":"primary.init::createWorkerProcess (cognitive 19): primary.init::createWorkerProcess has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (7 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. This shape REPEATS in the file: one other method here (primary.init::queryServer) 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":"ext/node/polyfills/internal/cluster/primary.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c60a335c822910fa10ee9b4c033725c9839afb74c8888c7602bbfc4ff798420"}},{"ruleId":"D2","level":"warning","message":{"text":"_randomBytes.randomBytes (cognitive 19): _randomBytes.randomBytes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 107). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/_randomBytes.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d88e87e98a87ca853da1e02fdef965103f71978e7d191c2276960851f9dea0b"}},{"ruleId":"D2","level":"warning","message":{"text":"net._internalConnectMultiple (cognitive 19): net._internalConnectMultiple 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":"ext/node/polyfills/net.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"e513af8bcf335b171acb03bf2c58585da5b92247c0e96c3dca3f51c3b5c08d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"TestSuite.addTest (cognitive 19): TestSuite.addTest has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (9 pts), error handling 3 (6 pts), if/else 2 (3 pts), boolean chains 1 (nesting depth added 6). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 1765). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/testing.ts"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd8204ca6d5de557f7edf294a7eff2a67a12a3725d9370697ab307916ca7abf"}},{"ruleId":"D2","level":"warning","message":{"text":"06_streams.readableByteStreamControllerEnqueue (cognitive 19): 06_streams.readableByteStreamControllerEnqueue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"5365b64f92eb21b01ba2be4faed54150cdb9a94f944b374d09894e2f6ea67108"}},{"ruleId":"D2","level":"warning","message":{"text":"readableStreamCollectIntoUint8Array (cognitive 19): readableStreamCollectIntoUint8Array has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3, boolean chains 2, error handling 1 (2 pts) (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"028e62fb36eaa582f07e21d8944de2bb6e8d90d57332cb88cda1e77a6c49779c"}},{"ruleId":"D2","level":"warning","message":{"text":"readableStreamPipeTo::pump (cognitive 19): readableStreamPipeTo::pump has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 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":"ext/web/06_streams.js"},"region":{"startLine":3413}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5035e5384bebd2b1127ad3b1872ea6c5b0fbda06b42264e16b7804064cfa9e"}},{"ruleId":"D2","level":"warning","message":{"text":"bidirectionalIndexOf (cognitive 19): bidirectionalIndexOf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 2 (4 pts), boolean chains 2 (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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6d87b1ddf8a77c39402df577c6688702c4286583b47e1027de23abcfeddfe5"}},{"ruleId":"D2","level":"warning","message":{"text":"refresh (cognitive 19): refresh has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (7 pts), if/else 4 (5 pts), other 5, ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 26 function items inside it that branch (getNodesAndLinks, getNodesAndLinks::getNodeY, createGraph, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/tracing/app.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"86341fed3f7e640365c8be6bcaf7c1e3ce5564c80582be5c9efb11b6f6c9479a"}},{"ruleId":"D2","level":"warning","message":{"text":"createPreviewSession (cognitive 19): createPreviewSession has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 3 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":"ext/node/polyfills/_repl_preview.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e150146847ea2c770454b01db22b10073da437be78c95b348e3cc42fba79d38"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpClient::get_redirected_response (cognitive 18): HttpClient::get_redirected_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/http_util.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"003eb65c6487c2b6851da4c7d429f629c874d583b4ad9637b562a210a64d4907"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoTaskLifeCycleScriptsExecutor::resolve_custom_commands_from_packages (cognitive 18): DenoTaskLifeCycleScriptsExecutor::resolve_custom_commands_from_packages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (8 pts), loops 2 (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":"cli/npm.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa50a970b2b21881882136a1a891f2bd08d27b620280cb398db605da69e6f9e4"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoCompileBinaryWriter::fill_bundle_native_addon_vfs (cognitive 18): DenoCompileBinaryWriter::fill_bundle_native_addon_vfs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 1 (2 pts), 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":"cli/standalone/binary.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d733e84f8a4aa1fb276284065cdc1c8bfd460d3aff2b8b96ccc3bf30bfe96a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalsMatcher::new (cognitive 18): ExternalsMatcher::new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/externals.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dab88cabaeb4faa6ab9dac600bf3b71c049dec85312e31b6af698f32d45663d"}},{"ruleId":"D2","level":"warning","message":{"text":"SpecifierUnfurler::find_types_package_version_req (cognitive 18): SpecifierUnfurler::find_types_package_version_req has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/unfurl.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8aa5dda658cf945191a3cac9cc3a5d05b026e6a8f56aa12945ec8dfcb781fb"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplSession::evaluate_line_and_get_output::inner (cognitive 18): ReplSession::evaluate_line_and_get_output::inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (9 pts) (nesting depth added 9). 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":"cli/tools/repl/session.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6a7075f4a03add5dca65f15213547759347830ab312e25763d1a9abf2b05bb"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::diagnostics::diagnose_dependency (cognitive 18): deno::lsp::diagnostics::diagnose_dependency has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, match/switch 1 (2 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":"cli/lsp/diagnostics.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f786aec2534ec87ee6c91cd7c9d1bb5af21c93d22997f8012cadb3fbdf8b70b3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop::package_macos_app_bundle (cognitive 18): deno::tools::desktop::package_macos_app_bundle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (7 pts) (nesting depth added 6). 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":"cli/tools/desktop.rs"},"region":{"startLine":3175}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d754f65b2e75b26d451c17475e273bf7730e076bf2bdd908d99850df2e24d8"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop_devtools::handle_upgrade (cognitive 18): deno::tools::desktop_devtools::handle_upgrade has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 9). 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":"cli/tools/desktop_devtools.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae72a3dab69e542488cc98b7f536b491a3cb39e392488cb127857ea88f29798"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::desktop_devtools::route_client_text (cognitive 18): deno::tools::desktop_devtools::route_client_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, 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":"cli/tools/desktop_devtools.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfcd0e2b84b4a6b420317bf71d49cb5cb8f2425f2bc133052b8ca58651bc008"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::global::uninstall (cognitive 18): deno::tools::installer::global::uninstall has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 2, 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":"cli/tools/installer/global.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0767d8208e61ca239c4279209b0dcc535fd581cc39642a6c47e7a47c73ace3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::installer::npm_compat::install_jsr_packages (cognitive 18): deno::tools::installer::npm_compat::install_jsr_packages has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 3 (6 pts), loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/installer/npm_compat.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8863251bd78495291df24e83952cd02a9893273d6783ab8fa512946293e0351"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pack::unfurl::unfurl_specifiers (cognitive 18): deno::tools::pack::unfurl::unfurl_specifiers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4, match/switch 2 (4 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":"cli/tools/pack/unfurl.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66a9e72004a18c6075dd52cb4dd4a741e9be94a156505c45b62e7f9e5eee3bc"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::find_package_and_select_version_for_req::select (cognitive 18): deno::tools::pm::find_package_and_select_version_for_req::select has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, match/switch 2 (3 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":"cli/tools/pm/mod.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c842c0a3be77e5ada942c68eece45e6cede82e9a0f6bbd375275aafddc57589"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::list::list (cognitive 18): deno::tools::pm::list::list has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 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":"cli/tools/pm/list.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbb3b1d71f4ffd7cbff6030c1b940e2e4fafd76a681b1bb730fcb7d893402ff"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::publish::perform_publish (cognitive 18): deno::tools::publish::perform_publish has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/mod.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"0159542c06b97168c5a89c53fc291a21cdcc030da311839ce91b11e102e283ae"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::x::autoinstall_package (cognitive 18): deno::tools::x::autoinstall_package has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 8). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"cli/tools/x.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"b313fcf6851cc5e37f6307aa0da3524fd035d16c9ccfed7a3fa3982f31222ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::util::pnpm_workspace::parse_pnpm_workspace (cognitive 18): deno::util::pnpm_workspace::parse_pnpm_workspace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), 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":"cli/util/pnpm_workspace.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3e1398c1fb0444b38e99ea349402059424148271f39aa9ae2f043f328e8c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::util::temp::attempt_fallback_temp_dir_garbage_collection (cognitive 18): deno::util::temp::attempt_fallback_temp_dir_garbage_collection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/temp.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd644889cbd96f0e84d40e69f7b9b525b39a3c82d6498f30b2baf8f2c1cd7026"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ffi::dlfcn::op_ffi_load (cognitive 18): deno_ffi::dlfcn::op_ffi_load has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 2 (5 pts), loops 1 (nesting depth added 10). 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":"ext/ffi/dlfcn.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fbddf6616927e66f055b1c62fdca5b26338b0340159bc826333fd490bdf6a9"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkStreamPrefixCheck::match_prefix_or_shutdown (cognitive 18): NetworkStreamPrefixCheck::match_prefix_or_shutdown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/network_buffered_stream.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c43e33a8c5aec7246f484ff75d1c6c8a9e2114cf64548489824a1cd69fd3557"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http::http_next::write_h1_flat_response (cognitive 18): deno_http::http_next::write_h1_flat_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (5 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":3561}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed5e2ad33d3222f03d8c01feb0c898b7e4660269e0fa040acd56bf6480a3a04"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http::request_properties::req_host_from_addr (cognitive 18): deno_http::request_properties::req_host_from_addr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, match/switch 1 (nesting depth added 6). 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":"ext/http/request_properties.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c76f6a848137c560746faa804cd6f161aa1f6909e00052ff1bd262d5180812"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_image::bitmap::parse_args (cognitive 18): deno_image::bitmap::parse_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, match/switch 6. 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":"ext/image/bitmap.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38dfd0958cf1fa3aba87834af3db7f4a566bfd251edcff8799aeeac6c4d5fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_napi::op_napi_open (cognitive 18): deno_napi::op_napi_open has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 6 (7 pts), 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":"ext/napi/lib.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cda6116bfadc090fbf69ace3bd89bec53db539d24016385cb8402c6b170a50c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_net::ops::op_net_connect_tcp_inner (cognitive 18): deno_net::ops::op_net_connect_tcp_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 3). 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":"ext/net/ops.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e02277c9befde9631bcd1b2b03418e393528055964fbc14c6202e988a876616"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::vm::op_vm_module_get_module_requests (cognitive 18): deno_node::ops::vm::op_vm_module_get_module_requests has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 1 (2 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":"ext/node/ops/vm.rs"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7866d894b62e61c8e2aa13325d24e4dce7c78490e4adcc9cbd146655e2820aa"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateFunctionOption::from_value (cognitive 18): AggregateFunctionOption::from_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (18 pts) (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":"ext/node_sqlite/database.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c754d763f6fd775f3f31ec401c075deae174d521b991167636f05c74f1e9e25e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node_sqlite::database::resolve_sqlite_system_path_alias (cognitive 18): deno_node_sqlite::database::resolve_sqlite_system_path_alias has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 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":"ext/node_sqlite/database.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3335fb5d863d20dda96287a18ffb6e4f23971c0de0ebb29babb63ee2535ea60"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node_sqlite::database::custom_aggregate_step_base (cognitive 18): deno_node_sqlite::database::custom_aggregate_step_base has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \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":"ext/node_sqlite/database.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"244f0ce4527f84b3762d0adf887d950c8d99c0a7fc3a6f6aab28408a0aa90367"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node_sqlite::database::custom_aggregate_value_base (cognitive 18): deno_node_sqlite::database::custom_aggregate_value_base has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (18 pts) (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":"ext/node_sqlite/database.rs"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3446294d1fcde5a6b9b77f8de57ea9b83e891935f33bfb6c8c302f4e0bb1c0e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::error_fmt::mark_node_modules (cognitive 18): deno_web::console::error_fmt::mark_node_modules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/error_fmt.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1515f4e8cb6bc266b1be178a3e332f4416815a8acdf2b0bfc392489540cfcb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Workspace::diagnostics::check_member_diagnostics (cognitive 18): Workspace::diagnostics::check_member_diagnostics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 3. 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. This shape REPEATS in the file: 2 other methods here (Workspace::diagnostics, Workspace::diagnostics::check_all_configs) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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":"libs/config/workspace/mod.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb76f9b560f776625947bbf97d06a78e08fb15ef0e1f68532881a07dc534916"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionContainer::dispatch_message_from_frontend (cognitive 18): SessionContainer::dispatch_message_from_frontend has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (6 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":"libs/core/inspector.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ba2b8c6bd9b806a2f404a7ed921eff7061cd57f6220672ba9d23b48b3db1ef"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleMap::drop_instantiated_requests (cognitive 18): ModuleMap::drop_instantiated_requests has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"297753f344b3b7ca62be5d3ebc7f1ae1a2f1347f8396b4b306de7df165182cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::runtime::bindings::op_ctx_template_or_accessor (cognitive 18): deno_core::runtime::bindings::op_ctx_template_or_accessor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (18 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":"libs/core/runtime/bindings.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bc859e707d9ada903f849b91e5260c0391292cfa0c6bcaf8c6b273e54e2652"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::uv_guess_handle (cognitive 18): deno_core::uv_compat::uv_guess_handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"a289f0531f8abc5f2f86958417485a31f3049e74407ea5d6772de34ecdb6fb9b"}},{"ruleId":"D2","level":"warning","message":{"text":"dcore::inspector_server::server (cognitive 18): dcore::inspector_server::server has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 1 (3 pts), loops 1 (nesting depth added 9). 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/dcore/src/inspector_server.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ec07ddc64280ac91bef0a0f62748c7060553d8762b41ab4a46563a7204b844"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_inspector_server::pump_websocket_messages (cognitive 18): deno_inspector_server::pump_websocket_messages has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 1 (5 pts), loops 1 (nesting depth added 12). 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/inspector_server/lib.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8bd62c77f9f34d303772dbc9c9783edaf4c8cf1f424b3b55233ab0c22b0c41"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeResolver::package_exports_resolve_internal (cognitive 18): NodeResolver::package_exports_resolve_internal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"503c3f192275970b64e14b2c36f62967bdec8500aa6500a22bd522fbfa072a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"StructField::try_from (cognitive 18): StructField::try_from has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (5 pts), loops 2 (4 pts) (nesting depth added 10). 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/ops/conversion/from_v8/struct.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bfd3803b6bc7587473d2daa5ce8bed26038c8f09d9db0e7343783ada1451e3"}},{"ruleId":"D2","level":"warning","message":{"text":"ByonmNpmResolver::resolve_package_folder_from_package::inner (cognitive 18): ByonmNpmResolver::resolve_package_folder_from_package::inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (2 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":"libs/resolver/npm/byonm.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77548319779c227f4955294c3e160889536acfb14ef222d90055e8659474ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"Host::parse_inner (cognitive 18): Host::parse_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"75883dfd425d5c4770007434ec680fd373a0fc08b20372952c68c4699efd1bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache.put (cognitive 18): Cache.put has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1 (2 pts) (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":"ext/cache/01_cache.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a99203437ce24c0a8736f07b5e42c760695975b820ec872db52a277beb9859"}},{"ruleId":"D2","level":"warning","message":{"text":"30_fs.createByteStruct (cognitive 18): 30_fs.createByteStruct has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/30_fs.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be2ce51cfa166fa4663827905470aa2a3448728db592fda6257f03b2b57f318"}},{"ruleId":"D2","level":"warning","message":{"text":"01_require.executeResolveHookChain (cognitive 18): 01_require.executeResolveHookChain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 1 (nesting depth added 4). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (nextResolve). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/01_require.js"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5185b8db1e5db3e7ae3182d800a30300b7b94a5fc0e08e3dda777e81c8117804"}},{"ruleId":"D2","level":"warning","message":{"text":"_fs_read.read (cognitive 18): _fs_read.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1, ternaries 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":"ext/node/polyfills/_fs/_fs_read.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2ea5b38eb19539e346e9a5c7ecaa71d885a39467764290c267614e361d0583"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_client.joinRequestHeadersForCdp (cognitive 18): _http_client.joinRequestHeadersForCdp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2271400617e1512530dfd17ac75417eadd4865739481dc8a41b4116aa03ec2b0"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_client.socketCloseListener (cognitive 18): _http_client.socketCloseListener has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0573ec2f5b6b269069697635dab8f9b0114f9f23607ea418489de884e07e53bf"}},{"ruleId":"D2","level":"warning","message":{"text":"assert.expectsError (cognitive 18): assert.expectsError has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/assert.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb7cf4bf470a6404c35d6e2327374915dad7acbc05243e3f83641d48bdcd600"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.write (cognitive 18): fs.write has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, ternaries 1 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 2 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":"ext/node/polyfills/fs.ts"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"360180434328544808c770d1164e67144f024290649b05781a755abb2e81d805"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.writeFile (cognitive 18): fs.writeFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, error handling 1, ternaries 1 (nesting depth added 1). Of this number, 9 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. 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":"ext/node/polyfills/fs.ts"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae92906eec6323bbd51675fbddfbc7fc53df3686393801acf8445cdf5393e92"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.watchPromise (cognitive 18): fs.watchPromise has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 2 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":"ext/node/polyfills/fs.ts"},"region":{"startLine":3630}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d259b856221f37aaf4c2e93ab26e5255565594d652176507dddada58ab05e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"http2.getUnpackedSettings (cognitive 18): http2.getUnpackedSettings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":5518}}}],"partialFingerprints":{"codehealthFindingId/v1":"222895dc8f2f464acd6dfa649fccc7e0c6806c96987f9c0abd9240b55685a4f8"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer.byteLength (cognitive 18): buffer.byteLength has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4629902f38313f477e1bc8511bfe0f341fe40474aa1195745aa9d3b4ffa86c1"}},{"ruleId":"D2","level":"warning","message":{"text":"cipher.prepareKey (cognitive 18): cipher.prepareKey has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"234062917a5f3b742d8c2c2564734530fa29110bde81be5aa0d951b9fd0b5453"}},{"ruleId":"D2","level":"warning","message":{"text":"address_override.h2ShadowServer (cognitive 18): address_override.h2ShadowServer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 2 (nesting depth added 4). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 404, 478). 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":"ext/node/polyfills/internal/http/address_override.js"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9399009085175462a7af4572bb1b040207cd4a95372f883aa0cd06e9eb81e7"}},{"ruleId":"D2","level":"warning","message":{"text":"JSStreamSocket.constructor (cognitive 18): JSStreamSocket.constructor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, loops 2 (4 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. 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":"ext/node/polyfills/internal/js_stream_socket.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9d15f4902a06727477d20585faba2e5c41ec4ab26cc6ab377444df0e872825"}},{"ruleId":"D2","level":"warning","message":{"text":"Utf8Stream.constructor (cognitive 18): Utf8Stream.constructor has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 8. Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8596773e9934e94a9e8a60ed1a5c3ca9f99f603f8330abe808f86e2edc7d1d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Utf8Stream.#flushSyncUtf8 (cognitive 18): Utf8Stream.#flushSyncUtf8 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, error handling 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ac227fc20f77ed18bf8c0f397b2b1f95d4881cafdc6412a46a48aec940c02e"}},{"ruleId":"D2","level":"warning","message":{"text":"comparisons.setEquiv (cognitive 18): comparisons.setEquiv has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"754459d27a3b0ea1d5720368883084d6f0c085a7baa327c62192eea78b4885df"}},{"ruleId":"D2","level":"warning","message":{"text":"cares_wrap.getaddrinfo (cognitive 18): cares_wrap.getaddrinfo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, error handling 1 (nesting depth added 3). None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 138, 174, 184). 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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"144deb2fac5c66e7344037dac8cea7c726fe8b054c2b32008ecbbdcb08313cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"_posix.extname (cognitive 18): _posix.extname has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). 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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ac895f78157684f0d7be04de115f3d5186e5c734056512f8cb27b7f616c21b"}},{"ruleId":"D2","level":"warning","message":{"text":"repl.defineDefaultCommands (cognitive 18): repl.defineDefaultCommands has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), error handling 2, boolean chains 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 491, 471, 426, \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":"ext/node/polyfills/repl.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca510841a5d8fdc87a75da991e44ffd44c4d33d479e148b205f2f0424dd25644"}},{"ruleId":"D2","level":"warning","message":{"text":"WASI.constructor (cognitive 18): WASI.constructor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 3). 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":"ext/node/polyfills/wasi.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d652478d86578bd5410b11992a8e6c35e5d14b9cd7ab08c1d0d0700e94f3db5"}},{"ruleId":"D2","level":"warning","message":{"text":"13_message_port.fastSerialize (cognitive 18): 13_message_port.fastSerialize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), ternaries 1 (2 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":"ext/web/13_message_port.js"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecade6dd059a055bc3a982818b604b48546562ce0528906406c169f4419c98e"}},{"ruleId":"D2","level":"warning","message":{"text":"stripTypeScriptTypes (cognitive 18): stripTypeScriptTypes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, error handling 1, other 1 (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":"ext/node/polyfills/01_require.js"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab02a66d0e6509445f8c512114c6c8d42c4193b0c9781bfdcab7e14f1e995bed"}},{"ruleId":"D2","level":"warning","message":{"text":"#receiveDatagrams (cognitive 18): #receiveDatagrams has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (5 pts), error handling 2 (3 pts), boolean chains 1, other 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":"ext/web/webtransport.js"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9192c90f5097d5947fe12e8c3a2127302c652e7cca0cba7e0c0f5cba0bb93f7"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 18): (computed) has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). Of this number, 16 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":"ext/fetch/20_headers.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9d8fd1bede14dee422be7da4b4e554eec3b18cda90f713b4c132a44aad74be"}},{"ruleId":"D2","level":"warning","message":{"text":"newStreamDuplexFromReadableWritablePair (cognitive 18): newStreamDuplexFromReadableWritablePair has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, error handling 5, boolean chains 3. Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 23 function items inside it that branch (write, a function literal at line 412, destroy, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b77b23625c53468689b622413320ae7f88af6cc5e52d38fec0c6fc5b72a820"}},{"ruleId":"D2","level":"warning","message":{"text":"timerify (cognitive 18): timerify has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, ternaries 2, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (timerified, a function literal at line 266). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/perf_hooks.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"be09ae168bb7c742ada84cc5f5408851dee6e6135b37b7cdbcfc1efdc2867f55"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadStream (cognitive 18): ReadStream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 3 (5 pts), boolean chains 2, other 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":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1acb378e4ac94c933503a25fcf8e9d6478751a2d49598f25282e8f0df191c1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 18): (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (invokeCallback, cb, cb). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/timers.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cbe1e33ebb791952da12bf0304835b44e5ddbb7c486e5c62be62a50e61b600"}},{"ruleId":"D2","level":"warning","message":{"text":"encodeLockName (cognitive 18): encodeLockName has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/locks.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a462f1f102000097b626b3112ea070847135eefcab8a5273a7b3b4832402f479"}},{"ruleId":"D2","level":"warning","message":{"text":"CliOptions::resolve_config_permissions_for_dir (cognitive 17): CliOptions::resolve_config_permissions_for_dir has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (7 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":"cli/args/mod.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8254dba1b2f3aebe6463fa9cde278265de18a081529bc44ce57c9bcc28796198"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::initialize (cognitive 17): Inner::initialize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"227a311075ee1002a67d2932a06db1593630b54a71cbf4aa050517cd5af46353"}},{"ruleId":"D2","level":"warning","message":{"text":"DenoTaskLifeCycleScriptsExecutor::run_single_package_scripts (cognitive 17): DenoTaskLifeCycleScriptsExecutor::run_single_package_scripts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 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":"cli/npm.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"645c8cba3568e73bf9d3bf4b596abc1d7c5903d81f7c91e2a97c7ebffba5c50f"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphWalker::maybe_get_check_entry (cognitive 17): GraphWalker::maybe_get_check_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). 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":"cli/type_checker.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f7905504f1dda6ec7c26e73f0dc65463ebd99edba1d61c103328c60fef520d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::code_lens::collect_tsc (cognitive 17): deno::lsp::code_lens::collect_tsc has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 4 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/code_lens.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb2aaf4a4f17c2b359db4fa3fd4b20d5f69d1dc4fd5e4707d01f3961fb2f38b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::testing::execution::extract_env_files_from_command (cognitive 17): deno::lsp::testing::execution::extract_env_files_from_command has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), boolean chains 3 (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":"cli/lsp/testing/execution.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae6c6d19de44518c878f7cf270b4c06c1e8eb7084e3ab32324db7ea826e3d15"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::bundle::flatten_declarations (cognitive 17): deno::tools::bundle::flatten_declarations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (deno::tools::bundle::inline_declarations) 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":"cli/tools/bundle/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5549ca5a981212021b6f5503df65950ff5bfdb32203171a7b4f5a78a53067a1"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::bundle::inline_declarations (cognitive 17): deno::tools::bundle::inline_declarations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (deno::tools::bundle::flatten_declarations) 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":"cli/tools/bundle/mod.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"589edc0f8502c0ef0c9495e773316517c9300f23b54e86d79ed601a5899e5fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::clean::walk_removing (cognitive 17): deno::tools::clean::walk_removing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/clean.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4923f4ad830c6ed4284aba302979ee7ec0d51a7d13b4bf43efb3ca538d91e1"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pack::package_json::extract_main_and_types (cognitive 17): deno::tools::pack::package_json::extract_main_and_types has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/package_json.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d9e2b0fc075d612e947de226fb54bea22a0326e6303f7cf1dd8bd8f989c9b0"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::approve_scripts::approve_scripts (cognitive 17): deno::tools::pm::approve_scripts::approve_scripts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 5, boolean chains 4, match/switch 1 (nesting depth added 1). To reduce it, split the body into named stages: move each independent 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":"cli/tools/pm/approve_scripts.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4825657a5592df34a946b22b3aaef0aaf3242c960970ec3d5dcde9db8d32b5"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::repl::run (cognitive 17): deno::tools::repl::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e8b776566fc95c2f4ec5c9d1126d775535fc17372a1bb3522526df8c8b8e8d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tsc::resolve_graph_specifier_types (cognitive 17): deno::tsc::resolve_graph_specifier_types has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 2 (3 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/mod.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5889dd299344a80e12551cc7a1abf1985c2f84bc556a37d329ee4de0b2e179"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tsc::tsconfig_gen::merge_deno_options (cognitive 17): deno::tsc::tsconfig_gen::merge_deno_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"46165fdc0bc9cbcc5599cee7bd63083edba5f00af8e0582c541e08f3348a8a86"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::util::env::load_env_variables_from_env_files (cognitive 17): deno::util::env::load_env_variables_from_env_files has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 2 (6 pts), loops 2 (3 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":"cli/util/env.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f115d4830b5eb2f67bff590c3dcaa720d097c8793e6ac021fdf59bd8b1b8e1db"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::util::extract::extract_file_from_block (cognitive 17): deno::util::extract::extract_file_from_block has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/extract.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"38955464adb1f3feaa573c89ecbc176f09597614879bb1bca97b3f9315e696fc"}},{"ruleId":"D2","level":"warning","message":{"text":"VfsBuilder::build (cognitive 17): VfsBuilder::build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (7 pts), loops 2 (nesting depth added 8). Of this number, 14 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":"cli/lib/standalone/virtual_fs.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"794d91a6263d5704f402fb19178c26001349b048002b8de5dbac13e83cfeee88"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::sign_key_sync (cognitive 17): deno_crypto::sign_key_sync has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 2 (4 pts) (nesting depth added 7). 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":"ext/crypto/lib.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"205a65104f55966de2da427c95e1c32d9e5da418e254611ceebab8f5228d4f79"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_export_key::export_okp (cognitive 17): deno_crypto::subtle_export_key::export_okp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 5 (6 pts) (nesting depth added 6). 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":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d079f37a7cbf9f83efafafa32c3c1e6036a8a5bae75978249bd7976bb77918"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_import_key::validate_jwk_akp (cognitive 17): deno_crypto::subtle_import_key::validate_jwk_akp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (deno_crypto::subtle_import_key::validate_jwk_oct) 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa9bc524fe4920b84313a84ceea03ccc9bff61ae58b6ce80d967dea7a5a3ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_import_key::validate_jwk_oct (cognitive 17): deno_crypto::subtle_import_key::validate_jwk_oct has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (deno_crypto::subtle_import_key::validate_jwk_akp) 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede132538b2a848559c1d1c04eced95607b944a611a36fb06209223e1d220989"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_verify::run (cognitive 17): deno_crypto::subtle_verify::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"ext/crypto/subtle_verify.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"896032a550b9d66d0ffbd08e1f7d6c6143471e3ffdfd54f9d57d39c7f01b8d85"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_napi::js_native_api::node_api_create_object_with_properties (cognitive 17): deno_napi::js_native_api::node_api_create_object_with_properties has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 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":"ext/napi/js_native_api.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"6769fa7d7465ad0669edab92b8f27ee8779d827b7f352d2f80aa328ba83f295c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_napi::js_native_api::napi_check_object_type_tag (cognitive 17): deno_napi::js_native_api::napi_check_object_type_tag has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, match/switch 1 (2 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":"ext/napi/js_native_api.rs"},"region":{"startLine":3252}}}],"partialFingerprints":{"codehealthFindingId/v1":"af59524624e4704d1f0a9bbe93b783f0ac332876f19123dbd72d781c2080dc6b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_napi::uv::_napi_uv_close (cognitive 17): deno_napi::uv::_napi_uv_close has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"ext/napi/uv.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a744eff8242f45992c7cc3ad977f83dfc9be4c87f4141f327c9abba420e5b80"}},{"ruleId":"D2","level":"warning","message":{"text":"WasiContext::fd_pwrite (cognitive 17): WasiContext::fd_pwrite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (7 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5195bb156aa06492abc20d4f332b1268979a1f766a570c0f78246c3f36729f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::ipc::impl_::ab_view_to_index (cognitive 17): deno_node::ops::ipc::impl_::ab_view_to_index has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16 (17 pts) (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":"ext/node/ops/ipc.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3849d6316f647817c0163795cf02930c28495c7bc48ae6b25707b76e8a693e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_process::deprecated::kill (cognitive 17): deno_process::deprecated::kill has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (7 pts) (nesting depth added 6). 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":"ext/process/lib.rs"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5933e24f4220b5588f12fe341ce3a5b7d93bf5550dfa8bc2c54d3946cee38b"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformListParser::next (cognitive 17): TransformListParser::next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (6 pts) (nesting depth added 6). 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":"ext/web/css_value.rs"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"702de5fd867b7eebb780988f294118df9e393047daf37b84c4642a0e6594965f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::op_console_quote_string (cognitive 17): deno_web::console::op_console_quote_string has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (4 pts) (nesting depth added 11). 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":"ext/web/console/mod.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be01e79876e60d358a09d76df740998a2ed7d4fcfd890da2a9d55d9db13e2ec"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_websocket::op_ws_next_event (cognitive 17): deno_websocket::op_ws_next_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/lib.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"3deb6174f911db84640e55521fc9e163509ee7d7e437c066740bdef915a086a1"}},{"ruleId":"D2","level":"warning","message":{"text":"FileFetcher::should_use_cache (cognitive 17): FileFetcher::should_use_cache has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). 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/cache_dir/file_fetcher/mod.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3158b1150dbb7c234d964eb914ce4838e4580d76383979eaaaa911c7a1b12e7"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalCacheManifestData::new (cognitive 17): LocalCacheManifestData::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cache_dir/local.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bca1ca00c0147b7436219df0e4776f4ced7e65ce0c44663a380abcb562f962c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::convert::install_parse (cognitive 17): deno_cli_parser::convert::install_parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ff1ae8e0760499fa0c002abb500e1176b5733290aefea3fa8706f80f5e8588"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_config::import_map::rewrite_jsr_imports_to_npm (cognitive 17): deno_config::import_map::rewrite_jsr_imports_to_npm has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (rewrite_map). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/import_map.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2102002530a94580f5c6d6f2ff30876c631f1b4c29cee1a016f65966f9425c39"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleMap::new_module_with_pending (cognitive 17): ModuleMap::new_module_with_pending has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2861362b999e441eaba8a660e18c4d203ab47c8cdbac79b6247e8811d0c6e1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::error::format_location (cognitive 17): deno_core::error::format_location has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/error.rs"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3991de16ec4f749082c1ee567672e0896e5814afbf7c8e2f9d7768ad32d488"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::modules::map::ext_script::strip_script_prologue (cognitive 17): deno_core::modules::map::ext_script::strip_script_prologue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 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":"libs/core/modules/map/ext_script.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a51053abe752aa94a2977b7f2ad77b18a0fde3560cd3a9ca6edf480f88149b4"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::pipe::uv_pipe_connect (cognitive 17): deno_core::uv_compat::pipe::uv_pipe_connect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 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":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"2909044273eeafadd3f7d3909eac0ba7f42ab62d80e3fc3659f658de75e6f0ad"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::stream::uv_shutdown (cognitive 17): deno_core::uv_compat::stream::uv_shutdown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), 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":"libs/core/uv_compat/stream.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"6199f0b7d7498864ecb00128d323739f3a7ee89802d26a671bfde680c058a26a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::uv_compat::tty::tty_try_write (cognitive 17): deno_core::uv_compat::tty::tty_try_write has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 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":"libs/core/uv_compat/tty.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42efcafe2b05ba8468e8571982967a7c81fdbad8d0ee2486e8f5c0889e61b74"}},{"ruleId":"D2","level":"warning","message":{"text":"EszipV2::from_graph (cognitive 17): EszipV2::from_graph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 6 (14 pts), match/switch 4 (7 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (EszipV2::from_graph::visit_module) 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":"libs/eszip/v2.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"620da2260a9c329eb3417e185e86cac921c3feb9f411bc77ead77744b634c973"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http_h1::write::write_response_head_inner (cognitive 17): deno_http_h1::write::write_response_head_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (deno_http_h1::write::write_response_head_to_inner) 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":"libs/http_h1/write.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c8e8a0a96cea4903503df0f75ce5719ed2c91e9a7623548d0bc5bbf481345d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http_h1::write::write_response_head_to_inner (cognitive 17): deno_http_h1::write::write_response_head_to_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (deno_http_h1::write::write_response_head_inner) 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":"libs/http_h1/write.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ce1d21c5c4df1ce5deae7ea25c00150384015e34b3569f3f10c4af85b2d860"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_inspector_server::pump_event_notifications (cognitive 17): deno_inspector_server::pump_event_notifications has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/inspector_server/lib.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ec61d5370e1da5e6fe65124c749e1dc490e3445a250f2428d21c4e0e191d99"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDependencyResolver::dedup_dep_paths (cognitive 17): GraphDependencyResolver::dedup_dep_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 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":"libs/npm/resolution/graph.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e09b5d8b1f7cda5afb6a1c8c9be4cfded27a9467090b056cd6a3cf52de5b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm_cache::tarball_extract::extract_tarball (cognitive 17): deno_npm_cache::tarball_extract::extract_tarball has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), 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":"libs/npm_cache/tarball_extract.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ba32ae056f3c1e54f4911dc197c2b465c3213408e5bbf5c7b3a010bf4f6726"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npmrc::ini::parse_quoted_string::take_inner_text (cognitive 17): deno_npmrc::ini::parse_quoted_string::take_inner_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npmrc/ini.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c7bd8bc060dc062555ac7f00948cd35c05bbb51b0213c21e1001c8c54df1ca"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroConfig::from_metas (cognitive 17): MacroConfig::from_metas has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/config.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9853f4419aecd60f5c7c4bde55e169d8a5b911ae7de7e7d058d00c4cb4dc4618"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceFactory::raw_node_modules_dir_mode (cognitive 17): WorkspaceFactory::raw_node_modules_dir_mode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/factory.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99dbd53cad58e2852134e81dfa4da1c8cbe5ee75e45b8e726c9288784fd1d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedModuleLoader::load_prepared_module_or_defer_emit (cognitive 17): PreparedModuleLoader::load_prepared_module_or_defer_emit has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 2 (5 pts) (nesting depth added 9). 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/resolver/loader/module_loader.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"827df0de8660516957de8e00ea4bcbd929b84e7736d61c891e78334431c5993e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_resolver::npm::managed::common::find_definitely_typed_package_from_snapshot (cognitive 17): deno_resolver::npm::managed::common::find_definitely_typed_package_from_snapshot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 1 belongs 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":"libs/resolver/npm/managed/common.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0b685513b1749efc44ed100bf7458b3666b3f06a227468544321053b45c587"}},{"ruleId":"D2","level":"warning","message":{"text":"40_lint.subTraverse (cognitive 17): 40_lint.subTraverse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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":"cli/js/40_lint.js"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"54364cdd123fec8de4d87ccc529eefdc2fcf291d424a8724f605702c6d3c3a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"20_headers.getDecodeSplitHeader (cognitive 17): 20_headers.getDecodeSplitHeader has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/20_headers.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"005b95d378232766a1fc17c7f44105c8888de07c32c30d194b1be3192dbad94f"}},{"ruleId":"D2","level":"warning","message":{"text":"02_websocket.buildCaseInsensitiveCommaValueFinder (cognitive 17): 02_websocket.buildCaseInsensitiveCommaValueFinder has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 4 (nesting depth added 4). None of this is in the body itself: all 17 points belong to 4 function items inside it that branch (a function literal at line 263, hasWord, skipWhitespace, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/02_websocket.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9501126933ed118a3bbb3e0cb2f95c2a3793b846357de963e39671a77700e9"}},{"ruleId":"D2","level":"warning","message":{"text":"_fs_readdir.readdirSync (cognitive 17): _fs_readdir.readdirSync has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), error handling 1 (2 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":"ext/node/polyfills/_fs/_fs_readdir.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f503da5af12f3f4e0040d0d8f3f6b155acab597c3a107823a0c38d1a19a964d9"}},{"ruleId":"D2","level":"warning","message":{"text":"myers_diff.myersDiff (cognitive 17): myers_diff.myersDiff has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (6 pts), boolean chains 4, if/else 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/myers_diff.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa7c9964bc1f557b55eb98c84a08abc212d9d22e573cde2158c6ce750ea0988"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer._from (cognitive 17): buffer._from has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4 (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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ec9c3c7eca80de9d083b78375078c160340453ba0394fbb6680f33210fdf19"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.normalizeStdioOption (cognitive 17): child_process.normalizeStdioOption has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 1 (2 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d658023f3e967e26b6acb2521bfe77acb1f9604d8ef76ea6df83d9e57f5f5d7"}},{"ruleId":"D2","level":"warning","message":{"text":"cipher.Cipheriv.final (cognitive 17): cipher.Cipheriv.final has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd5643895c9908d4ce41e727cefa923ce8e2397bcd7a2f9a92ae904b4be7fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"cipher.Cipheriv.update (cognitive 17): cipher.Cipheriv.update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (17 pts) (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. This shape REPEATS in the file: one other method here (cipher.Decipheriv.update) 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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b0cb34191721ac292e4d7871105da4ffb6019f1a87047559b3c39254608a12"}},{"ruleId":"D2","level":"warning","message":{"text":"cipher.Decipheriv.update (cognitive 17): cipher.Decipheriv.update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (17 pts) (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. This shape REPEATS in the file: one other method here (cipher.Cipheriv.update) 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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"158c069caaa12f808f4e064538fe29ae1f4c03cfa74b2af3e4677b295a6147d3"}},{"ruleId":"D2","level":"warning","message":{"text":"keys.prepareAsymmetricKey (cognitive 17): keys.prepareAsymmetricKey has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a9a1cf6916870ae3393e8e01e857a49820f67ed697bc87787596824ba1da3a"}},{"ruleId":"D2","level":"warning","message":{"text":"promises.lookup (cognitive 17): promises.lookup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/dns/promises.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"903f3c63d02ea2d439c77bae483b311df016d2da124bc21b781ff61ad8741584"}},{"ruleId":"D2","level":"warning","message":{"text":"Http2ServerResponse.end (cognitive 17): Http2ServerResponse.end has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4 (nesting depth added 2). 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":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"e736eea41d319c0ba5f872641a9ca6f10d22a8fbad5ffea1b1351cbdc3130657"}},{"ruleId":"D2","level":"warning","message":{"text":"warning.onWarning (cognitive 17): warning.onWarning has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 7, loops 1 (2 pts) (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":"ext/node/polyfills/internal/process/warning.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df4805e122685f186bd5562118eeaca6fd8c00b5744774c7da9097ecb06ae77"}},{"ruleId":"D2","level":"warning","message":{"text":"Interface.[kTabCompleter] (cognitive 17): Interface.[kTabCompleter] has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 1 (nesting depth added 2). 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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59fb74464f459e9d401da75f846683c44bef0dda794cfd0e1c6eb56fbb9afda"}},{"ruleId":"D2","level":"warning","message":{"text":"Utf8Stream.#flushBufferSync (cognitive 17): Utf8Stream.#flushBufferSync has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95c3292c0685e58c1f3266e4f48a4f24fa42b41d416a23d55b18352877fcb57"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer.searchBytes (cognitive 17): buffer.searchBytes has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/buffer.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"259b36ff00f71978f15cd25376095d1914186983aa0c0781ee884fa5d4c7dfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"ChannelWrap.getHostByAddr (cognitive 17): ChannelWrap.getHostByAddr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af7b68c17821df10a6fd15f57e48be34d6018f67bb1d23795f9be44de87ee25"}},{"ruleId":"D2","level":"warning","message":{"text":"querystring.unescapeBuffer (cognitive 17): querystring.unescapeBuffer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/querystring.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19422b830806bb486c38947b0f397776ee8a80a468100561c7b59e14a838b37"}},{"ruleId":"D2","level":"warning","message":{"text":"REPLServer.constructor::_doComplete::completionGroupsLoaded (cognitive 17): REPLServer.constructor::_doComplete::completionGroupsLoaded has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 5 other methods here (REPLServer.constructor, REPLServer.constructor::defaultEval, REPLServer.constructor::_doComplete, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fac81dba047c1b2491d3472cbdea998226d5545ca3f131e2264945f966036d"}},{"ruleId":"D2","level":"warning","message":{"text":"worker_threads.postMessageToThread (cognitive 17): worker_threads.postMessageToThread has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 3, boolean chains 2 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee92e0a679acbdd126c3c393a061b7b8bf5ca50a584f67a3092031032dd5a80"}},{"ruleId":"D2","level":"warning","message":{"text":"01_core.runImmediates (cognitive 17): 01_core.runImmediates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/01_core.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace778aff97f65cca58ec1fc458ac93dbe99c75c2ca0982a4fa7f8d85a8fa615"}},{"ruleId":"D2","level":"warning","message":{"text":"10_permissions.cache (cognitive 17): 10_permissions.cache has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8 (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":"runtime/js/10_permissions.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a694f9f113e7d77bad4dd5c56185d9c60a29daf26850ad3993b60b2d8a07a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"readableByteStreamTee::closeSteps (cognitive 17): readableByteStreamTee::closeSteps has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 4, boolean chains 2 (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":"ext/web/06_streams.js"},"region":{"startLine":4108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8e3324e4a8ec6bc358888ae2f6267f9b4de7cdb138984e7691dec26db2ec46"}},{"ruleId":"D2","level":"warning","message":{"text":"executeEsmResolveHookChain (cognitive 17): executeEsmResolveHookChain has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), error handling 2 (5 pts), boolean chains 2, loops 1, other 1 (nesting depth added 5). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (nextResolve, nextResolve::wrappedNext). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/01_require.js"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4926aec3dba90c87543f83cf70a0c06081530b17c94f7d35fd4f879ee19ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"concat (cognitive 17): concat has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"841ad898a9d76fcb6adca0a42b15294174e051ba12237a430166a14eb634e81d"}},{"ruleId":"D2","level":"warning","message":{"text":"addChunk (cognitive 17): addChunk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 1 (2 pts), boolean chains 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea2dc48dfa68b61e45f6a5132506424671f9ec4c90e14bf9f71f7452e3afa30"}},{"ruleId":"D2","level":"warning","message":{"text":"createAsyncIterator (cognitive 17): createAsyncIterator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, ternaries 2 (3 pts), error handling 1, loops 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baf4543a4c4e503391d974b65e1ffe30362be95371614965d10beb5fdcae13a"}},{"ruleId":"D2","level":"warning","message":{"text":"structuredClone (cognitive 17): structuredClone has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/13_message_port.js"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"1845737248f3b66a522ef9e809a73c660683cd92f85c87d6be313f3b6de13501"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 17): (computed) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 1 (nesting depth added 2). 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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"172a8e3279cfcf122cc2d2ccfd3446bbb9593d77b9075268332cd6ce98bdaf38"}},{"ruleId":"D2","level":"warning","message":{"text":"_addListener (cognitive 17): _addListener has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 1 (3 pts), boolean chains 1, other 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_events.mjs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef7a88c33153c4da2220f13e49002bb4a8d6eeeb087871c70652288acd31721"}},{"ruleId":"D2","level":"warning","message":{"text":"readable (cognitive 17): readable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 5 function items inside it that branch (pull, a function literal at line 879, a function literal at line 886, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/webtransport.js"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"30260dae8b2534d6ad611a3d18a86b5c2f3116edb72fb2b03c47fe5d81cd11cd"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 17): (computed) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (17 pts) (nesting depth added 9). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 918, 922, 920, \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":"ext/websocket/01_websocket.js"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efa9c5c7079b18d7ff059883ed8ae963c8460d7419f670f45f040fb0313c35d"}},{"ruleId":"D2","level":"warning","message":{"text":"keepSocketAlive (cognitive 17): keepSocketAlive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 1 (4 pts), boolean chains 1 (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":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb4284ae641c4c16b86afb91932be5cf5d5af906ac163103f77f292bcf37c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"map::map::pump (cognitive 17): map::map::pump has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/operators.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3ae3a50bb66b873a55e76b13377df1c5244803831f7fb7f5e9970cce63c292"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigData::load (cognitive 16): ConfigData::load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 9). 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":"cli/lsp/config.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3c36290e06db380d9271d28c9ab4ddf0648dcd1ee7bfc42aadd785dccee33b"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigData::load_inner (cognitive 16): ConfigData::load_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, match/switch 2 (3 pts) (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":"cli/lsp/config.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87732e30b8aa8f6ad1527bdda3b5f4fde9ce6028efdd51f3d43c1fe7bfafd17"}},{"ruleId":"D2","level":"warning","message":{"text":"Documents::change_notebook (cognitive 16): Documents::change_notebook has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (5 pts), match/switch 2 (5 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":"cli/lsp/documents.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dac161caad1e2d137f52297da07c3bd556f959f936ec2f526ce81a76984920"}},{"ruleId":"D2","level":"warning","message":{"text":"TestRun::get_args (cognitive 16): TestRun::get_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2 (3 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":"cli/lsp/testing/execution.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06ce2ad936c017bb096fb619a9d3fb41fab3ee492775e4bb9b63943147eca2c"}},{"ruleId":"D2","level":"warning","message":{"text":"BinNameResolver::infer_name_from_url (cognitive 16): BinNameResolver::infer_name_from_url has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, match/switch 2 (3 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":"cli/tools/installer/bin_name_resolver.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c00a6bd7744ad5c46f84212eab15bda050dc84c64ef2868ee6ad483ac362839"}},{"ruleId":"D2","level":"warning","message":{"text":"BarProgressBarRenderer::render (cognitive 16): BarProgressBarRenderer::render has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 pts) (nesting depth added 2). 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":"cli/util/progress_bar/renderer.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7e74c31bded73c625a52a67a7874c0923b9a211d16dd4f0f52150e75935c6a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::lsp::completions::get_jsr_completions (cognitive 16): deno::lsp::completions::get_jsr_completions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/completions.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ab934f79670eae326f5af8d0237ccd101761e0dc2283489b5f821a25792272"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::init::init_project (cognitive 16): deno::tools::init::init_project has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15 (16 pts) (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":"cli/tools/init/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a886313f92b89ef39610e311461f9c888a07c39aafddf51f36a014d6ba8671a"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::lint::ast_buffer::swc::serialize_decl (cognitive 16): deno::tools::lint::ast_buffer::swc::serialize_decl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (7 pts) (nesting depth added 6). 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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"85aef985a1ce72565f262d4264549fc54f62af9b5432d64157766d5593d5c6f1"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pack::process_single_module (cognitive 16): deno::tools::pack::process_single_module has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \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":"cli/tools/pack/mod.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c91979631cf4ba7cdd29052351d8dcd67f6ec14bb48c8a47cfb8b29017f83b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::audit::socket_dev::print_firewall_report_to (cognitive 16): deno::tools::pm::audit::socket_dev::print_firewall_report_to has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/audit.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"5482a77b825e122b21016c15e8cade2f3d934083b65d690389e8f17dcfaf130b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::pm::list::print_tree (cognitive 16): deno::tools::pm::list::print_tree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (nesting depth added 6). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (walk). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/list.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e620d321abca509e98f9a34384b1d628ebc6bcc4283d5f17f16765092b55da"}},{"ruleId":"D2","level":"warning","message":{"text":"deno::tools::upgrade::build_delta_chain (cognitive 16): deno::tools::upgrade::build_delta_chain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (4 pts), boolean chains 2 (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":"cli/tools/upgrade.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5065e3ce26a1a866ba046588251b6eb6c6244520822a5c9693fe6871eb1a756"}},{"ruleId":"D2","level":"warning","message":{"text":"CjsCodeAnalyzer::inner_cjs_analysis (cognitive 16): CjsCodeAnalyzer::inner_cjs_analysis has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (5 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":"cli/rt/node.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"69373aee1357da81fad38b6b579eef7c3e9ac9ac26d9717d49ef2a10a0d5d030"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_crypto::subtle_export_key::jwk_to_object (cognitive 16): deno_crypto::subtle_export_key::jwk_to_object has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, loops 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":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8df7cf2ceda98a94200f5a3752344692e333a3ae580607d5c5dd500eea64cc5"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_ffi::turbocall::compile_trampoline::convert (cognitive 16): deno_ffi::turbocall::compile_trampoline::convert has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). 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 (deno_ffi::turbocall::compile_trampoline) 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":"ext/ffi/turbocall.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"81010606981ce0ca2e4b4ed7656e779320dfaeccbc0307525ce3dfa2ea7d697d"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_fs::std_fs::cp (cognitive 16): deno_fs::std_fs::cp has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (nesting depth added 2). Of this number, 8 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/std_fs.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d04b41bf113ec2e05877ecc5db8bf49106c467bb1d0b17fbb067aa68198db0"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http::op_http_write_resource (cognitive 16): deno_http::op_http_write_resource has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (4 pts), 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":"ext/http/lib.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1db774516a09acfab6a4d3fd030564f1309475f0aa67a42de92a298c70ec0f"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_http::http_next::write_h1_flat_response_shared (cognitive 16): deno_http::http_next::write_h1_flat_response_shared has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":3920}}}],"partialFingerprints":{"codehealthFindingId/v1":"7051d96aa1eeaca2b0ccbd1e1e948683e8a1b7698ecf614425af5a211c3a82c2"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_image::bitmap::op_create_image_bitmap (cognitive 16): deno_image::bitmap::op_create_image_bitmap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, match/switch 4 (5 pts), boolean chains 1 (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":"ext/image/bitmap.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b196699c8b4f0b39ed2ebfc53a9227a39d9668dcd4a3fffa9d6df56d4a10df"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_napi::uv::uv_ref (cognitive 16): deno_napi::uv::uv_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), 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. This shape REPEATS in the file: one other method here (deno_napi::uv::uv_unref) 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":"ext/napi/uv.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abbb53bf2251119a3c23d60b30dbdcb394b1e6dd479eca8e907903ea9357561"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_napi::uv::uv_unref (cognitive 16): deno_napi::uv::uv_unref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), 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. This shape REPEATS in the file: one other method here (deno_napi::uv::uv_ref) 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":"ext/napi/uv.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"976afd2296e77e9e2fb486adc055bd86d5efb468b8c0f506550c99bfefc394f0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSWrap::set_alpn_protocols (cognitive 16): TLSWrap::set_alpn_protocols has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), boolean chains 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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":3056}}}],"partialFingerprints":{"codehealthFindingId/v1":"657f31ad20e12f5ab0158a482a8ef62285ea9f860201ff89061456989a50bfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"WasiContext::fd_readdir (cognitive 16): WasiContext::fd_readdir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0381928a28f1a6d368639240fd1c52220dec101f1a3ed462dd98879d3ed6a590"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::fs::check_parent_paths_impl (cognitive 16): deno_node::ops::fs::check_parent_paths_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (deno_node::ops::fs::check_parent_paths_impl_sync) 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":"ext/node/ops/fs.rs"},"region":{"startLine":2531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c62b790492ecc0e395dc85393ce5608d1f81f4ca5fac9ca5dbc5a9ca13801fe"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::fs::check_parent_paths_impl_sync (cognitive 16): deno_node::ops::fs::check_parent_paths_impl_sync has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (deno_node::ops::fs::check_parent_paths_impl) 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":"ext/node/ops/fs.rs"},"region":{"startLine":2624}}}],"partialFingerprints":{"codehealthFindingId/v1":"b917cd4b0a3a4d529ebd00f2263723f7b4149b13a2070b46fcc5469c7ca96995"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::http2::session::h2_read_cb (cognitive 16): deno_node::ops::http2::session::h2_read_cb has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (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":"ext/node/ops/http2/session.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9202f2d1a36aa92a5c54b5ce622a190738504c50aba3502db6932709d3e9da0e"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::tls_wrap::der_time_secs (cognitive 16): deno_node::ops::tls_wrap::der_time_secs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 2). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":3939}}}],"partialFingerprints":{"codehealthFindingId/v1":"93959a84d4bcfbbdb1d9135795bb7a94e18a7a247cd2d594983d4061e0914809"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::vm::property_setter (cognitive 16): deno_node::ops::vm::property_setter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, match/switch 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":"ext/node/ops/vm.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22e2b072923004f4feb2d89240c1eae835428a66b83594d65d4c6240cd7092b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node::ops::wasi::canonicalize_lookup (cognitive 16): deno_node::ops::wasi::canonicalize_lookup has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04e5e6da134763cfaacaef750499d83f1552df9912dd6aa42e03d73075fd6a5"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSync::apply_changeset (cognitive 16): DatabaseSync::apply_changeset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (conflict_handler, filter_handler). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c009489d7cb4e936f6c79abab3d1fc4d93049c89dd879b85abf7a574d71f455"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementSync::columns (cognitive 16): StatementSync::columns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/statement.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"8488a3cfce4f125bf6bc54aa37f3021e0c8483b4a3ba5b9c1f48ae7357008ea3"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node_sqlite::backup::op_node_database_backup (cognitive 16): deno_node_sqlite::backup::op_node_database_backup has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/backup.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7980dc1925d1eccae29ca6fa4902e2a621dc89ceb46fa5d0008aba71857d3f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_node_sqlite::database::open_db (cognitive 16): deno_node_sqlite::database::open_db has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"c380e64abb3e512e022e83ecd58fa996f142a8cacc93447173cc3b34ee4b3252"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_process::op_spawn_sync::read_with_limit (cognitive 16): deno_process::op_spawn_sync::read_with_limit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (deno_process::op_spawn_sync) 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":"ext/process/lib.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b2553ec184c5726aacf7d1c9184f05ed56f08a75f3d8b621d9ef5ef2d84278"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_web::console::error_fmt::identical_sequence_range (cognitive 16): deno_web::console::error_fmt::identical_sequence_range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 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":"ext/web/console/error_fmt.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6a905cd3c63758c3e1e68acb87f459db8eca4a6d966ec7d7f40b0fa3189fbf"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthDomain::matches (cognitive 16): AuthDomain::matches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cache_dir/file_fetcher/auth_tokens.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e84ba6bbd486f1d3307f0596af44f06cfc090b35b5e361186c5728efffe7f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_cli_parser::convert::ignore_scripts_value (cognitive 16): deno_cli_parser::convert::ignore_scripts_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"02941dbb0551a52f63668370630d8e6687f17bbc80dd44a7138f46ebf657a00f"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceDirectory::discover::resolve_start_dir (cognitive 16): WorkspaceDirectory::discover::resolve_start_dir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (8 pts) (nesting depth added 9). 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/config/workspace/mod.rs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"231b2c2920d89ffe0a7bff84d14bf1a10e1c4161f6fc71f7aa2557e08f9ba5c1"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeActivityStatsFactory::capture (cognitive 16): RuntimeActivityStatsFactory::capture has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/stats.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bcc74c12645e9ab6a4c0a4277d2f9bb681e471921587b6e9a4c9c38d9b50a4"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::ops_builtin_v8::op_compile_function (cognitive 16): deno_core::ops_builtin_v8::op_compile_function has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 4 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"5367d70832b1cdce96dfea93d5a6364c900a0bd1f95f9d358698dc1401896dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::ops_builtin_v8::op_current_user_call_site (cognitive 16): deno_core::ops_builtin_v8::op_current_user_call_site has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bba4db2f55346fa5847fd45579ea11c47be292b01643405ae3fd4b0dca56fe"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_core::runtime::bindings::op_ctx_function_or_accessor (cognitive 16): deno_core::runtime::bindings::op_ctx_function_or_accessor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/bindings.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c1217f6753175c392dd7dd573ca08015f4875dea3738ed184e494c3eb5dd40"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_lockfile::split_git_conflict_sides (cognitive 16): deno_lockfile::split_git_conflict_sides has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/lockfile/lib.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee2262611292ead7cb659bb82977b1e59b461773171b4cf7f7e68eceb0b19c6"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmPackageVersionInfo::dependencies_as_entries (cognitive 16): NpmPackageVersionInfo::dependencies_as_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs 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":"libs/npm/registry.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"26601c1e7a5f07b7a07822dec1e9ed88ee75349632bc4c6de33b0e75d512ffd6"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmPackageVersionResolver::resolve_best_package_version_info (cognitive 16): NpmPackageVersionResolver::resolve_best_package_version_info has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/common.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"435b7def03b23d8aad7c25adfb99465fed8597a422f0520df1429cc63ea894bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::resolve_packages_for_snapshot_with_maybe_restart (cognitive 16): Graph::resolve_packages_for_snapshot_with_maybe_restart has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/graph.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"096bdd4c443dd5c61dad02f896476baf2b961f433df5d895fa5053057f7eb83b"}},{"ruleId":"D2","level":"warning","message":{"text":"deno_npm_installer::resolution::peer_dep_diagnostics_to_display_tree (cognitive 16): deno_npm_installer::resolution::peer_dep_diagnostics_to_display_tree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 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":"libs/npm_installer/resolution.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"88187514b27f466a07ae5eabb50e6c60d5385a00694b369c1f5b90f89957d276"}},{"ruleId":"D2","level":"warning","message":{"text":"EnumVariantAttribute::from_variant (cognitive 16): EnumVariantAttribute::from_variant has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), match/switch 2 (5 pts), if/else 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":"libs/ops/conversion/to_v8/enum.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e7e51a105f2cdd5fb931713c2399af930d5d91add5e721cda617d6d1acf759"}},{"ruleId":"D2","level":"warning","message":{"text":"ByonmNpmResolver::resolve_pkg_folder_from_deno_module_req (cognitive 16): ByonmNpmResolver::resolve_pkg_folder_from_deno_module_req has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 6). Of this number, 9 points are the body\u0027s own statements and 7 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":"libs/resolver/npm/byonm.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d417a89687873b90603288e2da56696de58c8dc6c9a1a768c6cd7a169d30dfd8"}},{"ruleId":"D2","level":"warning","message":{"text":"99_main_compiler.exec (cognitive 16): 99_main_compiler.exec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), ternaries 3, boolean chains 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":"cli/tsc/99_main_compiler.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae0f6ce3ad99cf12d197e6b1203720e82776caf1d19a671c2bf7c54afdb361b"}},{"ruleId":"D2","level":"warning","message":{"text":"23_request.cloneInnerRequest (cognitive 16): 23_request.cloneInnerRequest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, error handling 2 (4 pts), boolean chains 1 (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":"ext/fetch/23_request.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6524976c187ceb462223f9740dfcd14b26af9c47c6a47c022426d1f1e2f80d"}},{"ruleId":"D2","level":"warning","message":{"text":"26_fetch.parseContentTypeForCdp (cognitive 16): 26_fetch.parseContentTypeForCdp has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f46ebeb5ba04495ca31476b6dcccafc4d3af3de9dafef072c67fb3e1cb4ff6"}},{"ruleId":"D2","level":"warning","message":{"text":"30_fs.parseFileInfo (cognitive 16): 30_fs.parseFileInfo has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 15, boolean chains 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":"ext/fs/30_fs.js"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"09643002af2e08334d8fa36eb57b46acdf2306b55802795142ace86867a98fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"InnerRequest.close (cognitive 16): InnerRequest.close has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (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":"ext/http/00_serve.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2649a02638eeb38b0f9fe5a44b9d9674fbd6c80530fcf46bb2732068e9bc3699"}},{"ruleId":"D2","level":"warning","message":{"text":"00_serve.serve (cognitive 16): 00_serve.serve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 1 (2 pts), ternaries 1 (2 pts) (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":"ext/http/00_serve.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71163c87e96efcdc6c0fb66318f1f36f68e80733657db02de9bdd3f5d235ee4"}},{"ruleId":"D2","level":"warning","message":{"text":"Glob.#addSubpattern (cognitive 16): Glob.#addSubpattern has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"614d111cb6540b11cd547d0a769a24bdb2231887f86fceb15ca3f576ab6ab19a"}},{"ruleId":"D2","level":"warning","message":{"text":"_http_outgoing.tryDirectEnd (cognitive 16): _http_outgoing.tryDirectEnd has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. 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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"426b533f1a025f24cc1ae11f6df640ca98b6d3214d6434b3adc46b248167888d"}},{"ruleId":"D2","level":"warning","message":{"text":"_tls_wrap.connect (cognitive 16): _tls_wrap.connect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4 (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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dc544e2cd0d4285b538ddda59be72feba3239fc9603265cd41c0fc1ffd6e36"}},{"ruleId":"D2","level":"warning","message":{"text":"child_process.execFile::exithandler (cognitive 16): child_process.execFile::exithandler has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. 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. This shape REPEATS in the file: one other method here (child_process.execFile) 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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9b6eb633809f6bbb702853f76e0c0ffd5b6172e5b0965c7281b5d47684736d"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.readFileFromFd (cognitive 16): fs.readFileFromFd has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (3 pts), ternaries 2 (3 pts), boolean chains 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":"ext/node/polyfills/fs.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cda3144d69cfd09e8478126662e6f1629307651568a1e9017af657841c57464"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.mkdir (cognitive 16): fs.mkdir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs.ts"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b84ab7c22f09193bcdb752a5cf06e610e30aec8171693a3dedac5ec3e9aa973"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerHttp2Stream.pushStream (cognitive 16): ServerHttp2Stream.pushStream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, match/switch 1 (2 pts), ternaries 1 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"d769099526bbba0b6deaee8f22a549bad94959ce4764528ba0c57851dd99655a"}},{"ruleId":"D2","level":"warning","message":{"text":"http2.requestOnConnect (cognitive 16): http2.requestOnConnect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 3). Of this number, 12 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38fe93bf30c4b9908dead15e6158490d7eaaabf74a9ff8ef6cccfd3a2b20fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"http2.closeSession (cognitive 16): http2.closeSession has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, loops 2 (4 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3819}}}],"partialFingerprints":{"codehealthFindingId/v1":"906fef4dec57ea71aa7c9d1ed4b36003ce58befc700ba65c21e5ce367282f137"}},{"ruleId":"D2","level":"warning","message":{"text":"http2.connect (cognitive 16): http2.connect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, match/switch 1 (2 pts) (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":"ext/node/polyfills/http2.ts"},"region":{"startLine":5345}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca134e24d9537d10e42caa71e592e3846e1b9688cc658f5024df80cb50fdcaa"}},{"ruleId":"D2","level":"warning","message":{"text":"primary.init::queryServer (cognitive 16): primary.init::queryServer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (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. This shape REPEATS in the file: one other method here (primary.init::createWorkerProcess) 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":"ext/node/polyfills/internal/cluster/primary.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fb272b44c7ea163e6727822ff41ea69464d478e0ecd358744c822cae79a924"}},{"ruleId":"D2","level":"warning","message":{"text":"pbkdf2.pbkdf2 (cognitive 16): pbkdf2.pbkdf2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 2 (nesting depth added 3). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 170, 152). 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":"ext/node/polyfills/internal/crypto/pbkdf2.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"932e85f88b65dff58446fb4451edc084cf21ac3c3e36360615dcc689e6bc518b"}},{"ruleId":"D2","level":"warning","message":{"text":"util.prepareRequestHeadersObject (cognitive 16): util.prepareRequestHeadersObject has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"79459543cc8154a0c36bfde3220aa4c12b44d6e8a8b450f417b2a25a3a1aa5a6"}},{"ruleId":"D2","level":"warning","message":{"text":"writable.writeOrBuffer (cognitive 16): writable.writeOrBuffer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71ee48bde2ad46d398433470eb33da19f99ee106f88b310157a4bd79964974f"}},{"ruleId":"D2","level":"warning","message":{"text":"writable.Writable.end (cognitive 16): writable.Writable.end has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 pts) (nesting depth added 2). 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd97fac7a0bf234e9a4d55d354503601f338a880012b27482d5726cb26cb084"}},{"ruleId":"D2","level":"warning","message":{"text":"http_parser.HTTPParser.execute (cognitive 16): http_parser.HTTPParser.execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/http_parser.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab44f0eb24b773f9167435d84723db172753e846c62fede22f4028e56f194a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"net.Socket.connect (cognitive 16): net.Socket.connect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). 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":"ext/node/polyfills/net.ts"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3254bf9de8599cd1c6f46454ec3c78c922640e76dcd701b0dbf531ece04d9590"}},{"ruleId":"D2","level":"warning","message":{"text":"process.emitWarning (cognitive 16): process.emitWarning has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/process.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c12d7a0db337a1192e833c88f6dbf3ea5e12b966420e8c6fd44cfa32728139"}},{"ruleId":"D2","level":"warning","message":{"text":"repl.isRecoverableError (cognitive 16): repl.isRecoverableError has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 1 (2 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a8716a1329d37595037fe6a2bdd8e412a846630b9f7ce783b4f0e71c050390"}},{"ruleId":"D2","level":"warning","message":{"text":"timers.setIntervalAsync (cognitive 16): timers.setIntervalAsync has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (3 pts), boolean chains 1, error handling 1 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/timers.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"84511497f22f2e21b6e6f8d16c70477712e01404969368d6939086f7fd60a844"}},{"ruleId":"D2","level":"warning","message":{"text":"06_streams.readableStreamPipeTo (cognitive 16): 06_streams.readableStreamPipeTo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 34 (44 pts), boolean chains 10, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 11). 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":"ext/web/06_streams.js"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"177fc42bee6bba332b9d46d7b1133afe6525f669aaf1ddc4c8b016459e2383bc"}},{"ruleId":"D2","level":"warning","message":{"text":"06_streams.readableStreamDefaultTee (cognitive 16): 06_streams.readableStreamDefaultTee has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 3, error handling 1 (2 pts) (nesting depth added 1). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (chunkStepsMicrotask, a function literal at line 3887, pullAlgorithm, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":3727}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d50a311ff880eeae86b8798c912070f7fd7ec06b5a7620a8d356ed4df44f36"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagePort.start (cognitive 16): MessagePort.start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 395). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/13_message_port.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"947c7e6e0e3ac934bc34a731cd88b9b7d7b8cebba995f4563f3ebc7457973722"}},{"ruleId":"D2","level":"warning","message":{"text":"flamegraph.update_text_for_elements (cognitive 16): flamegraph.update_text_for_elements has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 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":"runtime/cpu_profiler/flamegraph.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b21d335f08fb7c9e60ee5b2a09c5be9b7df09ac8e0ce2c235935a205b2ac8b0"}},{"ruleId":"D2","level":"warning","message":{"text":"flamegraph.zoom (cognitive 16): flamegraph.zoom has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/cpu_profiler/flamegraph.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dfbab01262cc76282f0adb8194bbb3a31b834d63c8a70e435ffb0e821e4c40"}},{"ruleId":"D2","level":"warning","message":{"text":"executeLoadHookChain (cognitive 16): executeLoadHookChain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, ternaries 1 (2 pts), loops 1, other 1 (nesting depth added 3). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (nextLoad, nextLoad::wrappedNext). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/01_require.js"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f59512039c32f71c6a11882e98698d9dae4680b080c0490d067fb300056f56"}},{"ruleId":"D2","level":"warning","message":{"text":"processTicksAndRejections (cognitive 16): processTicksAndRejections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (4 pts), loops 3 (4 pts), match/switch 1 (4 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/01_core.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7a881294b2727598f0923903927c5b401c6cf08cec0be26e131e8e41ae6fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 16): (computed) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"67295ce6f1ad5f4356be44162627632a4398cb530df9aca902efc714ace97bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"WritableState (cognitive 16): WritableState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c29c6f28b7db744674458e8797b19266a06ba55847876489d3875a93683b313"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OptionsParser.setup_options: MethodTooLong \u2014 setup_options runs 1221 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 1121 over it, 12.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":"libs/node_shim/lib.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9a127475a6a698063fed6534cb4d18a00906798909458a7165df3c0126708f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/tsc.rs: FileTooLong \u2014 5042 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 43 free functions. The bar is 500 significant lines; this is 4542 over it, 10.08\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":"cli/lsp/tsc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd1eab827363a32ba20a2f6427c4965799eb15c8a236daf1c1c28045f38cc6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/06_streams.js: FileTooLong \u2014 4965 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 4465 over it, 9.93\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":"ext/web/06_streams.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07447de42e73664b52d3cd002eb66b90b95e6bbbcd0fdc878d140f25b8d59985"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http/http_next.rs: FileTooLong \u2014 4032 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 116 free functions. The bar is 500 significant lines; this is 3532 over it, 8.06\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":"ext/http/http_next.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bfd600cf6567c1a9b762603b597bc1ba90806ad118f9b31a6118362e49bcde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: permissions/lib.rs: FileTooLong \u2014 3795 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 3295 over it, 7.59\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":"runtime/permissions/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"481a05fbc71614feb5797b928a7f8df6afc803fde9e67edd6b6b086819d955ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/language_server.rs: FileTooLong \u2014 3701 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 78% of them inside a single declaration: Inner (5 blocks, 305-4813). The bar is 500 significant lines; this is 3201 over it, 7.40\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":"cli/lsp/language_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6dc35154acddeda159565beae479fd30535830fa396aa0e7228bcf79881b75"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Inner: ClassTooLong \u2014 2878 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), 75 methods, 5 blocks, lines 305-4813. The bar is 400 significant lines; this is 2478 over it, 7.20\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":"cli/lsp/language_server.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d824a43e447cd8298010facd27abd8cbee552fbf48d1299731521f9b076ee275"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/desktop.rs: FileTooLong \u2014 3589 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 94 free functions. The bar is 500 significant lines; this is 3089 over it, 7.18\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":"cli/tools/desktop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2542f1ea5d130f05432cb5301bf1ad1284059a5eafdd108073c16c91db3fadbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_crypto/keys.rs: FileTooLong \u2014 3427 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 87 free functions. The bar is 500 significant lines; this is 2927 over it, 6.85\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":"ext/node_crypto/keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6f9b5db3b6852fbb06c33b6870b84528bb649b8122ffa0e00f68737b53435a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/http2.ts: FileTooLong \u2014 3298 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2798 over it, 6.60\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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"596e9e2ed403a2504c49a575983512ea5dc63c13fbed791548c75dff73f58b9f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalNpmPackageInstaller.sync_resolution_with_fs: MethodTooLong \u2014 sync_resolution_with_fs runs 645 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 545 over it, 6.45\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/npm_installer/local.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae2d873bd236d408374dd99ef6f60a4869c2a1eebf13e9f06e9a244d5f9a3db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/tls_wrap.rs: FileTooLong \u2014 3180 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 49 free functions. The bar is 500 significant lines; this is 2680 over it, 6.36\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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c767ada5deba844a5e56ab884b51f56b096600297ce24aa3c163312ec5374e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: napi/js_native_api.rs: FileTooLong \u2014 2953 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 137 free functions. The bar is 500 significant lines; this is 2453 over it, 5.91\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":"ext/napi/js_native_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"713d094c8e5fc4763855ebeaae4f7567501e68bc0092e14dc8ac03d7be890cb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: console/inspect.rs: FileTooLong \u2014 2860 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 92 free functions. The bar is 500 significant lines; this is 2360 over it, 5.72\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":"ext/web/console/inspect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"219a11026a91a26a5b52609a66fc08a5a6f1fc837598196bdf609ac5a64e45b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/fs.ts: FileTooLong \u2014 2853 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2353 over it, 5.71\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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5e4de3abf4676a9cab9b7192f957cbe8e42ae04ab6e1e4444935f0509d6ead"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_shim/lib.rs: FileTooLong \u2014 2823 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 64% of them inside a single declaration: OptionsParser (3 blocks, 776-3074). The bar is 500 significant lines; this is 2323 over it, 5.65\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":"libs/node_shim/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5995466297cb761320bf67ed01fbca04e87b7bbbf2a9bab54e57cec19dedce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/errors.ts: FileTooLong \u2014 2684 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2184 over it, 5.37\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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"731bf88e3ba1c3b71cc18e3ae563b19641be590df14da68394dbc040ca008346"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TsEsTreeBuilder: TooManyMethods \u2014 155 methods. The bar is 30 methods; this is 125 over it, 5.17\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":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b685509fa9512eb4547246d83ba9cbace09b72cb45537fac4ddd26c6567f48d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/fs.rs: FileTooLong \u2014 2567 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 91 free functions. The bar is 500 significant lines; this is 2067 over it, 5.13\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":"ext/node/ops/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa7f938f5977d8eb6356a08c38df1f28cdcc5f6feacacd6707af4b29f72ba60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: telemetry/lib.rs: FileTooLong \u2014 2478 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 45 free functions. The bar is 500 significant lines; this is 1978 over it, 4.96\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":"ext/telemetry/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabc2d55700249ba91855bc8ad0f3bd0303acfb584a1c899655a6b15e3f048ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/convert.rs: FileTooLong \u2014 2401 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 104 free functions. The bar is 500 significant lines; this is 1901 over it, 4.80\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/cli_parser/src/convert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"325010264b0f7b33a914febdb3266282562a12d7bcf2c20863e4482e84669c59"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TsEsTreeBuilder: ClassTooLong \u2014 1882 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), 155 methods, 3 blocks, lines 476-2898. The bar is 400 significant lines; this is 1482 over it, 4.71\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":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa776f532d61bf10732ce6af520ab33ea065ee40e0996355681a40f87f2b264"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast_buffer/ts_estree.rs: FileTooLong \u2014 2347 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 80% of them inside a single declaration: TsEsTreeBuilder (3 blocks, 476-2898). The bar is 500 significant lines; this is 1847 over it, 4.69\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":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf65a5e3e9124ae16e8c2d62660f22bf72b1e5c32ebb1cdf1c0a624ce4e45f13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DenoCompileBinaryWriter.write_standalone_binary: MethodTooLong \u2014 write_standalone_binary runs 464 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 364 over it, 4.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":"cli/standalone/binary.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b289bd428cb38ad2b72193f70dc8a9419255c31d9a4bf701f180a98ec4a2e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/buffer.mjs: FileTooLong \u2014 2314 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 1814 over it, 4.63\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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63ba9035e15271dc465b5537e73287eaad6c5999dbe262f695a8eb7e3967bfc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/geometry.rs: FileTooLong \u2014 2290 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 1790 over it, 4.58\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":"ext/web/geometry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e031d7884953133490155dace4145c935cab212f36d8ab31f878b8a3d36822"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/testing.ts: FileTooLong \u2014 2278 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1778 over it, 4.56\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":"ext/node/polyfills/testing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2a55cb9e615d26cb2ce1b7ebb4a395d14d03aae3dce61f9363d1e5a894ff81"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OptionsParser: ClassTooLong \u2014 1809 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), 13 methods, 3 blocks, lines 776-3074. The bar is 400 significant lines; this is 1409 over it, 4.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":"libs/node_shim/lib.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46c8fda272445696febea5f21dbc8365bed27de6629be1ba16a78c4dda29740"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workspace/mod.rs: FileTooLong \u2014 2255 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 1755 over it, 4.51\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/config/workspace/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f497ab3e5f68d311c17457bd65b9c0fb681393a260401cac4d1a89e12eac85"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: jupyter_kernel.startJupyterKernel: FunctionTooLong \u2014 startJupyterKernel runs 447 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 347 over it, 4.47\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":"cli/js/jupyter_kernel.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca82c40c926606c5c576d3fcdbdfc06eeaa2be68be0c705540adc2e9856c4e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/graph.rs: FileTooLong \u2014 2222 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 66% of them inside a single declaration: GraphDependencyResolver (2 blocks, 1106-3418). The bar is 500 significant lines; this is 1722 over it, 4.44\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":"libs/npm/resolution/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ff04be112c923f5a28ea0fdd07bbea2e695d08225ad06038eb593fc20e4830"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_sqlite/database.rs: FileTooLong \u2014 2215 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 1715 over it, 4.43\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":"ext/node_sqlite/database.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"202086487be5bfb2b558f814498f4fec0acb4b77fa1c4e34c281aba22566574b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_resolver/resolution.rs: FileTooLong \u2014 2204 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 1704 over it, 4.41\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/node_resolver/resolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b648264fa38c7faea491f976cdb64be1802bc99484f1d0bb4d6652a4064a91fe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: EnvironmentOptions: TooManyFields \u2014 132 stored fields beside 1 method. The bar is 30 stored fields; this is 102 over it, 4.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/lib.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"596241b40c182773d29bccb4ce69d861d8e84803aed7bdd682e000f4a4e6d34c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/01_require.js: FileTooLong \u2014 2184 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 1684 over it, 4.37\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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3805355d801abda8c37c6c4ef9dd082f9efa0a30d651f0460d8e49dafdbde629"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http2/session.rs: FileTooLong \u2014 2182 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 47 free functions. The bar is 500 significant lines; this is 1682 over it, 4.36\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":"ext/node/ops/http2/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35aa3258599e0a2492eca73ea794c98038c5da8c7f39f4b7ef80f4e47144f10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/jsruntime.rs: FileTooLong \u2014 2156 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 1656 over it, 4.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":"libs/core/runtime/jsruntime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce1023d22eb9b17edeae4ef2dee90630ddc64ddff7a731110ec7e4e308db987"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast_buffer/swc.rs: FileTooLong \u2014 2150 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 49 free functions. The bar is 500 significant lines; this is 1650 over it, 4.30\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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"021a94ba47ea5a90b6d89e8c544483ceb9fa4f6425365da24df7ae4f6161ff3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: denort::run::run_with_options: FunctionTooLong \u2014 denort::run::run_with_options runs 427 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 327 over it, 4.27\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":"cli/rt/run.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad811c28328c4870a31690d1c8e3693f1dd2e8cf6fa76d14a9c60d2e25ea58d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bundle/mod.rs: FileTooLong \u2014 2129 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 47 free functions. The bar is 500 significant lines; this is 1629 over it, 4.26\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":"cli/tools/bundle/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d802c665870e3d96043500a7986c35635221030c7e3805e510f538d5e00a6b77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::desktop::create_windows_msi: FunctionTooLong \u2014 deno::tools::desktop::create_windows_msi runs 425 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 325 over it, 4.25\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":"cli/tools/desktop.rs"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be24b8732d0192b19dbe5dac80f679f8949929effa51749533bc26cc0f77631"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_http::http_next::serve_http11_raw: FunctionTooLong \u2014 deno_http::http_next::serve_http11_raw runs 417 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 317 over it, 4.17\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":"ext/http/http_next.rs"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9173f9f0b568061f40cf5d8ca91c6dc7823c6810580bb5d7fe69783eb89ddcc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NumericValue.parse_inner: MethodTooLong \u2014 parse_inner runs 411 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 311 over it, 4.11\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":"ext/web/css_value.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"9435d0b99b8ca479448c9b605ae382204dc360ee67e085733a237de1537166c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/net.ts: FileTooLong \u2014 1986 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1486 over it, 3.97\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":"ext/node/polyfills/net.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fea7eaef56021b55cf61d5e87711a25a24c03f11ad4f819bcad7eddaa5106a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: uv_compat/tty.rs: FileTooLong \u2014 1983 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 37 free functions. The bar is 500 significant lines; this is 1483 over it, 3.97\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/core/uv_compat/tty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1b67b1667e3f1554567f4770c78b91f4de6c5de7df4ca553d35da000009151"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WASI.constructor: MethodTooLong \u2014 constructor runs 395 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 295 over it, 3.95\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":"ext/node/polyfills/wasi.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"27346066c1a0c87511cb511c6dfa7bf042bf736b9609c0128e75ce99c126981d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: deno_json/mod.rs: FileTooLong \u2014 1972 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 1472 over it, 3.94\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/config/deno_json/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1a58d6a09d7f04569e66d5cc6f2fa3396ed9a8c061ea24751cb2c2613abd21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::lint::ast_buffer::swc::serialize_expr: FunctionTooLong \u2014 deno::tools::lint::ast_buffer::swc::serialize_expr runs 378 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 278 over it, 3.78\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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc8311509282f153f9c843a7c2b0a912e87121b5ca636b59d30f24acaa8fae3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: _win32.join: FunctionTooLong \u2014 join runs 378 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 278 over it, 3.78\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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4112fb5f29c5350c0e6cd4f55d32b40224c8f8a1d11c68e0e89502488b5b16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/child_process.ts: FileTooLong \u2014 1869 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1369 over it, 3.74\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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a184ab700657790484c35eee2a83fed3d8ca9f7d58a81a75522bd6951c5fd5b7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphDependencyResolver: ClassTooLong \u2014 1456 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), 27 methods, 2 blocks, lines 1106-3418. The bar is 400 significant lines; this is 1056 over it, 3.64\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":"libs/npm/resolution/graph.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f6d6d388024292d68d60f7324bb38310e1888fb0d5f9417827ba078c02a75f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/documents.rs: FileTooLong \u2014 1774 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 1274 over it, 3.55\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":"cli/lsp/documents.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1434a7ddffef4b25ffe9db1aac69b2bc685903c2b0c80f26b8394bb6ac2fa728"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/error.rs: FileTooLong \u2014 1736 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 40 free functions. The bar is 500 significant lines; this is 1236 over it, 3.47\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/core/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"679c1f00c1436e32416f1a12c6d0dc7b34263366200fd9fd4eb487d5eee1d559"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/wasi.rs: FileTooLong \u2014 1711 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 71% of them inside a single declaration: WasiContext (3 blocks, 416-2262). The bar is 500 significant lines; this is 1211 over it, 3.42\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":"ext/node/ops/wasi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc0fcb7999a507bef4380b2f4f093470bb2bd98bc94b106bc3f1192c258aebd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/ops.rs: FileTooLong \u2014 1699 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 78 free functions. The bar is 500 significant lines; this is 1199 over it, 3.40\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":"ext/fs/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"726e32c530c05c0fc92d0d46c2db79e180c432ceca2b6f39b6e5b9a740e47862"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_ops::op2::dispatch_slow::from_arg: FunctionTooLong \u2014 deno_ops::op2::dispatch_slow::from_arg runs 332 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 232 over it, 3.32\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/ops/op2/dispatch_slow.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5608275cdf516af012c0a8f1fa7ded17a5ad4f51c6ca631ee8552d56ea680b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utils.emitKeys: FunctionTooLong \u2014 emitKeys runs 331 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 231 over it, 3.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":"ext/node/polyfills/internal/readline/utils.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0decadea6d5dd00d7db9c08faa30107a64aff3ebf0222f3146b894e944f98d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/module_loader.rs: FileTooLong \u2014 1617 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 1117 over it, 3.23\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":"cli/module_loader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90705ed7f480ff7137326365c5eaa6d946cc3f57e883b32950088d844171c82"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::desktop::compile_desktop: FunctionTooLong \u2014 deno::tools::desktop::compile_desktop runs 320 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 220 over it, 3.20\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":"cli/tools/desktop.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e60d34fb454f4c717c395ea658694e32e581e58f1d360e4192ee4d7c9cbd58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: process/lib.rs: FileTooLong \u2014 1575 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 1075 over it, 3.15\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":"ext/process/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cd344f30dd5dbf72a5ca920cfa7b68f4dcfd283dddc658f70f91d37e9c379e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::run_subcommand: FunctionTooLong \u2014 deno::run_subcommand runs 315 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 215 over it, 3.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":"cli/lib.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdd1694fc5521a091eba6f79bb8d1404a604e98f996158405eb72b27c033819"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/vm.rs: FileTooLong \u2014 1553 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 48 free functions. The bar is 500 significant lines; this is 1053 over it, 3.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":"ext/node/ops/vm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d73462f970652a2507e2a5870c53e8956e5980db88b2b67c3ebe802f2d6afef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/subtle_import_key.rs: FileTooLong \u2014 1550 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 1050 over it, 3.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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01dd3bc311894470232cc2cc6823eb225859e0d502aef6a8f8d73fb274ae8cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_crypto/lib.rs: FileTooLong \u2014 1547 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 67 free functions. The bar is 500 significant lines; this is 1047 over it, 3.09\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":"ext/node_crypto/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe83119a4603d4f49bfe3201622c2e48177ccbf2eca36f48b967682246293dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HoistedNpmPackageInstaller.sync_resolution_with_fs: MethodTooLong \u2014 sync_resolution_with_fs runs 305 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 205 over it, 3.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":"libs/npm_installer/hoisted.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c7c4b846db91e241e687d43db546107e3f52af5a6dfb92d815c8362a904b9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/diagnostics.rs: FileTooLong \u2014 1518 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 1018 over it, 3.04\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":"cli/lsp/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7a4f04bcbd409c1a5758895cd215f5d18b07619a4d2e4d2b7fd307403b58c6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WasiContext: ClassTooLong \u2014 1207 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), 47 methods, 3 blocks, lines 416-2262. The bar is 400 significant lines; this is 807 over it, 3.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":"ext/node/ops/wasi.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c69d5ba703bb69176c80d81a4a8758f5569c9b2209a8ba98481a7f1c050db2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rt/run.rs: FileTooLong \u2014 1501 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 1001 over it, 3.00\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":"cli/rt/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5d3ff025b50667ceea0b30e350687afc6c653c463b1f19aac610fbfd8f3e4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: npm_installer/local.rs: FileTooLong \u2014 1498 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 998 over it, 3.00\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/npm_installer/local.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"983e5d7300e8b1b02bb104dd40616344d0985a865f0f8309bf3fe3eaaccb5226"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/config.rs: FileTooLong \u2014 1488 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 988 over it, 2.98\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":"cli/lsp/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a6f9a6e230602838ff326b426d428eaf349108ca355392aaafb234da7aa634"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CliOptions: TooManyMethods \u2014 88 methods. The bar is 30 methods; this is 58 over it, 2.93\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":"cli/args/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c9147e82a4e30512b123448e2e811e80ba3e1c1718e5e646b27760a72ddb78"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphDependencyResolver.resolve_peers_of_node: MethodTooLong \u2014 resolve_peers_of_node runs 287 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 187 over it, 2.87\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/npm/resolution/graph.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7051401d86eb8f805fb29ea0e9aaa896d1bbf5b96d009b01fe5748516aee3e0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DOMMatrixReadOnly: TooManyMethods \u2014 86 methods. The bar is 30 methods; this is 56 over it, 2.87\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":"ext/web/geometry.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d7cbeba15ee445db5565d7bd71258590d62c2a0d471613dc5416df0a3e44ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/inspector.rs: FileTooLong \u2014 1424 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 924 over it, 2.85\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/core/inspector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4682cd5b8b8f188a48c8c0e5e08f738b01977569c28a182e03cd5aaccf18bead"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/upgrade.rs: FileTooLong \u2014 1408 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 41 free functions. The bar is 500 significant lines; this is 908 over it, 2.82\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":"cli/tools/upgrade.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bab0d095ee9a424e65f5bffd92a3381e4a9cee487a601e66d9d7f2afc5c6be5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fetch/lib.rs: FileTooLong \u2014 1408 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 908 over it, 2.82\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":"ext/fetch/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9037ae3193236bac1167e767b0fa9d502800495df372dcb7a086e7c8c86af21c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/worker_threads.ts: FileTooLong \u2014 1406 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 906 over it, 2.81\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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c98c8a244fade91dd4c379284944265125b9b9f9fd639c55327a2ee9ba20f96"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::uv_compat::tty::poll_tty_handle: FunctionTooLong \u2014 deno_core::uv_compat::tty::poll_tty_handle runs 281 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 181 over it, 2.81\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/core/uv_compat/tty.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd74b641655310e1d4dfb8abb13970f60737261838192c4d42adf749c915173"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainWorker.from_options: MethodTooLong \u2014 from_options runs 280 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 180 over it, 2.80\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":"runtime/worker.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9734af39f067302038c8568efb343ffe1d7122e493cf4f1976848bff382455e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolver/deno_json.rs: FileTooLong \u2014 1388 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 888 over it, 2.78\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/resolver/deno_json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffe7e3ea84f6152612a81265590ec6d591fc3bf543b7f8288c2b131a52dede2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolver/workspace.rs: FileTooLong \u2014 1378 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 878 over it, 2.76\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/resolver/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e89ddd0a0f466d27deb852ed35a4e812156a10a816907e00b94a2eaa26c8b72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/repl.ts: FileTooLong \u2014 1375 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 875 over it, 2.75\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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40adcb707cb1f0d9e75707297443b7ab794802ee473b5923161a13a61a4d031"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http/lib.rs: FileTooLong \u2014 1373 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 873 over it, 2.75\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":"ext/http/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8510dda12120deef5af0f95acfa47531d8a7253981bb6c7be2efd448c0da8a6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: args/mod.rs: FileTooLong \u2014 1368 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 868 over it, 2.74\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":"cli/args/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b863170df867c42a62190f4f37d1a49712ca517f03e1a8b9c05556787351d3bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: telemetry/telemetry.ts: FileTooLong \u2014 1367 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 867 over it, 2.73\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":"ext/telemetry/telemetry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"072ebd5a5cad725d2384a34a274d56b637f165cc014b318beba9c05a1331c8c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleRegistry.get_completions: MethodTooLong \u2014 get_completions runs 273 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 173 over it, 2.73\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":"cli/lsp/registries.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f211af1d28a5cee28280d824f95ad6d97b6e39251af829b2a87df4eafa6d676"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/css_value.rs: FileTooLong \u2014 1358 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 858 over it, 2.72\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":"ext/web/css_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2fd84e58f834d67f271dbf8f3bc309fdeb5a646a479c053804d057051216c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: op2/signature.rs: FileTooLong \u2014 1341 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 841 over it, 2.68\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/ops/op2/signature.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fe3dea1c0125a28a2eb0817cb76f17382ca0c7d970cdfd1e59e0a8b826ecff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: standalone/binary.rs: FileTooLong \u2014 1312 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: DenoCompileBinaryWriter (2 blocks, 367-1616). The bar is 500 significant lines; this is 812 over it, 2.62\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":"cli/standalone/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8884d1c04944444f80cc72c561a008e5cdfffdd5c54aff16e543b032b3277767"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/desktop.rs: FileTooLong \u2014 1307 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 807 over it, 2.61\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":"runtime/ops/desktop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdb50f190cfe6a408a7e93a7123172bb3b70ed67643c5f28564fd57012d613c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::uv_compat::pipe::poll_pipe_handle: FunctionTooLong \u2014 deno_core::uv_compat::pipe::poll_pipe_handle runs 261 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 161 over it, 2.61\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/core/uv_compat/pipe.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5dbde1f25894596ca8009bf37aedda74541273b064514fb7e3def9432ef209"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eszip/v2.rs: FileTooLong \u2014 1303 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 803 over it, 2.61\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/eszip/v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"965643d9cce9d8058e275d079e077daff19ae5f9669f8de6aff950533d0b4cfd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: console/mod.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), declaring 32 free functions. The bar is 500 significant lines; this is 791 over it, 2.58\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":"ext/web/console/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8447b5c56f470306508b113c8557888dc8cfa8380a63fc4233b6fd791b5cb07"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Console.table_impl: MethodTooLong \u2014 table_impl runs 256 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 156 over it, 2.56\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":"ext/web/console/mod.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"edca1c9199c95d184d14ac229654188cc10e9ae1385f0f8cb651962c0b87ddb6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EszipV2.from_graph: MethodTooLong \u2014 from_graph runs 256 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 156 over it, 2.56\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/eszip/v2.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9686236d2d84b45307eb5f91bad0a9dce45bd924a0b6d01124d7b4bd1cd4d7b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: uv_compat/pipe.rs: FileTooLong \u2014 1277 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 777 over it, 2.55\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/core/uv_compat/pipe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9258bd4fe898e34691f0964bd52df81cc340a3fff7db7c8b35fab8472189de7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rt/file_system.rs: FileTooLong \u2014 1272 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 772 over it, 2.54\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":"cli/rt/file_system.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"584dd3ecb6814df127e655d25ce02c86ef61eb8eb13c4697d682a0e3ae850f71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_ffi::callback::do_ffi_callback: FunctionTooLong \u2014 deno_ffi::callback::do_ffi_callback runs 254 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 154 over it, 2.54\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":"ext/ffi/callback.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca521f76f8b303cc3baba3cd467e2b80906486db4df630541ebe880a26b4c3c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ModuleMap: TooManyMethods \u2014 76 methods, declared across 5 files: modules/map.rs (41), map/ext_script.rs (16), map/dynamic.rs (12), map/evaluation.rs (5), \u002B1 more file(s). The bar is 30 methods; this is 46 over it, 2.53\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":"libs/core/modules/map.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2e69bdc43f7518bf91c5ad1462591bcc821248ec12bed15e3c9f33cbed3cba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModuleMap: ClassTooLong \u2014 1005 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), 76 methods, 2 blocks, lines 110-1761. The bar is 400 significant lines; this is 605 over it, 2.51\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":"libs/core/modules/map.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d67d66e9ea6162f5b1cf65ba73aa55040b1f9a14d95d86d2f0327650db7174"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/_tls_wrap.js: FileTooLong \u2014 1252 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 752 over it, 2.50\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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09fc4541b3992f169b2a2cbb4aaa7f975b5ccdd0ffdf3880c5ed85b2adc4264"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Inner: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.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":"cli/lsp/language_server.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88babc0872221433fd4de5698ab47a5c67c896a37d6f74348d6a54cfa7251b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rt_desktop/lib.rs: FileTooLong \u2014 1246 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 746 over it, 2.49\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":"cli/rt_desktop/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f065ca98acf37e9a9b77219d55a3b378ce4cbd67c2c93028f68f818af3c4581"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TsJsServer: ClassTooLong \u2014 994 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), 36 methods, 3 blocks, lines 251-1619. The bar is 400 significant lines; this is 594 over it, 2.49\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":"cli/lsp/tsc.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"736f4260b3d8c1e629923c1fc167caa6ab179596f92309fdc75b2d52a03c283a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_runtime::cpu_profiler::cpuprof::generate_markdown_report: FunctionTooLong \u2014 deno_runtime::cpu_profiler::cpuprof::generate_markdown_report runs 248 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 148 over it, 2.48\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":"runtime/cpu_profiler/cpuprof.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a923b4cddabc5d9079f6dd32f5defcb441cbf09a42a560f1888f0d364fec2496"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/fmt.rs: FileTooLong \u2014 1224 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 36 free functions. The bar is 500 significant lines; this is 724 over it, 2.45\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":"cli/tools/fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cead8d9c4a05e09afd2349d6153404c090730905e57cddd1b48b8381c1ebb39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/process.ts: FileTooLong \u2014 1215 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 715 over it, 2.43\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":"ext/node/polyfills/process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbb491729d278bd57e2e14031be11174259d9259392760d761464504675342d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TsServer: ClassTooLong \u2014 968 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), 29 methods, 2 blocks, lines 37-1310. The bar is 400 significant lines; this is 568 over it, 2.42\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":"cli/lsp/ts_server.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6417b059920fac47a59e7a019e38bf3bb76f1f0ef68486282ad57bd8ea3133"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_canvas::bitmaprenderer::create: FunctionTooLong \u2014 deno_canvas::bitmaprenderer::create runs 241 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 141 over it, 2.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":"ext/canvas/bitmaprenderer.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f7bdf628673f66389fb24e9e93ecc1449a40f44563c5e74c62f3abb0a9594c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http/00_serve.ts: FileTooLong \u2014 1202 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 702 over it, 2.40\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":"ext/http/00_serve.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e796eff66c28b9c33291a09f5aee0244d999aea2c61f68afc3a75c3cda36a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/factory.rs: FileTooLong \u2014 1197 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 72% of them inside a single declaration: CliFactory (2 blocks, 340-1550). The bar is 500 significant lines; this is 697 over it, 2.39\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":"cli/factory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65ed49d685823b1e2121907f4c749a7da938b3dab0c8248efe8d3e82cc19b74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/resolver.rs: FileTooLong \u2014 1195 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 695 over it, 2.39\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":"cli/lsp/resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0ffbc973065f004bd4870bee3320e7c3c2f06c85b34c670db5f68621e09d3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/_http_outgoing.ts: FileTooLong \u2014 1193 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 693 over it, 2.39\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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f959bed2fb0a7ad09b376ac41e5dafe58a5f8898bc0a74c4514d7d74896569"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/stream_wrap.rs: FileTooLong \u2014 1192 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 692 over it, 2.38\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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4360212c2ddaf06e053f197ace0137098f841a5d68b56f38a0598d9cea1cca5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_process::create_command: FunctionTooLong \u2014 deno_process::create_command runs 238 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 138 over it, 2.38\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":"ext/process/lib.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4a8635ebcb1d7ed4f15cb9626084b4d5dc116895d177edff648e92d2d05a97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::lint::ast_buffer::swc::serialize_module_decl: FunctionTooLong \u2014 deno::tools::lint::ast_buffer::swc::serialize_module_decl runs 237 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 137 over it, 2.37\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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6350cbba5a08402aa2de1a2ac976a691cd621bedaba3fd7f077048cbbf31ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: update_node_stream.transform: FunctionTooLong \u2014 transform runs 237 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 137 over it, 2.37\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":"ext/node/update_node_stream.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2749c9559370da2f2773f268d4eb0bf29e08efebaf74624d7c9c9db163f0df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http_h1/conn.rs: FileTooLong \u2014 1181 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 681 over it, 2.36\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/http_h1/conn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25066b5868837a5aafd19b5b80c9b2df7411efad72fd7d17b935333c06d4b27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/bindings.rs: FileTooLong \u2014 1180 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 34 free functions. The bar is 500 significant lines; this is 680 over it, 2.36\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/core/runtime/bindings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e74980619ece94e7289280255eaeceb7335f34a5bc5983bfd5617e89590fb48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_generate_key::run: FunctionTooLong \u2014 deno_crypto::subtle_generate_key::run runs 234 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 134 over it, 2.34\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":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"90da4d7b59e34ee8ab30365c6bddb45e7635c7e6bb4930c90b73c312e0832c63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_crypto/cipher.rs: FileTooLong \u2014 1168 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 668 over it, 2.34\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":"ext/node_crypto/cipher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5653d4009194211f32365b5d6ba32a7e1bee61fbe98762971f28d1c4ebe13c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/map.rs: FileTooLong \u2014 1157 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 87% of them inside a single declaration: ModuleMap (2 blocks, 110-1761). The bar is 500 significant lines; this is 657 over it, 2.31\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":"libs/core/modules/map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a5e86a903057a182e4ffdae1e5648cc3c648fe162e281815bdca4e3e904b22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: npm/registry.rs: FileTooLong \u2014 1157 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 657 over it, 2.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":"libs/npm/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"628bd7a9f418cf086328698b2bba390a13459c84a192beb31bc6ac938af76e0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Inner.code_action: MethodTooLong \u2014 code_action runs 231 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 131 over it, 2.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":"cli/lsp/language_server.rs"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1beb7ac99bfc18ea7bf7f99e6e7dae652f0855e5bb7a5eaec234eb88ecf1a43d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: _http_client.ClientRequest: FunctionTooLong \u2014 ClientRequest runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5af9815d3a6bb40443cc4f6f941561743b592ae64689e71118ad35f77d8a049"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::uv_compat::tcp::poll_tcp_handle: FunctionTooLong \u2014 deno_core::uv_compat::tcp::poll_tcp_handle 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":"libs/core/uv_compat/tcp.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"37532988171c8feb3d112bc9cf55082afcdb56a59f9a33b8aae3a492d32050be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebWorker.from_options: MethodTooLong \u2014 from_options runs 229 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 129 over it, 2.29\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":"runtime/web_worker.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e38a08b3488b9a96891cd5a55533dfaea9130b178673bb645e5d8ccdd30c8ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: publish/mod.rs: FileTooLong \u2014 1143 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 643 over it, 2.29\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":"cli/tools/publish/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a732373ab5262438c3c0c0836a2acd7f97b886d5a9bfe0b5b14fb56c6f0a2c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: primary.init: FunctionTooLong \u2014 init runs 227 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 127 over it, 2.27\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":"ext/node/polyfills/internal/cluster/primary.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3d9f59ccb6ca0e5e7d0e1699a1d983ae0028bd457f6644426f295432b6a585"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CliFactory: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.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":"cli/factory.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa732989e9d17b030f35970b69b749ce2e23835a82323f71575b8d68acebe2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageBitmapRenderingContext.transfer_from_image_bitmap: MethodTooLong \u2014 transfer_from_image_bitmap runs 225 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 125 over it, 2.25\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":"ext/canvas/bitmaprenderer.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cce6b066de2efc736d097ef623fe7d8b276d7192cc779060add395e88ea88cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/type_checker.rs: FileTooLong \u2014 1119 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 619 over it, 2.24\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":"cli/type_checker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e07162303566b10c39ac53cba6dc13bacd6c75f42df2af40139eb10d6019479"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/ops_builtin_v8.rs: FileTooLong \u2014 1117 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 47 free functions. The bar is 500 significant lines; this is 617 over it, 2.23\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/core/ops_builtin_v8.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7c4566c787b6b9886cfb43e24d24b871fba774cebfaeaf6bfd0a784e79b4f0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Workspace: ClassTooLong \u2014 891 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), 51 methods, 2 blocks, lines 540-1854. The bar is 400 significant lines; this is 491 over it, 2.23\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":"libs/config/workspace/mod.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9f513bb5e380fd98657454d8f5ada6c8f7b1820cd678384b337200c0ecc566"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::standalone::virtual_fs::vfs_as_display_tree: FunctionTooLong \u2014 deno::standalone::virtual_fs::vfs_as_display_tree runs 221 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 121 over it, 2.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":"cli/standalone/virtual_fs.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"34509cab5435efd4a2e779e74aba30f7246e27537e2ed77bff54c3b46cf52aa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: napi/uv.rs: FileTooLong \u2014 1104 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 69 free functions. The bar is 500 significant lines; this is 604 over it, 2.21\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":"ext/napi/uv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d05ddd861d7e3eb338fe825a3fa4b628cef4aa4789c78db8fb4dbf4f95b007"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DenoCompileBinaryWriter: ClassTooLong \u2014 883 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), 10 methods, 2 blocks, lines 367-1616. The bar is 400 significant lines; this is 483 over it, 2.21\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":"cli/standalone/binary.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"13615c18c81cdd7cc1589a79ee89631b2129d93da36e2df40aa968fc835720ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pm/mod.rs: FileTooLong \u2014 1099 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 599 over it, 2.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":"cli/tools/pm/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4155cbc21822cdb75806c591e8395bd15873c77375c3f634b935226eff3b45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/task.rs: FileTooLong \u2014 1098 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 598 over it, 2.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":"cli/tools/task.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca8d42b574114233233d26c8bc51a50d9c382064a0b2224950986d2990a608e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: streams/readable.js: FileTooLong \u2014 1092 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 592 over it, 2.18\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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ac483490fdb7dd01961ee9627d7e1271953eba77c5ab9683197378f878af95"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: zlib/mod.rs: FileTooLong \u2014 1089 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 589 over it, 2.18\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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"295ee5be26476e66b27e1c0ccb624f05f778114dd2ce59380c40e7c875a323fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_fetcher/mod.rs: FileTooLong \u2014 1087 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 587 over it, 2.17\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/cache_dir/file_fetcher/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3914f4e4f88e28ef9fe2937da070808e56a77f041e9051c8a3c46f05569319"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DatabaseSync: ClassTooLong \u2014 866 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 648-2601. The bar is 400 significant lines; this is 466 over it, 2.17\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":"ext/node_sqlite/database.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"9410d4338121239604f7706451c43213fe998ef8c22fe96ce925b7e95ffd96d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::uv_compat::pipe::poll_pipe_handle: FunctionTooLong \u2014 deno_core::uv_compat::pipe::poll_pipe_handle 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/core/uv_compat/pipe.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"954d57dcd04d32ed9c72040c80cebbc405f7720edb65b0d8e922504daea40652"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CliFactory: ClassTooLong \u2014 858 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), 68 methods, 2 blocks, lines 340-1550. The bar is 400 significant lines; this is 458 over it, 2.15\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":"cli/factory.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"13daded58e46ecdf64853877fd8f1205da8631b5e46292c2eae61eb7eff77ffc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 26_fetch.mainFetch: FunctionTooLong \u2014 mainFetch runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\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":"ext/fetch/26_fetch.js"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"469547ab66e4f97c4256f5f336ae1b0296397c234b7ac252638a0068b9d8d4b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/_http_client.js: FileTooLong \u2014 1068 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 568 over it, 2.14\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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53b1c19861b195942483fdedcaaedf229259b6427b91d4f9e8d42d7b2b9b08e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/02_event.js: FileTooLong \u2014 1067 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 567 over it, 2.13\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":"ext/web/02_event.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ce305ede937923963566443467e299a8dcad8958bb7d95609e84bc8c34ba2c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsRuntime: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.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":"libs/core/runtime/jsruntime.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"4694357aebadf44542fbeed79e478ab7e60e6518800c63c212faf5aed0aa23c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/_http_server.js: FileTooLong \u2014 1063 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 563 over it, 2.13\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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8462150852b6e2d35bd93877057b6d3c2c7219f6aa74ace84da8d53bfaf5875e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workspace/discovery.rs: FileTooLong \u2014 1058 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 558 over it, 2.12\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/config/workspace/discovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99bfd48aa27a1bbd264ea99bdfa76114f83ad4edd4692e0e4d84eea060fb74d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_import_key::import_key_rsa: FunctionTooLong \u2014 deno_crypto::subtle_import_key::import_key_rsa runs 211 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 111 over it, 2.11\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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"031f3fe00194755e140e2247c229e6234e68022eee576e4d91fcfa0d65d3f958"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsError.inner_from_v8_exception: MethodTooLong \u2014 inner_from_v8_exception runs 211 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 111 over it, 2.11\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/core/error.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06edb85481c5d495ff1a11c360e4596a63355ea20f4ae0eed8d75caac5107ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolver/factory.rs: FileTooLong \u2014 1050 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 550 over it, 2.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":"libs/resolver/factory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d869a78c4263907932192ae70827372e84adcdbaab2285a67ce929a9a9d87b71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NpmInstallDepsProvider.from_workspace: MethodTooLong \u2014 from_workspace runs 209 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 109 over it, 2.09\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/npm_installer/package_json.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d1d2e29e41ad4b6a99f9d01d434b94d13d87dfc730951f91d2d9f6bb9c194d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: net/ops.rs: FileTooLong \u2014 1040 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 37 free functions. The bar is 500 significant lines; this is 540 over it, 2.08\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":"ext/net/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ccbd66736bfa7b7eedfde1850b964d3139e6b34eefaa37d0d91a9481b01e3b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebSocket.constructor: MethodTooLong \u2014 constructor runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\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":"ext/websocket/01_websocket.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48783e63e077bcdcae54670abb5fd3898355d442b66274f6fa70792b1c89ad9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/worker.rs: FileTooLong \u2014 1037 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 537 over it, 2.07\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":"runtime/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c9751afd4317dbdc8bd010b2236a9105f0242006971994830c4022e124abad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/lib.rs: FileTooLong \u2014 1032 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 532 over it, 2.06\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":"cli/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f9e7a8cd3bde91e014c15bba0e0ecd4b58e71fc5483ab478ebe6a0383691dc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DOMMatrixReadOnly: ClassTooLong \u2014 824 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), 86 methods, 4 blocks, lines 1256-2408. The bar is 400 significant lines; this is 424 over it, 2.06\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":"ext/web/geometry.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8c07d7fca78114066ea4e67e78ba986b8d75af28a28c444a52552d98c135f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: denort_desktop::run_desktop: FunctionTooLong \u2014 denort_desktop::run_desktop runs 206 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 106 over it, 2.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":"cli/rt_desktop/lib.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"036bb2dfd0b04d004a993feac37763ffc3356044d7c70c58a4cbe85c5d62b418"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: net/quic.rs: FileTooLong \u2014 1029 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 35 free functions. The bar is 500 significant lines; this is 529 over it, 2.06\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":"ext/net/quic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b305c199d5688fbd50f76af1b6e3473acff8bfa3d3390bfa876c38ab20ee5ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/lib.rs: FileTooLong \u2014 1028 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 528 over it, 2.06\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":"ext/io/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"735185cea235e5626c54dd4dc1b63378e329dd140c4107b06d68558ccc41cfbd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Url.urlParse: MethodTooLong \u2014 urlParse runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.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":"ext/node/polyfills/url.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"988e0be0a661d8644b38b53d4c593550c9866f55564b3a634d442b90d37b9ae1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLTagStore.iterate: MethodTooLong \u2014 iterate runs 205 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 105 over it, 2.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":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae17a5e251111768c8b85fa39e71fcad954ca5145bb9ab0dd8f5ceec760a4de"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_ops::op2::generate_op2: FunctionTooLong \u2014 deno_ops::op2::generate_op2 runs 205 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 105 over it, 2.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":"libs/ops/op2/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17159880c9ccfc88e442b15a35099b7fb1bcb3c21fda80650cd083c22211d71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_config::workspace::discovery::resolve_workspace_for_config_folder: FunctionTooLong \u2014 deno_config::workspace::discovery::resolve_workspace_for_config_folder runs 204 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 104 over it, 2.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/config/workspace/discovery.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e4dd4e6a2269989bf7effd124b9f9df849c0f9e02a5bc17eb1e38478eab625"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_config::workspace::discovery::discover_workspace_config_files_for_single_dir: FunctionTooLong \u2014 deno_config::workspace::discovery::discover_workspace_config_files_for_single_dir runs 203 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 103 over it, 2.03\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/config/workspace/discovery.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dd03a193158396e0e96558671da032b25888c37eac68c609612d6a868a649c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TLSWrap: ClassTooLong \u2014 808 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), 50 methods, 6 blocks, lines 2077-4802. The bar is 400 significant lines; this is 408 over it, 2.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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b5ee6d596b158ddbd535bdcb602752bae0f2e67f699ed0b96a789d326b9004"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_ffi::turbocall::compile_trampoline: FunctionTooLong \u2014 deno_ffi::turbocall::compile_trampoline runs 200 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 100 over it, 2.00\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":"ext/ffi/turbocall.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"00012c6d74711e95fde09ef94cdcb6ebd720ab3fca6aba241b7cb5f2df121120"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/ts_server.rs: FileTooLong \u2014 999 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 97% of them inside a single declaration: TsServer (2 blocks, 37-1310). The bar is 500 significant lines; this is 499 over it, 2.00\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":"cli/lsp/ts_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ec21b273ae2e95743eea89bac8d1f17383d49cd12c8b8681b909f7cb8fd66d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/graph_util.rs: FileTooLong \u2014 998 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 498 over it, 2.00\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":"cli/graph_util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d53fe49e524a94fe387188a2b476aea82b4c70da087c839ad44d2b1ab306a05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/url.ts: FileTooLong \u2014 993 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 493 over it, 1.99\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":"ext/node/polyfills/url.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0a1ad7c34e99fe10a077ea1a8ee8ed2663632f9949fc39b848aa5cfce27fad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DOMMatrix: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\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":"ext/web/geometry.rs"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"855f9393a03f8b59cc076009f905ee991972491530b1d0f6d465f8c48e8e259d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PermissionsContainer: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\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":"runtime/permissions/lib.rs"},"region":{"startLine":4132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c6262e60eb5e7626a8148f98bc7090c7aefb4e8a246f36ad6c3568a27f0db1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/comparisons.ts: FileTooLong \u2014 980 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 480 over it, 1.96\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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eecfd5c3a938d38021254a3159004605908c047f1619cfb8f5ee97b3a3ef38"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EszipV2.parse_with_version: MethodTooLong \u2014 parse_with_version runs 196 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 96 over it, 1.96\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/eszip/v2.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b404857b75e007a99c69baa79c40e90b44a50051834d559387f84f5d6b57b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceResolver.from_workspace: MethodTooLong \u2014 from_workspace runs 196 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 96 over it, 1.96\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/resolver/workspace.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"baca0cf3277a3d4a4660c92aa07db7563549c461122e36dc87a6925376ae7050"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Url.resolveObject: MethodTooLong \u2014 resolveObject runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\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":"ext/node/polyfills/url.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1205af58cb1469bb140b2512da7bdeac0dbd77ef60704b86a72798dae1dce04"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalNpmPackageInstaller: ClassTooLong \u2014 777 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), 3 methods, 4 blocks, lines 109-1281. The bar is 400 significant lines; this is 377 over it, 1.94\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":"libs/npm_installer/local.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b17df6265f5a3a4fa111d55bf553ef57119b9225c78033474663835a2e242f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Workspace.diagnostics: MethodTooLong \u2014 diagnostics runs 194 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 94 over it, 1.94\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/config/workspace/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"061b97dcb943bbbcf8f11e96f7e762d487a7b1ea08834880b3b74f501b3dbe31"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphDependencyResolver.drain_pending_parallel: MethodTooLong \u2014 drain_pending_parallel runs 192 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 92 over it, 1.92\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/npm/resolution/graph.rs"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ed27a2d3597de35a98dd17d94a29ecae52c1681d2ebe56302fccff91571350"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PackageJson.load_from_value: MethodTooLong \u2014 load_from_value runs 192 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 92 over it, 1.92\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/package_json/lib.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"654cd1843be4a0a7d7ad9b8c53464555237c4751581a7d7486d80d37f30fbc54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_runtime::cpu_profiler::flamegraph::generate_flamegraph_svg: FunctionTooLong \u2014 deno_runtime::cpu_profiler::flamegraph::generate_flamegraph_svg runs 192 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 92 over it, 1.92\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":"runtime/cpu_profiler/flamegraph.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf2534816ff7f04384d1f708b8c2d80f9cc48a22d387ef9d0e730e36185f16d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: uv_compat/tcp.rs: FileTooLong \u2014 959 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 459 over it, 1.92\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/core/uv_compat/tcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdabc7b925e445492f3337e63ee053d245c11ec6b5e43600dfd7809371afbba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/std_fs.rs: FileTooLong \u2014 956 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 456 over it, 1.91\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":"ext/fs/std_fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f758b9f0352f7772d20aa894e683b01943250dbbf4be08c331506252ea088546"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: installer/npm_compat.rs: FileTooLong \u2014 955 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 34 free functions. The bar is 500 significant lines; this is 455 over it, 1.91\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":"cli/tools/installer/npm_compat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce673b18eb11b862c377c70511318e661bd07a594f30b1dcdc7430a8de1618a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::pm::add: FunctionTooLong \u2014 deno::tools::pm::add runs 191 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 91 over it, 1.91\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":"cli/tools/pm/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f996fc50d8cc15d5419e84aa093e0a1d7d6e4f9d63e9e082cf5135433bdf0745"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphDependencyResolver.run_dedup_pass: MethodTooLong \u2014 run_dedup_pass runs 191 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 91 over it, 1.91\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/npm/resolution/graph.rs"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"160b2d47b8c3e872263f1ffac0b1978768cf548bb720dae437d9521efbb8442c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: installer/global.rs: FileTooLong \u2014 950 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 450 over it, 1.90\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":"cli/tools/installer/global.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fdbc8c1f8501dbfb4394ca7eae20c147a32aa3fc95426ac3a6e2c26109f9bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 40_lint_selector.parseSelector: FunctionTooLong \u2014 parseSelector runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\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":"cli/js/40_lint_selector.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d1485a0bf435495bf60498c61df5b1c358bc96cb08ebd1a5e3ec27dda525c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: child.init: FunctionTooLong \u2014 init runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\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":"ext/node/polyfills/internal/cluster/child.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"645f1da965841040c76ed12757dc8a2d58f3c4635eb6f7a77f0fc29fab933ac4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transform.parse: MethodTooLong \u2014 parse runs 190 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 90 over it, 1.90\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":"ext/web/css_value.rs"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27a6718a108282ce132db973bbbe55274dda916b48a6e919cf062ba13d09582"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FsConstants: TooManyFields \u2014 57 stored fields. The bar is 30 stored fields; this is 27 over it, 1.90\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/constant.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e420c85d5f1828c262f254f3c52fd4a60d8235e878dfaec665bdb9adeb3d1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/process.rs: FileTooLong \u2014 946 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 446 over it, 1.89\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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56996ce6757efedc84d001eeffe1dfd6bf2bb637168b7b4e4e26f2f20260c3d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConfigFile: ClassTooLong \u2014 752 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), 48 methods, 2 blocks, lines 1730-2829. The bar is 400 significant lines; this is 352 over it, 1.88\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":"libs/config/deno_json/mod.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae822c7959492c8f584a2edc7230aacfd6cf51ee81aa256f4860eef5b8c169d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_crypto/x509.rs: FileTooLong \u2014 936 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 34 free functions. The bar is 500 significant lines; this is 436 over it, 1.87\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":"ext/node_crypto/x509.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba24141b9070ff3d848a763d089564ae1de41592c9beea2bd64c67b7ff94c145"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Interface.[kTtyWrite]: MethodTooLong \u2014 [kTtyWrite] runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae8dea07a4f4acf11df645bd85135e24d08243a6e3e0a92bad773897de8117a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KeyObjectHandle.new_asymmetric_private_key_from_js: MethodTooLong \u2014 new_asymmetric_private_key_from_js runs 187 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 87 over it, 1.87\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":"ext/node_crypto/keys.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de74db24d1058be051bffcddfce8ecf09dd51ccf6320ddb171df40f2184bd62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_process::op_spawn_sync: FunctionTooLong \u2014 deno_process::op_spawn_sync runs 187 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 87 over it, 1.87\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":"ext/process/lib.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ee766067efec0ddfd32c1680531ec52156fc9733e372d53077dd62382842c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: op2/dispatch_slow.rs: FileTooLong \u2014 932 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 31 free functions. The bar is 500 significant lines; this is 432 over it, 1.86\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/ops/op2/dispatch_slow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da250176f6b9db91dae102f17c13c09511524473ccf93e1cdc84805aa40b0603"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/web_worker.rs: FileTooLong \u2014 932 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 432 over it, 1.86\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":"runtime/web_worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3a302b99e90eecd5d5196f32c2f0c124acc5bcdc5a976924ae250d0f61339b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EmbeddedModuleLoader.resolve_inner: MethodTooLong \u2014 resolve_inner runs 186 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 86 over it, 1.86\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":"cli/rt/run.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"646ad11cbede52b82c5cb923cacc33c3913f3f379658f1b529e344a186457a92"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Operation.registered: MethodTooLong \u2014 registered runs 186 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 86 over it, 1.86\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":"ext/crypto/algorithm.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"27aa7212c18761e4ec4db2bf3cf75854e4e0ef298c3e590f8ba285739b94f6e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node::ops::fs::op_node_cp_on_link_sync: FunctionTooLong \u2014 deno_node::ops::fs::op_node_cp_on_link_sync runs 186 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 86 over it, 1.86\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":"ext/node/ops/fs.rs"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf2a5ab01fc882076238ae74b8cf5ba549ccabe12bee2bfcb88e89f99c86c73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::x::run: FunctionTooLong \u2014 deno::tools::x::run runs 185 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 85 over it, 1.85\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":"cli/tools/x.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d7e057b0b781523a8868ff346930f2003945e6edab301ed21bd27eefd5e4d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SloppyImportsResolver.resolve: MethodTooLong \u2014 resolve runs 185 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 85 over it, 1.85\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/resolver/workspace.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16dbf899a21f7e4515e00357aa054e42e391a962b3341a0926d23b619af1e28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsRuntimeInspectorState.poll_sessions: MethodTooLong \u2014 poll_sessions runs 184 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 84 over it, 1.84\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/core/inspector.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b37a260d00ec21857df21ba70b0cd7932121c35675cd4ba23d9e917db2fd2c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OptionsParser.set_boolean_field: MethodTooLong \u2014 set_boolean_field runs 184 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 84 over it, 1.84\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/node_shim/lib.rs"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5614c493c6a6028f22a65d123d632d43dbf6038641afb06a499496e8f9d6ad0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UnaryPermission: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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":"runtime/permissions/lib.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db1427668b179f79419e305e2e922b1d2edec82b5471f2051bd172f146e5cab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: readline/interface.mjs: FileTooLong \u2014 916 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 416 over it, 1.83\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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4112d84f1b0be2032c8fbfdd25565b1be71e169b52f08fd6e9407130e15ad75d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TestRun.exec: MethodTooLong \u2014 exec runs 183 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 83 over it, 1.83\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":"cli/lsp/testing/execution.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ff40b1968c71562aae82901a3e15750edbedffde5a0007b5852040d0c607d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::lint::ast_buffer::swc::serialize_decl: FunctionTooLong \u2014 deno::tools::lint::ast_buffer::swc::serialize_decl runs 183 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 83 over it, 1.83\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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"041f7cfac3794cd12b1b04fd5289a46eadc84e1ff10e4a76f7a71fd2d2686916"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebSocketStream.constructor: MethodTooLong \u2014 constructor runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\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":"ext/websocket/02_websocketstream.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0f571954d6792b530102a6a612ce7d029523d924dcf68948ff685291943a30"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::lint::ast_buffer::swc::serialize_ts_type: FunctionTooLong \u2014 deno::tools::lint::ast_buffer::swc::serialize_ts_type 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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5404e06f6a0071beadbd99654c7ae4826c296f4df89160bf953825db0d3eb97f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_ops::op2::signature::parse_type: FunctionTooLong \u2014 deno_ops::op2::signature::parse_type 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":"libs/ops/op2/signature.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c120100fe63c84c9b2613a50cfa9b79e00e702ab311e4ffb8a6a07d9ed1dfd7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: standalone/virtual_fs.rs: FileTooLong \u2014 907 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 407 over it, 1.81\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":"cli/lib/standalone/virtual_fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8374c27103f46a8912b3e8ca9c2e8da04a220da3f17dad4de6b459e083371dbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/uv_compat.rs: FileTooLong \u2014 906 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 406 over it, 1.81\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/core/uv_compat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"869eca6b06b734ece67a6bdcd220bff8d813993cd2c543cf723a1a4301e6cc2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/compile.rs: FileTooLong \u2014 903 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 403 over it, 1.81\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":"cli/tools/compile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6798efd581862bf21bc37e25198d639f802554371acc15e66f7162bd26d2a28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EmbeddedModuleLoader.load_default: MethodTooLong \u2014 load_default runs 179 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 79 over it, 1.79\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":"cli/rt/run.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce40ab2b74db75f9d5d667784de0598c799cfd3c6b61f863007acb4449fd42d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: child_process.execFile: FunctionTooLong \u2014 execFile runs 179 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"408588d22001f35d56808977e274bedbc13b5ff6169577e1889280f1eabb8644"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/zlib.js: FileTooLong \u2014 894 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 394 over it, 1.79\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":"ext/node/polyfills/zlib.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2d27c07ee8ca50d0e9533532f0a0dd3ac075d8da5876315f6f14fab1def3b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/99_main.js: FileTooLong \u2014 890 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 390 over it, 1.78\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":"runtime/js/99_main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ea0c2691d8ea269f0836601a622c41bc6d59b1213929f1e6f2ea06dfb2c39c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tsc/mod.rs: FileTooLong \u2014 890 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 390 over it, 1.78\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":"cli/tsc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a59986e065c3c5b5714ecc435127089d037e14a9e5cb95bfdb99792f4769540"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EmbeddedModuleLoader: ClassTooLong \u2014 710 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), 3 methods, 5 blocks, lines 157-1211. The bar is 400 significant lines; this is 310 over it, 1.78\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":"cli/rt/run.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"019436065a17aabe416b535a64cac2c43e49f84ca1a146242e21c12a2e89a1f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/01_core.js: FileTooLong \u2014 885 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 385 over it, 1.77\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/core/01_core.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea3d0c8208082d7a40b60316e3c2a83479fe463330f6aae86d7e29850aed288"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::tsc::op_script_names: FunctionTooLong \u2014 deno::lsp::tsc::op_script_names runs 177 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 77 over it, 1.77\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":"cli/lsp/tsc.rs"},"region":{"startLine":5589}}}],"partialFingerprints":{"codehealthFindingId/v1":"34678a3671d14855265da1d91b74e0ef8135ff56688b7ca2842867d19fc8f4ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeWorker.constructor: MethodTooLong \u2014 constructor runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c472ae49f85bc30f651c0f53c687f4f9b0cdaa1c01177f70f0c034174d40f1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_lockfile::printer::print_v5_content: FunctionTooLong \u2014 deno_lockfile::printer::print_v5_content runs 177 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 77 over it, 1.77\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/lockfile/printer.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"af32f2966bd502f122385d81e1b11f61928153be5a19e8e0cf5c0a2e2bdcabb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.refresh: FunctionTooLong \u2014 refresh runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\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/npm/resolution/tracing/app.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d8654588ae8a8c00c5578f4d4c4120b60f5265a30ca04ba43c45e7d8acc2a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleMap.new_module_from_js_source_with_pending: MethodTooLong \u2014 new_module_from_js_source_with_pending runs 175 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 75 over it, 1.75\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/core/modules/map.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02187c2d9b5d4d3263ce0a24046bcea61933675e7552d0e1d89ffb822e54a40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/analysis.rs: FileTooLong \u2014 874 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 374 over it, 1.75\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":"cli/lsp/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2c1900aa68d81c7b2199045486d6267273debe48d7bcf5ff9248ae0bc26f0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rt/binary.rs: FileTooLong \u2014 873 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 373 over it, 1.75\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":"cli/rt/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5189805390ca4f4ecbb9c181492f9863c66e643edc2d2f999ee2748290f8e73d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pm/deps.rs: FileTooLong \u2014 873 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 373 over it, 1.75\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":"cli/tools/pm/deps.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a146a66da37913d4ea9f5c2fbdda913712f22bb3d13054e0521af4b05008762"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CliOptions: ClassTooLong \u2014 698 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), 88 methods, 2 blocks, lines 553-1622. The bar is 400 significant lines; this is 298 over it, 1.75\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":"cli/args/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d6e4a271b3500e10fbfe43dbf7d1384363a70cd3892538bc0d2fb044ad3bb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_web::console::error_fmt::format_error: FunctionTooLong \u2014 deno_web::console::error_fmt::format_error runs 174 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 74 over it, 1.74\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":"ext/web/console/error_fmt.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"588a8959daa9c24ebf6231233db2cb96bedcbf586cd648282fb9d4ea966c8a90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::inspector::pump_inspector_session_messages: FunctionTooLong \u2014 deno_core::inspector::pump_inspector_session_messages runs 174 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 74 over it, 1.74\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/core/inspector.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1181f137e885e48ef4fe93ef034df16d3c58db2385ed6216fb1e15cd689f73b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LockfileContent.from_json: MethodTooLong \u2014 from_json runs 174 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 74 over it, 1.74\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/lockfile/lib.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ed0587751bea8841bfbb76325aa9037d8e163de71c18383ef118b703f7f6b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_ops::op2::dispatch_fast::generate_dispatch_fast: FunctionTooLong \u2014 deno_ops::op2::dispatch_fast::generate_dispatch_fast runs 174 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 74 over it, 1.74\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/ops/op2/dispatch_fast.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9d42e38dbbd35ef666b366dd78e5de4394f6d185564fda56297b85ca188d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LibUvStreamWrap: ClassTooLong \u2014 693 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), 37 methods, 6 blocks, lines 210-2066. The bar is 400 significant lines; this is 293 over it, 1.73\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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6885f56ebf8ee0e6fd8cac07e2b46fa477dcc8b513244d38d076e4fd5e8e0e84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node::ops::tls_wrap::build_client_config: FunctionTooLong \u2014 deno_node::ops::tls_wrap::build_client_config runs 173 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 73 over it, 1.73\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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4895}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cb6bde2c80e9d55f8558a3b27a0f60279f229853d394189d3b2f01d901c330"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseSyncOptions.from_v8: MethodTooLong \u2014 from_v8 runs 173 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 73 over it, 1.73\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":"ext/node_sqlite/database.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99dcd03700510dea77dd9478c01a008d233a741526d13956cbd31f505c7a70e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pipeline.pipelineImpl: FunctionTooLong \u2014 pipelineImpl runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\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":"ext/node/polyfills/internal/streams/pipeline.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cdb832ab1ae58774342c62f821379bbffef836e361291fc5d2df66b36b7a02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OptionsParser.parse: MethodTooLong \u2014 parse runs 172 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 72 over it, 1.72\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/node_shim/lib.rs"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03effdecdb051ce950529661cd47d4ba49b79c1bb0be180cf4a2b8552b9ec8e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkspaceDirectory: ClassTooLong \u2014 685 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), 39 methods, 2 blocks, lines 1918-2850. The bar is 400 significant lines; this is 285 over it, 1.71\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":"libs/config/workspace/mod.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"0735a424d21540fa2d9be7c3be54cc2d61c09ccc7c70c390feaaef80e130b459"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lockfile/lib.rs: FileTooLong \u2014 855 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 355 over it, 1.71\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/lockfile/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66916fbb5905da8a7637e9b0907db187369d246eaa610209f50b1825bb6622e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 00_infra.setUpAsyncStub: FunctionTooLong \u2014 setUpAsyncStub runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\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/core/00_infra.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9628dc498db883a308fe8861b7abdd9b6bb858a4cc0bc2f0c6998c593446bc6f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Workspace: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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":"libs/config/workspace/mod.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7df0e2c8c6ae858549b1c74dedc9fad95a604aceed2408cf30d7d7c694d837c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: napi/node_api.rs: FileTooLong \u2014 850 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 35 free functions. The bar is 500 significant lines; this is 350 over it, 1.70\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":"ext/napi/node_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"980eb61bf8109f875d5fe5285075da931e6647c6efd9a06c4016d656c119a891"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/convert.rs: FileTooLong \u2014 845 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 345 over it, 1.69\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/core/convert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"063be2b88d746bd9b80c40966adb2c6651b573730af5043549d7413465e267e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::lint::ast_buffer::swc::serialize_class_member: FunctionTooLong \u2014 deno::tools::lint::ast_buffer::swc::serialize_class_member runs 169 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 69 over it, 1.69\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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"45255b59a7a0e9d66bc15e2be7cc3b2cb66a36036967beebbe339b2eba14c8c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KeyObjectHandle.new_asymmetric_public_key_from_js: MethodTooLong \u2014 new_asymmetric_public_key_from_js runs 169 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 69 over it, 1.69\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":"ext/node_crypto/keys.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ca1dd417a02bc9d16188785f9df88f711002f2f233a07fe90060810ce6e0ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lockfile.set_workspace_config: MethodTooLong \u2014 set_workspace_config runs 169 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 69 over it, 1.69\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/lockfile/lib.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"b015634754d54ab1d6aaf535f3b817d1db923ff4e36b2f169db9303bdbd1c4e0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EszipV2: ClassTooLong \u2014 675 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), 16 methods, 3 blocks, lines 664-1742. The bar is 400 significant lines; this is 275 over it, 1.69\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":"libs/eszip/v2.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7b83012923dd3747e9b39ec78fdb79da9aa54637852959fa378b4cab273f31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/bump_version.rs: FileTooLong \u2014 843 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 343 over it, 1.69\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":"cli/tools/bump_version.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca584be56937195cf76a468f9680647caa4e1c8011100c76a74403e0c2f54f76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolution/snapshot.rs: FileTooLong \u2014 842 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 342 over it, 1.68\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/npm/resolution/snapshot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e40fe3e0113c3fbbf690afa4e47408074679342b7a864dbe6cb4fa2985a46c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/v8.rs: FileTooLong \u2014 841 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 46 free functions. The bar is 500 significant lines; this is 341 over it, 1.68\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":"ext/node/ops/v8.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b4f5f5b1e4744c25b5a269853a08425f9e99ec3ff826299172253a298dbdcc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _fs/_fs_glob.ts: FileTooLong \u2014 840 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 340 over it, 1.68\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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a782bc58ece65422b39e670d0b4f7781be25d5ae0c2f1cd71d74b99331aa8a92"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::args::flags_to_permissions_options: FunctionTooLong \u2014 deno::args::flags_to_permissions_options runs 168 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 68 over it, 1.68\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":"cli/args/mod.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"690e04bd4b23c89be88229d87c980183b1d246c8db3977be452952b01fe2bb14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: publish/unfurl.rs: FileTooLong \u2014 839 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 65% of them inside a single declaration: SpecifierUnfurler (2 blocks, 334-1105). The bar is 500 significant lines; this is 339 over it, 1.68\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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a28a4a7f626e664239973a64526fd67ed058998f8b14c8a4ea2e815bea417a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/utils.mjs: FileTooLong \u2014 837 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 337 over it, 1.67\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":"ext/node/polyfills/internal/fs/utils.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0db693275a3550112c82ecb424dc2b156fa10bc53f3c0d72c4bb21372ae4323"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSWrap: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa136994223755cbdccee91b46029cae9919176874f00e87ba9b39e3045a0396"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GPUDevice: ClassTooLong \u2014 664 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), 27 methods, 6 blocks, lines 49-970. The bar is 400 significant lines; this is 264 over it, 1.66\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":"ext/webgpu/device.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f58e41525f36908a0deab6fcf51854e28cbbe0f05a8d6f49066d480fdf7f7a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpecifierUnfurler.unfurl_specifier: MethodTooLong \u2014 unfurl_specifier 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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba2fdb91f7c53a0874f706af0575067b7ebfa6ecf9910ef7836de45311dfded"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_derive_bits::run: FunctionTooLong \u2014 deno_crypto::subtle_derive_bits::run 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":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"712b23ac675539e54c15cc8dbac4a4c813676ee9349078de3162d597396bc45e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/completions.rs: FileTooLong \u2014 826 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 326 over it, 1.65\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":"cli/lsp/completions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62665fab4575ef0d812a63da8e2e8710b579f808871d363cd914e00db681907"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/extract.rs: FileTooLong \u2014 826 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 326 over it, 1.65\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":"cli/util/extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e90bf1e2b4274586dc08692132164f5278283e4c47730bf50a336120223e684"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Glob.#iterateSubpatterns: MethodTooLong \u2014 #iterateSubpatterns runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c88962852d52fc40e23574d9bf5dc8b0bcb3ddc60bdc309bfbcfc16f98f1b64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/registries.rs: FileTooLong \u2014 824 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: ModuleRegistry (2 blocks, 457-1157). The bar is 500 significant lines; this is 324 over it, 1.65\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":"cli/lsp/registries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"539b6f7ea39d86df7f213cd39e753fe87c8734575bef101c770d07e1250e7b50"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::clean::clean_except: FunctionTooLong \u2014 deno::tools::clean::clean_except 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":"cli/tools/clean.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2b95c091b4c17af2e93f88a3d78642351200704496083c77ffe6289fb077bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: node_shim::translate_to_deno_args: FunctionTooLong \u2014 node_shim::translate_to_deno_args 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":"libs/node_shim/lib.rs"},"region":{"startLine":3470}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0d714832604c049ee6454cfda1beb0584c9b20a9e7fbdab8b48eb3fa66bba3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http/service.rs: FileTooLong \u2014 819 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 319 over it, 1.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":"ext/http/service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59604591c908d2c322fbce3fa36004c1bc5d6bcf3e08c1f32c92b5a46f6ce940"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/keys.ts: FileTooLong \u2014 815 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 315 over it, 1.63\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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7c6dcf5d08a4b34ab2ee894a87a45812ef6396936a7e285c0f090383f302c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: keygen.createJob: FunctionTooLong \u2014 createJob runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\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":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bad2f0cce6c5f728ad13c90826ce988414cc48ec4456ca539bba1f07ade261d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Workspace.config_folders_sorted_by_dependencies: MethodTooLong \u2014 config_folders_sorted_by_dependencies runs 163 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 63 over it, 1.63\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/config/workspace/mod.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"a713a564c123e0c5d866758a40d708fda9b10c1e6955d94f6a41de8b1d7da811"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_resolver/errors.rs: FileTooLong \u2014 814 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 314 over it, 1.63\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/node_resolver/errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fb5601dd57930295ecba7af983a42cb944ebbad9fe59a7c59ae7fc8a77bc61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repl/session.rs: FileTooLong \u2014 812 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 312 over it, 1.62\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":"cli/tools/repl/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2378556f9460f1e3bf483b30237ebed54e2e128d01df353448b7e6c1a0df14b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/desktop_devtools.rs: FileTooLong \u2014 809 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 309 over it, 1.62\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":"cli/tools/desktop_devtools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c93e0469b78c0832f0da4be0bc84a0ac9123c9ad66578ebcd672a09860680d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::pm::outdated::update: FunctionTooLong \u2014 deno::tools::pm::outdated::update runs 161 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 61 over it, 1.61\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":"cli/tools/pm/outdated/mod.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5505fa8a67a42abec25e96ab2b8ab832d13b228936ed1ade4dd947a8b15dbdd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http2/util.ts: FileTooLong \u2014 803 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 303 over it, 1.61\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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c386a9e13a2aac4f4a09d8170cf6427c5f0070744588545c8046576cc967e8ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/00_url.js: FileTooLong \u2014 801 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 301 over it, 1.60\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":"ext/web/00_url.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f5435e20b103f6f87deaeccb76ebce0b4a063a5fc8ea7b70eb598fe3c87819"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConfigFile: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"libs/config/deno_json/mod.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fdebc66674bd0c0279d22902d33d52c05c99b8108617476915add31529cc82"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeResolver: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"libs/node_resolver/resolution.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b39bc72f59356c536cf659bbe6ff4184cc11bf5aa94f8254ca016215d3f6331"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Flags: TooManyFields \u2014 48 stored fields beside 2 methods. The bar is 30 stored fields; this is 18 over it, 1.60\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/flags.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"338c3936ddbc0fa480906ba0634228eaac750b03326c794cdc806cf1c6a5ab9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigData.load_inner: MethodTooLong \u2014 load_inner runs 160 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 60 over it, 1.60\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":"cli/lsp/config.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86c7499202b4825c276d471135bbd6d3abcf047cdb4c06cf2ae95d3c47c76bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: websocket/lib.rs: FileTooLong \u2014 798 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 298 over it, 1.60\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":"ext/websocket/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd42f87b22c5ad2e91177eb45ffe0f1361b691f5e18028576828969b14d6dd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolver/graph.rs: FileTooLong \u2014 798 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 298 over it, 1.60\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/resolver/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1e4504900c72f5700fd289307ce4ae28c97b1248689b2a1e3bb400433414db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::pm::cache_deps::cache_top_level_deps: FunctionTooLong \u2014 deno::tools::pm::cache_deps::cache_top_level_deps runs 159 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 59 over it, 1.59\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":"cli/tools/pm/cache_deps.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e5dc111e1615e8093add2c15a2fe32b8034c4e9fffbb1e4f38bb5047f9c9fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LockfileLock.discover: MethodTooLong \u2014 discover runs 159 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 59 over it, 1.59\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/resolver/lockfile.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe8f686db0eb0558d680fe7c86d5a5d62fb7fc06f74d5f86b61a87ccedd12d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/webtransport.js: FileTooLong \u2014 792 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 292 over it, 1.58\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":"ext/web/webtransport.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cc539308216e0d822f216e9b860c950a5423f7aed060ed3b5992e4651dd3ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibWorkerFactorySharedState.create_web_worker_callback: MethodTooLong \u2014 create_web_worker_callback runs 158 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 58 over it, 1.58\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":"cli/lib/worker.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f73e88a19d13e1ed60840ab372fc5b2ace38f546f65276069ffdcdba361261"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_subprocess_windows::process::uv__kill: FunctionTooLong \u2014 deno_subprocess_windows::process::uv__kill runs 158 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 58 over it, 1.58\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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99e13fa210896452d5b19a0115b0eb29329662b2c254cc5d5fe9a3049525a99"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SharedConn: ClassTooLong \u2014 630 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), 28 methods, 4 blocks, lines 288-1532. The bar is 400 significant lines; this is 230 over it, 1.58\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":"libs/http_h1/conn.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb10b2f98ce886dd4576a51c69c5993b141a6d9eb3fe816ea74a22e514b2c01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kv/lib.rs: FileTooLong \u2014 787 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 287 over it, 1.57\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":"ext/kv/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab66363e955eade1907f83c02acef35d073487481ca870b0fe28b9e452003531"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: npm_installer/hoisted.rs: FileTooLong \u2014 785 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 65% of them inside a single declaration: HoistedNpmPackageInstaller (4 blocks, 278-1118). The bar is 500 significant lines; this is 285 over it, 1.57\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":"libs/npm_installer/hoisted.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34502c29ded84bf2faefedd9e9988a341da8496d4e349e7647e98537432d52d8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StatementSync.iterate: MethodTooLong \u2014 iterate runs 157 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 57 over it, 1.57\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":"ext/node_sqlite/statement.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b7388c1ba19df9ecb2e38301de79f42aedf74f83cf9b08850128da9ebc7d78"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WasiContext: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\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":"ext/node/ops/wasi.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f12ed7f008e82d9c9d09d2482f0b402daba3c00f2743cd9690b8b48112970d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DenoPluginHandler: ClassTooLong \u2014 626 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), 12 methods, 4 blocks, lines 1479-2525. The bar is 400 significant lines; this is 226 over it, 1.57\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":"cli/tools/bundle/mod.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2c76339818f0a3f23a059ad30eb08898eee1dbe2befc0561aec2064d810a98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/40_lint.js: FileTooLong \u2014 781 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 281 over it, 1.56\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":"cli/js/40_lint.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ccb92589f5d05cc0188c45e5cce1b1fb5cd66f3655da421ceb636677dc57ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/dgram.ts: FileTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 280 over it, 1.56\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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61e8b29e0034f77cae4f1ebf6b4bfc1c83ff6d0278e9d1c9e1ad96ac29dbccb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::desktop::run_desktop_hmr: FunctionTooLong \u2014 deno::tools::desktop::run_desktop_hmr runs 156 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 56 over it, 1.56\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":"cli/tools/desktop.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2169058748873d2eaa6133569bcf4aa08573b723aee7a573525dee63c318d0f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::doc::doc: FunctionTooLong \u2014 deno::tools::doc::doc runs 156 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 56 over it, 1.56\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":"cli/tools/doc.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59cf9f87e7fe1637864fa06690e406733ec1380b1287f1e4146faafafcd209b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkspaceResolver: ClassTooLong \u2014 623 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), 19 methods, 2 blocks, lines 842-1785. The bar is 400 significant lines; this is 223 over it, 1.56\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":"libs/resolver/workspace.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b174ce1ea13cf04800ddc460c4b5cf7778adc69d2cd683fae98ba891092759"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/jupyter_kernel.js: FileTooLong \u2014 775 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 275 over it, 1.55\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":"cli/js/jupyter_kernel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"383d7d471cc2780166682d41b1ef5824d130a4644dce9288edaaf9f5e5664c95"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::uv_compat::tty::uv_tty_init: FunctionTooLong \u2014 deno_core::uv_compat::tty::uv_tty_init runs 155 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 55 over it, 1.55\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/core/uv_compat/tty.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1869bc15584f587ac7d4a9193c00a37c81ac5e6b50d47e39a6b2435ca200b590"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tsc/tsconfig_gen.rs: FileTooLong \u2014 773 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 273 over it, 1.55\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":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed9761bb6b60d56ff791f3cf8742d875d15fdd31f28e2ea326221ce350a0cc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache_dir/local.rs: FileTooLong \u2014 771 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 271 over it, 1.54\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/cache_dir/local.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ce4e75ce50c33518d1dd372776e06df6a1b1f2009f5043a7b7b6d97ad4d877"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: llhttp/binding.rs: FileTooLong \u2014 765 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 265 over it, 1.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":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b76d1f189cf0368ecce5552e51aec9e6a89396fcad113171ea0a77679673e27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::testing::collectors::visit_call_expr: FunctionTooLong \u2014 deno::lsp::testing::collectors::visit_call_expr runs 153 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 53 over it, 1.53\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":"cli/lsp/testing/collectors.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c4dc0aab2258c84041c549d014f361c850a41f187fd423ec9f40757775b841"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: streams/writable.js: FileTooLong \u2014 762 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 262 over it, 1.52\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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b9adbf144fd039b797bdc7286adfc03cc3125427642a11860f2487c295e599"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webgpu/device.rs: FileTooLong \u2014 761 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 87% of them inside a single declaration: GPUDevice (6 blocks, 49-970). The bar is 500 significant lines; this is 261 over it, 1.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":"ext/webgpu/device.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a0912590eff74ae143cf7ff96d303a4a44349c27f1f1c540c4462a7ff096e9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompletionEntry.as_completion_item: MethodTooLong \u2014 as_completion_item runs 152 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 52 over it, 1.52\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":"cli/lsp/tsc.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a372870722b92715df3a9ce38f7b1d5e901ca0838de9140dade2b38531e501a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_get_public_key::run: FunctionTooLong \u2014 deno_crypto::subtle_get_public_key::run runs 152 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 52 over it, 1.52\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":"ext/crypto/subtle_get_public_key.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"620eb4cdea1728068048193728308a05424e0f5b9ec6948178fd9bb9cfdfb6c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_import_key::import_key_ec: FunctionTooLong \u2014 deno_crypto::subtle_import_key::import_key_ec runs 152 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 52 over it, 1.52\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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cdcc3a690581575292a3173fbd2ec8d3ac5e3f918e611f5788748d76f1c24d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 01_http.createRespondWith: FunctionTooLong \u2014 createRespondWith runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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":"ext/http/01_http.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbed6110fe7af51a9c42af39f9577d59f433e3ffc516f46000ab51d381f48e1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: op2/dispatch_fast.rs: FileTooLong \u2014 757 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 257 over it, 1.51\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/ops/op2/dispatch_fast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ff2032cbebc113534de8e4851331dc18fec0f741ad04770876b7aaed549825"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/worker.rs: FileTooLong \u2014 756 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 256 over it, 1.51\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":"cli/lib/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee16c101d6fa9cb94ecc4a4b3285aab8d3bac84e3af2b9f757beebd64b3d920"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_sqlite/statement.rs: FileTooLong \u2014 756 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 69% of them inside a single declaration: StatementSync (6 blocks, 272-1191). The bar is 500 significant lines; this is 256 over it, 1.51\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":"ext/node_sqlite/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aa0ac96618f192f6bc4eb78982b21fdef7dd1ecf4945f3e2c704e0dbb6614e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flags.rs: FileTooLong \u2014 755 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 255 over it, 1.51\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/cli_parser/src/flags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08497dcfc8e8e3b1307931aa9098b107a726d7e229cc72321d13efd308369e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_cli_parser::parse::parse_args: FunctionTooLong \u2014 deno_cli_parser::parse::parse_args runs 151 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 51 over it, 1.51\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/cli_parser/src/parse.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4da5c3b5c2ffaf053646f64debb14506e1377439fe402f93570dc99a80679d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TtyPrompter.prompt: MethodTooLong \u2014 prompt runs 151 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 51 over it, 1.51\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":"runtime/permissions/prompter.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"636cf4cfb72009d39df37cb023d26bf957fd920d2b04136894577f43ff1d983c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/40_lint_selector.js: FileTooLong \u2014 754 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 254 over it, 1.51\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":"cli/js/40_lint_selector.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba6f87d6f0a8968cc93fca8af376a5a9e99e2528a408dcb92aedbed2a3d11a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/webidl.rs: FileTooLong \u2014 753 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 253 over it, 1.51\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/core/webidl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5497e848587b87b9acc3e14b5a809a357936afd3400460adcb7662b1e1839a2c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LanguageServer: ClassTooLong \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), 9 methods, 3 blocks, lines 231-4246. The bar is 400 significant lines; this is 201 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":"cli/lsp/language_server.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b416d12d415ec5d214712f9fa6260038b89a9bbf5a8b80c4561b9d00a209d43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_dotenv::parse_env_content_hook_impl: FunctionTooLong \u2014 deno_dotenv::parse_env_content_hook_impl runs 150 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 50 over it, 1.50\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/dotenv/lib.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bd03e6093c0a7fb0702e09bd068641ef9a9d40864bf4febcd67eee8a06675b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/_events.mjs: FileTooLong \u2014 749 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 249 over it, 1.50\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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f1543445a1269c48776cccb6aeadc254ebe7fa785c2ccf0002d12b920d418b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 98_lsp.serverRequestInner: FunctionTooLong \u2014 serverRequestInner runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\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":"cli/tsc/98_lsp.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aee66571a49ff99e23474ceaf0f6b6b302e029eca140f273d49786bb7a9dffc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NumericValue: ClassTooLong \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), 13 methods, 9 blocks, lines 250-1555. The bar is 400 significant lines; this is 195 over it, 1.49\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":"ext/web/css_value.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80dfa29a65b297c6bbe344dbea3d7964fc3c94235f620aef4827d65f4ea2142"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: KeyObjectHandle: ClassTooLong \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), 11 methods, 5 blocks, lines 70-1771. The bar is 400 significant lines; this is 195 over it, 1.49\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":"ext/node_crypto/keys.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"990779636cd460b3457ae846bda1416c5c750bf6cfeb36c50b500e02415cd43a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: napi/lib.rs: FileTooLong \u2014 741 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 241 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":"ext/napi/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a38b172bb25669ac106c0aafea856398932d70348b8b9dc0ee4029f0140a01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/dns.ts: FileTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 237 over it, 1.47\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":"ext/node/polyfills/dns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef77f0149d438fec2c2be9c505a35d8da92ef5c4d213bbeb7353849c1ae5ead9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/lib.rs: FileTooLong \u2014 736 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 236 over it, 1.47\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":"ext/crypto/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63557bbf59fee7343689532af1d58735d819dba3225561994f94de5ba86021d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 01_http.createRespondWith.respondWith: FunctionTooLong \u2014 createRespondWith.respondWith runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"ext/http/01_http.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"843980bf4be8b84046b731a6ec4803f9ab278a918864801c4be7a463680bb4ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 01_require.Module._load: FunctionTooLong \u2014 Module._load runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ee72dc4925f79efcda1e279d4292d6e0a850b1fc800d654314015e04623294"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: https.openCONNECTTunnel: FunctionTooLong \u2014 openCONNECTTunnel runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"ext/node/polyfills/https.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa649a12e815c23221e112cd865996430e1389a07064a8892516b7dbb1e405ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: end-of-stream.eos: FunctionTooLong \u2014 eos runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"ext/node/polyfills/internal/streams/end-of-stream.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"251bf8984860e974fd43c04693075d61cf3f1faa436ad18a58347ac2320723f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 99_main.bootstrapMainRuntime: FunctionTooLong \u2014 bootstrapMainRuntime runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"runtime/js/99_main.js"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"0269f73f37f8289755da30134435b7843bc4e2c374a1ca62fe904f4fbedebb8b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DenoRtSys: ClassTooLong \u2014 587 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), 8 methods, 21 blocks, lines 56-1192. The bar is 400 significant lines; this is 187 over it, 1.47\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":"cli/rt/file_system.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a8018cbe3b3ea9f79d8751c748477399d88f0cc5300a80c3e7da5bc76ba230"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Inner.code_action_resolve: MethodTooLong \u2014 code_action_resolve runs 146 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 46 over it, 1.46\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":"cli/lsp/language_server.rs"},"region":{"startLine":2451}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb9bfb8844d7ccacfb910aedbb87d129399e063e21a7c701b9dc3c6a457a491"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EmbeddedModuleLoader.load: MethodTooLong \u2014 load runs 146 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 46 over it, 1.46\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":"cli/rt/run.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1022d03a3674447bf43d7f3a2d4664c021ec6c33eda766046d92cdd1683982"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::info::info: FunctionTooLong \u2014 deno::tools::info::info runs 146 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 46 over it, 1.46\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":"cli/tools/info.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"45437b08aafe0969bf6caa693e7edf92d6797b83f8b5ba218c893fb84ebcd6a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpecifierUnfurler.unfurl_to_changes: MethodTooLong \u2014 unfurl_to_changes runs 146 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 46 over it, 1.46\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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f3a8e374cb98141e9ff4aef300883e4622024e2c31530c7ee703d958a2161f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::task::execute_script: FunctionTooLong \u2014 deno::tools::task::execute_script runs 146 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 46 over it, 1.46\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":"cli/tools/task.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06786d9234deefdac9c3156a103992f3058aecbfa4e1c3bf9cea1b682a984a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Glob.#addSubpatterns: MethodTooLong \u2014 #addSubpatterns runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afae4cbcc112ddef63cafbb88b4b7b3d8f95cb54aa7a6190fc3bca878dcb385"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: _http_server.parserOnIncoming: FunctionTooLong \u2014 parserOnIncoming runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff70e31eae03471f131f454fec0b1045378a9bbeb9dba9097818d6ca8f33920"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClientHttp2Session.request: MethodTooLong \u2014 request runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"ext/node/polyfills/http2.ts"},"region":{"startLine":4684}}}],"partialFingerprints":{"codehealthFindingId/v1":"3461bc49f3b793dc95290131d28e949c2a0f0ebe209ba0542c2a5d774c491140"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compose.compose: FunctionTooLong \u2014 compose runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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":"ext/node/polyfills/internal/streams/compose.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3147d30eecc542a6314e4f700d9f28e2000ad0df05c2f4bbdedaa3a8f25f741"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AsymmetricPrivateKey.export_der: MethodTooLong \u2014 export_der runs 145 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 45 over it, 1.45\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":"ext/node_crypto/keys.rs"},"region":{"startLine":2410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8176b3e1c1dfb7568ab6281bc1b715f0e483ec8a9d55fd6b7a23cc2b20f19d5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeResolver.resolve_package_target_string: MethodTooLong \u2014 resolve_package_target_string runs 145 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 45 over it, 1.45\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/node_resolver/resolution.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"765a7bac241552eafb760a2bf193cd7d906c961d95e3f784571fbca57454fb7c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceResolver.resolve: MethodTooLong \u2014 resolve runs 145 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 45 over it, 1.45\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/resolver/workspace.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6420823e9dc966cd28e75fc248e3782a68d3c52e43f359780c7a4987dcf9534"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: process.internals.__bootstrapNodeProcess: FunctionTooLong \u2014 internals.__bootstrapNodeProcess runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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":"ext/node/polyfills/process.ts"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fb49ef2aca9ba369f8573bd41a4fc89343550b7860e7a296459e7b79db158e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::modules::map::wasm::render_js_wasm_module: FunctionTooLong \u2014 deno_core::modules::map::wasm::render_js_wasm_module runs 144 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 44 over it, 1.44\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/core/modules/map/wasm.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff57ceeb38ff2aed2d8b61b761d743dc41def3abe29b1592282816c3cac20715"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::uv_compat::tty::get_vt100_fn_key: FunctionTooLong \u2014 deno_core::uv_compat::tty::get_vt100_fn_key runs 144 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 44 over it, 1.44\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/core/uv_compat/tty.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"54841b940f9ffb1adf0bc912f90e39081ef885951a53b3f720aa996511b5de8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::lint::get_deno_lint_code_actions: FunctionTooLong \u2014 deno::lsp::lint::get_deno_lint_code_actions runs 143 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 43 over it, 1.43\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":"cli/lsp/lint.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bacfc5ec47f6fb0a4324255642a1b55a3a0d839a1abd37c970879a3def3a46"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_http::http_next::write_h1_stream_response_shared: FunctionTooLong \u2014 deno_http::http_next::write_h1_stream_response_shared runs 143 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 43 over it, 1.43\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":"ext/http/http_next.rs"},"region":{"startLine":4338}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cd5871cf9445847a96c1e0e19195ddc7a429537936b962b99bf6019bec146e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibUvStreamWrap.writev: MethodTooLong \u2014 writev runs 143 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 43 over it, 1.43\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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"312bd82d921cf4cbb0e1f071afe8629adb9ff35a79dba726678afedf2bd67207"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleMap.load_ext_script: MethodTooLong \u2014 load_ext_script runs 143 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 43 over it, 1.43\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/core/modules/map/ext_script.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa33bc6eb8b496f6583abaf5fb9d4bf053c26782975429707c8b262956511ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_runtime::fmt_errors::get_message_suggestions_inner: FunctionTooLong \u2014 deno_runtime::fmt_errors::get_message_suggestions_inner runs 143 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 43 over it, 1.43\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":"runtime/fmt_errors.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"8378495bc1e7afe9d23a3cbcf5779c3626e7d13c85f7b3e284d93ee3cbf0b767"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_subprocess_windows::process::spawn: FunctionTooLong \u2014 deno_subprocess_windows::process::spawn runs 143 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 43 over it, 1.43\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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67b4d43f081197a28ba72d4a48adf97e8ba6e8e44c75463aadba00902f12f3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: testing/execution.rs: FileTooLong \u2014 711 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 211 over it, 1.42\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":"cli/lsp/testing/execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2be68edc1c7dd1e4002e63a1c60eb9be55226ac32d0f00e1eb9e0343b88959"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/assert.ts: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 211 over it, 1.42\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":"ext/node/polyfills/assert.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1587d6e4fc05973aeb1f53e6381b02999ac359cd606e49b393e8ff65d4832dc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Console: ClassTooLong \u2014 564 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), 24 methods, 5 blocks, lines 1002-1774. The bar is 400 significant lines; this is 164 over it, 1.41\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":"ext/web/console/mod.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"6678cd0bc04ffe7a63a702728a4a48eb112c5561430e86f116a0850b1fde0f4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Flags.to_permission_args: MethodTooLong \u2014 to_permission_args 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":"cli/args/flags.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac8a2893e1df4c9bd50a4a6e122aeeef84c86464f1074bf6a3beca365a78a05"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceSettings.from_raw_settings: MethodTooLong \u2014 from_raw_settings 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":"cli/lsp/config.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda0928b2304f4e3e67ebebcd2ad6ee8a4aec70cc8a352c168d4c6628acbae3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tsc::load_for_tsc: FunctionTooLong \u2014 deno::tsc::load_for_tsc 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":"cli/tsc/mod.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0345c1ae680ced647aa7f4d2e75850cf427b62176f813d18c6d20a1b163134"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 00_serve.mapToNativeResponseCallback: FunctionTooLong \u2014 mapToNativeResponseCallback runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/http/00_serve.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"8142d3891d25d1711e0043114fe535f2b264dae3ff6f998f9c6da4566cbb510d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_runtime::web_worker::run_web_worker: FunctionTooLong \u2014 deno_runtime::web_worker::run_web_worker 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":"runtime/web_worker.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"10679baf319551db88577d70b97e9f6ec58838b5604492ff67c77e842f3fc9e1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Http2Session: ClassTooLong \u2014 562 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), 30 methods, 5 blocks, lines 2849-3697. The bar is 400 significant lines; this is 162 over it, 1.41\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":"ext/node/ops/http2/session.rs"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"df822ffa44d5acd189aa93e9c042b134053338f978df1ecf552c0d079a0b2fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: path/_win32.ts: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 202 over it, 1.40\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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6b4eb32779f3447dab673c307f66d3191799a4852056d708bd8d3c593704d5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StdFileResourceInner: ClassTooLong \u2014 561 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), 9 methods, 4 blocks, lines 589-1551. The bar is 400 significant lines; this is 161 over it, 1.40\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":"ext/io/lib.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"9975878bf64c18e384346500a6c4511fd305ac17b36c715cb970c9fee9c75aab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/30_fs.js: FileTooLong \u2014 701 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 201 over it, 1.40\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":"ext/fs/30_fs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0573073163c2c5e7139b10c268cdde03cddd9a478ecd1028c6d6649fd60d7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: websocket/01_websocket.js: FileTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 68% of them inside a single declaration: WebSocket (252-986). The bar is 500 significant lines; this is 201 over it, 1.40\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":"ext/websocket/01_websocket.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc102db859afa4831314b05f93a2806681650df040fd27b5a2644f2be164f23"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TLSWrapInner: TooManyFields \u2014 42 stored fields beside 11 methods. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6635591a5aa789afd76870a277526430c5fefe64036112273452d7ef252e244"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::desktop_devtools::run_unified_session: FunctionTooLong \u2014 deno::tools::desktop_devtools::run_unified_session runs 140 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 40 over it, 1.40\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":"cli/tools/desktop_devtools.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d23dc7238838ecf3b2682a52ca10017b2b9470ddefa34053156f7a9aff37a11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::installer::npm_compat::setup_npm_compat: FunctionTooLong \u2014 deno::tools::installer::npm_compat::setup_npm_compat runs 140 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 40 over it, 1.40\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":"cli/tools/installer/npm_compat.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38d68d51176c65c53d0310a668178e4eb8f8f72b08a602c2a612aed7bff2b86"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: worker_threads.webMessagePortToNodeMessagePort: FunctionTooLong \u2014 webMessagePortToNodeMessagePort runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b6b62b0244762570375586a6f17006ab18ff61ff57de34b15a0cf73ae69bda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/ipc.rs: FileTooLong \u2014 698 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 198 over it, 1.40\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":"ext/node/ops/ipc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5c1e3b142eb1a9294d6a6e3c023915ed28452a12c10c09df021247c187540e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 01_require.Module._resolveFilename: FunctionTooLong \u2014 Module._resolveFilename runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"5261937f4b1c8961234167858958a3c0177594bd4f03887ec9c865a88f3b854a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_ops::op2::dispatch_fast::map_v8_fastcall_arg_to_arg: FunctionTooLong \u2014 deno_ops::op2::dispatch_fast::map_v8_fastcall_arg_to_arg runs 139 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 39 over it, 1.39\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/ops/op2/dispatch_fast.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf34aed7bc9ca4eed3db08f5ae8b0c4b31140896d47d3abf4f5ef6f7952e68d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/subtle_export_key.rs: FileTooLong \u2014 694 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 194 over it, 1.39\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":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b545352d4a64b8f22d0d407472200424f0bfe3f1b66c8aedeb5429bbcb465c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubtleDeriveBitsParams.convert: MethodTooLong \u2014 convert runs 138 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 38 over it, 1.38\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":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae18f8bfbd4808db5d9e9b40a660ed97316a5e90b90fe7146facad075377092b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Decipher.r#final: MethodTooLong \u2014 r#final runs 138 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 38 over it, 1.38\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":"ext/node_crypto/cipher.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6791b7150592d5dc72a72a9c0f5d718204c2f9485c55654388e973d4d046f5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DocumentModules: ClassTooLong \u2014 550 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, 2 blocks, lines 1250-1983. The bar is 400 significant lines; this is 150 over it, 1.38\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":"cli/lsp/documents.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"708867191831a6649424205f432bef4ef3fcf934626b6de736f4e6cb3ce691b8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SpecifierUnfurler: ClassTooLong \u2014 548 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), 8 methods, 2 blocks, lines 334-1105. The bar is 400 significant lines; this is 148 over it, 1.37\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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"168908956a7f817df167be28ed9ac1158f2bb72d500fde46e8733681e1e1988f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kv/01_db.ts: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 185 over it, 1.37\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":"ext/kv/01_db.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbe60e433c1dec25c773b2487c80a92bc2242a9a1fadf7d1408cb43fc607ceb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::desktop::build_deb_data_tar: FunctionTooLong \u2014 deno::tools::desktop::build_deb_data_tar runs 137 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 37 over it, 1.37\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":"cli/tools/desktop.rs"},"region":{"startLine":4063}}}],"partialFingerprints":{"codehealthFindingId/v1":"8347259e2bc3cca378c051018e52a193bb355d85cd8e552b38d65959f9abd1de"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 01_image.createImageBitmap: FunctionTooLong \u2014 createImageBitmap runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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":"ext/image/01_image.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"139c3a3159abe5f61c510ac580f692d5add4738af9a0488929cfd3562602d7c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TsConfigCollector.read_ts_config: MethodTooLong \u2014 read_ts_config runs 137 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 37 over it, 1.37\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/resolver/deno_json.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6007c0a5d0d0301bacaf13ed563dec7d1e82b0dd24ea2b6a0369ffeaec3071cf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Interface: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc0ae81fd152c68c096adfe3ac048bf3339a1e2ffac8af3272408d9bb168e46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/event_target.mjs: FileTooLong \u2014 683 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 183 over it, 1.37\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":"ext/node/polyfills/internal/event_target.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f86858d5130e85f0536cfe3ae68d5c5d27e4853559b8b070b2babf0d241a89f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/13_message_port.js: FileTooLong \u2014 683 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 183 over it, 1.37\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":"ext/web/13_message_port.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c22e10a0104957d3e441adf9a9c30683640e725331e6c61c2c1241fac90491e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_resolver/analyze.rs: FileTooLong \u2014 682 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 182 over it, 1.36\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/node_resolver/analyze.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cce0523aa4d792e437f8cc6b9b55014f90a33bd6f9b3b501d7262629c569af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fetch/26_fetch.js: FileTooLong \u2014 680 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 180 over it, 1.36\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":"ext/fetch/26_fetch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54823e0d0675244236bbe6b96507e95bcd248ab5a02933aaf73fa7581d31bb80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskRunner.run_tasks_in_parallel: MethodTooLong \u2014 run_tasks_in_parallel 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":"cli/tools/task.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1c29534b333fcd8d1258912bd6c27b9e39d9c14ff64404f679d83fd949d2b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: comparisons.objectComparisonStart: FunctionTooLong \u2014 objectComparisonStart runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efd5b6b1fab60792cbb293702611a75d904a858c69ed1aadb4d676522fbcf87"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_resolver::npm_lockfile_import::package_lock_to_deno_lock_v5: FunctionTooLong \u2014 deno_resolver::npm_lockfile_import::package_lock_to_deno_lock_v5 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":"libs/resolver/npm_lockfile_import.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffa9913366ee0008989edbd13357da79e5f9474d228c81ca702c7583075285a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fetch/proxy.rs: FileTooLong \u2014 677 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 177 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":"ext/fetch/proxy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8d8714b62713f5226357ae79d2ebf7f142caa7c3cef4693c6efddad7927465"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MainWorker: ClassTooLong \u2014 541 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), 22 methods, 3 blocks, lines 194-1197. The bar is 400 significant lines; this is 141 over it, 1.35\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":"runtime/worker.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c15465463e16c722fc5c8fdd45ea27fb8f81a4e2c799593b8bb85a9a482b8d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WefDesktopApi: ClassTooLong \u2014 540 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), 2 methods, 3 blocks, lines 52-882. The bar is 400 significant lines; this is 140 over it, 1.35\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":"cli/rt_desktop/lib.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d565a29a9263ccce384771bcbb9f3ccb1913f5c8b270581a73b780180b71b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node::ops::tls_wrap::build_server_config: FunctionTooLong \u2014 deno_node::ops::tls_wrap::build_server_config runs 135 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 35 over it, 1.35\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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":5397}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c5a2c5bd1878b5a62238bfae665b287563b8d62fef291280991341e2781555"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::uv_compat::tty::tty_try_read_raw: FunctionTooLong \u2014 deno_core::uv_compat::tty::tty_try_read_raw runs 135 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 35 over it, 1.35\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/core/uv_compat/tty.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e1ace0f22d273e831881f6c35adf5e15e07fbd54fe1dbbc0670782beaaaf64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/diffiehellman.ts: FileTooLong \u2014 672 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 172 over it, 1.34\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":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e87c10a67698260ae0d83f44a219c84bb52947569e89d945f54c2b6d749e61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TsResponseImportMapper.check_specifier: MethodTooLong \u2014 check_specifier runs 134 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 34 over it, 1.34\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":"cli/lsp/analysis.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0015fed1416ae2581c7016e90499f2d7bb810ce8efac5d53ba55863f01979b3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TsServer.provide_code_actions: MethodTooLong \u2014 provide_code_actions runs 134 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 34 over it, 1.34\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":"cli/lsp/ts_server.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3200f0503e129eaf69af9ffb57bd68b592949ad38bcc29ee5994cdda8ebfd116"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node::ops::fs::op_node_cp_on_link: FunctionTooLong \u2014 deno_node::ops::fs::op_node_cp_on_link runs 134 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 34 over it, 1.34\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":"ext/node/ops/fs.rs"},"region":{"startLine":3112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b952a1113b51bb9920e3d27b7ac4ad0e623689fb222b949c71d03e8291d1178"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AsymmetricPublicKey.export_der: MethodTooLong \u2014 export_der runs 134 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 34 over it, 1.34\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":"ext/node_crypto/keys.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"073c4b267a403a6a67eb417fd50e84b70af896a425dd0e551047771a2db8e57d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Location.constructor: MethodTooLong \u2014 constructor runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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":"ext/web/12_location.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7112fefbaf3b516d3074387e32228e1a69cc5460799496e9a4908a8cf5ec3067"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EnvironmentOptions.default: MethodTooLong \u2014 default runs 134 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 34 over it, 1.34\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/node_shim/lib.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22d48152cce712232519f9611aab4d94c40cd89d0e0d8021ad1a1c635c4a2a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http2/compat.js: FileTooLong \u2014 669 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 169 over it, 1.34\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":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda6f3344bad6515f27072f4f81abc2be06627743da415ca00bf3ca4959b2c42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/lib.rs: FileTooLong \u2014 669 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 169 over it, 1.34\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":"ext/web/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a9d80b06e2977fd7ff9e320795aad99a2361aff04ab6dbec26acce8a3cf9ec"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VfsBuilder: ClassTooLong \u2014 535 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), 29 methods, 3 blocks, lines 515-1318. The bar is 400 significant lines; this is 135 over it, 1.34\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":"cli/lib/standalone/virtual_fs.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d2e6fd0326cf1041252294842b101c9b4f1d144886e7ce3eb76d0180afc561"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/x.rs: FileTooLong \u2014 667 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 167 over it, 1.33\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":"cli/tools/x.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"219b542accbabed390bac3f39d3bb3f228e0e07229aecc52849d7f88f5ebbaa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pm/audit.rs: FileTooLong \u2014 665 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 165 over it, 1.33\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":"cli/tools/pm/audit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"591b34fe3ae41f42ab4df939b99cbba2f936bde08e7cc0851e74905c6b48264b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KeyObjectHandle.verify_prehashed: MethodTooLong \u2014 verify_prehashed runs 133 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 33 over it, 1.33\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":"ext/node_crypto/sign.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d2f0401a0a51fd6a96eee6aad07a3c982e8a7b3c0c41eb97b01365a7c02e69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseSync.function: MethodTooLong \u2014 function runs 133 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 33 over it, 1.33\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":"ext/node_sqlite/database.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3f331b6ea00181787d240ebf5eb6b7fb6d825b605ba3e57b6f821923893db8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 00_serve.mapToCallback: FunctionTooLong \u2014 mapToCallback runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"ext/http/00_serve.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6d4882c2cffc42afda19b30f087711f0333f697ae1d8d2048f2815d836a815"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KeyObjectHandle.sign_prehashed: MethodTooLong \u2014 sign_prehashed runs 132 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 32 over it, 1.32\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":"ext/node_crypto/sign.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed08266513723c28c5835586ff2d4f7e8388f7b035c0bf3c41e8b762fdf28d98"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleMap.new_module_with_pending: MethodTooLong \u2014 new_module_with_pending runs 132 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 32 over it, 1.32\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/core/modules/map.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a006f369bac1eec49da1b1255893e2a080a85503a3dea59ace2a1132a03cf0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webgpu/01_webgpu.js: FileTooLong \u2014 659 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 159 over it, 1.32\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":"ext/webgpu/01_webgpu.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec0782886a1512d61b56737e7467ad626adb20ac206c023e88c7708b1b4cabd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/cipher.ts: FileTooLong \u2014 658 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 158 over it, 1.32\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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46b8c2609b835be59224200e0eee271be118ca8f495d898c935fdf7b4a422d5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StatementSync: ClassTooLong \u2014 524 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), 17 methods, 6 blocks, lines 272-1191. The bar is 400 significant lines; this is 124 over it, 1.31\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":"ext/node_sqlite/statement.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"380c2d52d355060e3bbed5e730c5e6d6a7b503bbdd313c20299f4778451c8c97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: interface.InterfaceConstructor: FunctionTooLong \u2014 InterfaceConstructor runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d06a2506f5dd7fe90648dbe807eae4da193f3770f8c36545d4cfb9e3e72624b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/child_process.ts: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 152 over it, 1.30\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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06e63cc4c68f54743a7830f2e862ab90a0c49044539bf0d8a72d3d2267c1174"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkspaceDirectory: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"libs/config/workspace/mod.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b870bbc08cdecd9d1e45752b840dc30444fb90d5f5692a2ec4d169f62ddc949"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/vm.js: FileTooLong \u2014 650 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 150 over it, 1.30\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":"ext/node/polyfills/vm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"758a9e1a80d0c905a8d4c44e7a9df8c77b1384156fe9c5afea8f3af1b34370c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/subtle_generate_key.rs: FileTooLong \u2014 650 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 150 over it, 1.30\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":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6def392b3d119ac8c6d5214c606f7f8a45f1304143043c1df1d62fc83cf60e57"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_resolver::pnpm_lockfile_import::pnpm_lock_to_deno_lock_v5: FunctionTooLong \u2014 deno_resolver::pnpm_lockfile_import::pnpm_lock_to_deno_lock_v5 runs 130 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 30 over it, 1.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":"libs/resolver/pnpm_lockfile_import.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adbbab62bd8136cfd26c2a2c7bd8d0c522cf71af38860955a5282133969a790"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: process/40_process.js: FileTooLong \u2014 649 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 149 over it, 1.30\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":"ext/process/40_process.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"525afff0dc01b15289b4b7d984e197bb810627d39b7bff5a9a0fd590686daebe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolver/file_fetcher.rs: FileTooLong \u2014 649 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 149 over it, 1.30\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/resolver/file_fetcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8451a074282e1f8d30f8b7e0dc263d8e16bd83ee35516d028e199c6b6702262"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal_binding/cares_wrap.ts: FileTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 147 over it, 1.29\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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24167d7549d9ca21069e78ea557d1bf674d7fa7940838e5885efb08b0125334c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_json/lib.rs: FileTooLong \u2014 646 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: PackageJson (2 blocks, 379-894). The bar is 500 significant lines; this is 146 over it, 1.29\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":"libs/package_json/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9348cbe018b56ab21d02be32cd78c0552bd022718619c7802a54287031f827c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/info.rs: FileTooLong \u2014 645 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 145 over it, 1.29\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":"cli/tools/info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d0eeea85ad28fb1ae0113a5f0fdc4b317f9276cd3185b70a94100c0ad8da3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: _tls_wrap.TLSSocket._init: FunctionTooLong \u2014 TLSSocket._init runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"694e43b11865418b57363d90f3725b42f8249d24755e4b33083f365abb30f5a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_cli_parser::convert::default_parse: FunctionTooLong \u2014 deno_cli_parser::convert::default_parse runs 129 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 29 over it, 1.29\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/cli_parser/src/convert.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d44d714bbba9201af6cb5705c03fe3c76ec0c5574aab65953c309452e82dfff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: console/error_fmt.rs: FileTooLong \u2014 640 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 140 over it, 1.28\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":"ext/web/console/error_fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"828a506a41e5967346a3aa13cc7f44ddf7ef1b7005978d9a953b4cbbc576549e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 40_bench.benchMeasure: FunctionTooLong \u2014 benchMeasure runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"cli/js/40_bench.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd352a58adda92f821300e71dba9b005ea95ec7fe5d11b5daf19b68b0b9223ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProxyConnector.call: MethodTooLong \u2014 call runs 128 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 28 over it, 1.28\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":"ext/fetch/proxy.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1261d36c20c24f8312ec50eb4ed9a534c74c2cf64d82b9a1e1bcc250d659d93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: net._lookupAndConnect: FunctionTooLong \u2014 _lookupAndConnect runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"ext/node/polyfills/net.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e3883f218c3e754f8909c875e119c8d2e4b79af41f30c1c3e9fe650b952f29"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HoistedNpmPackageInstaller: ClassTooLong \u2014 511 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), 4 methods, 4 blocks, lines 278-1118. The bar is 400 significant lines; this is 111 over it, 1.28\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":"libs/npm_installer/hoisted.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe22ed60f3a4a9ffa45867fcaae4abeaab83d10b1d440b125cf45a9c977a8d3b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModuleRegistry: ClassTooLong \u2014 510 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), 12 methods, 2 blocks, lines 457-1157. The bar is 400 significant lines; this is 110 over it, 1.28\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":"cli/lsp/registries.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d9c879f39c42e97cdd8b6900a154a0a56e567d96fda7256ab13fe58c0da103"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fetch/23_response.js: FileTooLong \u2014 636 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 136 over it, 1.27\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":"ext/fetch/23_response.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a330ad77289e223f7868c51d1f6bd44d6fed9e9b96a467567d43500fe9fef6b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_encrypt::run: FunctionTooLong \u2014 deno_crypto::subtle_encrypt::run runs 127 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 27 over it, 1.27\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":"ext/crypto/subtle_encrypt.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced47372d4c7b193343bde6d4fc81ff20f6a7277bdc7d48692d4bafe6d60c6ba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PerProcessOptions: TooManyFields \u2014 38 stored fields beside 1 method. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/lib.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3d3e593b524c18d493a752cd1ec23b6b5d47ad4470c68bbb78fdae90f99fe1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/path_to_regex.rs: FileTooLong \u2014 632 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 132 over it, 1.26\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":"cli/lsp/path_to_regex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7815d803eb6320a9de212c388d8279e68bbe4b82562e2788e10dc3fd3f4f20b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::initialize_tunnel: FunctionTooLong \u2014 deno::initialize_tunnel runs 126 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 26 over it, 1.26\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":"cli/lib.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2ffdd193d2764ced15449ac59d5fa25d065248d126f338f51cb1899bc802c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibMainWorkerFactory.create_custom_worker: MethodTooLong \u2014 create_custom_worker runs 126 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 26 over it, 1.26\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":"cli/lib/worker.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca33b1ef03d16c5cacddec88eaf7581f71dcecc023431f00b7d3a0005da05b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DenoDiagnostic.get_code_action: MethodTooLong \u2014 get_code_action runs 126 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 26 over it, 1.26\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":"cli/lsp/diagnostics.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ccee0285a622afeab67b65198a254a2e25c14c5f97d339dcf1eb221af4f954"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfiguredDepResolutions.new: MethodTooLong \u2014 new runs 126 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 26 over it, 1.26\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":"cli/lsp/resolver.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbda16b15cd0125cfef30f67160df8b22878d1c10884a1c79743c54bd669f4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::bump_version::bump_workspace_conventional: FunctionTooLong \u2014 deno::tools::bump_version::bump_workspace_conventional runs 126 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 26 over it, 1.26\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":"cli/tools/bump_version.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f42612a0ec7a047d1ff1774d613ab1d429ecc6e7a78bd2868f9b243ab752b1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_decrypt::run: FunctionTooLong \u2014 deno_crypto::subtle_decrypt::run runs 126 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 26 over it, 1.26\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":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd2a8f8dd55cf2c5508565e2180f8902c5e9ff4640ecd014a53018339697057"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/ops_builtin.rs: FileTooLong \u2014 629 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 33 free functions. The bar is 500 significant lines; this is 129 over it, 1.26\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/core/ops_builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7aad5bf882fe2cfbdb858be517a5591f6342fa4837094145922f185b8b4709"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inspector_server/lib.rs: FileTooLong \u2014 625 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 125 over it, 1.25\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/inspector_server/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca5e291313272b0e88f2cd2bc3aecc959400301adc11ff0da4f1d16dac03c3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::completions::get_import_completions: FunctionTooLong \u2014 deno::lsp::completions::get_import_completions runs 125 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 25 over it, 1.25\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":"cli/lsp/completions.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c332b949063c1f3cea2daf88ee693ec3910cdbe855ee2110d1d3539fe8e6c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_runtime::ops::tty::op_set_raw: FunctionTooLong \u2014 deno_runtime::ops::tty::op_set_raw runs 125 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 25 over it, 1.25\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":"runtime/ops/tty.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a742da6a900c13502b251614fc9f585d2b9e1358e07403251c1d61ef464d899"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/npm.rs: FileTooLong \u2014 622 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 122 over it, 1.24\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":"cli/npm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"189b657d21172f353dd621a354c799d749f9565f312050d62fa42454be9dc5ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/worker_host.rs: FileTooLong \u2014 620 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 120 over it, 1.24\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":"runtime/ops/worker_host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c72d1a35627a597b3ea6090e0bbea05e063febba42755f3ea308393c4e7e7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::completions::get_jsr_completions: FunctionTooLong \u2014 deno::lsp::completions::get_jsr_completions runs 124 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 24 over it, 1.24\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":"cli/lsp/completions.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d07866efa7373fdfe13450319efa7e95469728fbd54a8a6ceb117b8c5a77149"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::diagnostics::generate_module_diagnostics: FunctionTooLong \u2014 deno::lsp::diagnostics::generate_module_diagnostics runs 124 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 24 over it, 1.24\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":"cli/lsp/diagnostics.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1397a435540814d2d468302004622255f288f4ec9cf12df149139bf33ed577"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::fmt::get_typescript_config_builder: FunctionTooLong \u2014 deno::tools::fmt::get_typescript_config_builder runs 124 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 24 over it, 1.24\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":"cli/tools/fmt.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d641a04609b7011de3adfdf4fba208edf59d01394e9afa4b0e76ca6317bb11ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::installer::global::install_global: FunctionTooLong \u2014 deno::tools::installer::global::install_global runs 124 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 24 over it, 1.24\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":"cli/tools/installer/global.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e73fc4c7285b661aa50586ae71d979766fb957183a263d94da9554adf4db7ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::export_key::export_key_ec: FunctionTooLong \u2014 deno_crypto::export_key::export_key_ec runs 124 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 24 over it, 1.24\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":"ext/crypto/export_key.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e62402a13c9dea26baf4a26fe534a860fb6107656efa3af2efb191cb2dcb92"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LibUvStreamWrap: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0764cfec566808039750d4df84ac5fe03d73ced37de57949649c0e8e5925da2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::pm::why::why: FunctionTooLong \u2014 deno::tools::pm::why::why 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":"cli/tools/pm/why.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9965e088cec9e239aa77c2868058174d2ed6cd0b1878148581388558caa694"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/import_key.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). The bar is 500 significant lines; this is 111 over it, 1.22\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":"ext/crypto/import_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfcacf1efb1d633cc2b114cf88d65207582d0fa510c883a03172dfb4f59da54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolver/lib.rs: FileTooLong \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). The bar is 500 significant lines; this is 110 over it, 1.22\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/resolver/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b5ad276ce774a8f11b94f38f98b3acabbdeae85f29323a8b9ae86835c23601"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::completions::get_npm_completions: FunctionTooLong \u2014 deno::lsp::completions::get_npm_completions runs 122 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 22 over it, 1.22\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":"cli/lsp/completions.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"6496cf1a159711a2ed1354e86a4548207b2956c89686d7448f4a8d01cc19dfe9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::compile::compile_inner: FunctionTooLong \u2014 deno::tools::compile::compile_inner runs 122 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 22 over it, 1.22\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":"cli/tools/compile.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5984c972f41ac854942924399c375ef642631b75fc86a0fe68f7c6f81817108"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AstProp.fmt: MethodTooLong \u2014 fmt runs 122 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 22 over it, 1.22\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":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4522098d549cf4a9ff1af7ec3109d7c33be55dd2f921daed22d4a1cf09c430"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GPUDevice.new_render_pipeline: MethodTooLong \u2014 new_render_pipeline runs 122 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 22 over it, 1.22\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":"ext/webgpu/device.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"012a09858e59b639bc54abef2c7b375bc0d3203ce6c5194e186192165aeace4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_cache_dir::local::url_to_local_sub_path: FunctionTooLong \u2014 deno_cache_dir::local::url_to_local_sub_path runs 122 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 22 over it, 1.22\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/cache_dir/local.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c86d86fc3c89f1de32940b8e697591fdfd567a74fabc1a06d6fb999507f43f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilePatterns.split_by_base: MethodTooLong \u2014 split_by_base runs 122 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 22 over it, 1.22\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/config/glob/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2adae209551ccedb12e7d420bed53e862b82b172c476e09da45b77bd582a2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: serde_v8/de.rs: FileTooLong \u2014 609 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 109 over it, 1.22\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/serde_v8/de.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe394971c87ac56b60d9910d109837eca3445b8f136f2428ea6e50566fb201ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: canvas/bitmaprenderer.rs: FileTooLong \u2014 605 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 105 over it, 1.21\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":"ext/canvas/bitmaprenderer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d373f3b7ad4db85090d2bf9c8539c0a25a5b9a28db5d24841eb90e24b6e8515"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WefDesktopApi.setup_window_events: MethodTooLong \u2014 setup_window_events 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":"cli/rt_desktop/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd8731e22cc17f68f047d80b6988552cf78f14438e2d47598f56e0c899ad1d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::desktop::msi_sort_tables_by_string_id: FunctionTooLong \u2014 deno::tools::desktop::msi_sort_tables_by_string_id 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":"cli/tools/desktop.rs"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b4555aedfc4214a1f45815b6c395d18d9955867dec23d80dc4e05d8f67be93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: outdated/mod.rs: FileTooLong \u2014 602 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 102 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":"cli/tools/pm/outdated/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2949d23e462ec2a326a6bf3ca05d5836b1866ba6050eb1df678f26143ecacd0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: streams/fast-utf8-stream.js: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf56fddddd906283cf470608a47e7312e9b8a110af627a9292569706b90da1e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TsJsServer: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"cli/lsp/tsc.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec8d0ed1f621badc4c71004825d0484f0476c613987f4a8c836530cb415c2d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: npm_cache/lib.rs: FileTooLong \u2014 600 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 100 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":"libs/npm_cache/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"536da08e1b0a21a39bcefb85c2f51d90523fd7f70a8efc45050aaa9d3e74b6ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: adapters.newStreamDuplexFromReadableWritablePair: FunctionTooLong \u2014 newStreamDuplexFromReadableWritablePair runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"10819dd0b4d20df06b395a68f18ddd87855ced7fb032746fe4aeefce43c84f9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webgpu/texture.rs: FileTooLong \u2014 599 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 99 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":"ext/webgpu/texture.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7184b737ca4850cda7e65739b5d00a3c88496d43eb85f68c560788e0fc361b1c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WebSocket: ClassTooLong \u2014 478 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 78 over it, 1.20\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":"ext/websocket/01_websocket.js"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d2ddddcc7761d0990bf0ca1c5884ac12279866fed4dd6873af7507711d0fa2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WebWorker: ClassTooLong \u2014 476 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), 15 methods, 3 blocks, lines 434-1105. The bar is 400 significant lines; this is 76 over it, 1.19\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":"runtime/web_worker.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acd3d0c96813d59afbb0f6926a83ad6c3f4566afe99855d8c8b3748f01fc42c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Request.constructor: MethodTooLong \u2014 constructor runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/fetch/23_request.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3861bb87b5cc630bcd65179996f30b1bd120335be89b55524c078b5f691833f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: from.from: FunctionTooLong \u2014 from runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/node/polyfills/internal/streams/from.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f306125dedb2ad177e6c4ff928ee030c6fac4aabc2e2971985aeb7e271e0cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EszipV2.into_bytes: MethodTooLong \u2014 into_bytes 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":"libs/eszip/v2.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e12ad312d0e6cd7e34875116e00ba5a7d59e63b96748e18dae660031e7e487"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: os/lib.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). The bar is 500 significant lines; this is 92 over it, 1.18\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":"ext/os/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8a1f687bb416822eb54e92775c35f544a902d15b7a06c13f7253e7c527c2d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::pack::pack: FunctionTooLong \u2014 deno::tools::pack::pack runs 118 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 18 over it, 1.18\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":"cli/tools/pack/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaee100b82ddfef9a4bced2e6b8a73e87c391f1a3e7b8c77980135a6077c951"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 02_websocket.upgradeWebSocket: FunctionTooLong \u2014 upgradeWebSocket runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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":"ext/http/02_websocket.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"da38d82121657f9e090679f8e2e82d98e3f6ec12c464010cbaaf4ce38e350c10"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: util.updateSettingsBuffer: FunctionTooLong \u2014 updateSettingsBuffer runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"58016db194ef836570a9e0e5016521c4aeeea430a510dfe2b258f103f1bd247e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_resolver::npmrc::discover_npmrc: FunctionTooLong \u2014 deno_resolver::npmrc::discover_npmrc runs 118 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 18 over it, 1.18\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/resolver/npmrc.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fbf407bfc8c2eb1b19b927329eb2754957c4a3c808a8325542c64582c711c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/subtle_crypto.rs: FileTooLong \u2014 589 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 89 over it, 1.18\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":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0c4b82a50af01673ff48b6a9d496715bbefa49015321c7300e0806c3710cf0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tsc/97_ts_host.js: FileTooLong \u2014 585 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 85 over it, 1.17\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":"cli/tsc/97_ts_host.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"875047654946047e7536cfbb677a7aa993de4680ad74ae2408929b514a259162"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CliModuleLoader.load: MethodTooLong \u2014 load runs 117 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 17 over it, 1.17\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":"cli/module_loader.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3917dd1f27efc5a66e65b91ff9be816ebd5d3e8d920aaea1bf4e608720836136"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::compile::compile_binary: FunctionTooLong \u2014 deno::tools::compile::compile_binary runs 117 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 17 over it, 1.17\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":"cli/tools/compile.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9416432b67e41656bbfa863d42d9b40ec721633519989332b5f51e4d8670f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubtleDecryptParams.convert: MethodTooLong \u2014 convert runs 117 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 17 over it, 1.17\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":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49c6869a75b523090bb8ed52fae0dd226b958f1e72082d9877e6bb531d78061"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubtleEncryptParams.convert: MethodTooLong \u2014 convert runs 117 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 17 over it, 1.17\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":"ext/crypto/subtle_encrypt.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62da70ff71fdbf114cc87c16bc7b6773e308d3464d3b3422af7f86eff1d04b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceDirectory.to_fmt_config_inner: MethodTooLong \u2014 to_fmt_config_inner runs 117 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 17 over it, 1.17\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/config/workspace/mod.rs"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2651d66c7bb464a14d162a6b6d461b5bcdf431ab9d23f63a17c0d945fc1229"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolver/lockfile.rs: FileTooLong \u2014 584 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 84 over it, 1.17\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/resolver/lockfile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ddbf2b1f58495d5542575b0b78aa2620eddf067921588b3298421e96f50bd5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Socket: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fa1c763b0c8bfcde32a20b2e04a23892ffcc2f74130f6db3950b7df0a6adba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ConfigFileJson: TooManyFields \u2014 35 stored fields. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/mod.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"143a91fe0fe1d61b3d9d4e4ec1d88a200539d89f661b8fa0c6aaf50c1a83c648"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/extensions.rs: FileTooLong \u2014 582 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 82 over it, 1.16\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/core/extensions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9bb4f52b0720a69941be46b45de7f4665c14885c6537886b15fc94e5144301"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypescriptModuleLoader.load: MethodTooLong \u2014 load 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":"libs/core_testing/checkin/runner/ts_module_loader.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ec7d3d12c45c1a9554ef7b244249892601e4c26687c27ef2abb3c0f217aae2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_runtime::ops::worker_host::op_create_worker: FunctionTooLong \u2014 deno_runtime::ops::worker_host::op_create_worker 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":"runtime/ops/worker_host.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0299c0cd80ce479b99ec364e62a2a38106583c9cf021a2dd1742de1ef4f12fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/15_performance.js: FileTooLong \u2014 579 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 79 over it, 1.16\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":"ext/web/15_performance.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4028e409ebe8a51a86b0ff4dae99e01fc9128b35c9666a679381401f59d9da5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/v8.ts: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 78 over it, 1.16\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":"ext/node/polyfills/v8.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1794c357ca623a31ec42140296cf3af6fc8e7474ea7689e2a51945820ea2a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/wasi.ts: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 78 over it, 1.16\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":"ext/node/polyfills/wasi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8783c0f179522bbb244a0ddaf0c0869a404ac626470ee6e031c6acea9741ab94"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FileFetcher: ClassTooLong \u2014 462 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), 17 methods, 2 blocks, lines 547-1188. The bar is 400 significant lines; this is 62 over it, 1.16\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":"libs/cache_dir/file_fetcher/mod.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9854f663d16ad1ada4478e248b300089acff5d163106851fe29e8109a52e6b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::doc::generate_docs_directory: FunctionTooLong \u2014 deno::tools::doc::generate_docs_directory 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":"cli/tools/doc.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"026e595574db10226d07dfbe01bc345b996682f11e9bc1a0dd521c7ca72228b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: duplexify.duplexify: FunctionTooLong \u2014 duplexify runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/node/polyfills/internal/streams/duplexify.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebaf795a78b274de13dcf16fce581ecd03de645366cc87eef11a8d86a08e418"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileReader.#readOperation: MethodTooLong \u2014 #readOperation runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/web/10_filereader.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ec17d0da714df59c9954302a2928c3536aa672fe6976ba35e95e3cad46558b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::runtime::bindings::initialize_deno_core_ops_bindings: FunctionTooLong \u2014 deno_core::runtime::bindings::initialize_deno_core_ops_bindings 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":"libs/core/runtime/bindings.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d597443e8ab75617490efd71168911f33b63c524ab9ccbdf780c3594aaf1abb3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Glob: ClassTooLong \u2014 458 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 58 over it, 1.15\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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce0962d40ab757b215fa59890fd86c289c4587c5f97a9e22b212b2eca3c193d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Graph: ClassTooLong \u2014 457 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), 14 methods, 2 blocks, lines 377-1073. The bar is 400 significant lines; this is 57 over it, 1.14\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":"libs/npm/resolution/graph.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b95e3e0ddc4e25b8f97433fcd10b92e93ad2814b568b365984a6767ca019b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolverFactory.init_npm_resolver: MethodTooLong \u2014 init_npm_resolver runs 114 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 14 over it, 1.14\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":"cli/lsp/resolver.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"df022446bbdb034d100a8aa058443d237d9236b801bdb85551c5ad15999a38b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DenoPluginHandler.bundle_load: MethodTooLong \u2014 bundle_load runs 114 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 14 over it, 1.14\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":"cli/tools/bundle/mod.rs"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"711a261a2805bb0e0f9136e0e2320573d7ab51fd908f186677970364a43d4540"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_import_key::import_key_ml_kem: FunctionTooLong \u2014 deno_crypto::subtle_import_key::import_key_ml_kem runs 114 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 14 over it, 1.14\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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0a7cf46996d2aa7d42f50658fe4cde657272aca70026dd5536be9a83d10ef1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_fetch::op_fetch: FunctionTooLong \u2014 deno_fetch::op_fetch runs 114 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 14 over it, 1.14\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":"ext/fetch/lib.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f091cac2b8ec4fd4581a22a2023fcea0758b52366876ae1973dd70db10d3468"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_http::http_next::write_h1_stream_response: FunctionTooLong \u2014 deno_http::http_next::write_h1_stream_response runs 114 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 14 over it, 1.14\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":"ext/http/http_next.rs"},"region":{"startLine":4184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c86389135660781c506ab24f00faa6e4eaf7ca1f09364d815e766fc41deb6ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node::ops::stream_wrap::on_uv_read: FunctionTooLong \u2014 deno_node::ops::stream_wrap::on_uv_read runs 114 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 14 over it, 1.14\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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8ab27eaab4bd2dd5d9262ce39b9462ce299568629ed7752c5844e90c2bcba0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleMap.drain_dyn_imports: MethodTooLong \u2014 drain_dyn_imports runs 114 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 14 over it, 1.14\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/core/modules/map/dynamic.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"6675e860752cb0405da924b5227899e5f2419a65646ec3845891c3d0f7effa2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_core::uv_compat::tty::write_tty: FunctionTooLong \u2014 deno_core::uv_compat::tty::write_tty runs 114 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 14 over it, 1.14\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/core/uv_compat/tty.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"76724be07c39757c2d81674c24bda7d003408452de3b04aef15ddae354a03c97"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ResolverFactory: ClassTooLong \u2014 455 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, 2 blocks, lines 739-1349. The bar is 400 significant lines; this is 55 over it, 1.14\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":"libs/resolver/factory.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a0bb1f1d042da6bee755f00f216e4601729f88214e4d0bbe2668ce8287eaa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/tcp_wrap.rs: FileTooLong \u2014 567 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 79% of them inside a single declaration: TCPWrap (5 blocks, 172-905). The bar is 500 significant lines; this is 67 over it, 1.13\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":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"682c144ed2823d67985cba2438126fa20b51882a85b1d42b70564c577be50425"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Session: TooManyFields \u2014 34 stored fields beside 28 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"75079e2694f8f04a14bef0ce602af0a09f260fc773b46fe0b43af3ea39d6d6e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: console/constructor.mjs: FileTooLong \u2014 565 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 65 over it, 1.13\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":"ext/node/polyfills/internal/console/constructor.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22397d82b3e3a15871cbda448b2217713036316b66982b394129fd9963ee98a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/digest.rs: FileTooLong \u2014 565 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 65 over it, 1.13\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":"ext/crypto/digest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c5e31bc917c3ddeb23fb34afa6feffc39a99fbbcd4c1cbac3ef5deb0fa7ac6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::capabilities::server_capabilities: FunctionTooLong \u2014 deno::lsp::capabilities::server_capabilities runs 113 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 13 over it, 1.13\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":"cli/lsp/capabilities.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8d47466ea6dbbe80fddefaa5a8cc84ff859b6a1171880849730e7da359572d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::pm::audit::socket_dev::print_firewall_report_to: FunctionTooLong \u2014 deno::tools::pm::audit::socket_dev::print_firewall_report_to runs 113 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 13 over it, 1.13\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":"cli/tools/pm/audit.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5ac9d83411b61d4adf4a7679aa1973ea32d4211c36f832ea44e6b076dfe7f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_verify::run: FunctionTooLong \u2014 deno_crypto::subtle_verify::run runs 113 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 13 over it, 1.13\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":"ext/crypto/subtle_verify.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1c427fa2a58e55ef95d9668262afeaa8ca84583d460e3b2419d04f1be7a70a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 00_serve.serveInner: FunctionTooLong \u2014 serveInner runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"ext/http/00_serve.ts"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"08850f094e7a39a0b4646a31ba75d8a5d3a29052f9627bee51de4ca9f9bbd5a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteDbHandler.open: MethodTooLong \u2014 open runs 113 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 13 over it, 1.13\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":"ext/kv/sqlite.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b90d661043593d289ad5d88d694f8b9f7780e72bbe5b139514690e1d73358e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: child_process.fork: FunctionTooLong \u2014 fork runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"26794d5787b496bd94560b567f3cf592766522addd1a2a69cfedf68efe939d9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node_crypto::x509::op_node_x509_verify: FunctionTooLong \u2014 deno_node_crypto::x509::op_node_x509_verify runs 113 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 13 over it, 1.13\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":"ext/node_crypto/x509.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58b3b03630aa59eefcdc34b91d0176f20d71952d66c5e211d3e6daf5b291bf5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CjsModuleExportAnalyzer.analyze_reexports: MethodTooLong \u2014 analyze_reexports runs 113 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 13 over it, 1.13\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/node_resolver/analyze.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbad5af37a3862a0ede3e1c06f9a9b806629e153ce6d1e13da24c4587b0927c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RecursiveModuleLoad: ClassTooLong \u2014 451 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, 5 blocks, lines 76-780. The bar is 400 significant lines; this is 51 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":"libs/core/modules/recursive_load.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"278a71c11174f0165ec4cdad64f5b5bb7764776e2349baacb61dcb3a2d2ed21a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: args/flags.rs: FileTooLong \u2014 563 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 63 over it, 1.13\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":"cli/args/flags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82396713dcc82c667389ed16952fa074177049221ccce9570de690fc40e25877"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TCPWrap: ClassTooLong \u2014 450 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 172-905. The bar is 400 significant lines; this is 50 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":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5ab05e5b3b640bb833e29433e1cb992ba8d0b7ce5742e0d1775736b0389fca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::diagnostics::diagnose_dependency: FunctionTooLong \u2014 deno::lsp::diagnostics::diagnose_dependency runs 112 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 12 over it, 1.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":"cli/lsp/diagnostics.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9c2be8197cdc6786067fca8a79e0c3ddfd54f9ca1d14d9c4bcb2f3762bfa50"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Inner.did_change_watched_files: MethodTooLong \u2014 did_change_watched_files runs 112 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 12 over it, 1.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":"cli/lsp/language_server.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecba41dd653248cdc40763c06597e73b7ff166ddff9cc8ffcb72cda12e2762e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticsByFolderRealIterator.check_diagnostics_in_folder: MethodTooLong \u2014 check_diagnostics_in_folder runs 112 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 12 over it, 1.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":"cli/type_checker.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71745ec93cdf33f3e9ac11f31635ffcefea935294a8eea2ca56502c2a4bd5e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_fetch::create_http_client: FunctionTooLong \u2014 deno_fetch::create_http_client runs 112 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 12 over it, 1.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":"ext/fetch/lib.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c16d4ce2eed8f989e92c10c063e8fffebaeceb41bfa058c640bb845cae08c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggregateFunctionOption.from_value: MethodTooLong \u2014 from_value runs 112 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 12 over it, 1.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":"ext/node_sqlite/database.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d403b0e7c5b05d0b4cc14d554faf81849ca8e1a7b7a48dfc935c208b3a1244"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_web::console::apply_options: FunctionTooLong \u2014 deno_web::console::apply_options runs 112 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 12 over it, 1.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":"ext/web/console/mod.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e815aea727c77f6c71ca191c7511ed340d95daa2071419c75b03842d770d675b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pack/mod.rs: FileTooLong \u2014 559 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 59 over it, 1.12\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":"cli/tools/pack/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3e0895370442619591051ab4bca0e9a0c776eee9329950fd5f438457495a9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolver/emit.rs: FileTooLong \u2014 559 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 59 over it, 1.12\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/resolver/emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad4674d4a2bdb01265ea5c25430af91574196914060ef7852a3db55c98d82ea"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaskRunner: ClassTooLong \u2014 447 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), 10 methods, 2 blocks, lines 399-1032. The bar is 400 significant lines; this is 47 over it, 1.12\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":"cli/tools/task.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"82629e89f26b2bd967b291b76f85307f5265e937caaadc3f5f43c0b7ee10557a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/require.rs: FileTooLong \u2014 558 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 58 over it, 1.12\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":"ext/node/ops/require.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dc5b03dc5b27691e4aa0f7ddbc6c5f36584f2104c664c8fb94d21658a8c7e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/mod.rs: FileTooLong \u2014 557 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 57 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":"libs/core/modules/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f933796cac1b658fbf8acdd032a3aab3bb78541efc7d84b4f09fa9765b44fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_cli_parser::convert::test_parse: FunctionTooLong \u2014 deno_cli_parser::convert::test_parse runs 111 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 11 over it, 1.11\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/cli_parser/src/convert.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b62d31ffc9a85bb612780caffdb7c77f10229e60a68311c46cae4b509a2e1f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparedModuleLoader.load_prepared_module_or_defer_emit: MethodTooLong \u2014 load_prepared_module_or_defer_emit runs 111 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 11 over it, 1.11\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/resolver/loader/module_loader.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ad219bc375638ff08d3008508f6c7f39bd78c6390fb070fa5a3ae4461ba06c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/doc.rs: FileTooLong \u2014 551 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 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":"cli/tools/doc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaf89aa74e8893687bbba1fb0849edeedb2e3cd989761d424f48be028f44804"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: glob/mod.rs: FileTooLong \u2014 551 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 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":"libs/config/glob/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab2377d98557ab230ddcf59c4676fd109d2767105471b61749a2b6cc634c647"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/recursive_load.rs: FileTooLong \u2014 551 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: RecursiveModuleLoad (5 blocks, 76-780). The bar is 500 significant lines; this is 51 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":"libs/core/modules/recursive_load.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fd53496be774b3618b6d38d81ac62cef9485de6ba8d1151f50c0574f5ae9d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ContextState: TooManyFields \u2014 33 stored fields beside 3 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/jsrealm.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b8cba7180eebb4f7f6f80dc751cf01cfeed232290c7c72fe9d5e31e1c8ced6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceConfigData.load: MethodTooLong \u2014 load runs 110 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 10 over it, 1.10\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":"cli/lsp/config.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9323094ba3f99bf18ace6c37a392f5c2e54f67e0b3b6369874630e2b205b239d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::diagnostics::diagnose_resolution: FunctionTooLong \u2014 deno::lsp::diagnostics::diagnose_resolution runs 110 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 10 over it, 1.10\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":"cli/lsp/diagnostics.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"91870685c60e0c07cc96bc31ebc81374b4c6287fce846d2aa44c8b5ca02fb5ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphDiagnosticsCollector.collect_diagnostics_for_graph: MethodTooLong \u2014 collect_diagnostics_for_graph runs 110 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 10 over it, 1.10\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":"cli/tools/publish/graph.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"784e079226b71d0167aafba23789420332b05a045d1c10ba9bd9f6dd9684aa27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_runtime::fmt_errors::format_js_error_inner: FunctionTooLong \u2014 deno_runtime::fmt_errors::format_js_error_inner runs 110 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 10 over it, 1.10\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":"runtime/fmt_errors.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"57981eb9b7c221292c2d432c8330db156d4270ce935a8aae8a2e7f0fe641bbdf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GeneratorState: TooManyFields \u2014 33 stored fields. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/generator_state.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef1b03ed01717cd3ee13e03c8404c412b91cd68a61f3691f2ac164e443f39b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fetch/23_request.js: FileTooLong \u2014 546 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 46 over it, 1.09\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":"ext/fetch/23_request.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e43e844791252f70ef86fa6ce8f1bc6ff914939c62edd779598ea3df8638e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: loader/module_loader.rs: FileTooLong \u2014 545 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 45 over it, 1.09\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/resolver/loader/module_loader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda6c6e0f489dac45d8eccb57bd7949723c11bc1f9f28fc032f8545f22b9ec65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::installer::local::sync_types_command: FunctionTooLong \u2014 deno::tools::installer::local::sync_types_command runs 109 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 9 over it, 1.09\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":"cli/tools/installer/local.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"651da89321fddd9e441afefe8ed79224a7969c2e0790806529ff75200904b967"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SecureContext.constructor: MethodTooLong \u2014 constructor runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd94707351d2f8b830bae15a78d284163d40c2c7798d32c617e16367a1f39e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Decipher.new: MethodTooLong \u2014 new runs 109 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 9 over it, 1.09\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":"ext/node_crypto/cipher.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c40e81750df1cfea70ec29828e3d5b37b4f2a579c66076f1b152bd5f37ba43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node/lib.rs: FileTooLong \u2014 543 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 43 over it, 1.09\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":"ext/node/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad6721290b34cae4c660d7d598143d9cd4b28586d18a11d7ef3170464b4f816"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CliModuleLoader: ClassTooLong \u2014 434 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 34 over it, 1.09\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":"cli/module_loader.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0791d95d8d7ef81846258faf4792afeaf6ce35343a5a6dabbf7ed0cf2665e7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: net/01_net.js: FileTooLong \u2014 540 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 40 over it, 1.08\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":"ext/net/01_net.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9005be7948c1f5262b1f421eeb13f05803ea286e5debbedbdaff97abf8cb1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::pm::interactive_picker::select_items: FunctionTooLong \u2014 deno::tools::pm::interactive_picker::select_items runs 108 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 8 over it, 1.08\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":"cli/tools/pm/interactive_picker.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"948a3c0d1d9a7b304e428b2b943697509c3f49c9356a5a6ef05c27ef5b828ce9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/subtle_derive_bits.rs: FileTooLong \u2014 535 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 35 over it, 1.07\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":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"380c6cded1a2dc01d1841992fe30d2307d8cc8a7a78d629e789c4be7b1135495"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::path_to_regex::lexer: FunctionTooLong \u2014 deno::lsp::path_to_regex::lexer 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":"cli/lsp/path_to_regex.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e7acede4edd7e24b5954d316989354d9d4fa37ae4e25eb3bc73e0fa81a2cc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_fs::std_fs::cp: FunctionTooLong \u2014 deno_fs::std_fs::cp 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":"ext/fs/std_fs.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa596bd63d9ed73c84d5727201a053a379981b4a89827c9cb57650f24e6053f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_image::bitmap::op_create_image_bitmap: FunctionTooLong \u2014 deno_image::bitmap::op_create_image_bitmap 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":"ext/image/bitmap.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"893ea8b42ca05c4e58d11ea9f0e71c7dad517fd80eef4642fc874288046b793a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_os::sys_info::mem_info: FunctionTooLong \u2014 deno_os::sys_info::mem_info 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":"ext/os/sys_info.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d35fbf415dfcf2deb1abde00a70c0a8ae9e0040dc6233e73063ef0e13044323"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Ctx: TooManyFields \u2014 32 stored fields beside 1 method. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9acebc6ccf0810a872ffd417dbc4c858a16c0cd0ef0c78de9af50a91f927f44"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceMainModuleResolver.resolve_main_module: MethodTooLong \u2014 resolve_main_module 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":"cli/args/mod.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc02f968a8b118a09cc7e2fd10e73cc802fe6da679ae10a89fe47d880d32163"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 40_bench.bench: FunctionTooLong \u2014 bench runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"cli/js/40_bench.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"062c1c707c762902a92bc72845369f03a77e4c924140c238497d5f2cafc9d022"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node::ops::dns::getaddrinfo_inner: FunctionTooLong \u2014 deno_node::ops::dns::getaddrinfo_inner 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":"ext/node/ops/dns.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35f9ab19e2ebe3629430293329913054e2601dde70d5d2c022459f405bd134a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cipher.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":"ext/node_crypto/cipher.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a544641071ab0e9aca396babcd34aa6cb49c11d06e3d3793e0fc0af0b119227e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DOMMatrix: ClassTooLong \u2014 422 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), 59 methods, 3 blocks, lines 2413-2984. The bar is 400 significant lines; this is 22 over it, 1.06\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":"ext/web/geometry.rs"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7855532c09b9f40df1b571bc77d98fb5073e9ce880dfe5195fb83aa065cb84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/tls.rs: FileTooLong \u2014 525 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 25 over it, 1.05\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":"ext/node/ops/tls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57805817e4ef88c97c3d1e01d06f2dd7073f08518612c6a992c14a339f1ed1f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_sign::run: FunctionTooLong \u2014 deno_crypto::subtle_sign::run 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":"ext/crypto/subtle_sign.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8587af14e8a456356aa63bbddfdfe2278072be0776ce68dd63357bff39a9b785"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: _win32.resolve: FunctionTooLong \u2014 resolve runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"658cd65b840508ac09b3a8538b0bcd811ceca7f757c54e5535fc93fea73875de"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 02_event.dispatch: FunctionTooLong \u2014 dispatch runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/web/02_event.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbdb329b9407c5a06e502040339161e4adf14c9561fa34a780ebb99c2234cf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_cli_parser::convert::install_parse: FunctionTooLong \u2014 deno_cli_parser::convert::install_parse 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":"libs/cli_parser/src/convert.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bb1edb3c7947ebbb2b1f33ca3bfd329efb5edd258a9b9e1ab0bb85cfe2f587"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_config::util::parse_iso8601_duration: FunctionTooLong \u2014 deno_config::util::parse_iso8601_duration 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":"libs/config/util.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"732eb32449d0795136f7e44031ebad8a46e10cbbfae4535b2e8d38eddc23e64e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http2/stream.rs: FileTooLong \u2014 524 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 78% of them inside a single declaration: Http2Stream (4 blocks, 187-947). The bar is 500 significant lines; this is 24 over it, 1.05\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":"ext/node/ops/http2/stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c964fe8f807ccd7b911c082d6c4dacc028d8c96392d1dbc64480bb90e88ec6c4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SQLTagStore: ClassTooLong \u2014 417 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), 15 methods, 5 blocks, lines 122-796. The bar is 400 significant lines; this is 17 over it, 1.04\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":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"494d7bb5d98afd7d85f1554c4ae58ca155fed952821ea980c797edc20a5d7f22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::clean::clean_node_modules: FunctionTooLong \u2014 deno::tools::clean::clean_node_modules 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":"cli/tools/clean.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9146086fbdf907d40e5099149135e35a61c8353e51f15377805543d0da6ea3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::fmt_editorconfig::glob_to_regex_depth: FunctionTooLong \u2014 deno::tools::fmt_editorconfig::glob_to_regex_depth 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":"cli/tools/fmt_editorconfig.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab64f6f7af7791a10ac003e02a26f235098e85095248a9c01002d44e858fe9ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::x::autoinstall_package: FunctionTooLong \u2014 deno::tools::x::autoinstall_package 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":"cli/tools/x.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84a94ce6026f7a3519b1a840d8a6cc432f1c0a1096301be79de8f7417ffbb6a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssertionError.constructor: MethodTooLong \u2014 constructor runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/node/polyfills/internal/assert/assertion_error.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8310666c5caf8e46400fbaaeadabecb340ebc436fa296b1ab5bf3c9d87f678"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: inspect.formatWithOptionsInternal: FunctionTooLong \u2014 formatWithOptionsInternal runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3d816b59554ba42549996cc6550fe607e194de9573cf8c24bb58ce19ddee25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleMap.load_dynamic_import: MethodTooLong \u2014 load_dynamic_import 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/core/modules/map/dynamic.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4036dc2be95eda37a5c7c28135ab6f2e010ca8a46d82b9799428ccdfc323c3fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_ops::op2::dispatch_async::generate_dispatch_async: FunctionTooLong \u2014 deno_ops::op2::dispatch_async::generate_dispatch_async 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/ops/op2/dispatch_async.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07e6f02e3e8088b480742a7ae8bc19b0aabad94ec7affdea5220730c8815545"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HttpRecord: 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":"ext/http/service.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"610cf713065ee12d196e427750269d848a6acdca870d196595f0b36b828359fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UDP: 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":"ext/node/polyfills/internal_binding/udp_wrap.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5612aecdaeb1abfcc33fc3e601f88d2d16b8e16f9749aa7205bb7f0464ad06"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PackageJson: TooManyFields \u2014 31 stored fields beside 9 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/package_json/lib.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b59c5cb53ddfa7e46615e19740d7972a28cd8cc0c4e9b1430a54a70e3bd961"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LibMainWorkerOptions: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lib/worker.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cffbb0fefc4241cb132522fe4aafce118490d866e993c6020941f696b6f1fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_sqlite/sql_tag_store.rs: FileTooLong \u2014 516 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: SQLTagStore (5 blocks, 122-796). The bar is 500 significant lines; this is 16 over it, 1.03\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":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5b402c1c8c5728806d01999e6c2d977d61bc7135fa0b73327b41535424b394"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ffi/ir.rs: FileTooLong \u2014 515 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 15 over it, 1.03\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":"ext/ffi/ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c219fbd4476cb1cd83cae39ef08d97f7f19a944bec6be8d2b87444d710acb563"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Inner.hover: MethodTooLong \u2014 hover runs 103 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 3 over it, 1.03\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":"cli/lsp/language_server.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bbcc157d67b07e6b4e6d2536315e5288a2ae0433e455ae5a79a3b61b9a5b3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompletionEntryDetails.as_completion_item: MethodTooLong \u2014 as_completion_item runs 103 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 3 over it, 1.03\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":"cli/lsp/tsc.rs"},"region":{"startLine":3992}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddf8c839ab57d4ea31fc481b3b1605bde8588fcd7e52711eebbc8a850ae8e5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_crypto::supports_params_valid: FunctionTooLong \u2014 deno_crypto::subtle_crypto::supports_params_valid runs 103 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 3 over it, 1.03\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":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b562c0b716d47ca0aa09c0d6f7a20f5e399bed25d725e57d2e1e6c4a3a6dcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node::ops::llhttp::binding::consume_read_callback: FunctionTooLong \u2014 deno_node::ops::llhttp::binding::consume_read_callback runs 103 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 3 over it, 1.03\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":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f6e8b931ca57a1e66d606069413d9a193406213949b6c095e78940051da0c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: streams.createWritableStdioStream: FunctionTooLong \u2014 createWritableStdioStream runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"ext/node/polyfills/_process/streams.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5780ae12cd2b1cb9e93a55507b07f186b1046e19a9af31a3f7befa3dc55b588"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node_crypto::op_node_ecdh_compute_secret: FunctionTooLong \u2014 deno_node_crypto::op_node_ecdh_compute_secret runs 103 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 3 over it, 1.03\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":"ext/node_crypto/lib.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"634e581af5381329119ff181e8157b19e08fc4c880d00a395a2906d19482197d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 99_main.bootstrapWorkerRuntime: FunctionTooLong \u2014 bootstrapWorkerRuntime runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"runtime/js/99_main.js"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4425581f69353d5c6cf99465a44468d2aaadda6cdfb683bc779fb090365831"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Http2Stream: ClassTooLong \u2014 411 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), 28 methods, 4 blocks, lines 187-947. The bar is 400 significant lines; this is 11 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":"ext/node/ops/http2/stream.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"261d3c16ad9da92840418f1f0d55756ce9aca10810f11fc0e08e4e169aca2ed3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DepManager: ClassTooLong \u2014 410 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), 15 methods, 2 blocks, lines 614-1230. The bar is 400 significant lines; this is 10 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":"cli/tools/pm/deps.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd30bcda9f3d4b84285b0c25088a12dabc1da10f1acc53d9def20d647addfa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/01_console.js: FileTooLong \u2014 512 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 12 over it, 1.02\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":"ext/web/01_console.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"620b763177d9e3f0f084fcdbaa0157acc883776c67d01fab925cd3fdaae72bc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: npm/mod.rs: FileTooLong \u2014 512 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 12 over it, 1.02\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/resolver/npm/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"435d0e25ee98283119704e0cf50a52b9771485ae3ebf2c55c3e182690ca0e7ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/clean.rs: FileTooLong \u2014 511 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 11 over it, 1.02\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":"cli/tools/clean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c8033781138af3626a106e7b2cf4261b42272de27ddce2e83d9c6f0d37f70e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: net/ops_tls.rs: FileTooLong \u2014 511 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 11 over it, 1.02\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":"ext/net/ops_tls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d67a84e7b99a6205dc7120447a688e2f2b0c639c073f1cbef26e73a7accb6a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfills/_tls_common.ts: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 over it, 1.02\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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"263980b7a404e90a3ca06736ec141ca78b591f9727fbe7f808babb465f9ffbfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lint/mod.rs: FileTooLong \u2014 510 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 10 over it, 1.02\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":"cli/tools/lint/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fca8e5f5ed208ea173edff9d1e7344ef71614d9ab2c8ccec0e544726f488afc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::lsp::path_to_regex::tokens_to_regex: FunctionTooLong \u2014 deno::lsp::path_to_regex::tokens_to_regex 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":"cli/lsp/path_to_regex.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90a479c5ac8760ff8811c1443cdd6629bcb4b1c7caab3c9376f06f0749ab87c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::installer::global::setup_config_dir: FunctionTooLong \u2014 deno::tools::installer::global::setup_config_dir 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":"cli/tools/installer/global.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fc3fbde0b9990acb9a4a47c7b8519af9c7a2159baa8e06017540b4ff7e5e35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::installer::print_install_report: FunctionTooLong \u2014 deno::tools::installer::print_install_report 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":"cli/tools/installer/mod.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"57759f232b0d605e5a0c77c71412e99844b70fcfcb781cda8707f75b7fcc834f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::lint::ast_buffer::swc::serialize_stmt: FunctionTooLong \u2014 deno::tools::lint::ast_buffer::swc::serialize_stmt 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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe439002bd866dbeca3180d1af905da4cac2a16c4e403a2eebaf33bc40e88c4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_import_key::import_key_okp: FunctionTooLong \u2014 deno_crypto::subtle_import_key::import_key_okp 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54c69805c51c7fac48e4f451031fc9dbb374d931e37db0ffeddd22c08995e3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_net::quic::op_quic_endpoint_connect: FunctionTooLong \u2014 deno_net::quic::op_quic_endpoint_connect 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":"ext/net/quic.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"97db4c9b566a3b6912d073836f21b8cc5dc945363a31ec5c52b8c7e9a8400884"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node::ops::llhttp::binding::on_headers_complete: FunctionTooLong \u2014 deno_node::ops::llhttp::binding::on_headers_complete 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":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79802ba5c215d2cb6817d496fd287e53fbe36db63eaaa81e691e6d77f611940"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_node::ops::winerror::op_node_sys_to_uv_error: FunctionTooLong \u2014 deno_node::ops::winerror::op_node_sys_to_uv_error 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":"ext/node/ops/winerror.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1793b51cda383cb39a46b2c1ef1dd7af7758c9b9ba100af2a9578b4e7a7a241a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/09_file.js: FileTooLong \u2014 506 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 6 over it, 1.01\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":"ext/web/09_file.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e7839d461c1153050cb35251927f28eb9330191bc0e5fb523b2c27d45dcc5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/code_lens.rs: FileTooLong \u2014 505 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 5 over it, 1.01\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":"cli/lsp/code_lens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae785dc479baec4d551179e50c03eb134f1a5699a553a2a2492e6bd5510fd1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: map/ext_script.rs: FileTooLong \u2014 505 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 87% of them inside a single declaration: ModuleMap (56-774). The bar is 500 significant lines; this is 5 over it, 1.01\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":"libs/core/modules/map/ext_script.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7537f1e89c2f3365dcd431ca6c775ce0718020b8adaed7413786c5434b9202f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VfsBuilder.ensure_canonical_dir_inner: MethodTooLong \u2014 ensure_canonical_dir_inner runs 101 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 1 over it, 1.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":"cli/lib/standalone/virtual_fs.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"be761e9965087af35666d14217a892622d27855dc94226170d6ebe6876b73fa6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TestServer.new: MethodTooLong \u2014 new runs 101 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 1 over it, 1.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":"cli/lsp/testing/server.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dce11c3b190121eb447e2875dfc9fdf14a575f5a31825b9977ec7cd65e3eab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HtmlEntrypoint.patch_html_with_response: MethodTooLong \u2014 patch_html_with_response runs 101 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 1 over it, 1.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":"cli/tools/bundle/html.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9798e34eea7e3c0e32d4efe07a4cea4be2cfa5c1e54b9989a6cf119e2fb6a28a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno::tools::desktop::package_linux_app_dir: FunctionTooLong \u2014 deno::tools::desktop::package_linux_app_dir runs 101 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 1 over it, 1.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":"cli/tools/desktop.rs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6294802af4c2a7b4b0b6d3c3c9f61a67f66bd170ecd56f752abc374ceadeee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DepManager.load_latest_versions: MethodTooLong \u2014 load_latest_versions runs 101 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 1 over it, 1.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":"cli/tools/pm/deps.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec894b4f7df3173a933f43da3aad4c51378c020e6fb64d84f3ee8bd8b82082ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_crypto::subtle_import_key::import_key_ml_dsa: FunctionTooLong \u2014 deno_crypto::subtle_import_key::import_key_ml_dsa runs 101 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 1 over it, 1.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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"585f1a3d5b6f595972f1735d533b50f52a9a6899a308b057dadbdfb41325fa69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deno_io::bi_pipe::bi_pipe_pair_raw: FunctionTooLong \u2014 deno_io::bi_pipe::bi_pipe_pair_raw runs 101 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 1 over it, 1.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":"ext/io/bi_pipe.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dc228d672af343ee364a6ad48b1a6498562f665b908595c51f029b2d24af26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parse_args.argsToTokens: FunctionTooLong \u2014 argsToTokens runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"ext/node/polyfills/internal/util/parse_args/parse_args.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fac66afc74116672108acb539a77d5ec0fa67f5507f7a7f050a4181736b79a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseSync.apply_changeset: MethodTooLong \u2014 apply_changeset runs 101 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 1 over it, 1.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":"ext/node_sqlite/database.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bc722ff03994887a2589328c5f06f7f94af8673d1fcddf768ee676ba5602b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: uv_compat/stream.rs: FileTooLong \u2014 504 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 4 over it, 1.01\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/core/uv_compat/stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ea0f6cccb6db2cd109765c3b99bd684274784602af8fe393a188e9f0020c77"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TLSWrapInner: ClassTooLong \u2014 403 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), 11 methods, 2 blocks, lines 1061-1932. The bar is 400 significant lines; this is 3 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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15e01c0ea3d330fa94ee44644cd84d16de4d6918f56d93934b80f7687fd84dc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CliModuleLoaderInner: ClassTooLong \u2014 402 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), 14 methods, 2 blocks, lines 600-1318. The bar is 400 significant lines; this is 2 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":"cli/module_loader.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"0729b765b82ff7acb5ee5944f5ebbc2e6627802a58938f80aa11635477a7e2c4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NpmResolutionSnapshot: ClassTooLong \u2014 401 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, 2 blocks, lines 357-961. The bar is 400 significant lines; this is 1 over it, 1.00\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":"libs/npm/resolution/snapshot.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab3925a83f954a21d3ded57e989dfa40bbc695f470cbdb73b5fbafe1257b0dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 15 shared lines): ext/node/ops/tls_wrap.rs:530-567 | ext/node/ops/tls_wrap.rs:573-601 | ext/node/ops/tls_wrap.rs:609-635 | ext/node/ops/tls_wrap.rs:690-712 | ext/node/ops/tls_wrap.rs:840-872 \u2014 These 5 members are variants of one another: a block of 15 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca715840ee3d839380c5cb31c044c664d83f977113b0d1d711c8f810667da45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 27 shared lines): cli/lsp/code_lens.rs:276-317 | cli/lsp/code_lens.rs:383-446 | cli/lsp/testing/collectors.rs:390-441 | cli/lsp/testing/collectors.rs:530-579 \u2014 These 4 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"cli/lsp/code_lens.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e3377c245975fcff7be61e1c9cb67dc4c0d0ce338728cec59b82238ce74fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 23 shared lines): ext/signals/dict.rs:33-110 | ext/signals/dict.rs:33-180 | ext/signals/dict.rs:33-145 | ext/signals/dict.rs:33-75 \u2014 These 4 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"ext/signals/dict.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"787fb86c4b55bca068c42c7576839ce4716b49285ae589b5cd3a23fc27735a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 20 shared lines): ext/node/ops/tls_wrap.rs:530-567 | ext/node/ops/tls_wrap.rs:573-601 | ext/node/ops/tls_wrap.rs:609-635 | ext/node/ops/tls_wrap.rs:840-872 \u2014 These 4 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"4114d8d0174a870c9f6f0f96245bc7e249d6ab48996903927d48c42dea53f783"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 60 shared lines): ext/webgpu/compute_pass.rs:164-260 | ext/webgpu/render_bundle.rs:158-255 | ext/webgpu/render_pass.rs:238-333 \u2014 These 3 members are variants of one another: a block of 60 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/compute_pass.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7873aa7ec5b5c14d73f0d9a2349bfb71a8410b9e74954b4504d7694a7ede64d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 37 shared lines): ext/crypto/subtle_export_key.rs:720-795 | ext/crypto/subtle_export_key.rs:800-876 | ext/crypto/subtle_export_key.rs:881-944 \u2014 These 3 members are variants of one another: a block of 37 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3756d09e30dba0b92d227f254c10009f73bea66caecc501478e5b9e18e45704"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 22 shared lines): ext/node/ops/fs.rs:1441-1505 | ext/node/ops/fs.rs:1638-1686 | ext/node/ops/fs.rs:1806-1865 \u2014 These 3 members are variants of one another: a block of 22 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"774fd34a61eca14ff5c0dbc2a6e6daff4a8dfaf992986f4ea1883b9b403034a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (108 shared lines): cli/lsp/completions.rs:558-710 | cli/lsp/completions.rs:718-869 \u2014 These two members are variants of one another: 108 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":"cli/lsp/completions.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5b05529d06c2bab03363f1b6129a6b42b5b810cff60fb41439ce3928b0d75f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (94 shared lines): ext/node/ops/fs.rs:3118-3313 | ext/node/ops/fs.rs:3322-3574 \u2014 These two members are variants of one another: 94 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":"ext/node/ops/fs.rs"},"region":{"startLine":3118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a43e932a2ae91d7d9d77ed5d6d37630c31859aaa29e181fc37ddb9e64d55b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (89 shared lines): ext/node_sqlite/sql_tag_store.rs:475-772 | ext/node_sqlite/statement.rs:759-983 \u2014 These two members are variants of one another: 89 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":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"48630faf94ca6187dc7e50630d9fbeeb03b6a13eb5a4b2d5012c8b63baa9a905"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (79 shared lines): libs/core/ops_builtin_v8.rs:309-427 | libs/core/ops_builtin_v8.rs:436-559 \u2014 These two members are variants of one another: 79 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":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e51e4fc442a9b018ecfb988be55d85463b3fad4b45d67bac6a06b309138e260"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (68 shared lines): libs/dcore/src/inspector_server.rs:187-269 | libs/inspector_server/lib.rs:413-508 \u2014 These two members are variants of one another: 68 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":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"89306c15c8d650fd2fee895c2c28537529c80440928d95a39ce08120a31df575"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (66 shared lines): libs/dcore/src/inspector_server.rs:306-425 | libs/inspector_server/lib.rs:653-798 \u2014 These two members are variants of one another: 66 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":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe41f9e925465881ea0211ee3ef0bd9e569eabe8e38fed21e81d666de83ee4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): ext/http/http_next.rs:4194-4336 | ext/http/http_next.rs:4347-4530 \u2014 These two members are variants of one another: 57 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":"ext/http/http_next.rs"},"region":{"startLine":4194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2294f6a935380320073b396717f4a36029182c63f65d38e42ef4536172893aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (50 shared lines): cli/tools/desktop.rs:1626-1731 | cli/tools/desktop.rs:1753-1900 \u2014 These two members are variants of one another: 50 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":"cli/tools/desktop.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fbfaaf2b0bf5bad2dc5665cd9b6fe918ba037d954e16df2823d99362dd35ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (45 shared lines): ext/node/ops/zlib/mod.rs:912-982 | ext/node/ops/zlib/mod.rs:998-1068 \u2014 These two members are variants of one another: 45 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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7ca91ded8e4fc136cb5f8bd1c855467856f8eeac2558e45cca7e892585ca78"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (42 shared lines): cli/module_loader.rs:1433-1605 | cli/rt/run.rs:807-1024 \u2014 These two members are variants of one another: 42 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":"cli/module_loader.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b243474a5e737aa8d6902889c8d1fc081aeb07ca53dd7d8fe44f6f8a43d79d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (38 shared lines): cli/tools/bundle/esbuild.rs:51-156 | cli/tsc/native.rs:85-204 \u2014 These two members are variants of one another: 38 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":"cli/tools/bundle/esbuild.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae65ecabd537b8458383bbec5d4233432a55cf42d838286eecceaf5499be3c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): ext/node/ops/pipe_wrap.rs:138-164 | ext/node/ops/tcp_wrap.rs:139-165 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/pipe_wrap.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b379b02813964083d70eb1ea41de0d08487496e3faf57a03273cbc177733bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): ext/telemetry/lib.rs:3091-3116 | ext/telemetry/lib.rs:3129-3158 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":3091}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2493740832d16de6a176437ade79f57bdc68d463e21223127838ba16cc2cd7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): cli/lib/worker.rs:194-230 | ext/node/ops/process.rs:671-695 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lib/worker.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1228e9cca852f7fcf8d6e47f7b9c848b3280141e8809e1a43e96d7e8edf54a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): cli/lsp/language_server.rs:1829-1862 | cli/lsp/language_server.rs:2155-2448 | cli/lsp/language_server.rs:2650-2714 | cli/lsp/language_server.rs:2750-2788 | cli/lsp/language_server.rs:2795-2830 | cli/lsp/language_server.rs:2837-2872 | cli/lsp/language_server.rs:2879-2914 | cli/lsp/language_server.rs:3216-3252 | cli/lsp/language_server.rs:3259-3289 | cli/lsp/language_server.rs:3381-3416 | cli/lsp/language_server.rs:3423-3459 | cli/lsp/language_server.rs:3466-3501 | cli/lsp/language_server.rs:3590-3626 | cli/lsp/language_server.rs:4607-4641 | cli/lsp/language_server.rs:4781-4812 \u2014 These 15 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 15 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 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f640de9faf076d40a270d2a896f689020c175ca44d9b4933026dd90273f7be"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): ext/crypto/digest.rs:339-358 | ext/crypto/subtle_decrypt.rs:239-252 | ext/crypto/subtle_decrypt.rs:372-393 | ext/crypto/subtle_derive_bits.rs:275-311 | ext/crypto/subtle_encrypt.rs:294-307 | ext/crypto/subtle_encrypt.rs:428-449 | ext/crypto/subtle_sign.rs:238-270 | ext/crypto/subtle_sign.rs:286-322 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/digest.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1e637325057aa922f412ba3e11a384b1ae284b0f9eb881957266f6a93207f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): ext/node/ops/http2/session.rs:905-987 | ext/node/ops/http2/session.rs:1009-1027 | ext/node/ops/http2/session.rs:1033-1069 | ext/node/ops/http2/session.rs:1076-1095 | ext/node/ops/http2/session.rs:1097-1153 | ext/node/ops/http2/session.rs:1155-1192 | ext/node/ops/http2/session.rs:1194-1239 | ext/node/ops/http2/session.rs:1241-1285 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4a0c3cd2eb6002cc315efbbdc912473321d4d29c2eeec56c0a9ef1d1af543a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): ext/fs/ops.rs:284-304 | ext/fs/ops.rs:350-366 | ext/fs/ops.rs:374-390 | ext/fs/ops.rs:418-434 | ext/fs/ops.rs:1065-1083 | ext/fs/ops.rs:1117-1141 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"926e363e3d11d0784b004dbd786332342e5131e25b71f012dd255c97241a5087"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): ext/napi/js_native_api.rs:1259-1298 | ext/napi/js_native_api.rs:1306-1345 | ext/napi/js_native_api.rs:1353-1396 | ext/napi/js_native_api.rs:1843-1886 | ext/napi/js_native_api.rs:1894-1933 | ext/napi/js_native_api.rs:1941-1985 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"88829aced58c44976a6faee3552a28d4ce4e02fd918fbbf2c79a73b5d0a651e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): ext/crypto/node_interop.rs:337-348 | ext/crypto/node_interop.rs:354-365 | ext/crypto/subtle_crypto.rs:840-851 | ext/crypto/subtle_generate_key.rs:782-793 | ext/crypto/subtle_import_key.rs:1926-1937 \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":"ext/crypto/node_interop.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4dc5a72ba90e755f7fbedc4ecd05adfb9da91f11eda87a655dd8ebae548cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): ext/net/ops.rs:302-315 | ext/net/ops.rs:384-409 | ext/net/ops.rs:417-441 | ext/net/ops.rs:449-463 | ext/net/ops.rs:471-484 \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":"ext/net/ops.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eb84b7e3636297d1a9b1dc5cc9ceb4fabf8324f97441942822f21db3510254"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): ext/node/ops/wasi.rs:1510-1528 | ext/node/ops/wasi.rs:1537-1555 | ext/node/ops/wasi.rs:1564-1582 | ext/node/ops/wasi.rs:1594-1624 | ext/node/ops/wasi.rs:1738-1793 \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":"ext/node/ops/wasi.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb77b570bc9a03e370391b804957fdf77ec0d0f6ab207e010d6a26ce930c171"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): ext/webgpu/adapter.rs:119-247 | runtime/ops/desktop.rs:757-847 | runtime/ops/desktop.rs:1856-1875 | runtime/ops/desktop.rs:1923-1943 | runtime/ops/desktop.rs:2050-2108 \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":"ext/webgpu/adapter.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f19db1a21843313ae0ab7aa9ca6f555cfa4dfa1c2ab63a25a10dbc041cc15dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): libs/core/uv_compat/pipe.rs:662-708 | libs/core/uv_compat/pipe.rs:753-864 | libs/core/uv_compat/pipe.rs:875-920 | libs/core/uv_compat/pipe.rs:986-1069 | libs/core/uv_compat/pipe.rs:1334-1357 \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":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"958501f3652603136f1d4d042ef01a6a49ad19503839580c0b50e442412ca2cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): cli/lsp/tsc.rs:635-661 | cli/lsp/tsc.rs:1037-1063 | cli/lsp/tsc.rs:1170-1196 | cli/lsp/tsc.rs:1335-1367 \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":"cli/lsp/tsc.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce53d5d4058f0925abd2b6a1f919a50b47af9e0683b8f4d26f7c2c3306a0736"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): ext/crypto/subtle_import_key.rs:652-784 | ext/crypto/subtle_import_key.rs:793-907 | ext/crypto/subtle_import_key.rs:916-1020 | ext/crypto/subtle_import_key.rs:1381-1506 \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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"e490cd42d21e266a8ad01650ea7bfa624f09cb281a037759d0baf130c298b618"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): ext/fs/ops.rs:1150-1180 | ext/fs/ops.rs:1189-1223 | ext/fs/ops.rs:1232-1268 | ext/fs/ops.rs:1277-1313 \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":"ext/fs/ops.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3944899f4c4026c7e33793f6f6b34171b596cf7ce001118c602da97bdde98f05"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): ext/fs/ops.rs:1489-1525 | ext/fs/ops.rs:1563-1603 | ext/fs/ops.rs:1634-1671 | ext/net/ops.rs:1128-1235 \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":"ext/fs/ops.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9f12fc79ffa4450a9784a7db16cf29d640597243206e6c5f1253d711158768"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): ext/node/ops/fs.rs:570-591 | ext/node/ops/fs.rs:616-628 | ext/node/ops/fs.rs:651-663 | ext/node/ops/fs.rs:763-775 \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":"ext/node/ops/fs.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e144a9428e3457171ef40c92fc2830ab8198e2731c941da426767366e76f3c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): ext/node/ops/llhttp/binding.rs:310-343 | ext/node/ops/llhttp/binding.rs:446-590 | ext/node/ops/llhttp/binding.rs:596-637 | ext/node/ops/llhttp/binding.rs:639-685 \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":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5425b1e45615c2ff63ec7adf93f65947df681996a077e626fd145283bf729f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): ext/node/ops/llhttp/binding.rs:735-912 | ext/node/ops/stream_wrap.rs:621-808 | ext/node/ops/stream_wrap.rs:935-995 | ext/node/ops/stream_wrap.rs:1005-1054 \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":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cd6baf74c5afe758c5498f6ab75140487cb8279d5a5310330cd989488dbdbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): ext/telemetry/lib.rs:2900-2913 | ext/telemetry/lib.rs:2923-2955 | ext/telemetry/lib.rs:2968-3006 | ext/telemetry/lib.rs:3021-3067 \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":"ext/telemetry/lib.rs"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01c3341edd2173372a99df898ab73b742b36293e4bb8bc40c13e683ec263335"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): ext/web/console/mod.rs:1107-1125 | ext/web/console/mod.rs:1230-1249 | ext/web/console/mod.rs:1258-1294 | ext/web/console/mod.rs:1342-1371 \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":"ext/web/console/mod.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4efdf09f7e58a6df879dbcebf2d9faf7242a59838dc53b03d845b1c056f3172"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/eszip/v2.rs:96-116 | libs/eszip/v2.rs:121-147 | libs/eszip/v2.rs:152-172 | libs/eszip/v2.rs:177-210 \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":"libs/eszip/v2.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"534b2cb8749bebf1ced6d531d6518f46aed2c8c4982e34a05695bf58541cac60"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/resolver/bun_lockfile_import.rs:40-188 | libs/resolver/npm_lockfile_import.rs:64-266 | libs/resolver/pnpm_lockfile_import.rs:43-246 | libs/resolver/yarn_lockfile_import.rs:30-151 \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":"libs/resolver/bun_lockfile_import.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e0bb1094ba2da2c0f3d3b35d4cd5a513248c304adbc08cc1174d9682676b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/resolver/bun_lockfile_import.rs:339-350 | libs/resolver/npm_lockfile_import.rs:285-296 | libs/resolver/pnpm_lockfile_import.rs:739-756 | libs/resolver/yarn_lockfile_import.rs:180-190 \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":"libs/resolver/bun_lockfile_import.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d893b28a4746931b27a2ed3abcd11641834e0af08e30f8846bc68511dbe728"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): runtime/permissions/lib.rs:2523-2540 | runtime/permissions/lib.rs:2542-2559 | runtime/permissions/lib.rs:2561-2578 | runtime/permissions/lib.rs:2580-2597 \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":"runtime/permissions/lib.rs"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"1820aff31859c167df84a8f96dc821e4afa16069b29d327332c89204e8baf371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (157 corresponding lines): ext/node_crypto/cipher.rs:831-987 | ext/node_crypto/cipher.rs:1287-1448 \u2014 These two members are one piece of code written twice and then edited apart: 157 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"447ab21b46357568f4e2137ee2e6e5921c5daa4cf414809212fea017096123e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (166 corresponding lines): ext/crypto/subtle_decrypt.rs:427-592 | ext/crypto/subtle_encrypt.rs:484-659 \u2014 These two members are one piece of code written twice and then edited apart: 166 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"367308ccb1d53929b3e78692ab160348d44944264d6dcf0e50f80aff47fc4861"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (133 corresponding lines): ext/crypto/subtle_sign.rs:413-545 | ext/crypto/subtle_verify.rs:233-372 \u2014 These two members are one piece of code written twice and then edited apart: 133 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_sign.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb381137fb4a707d0ad68c64766d577b8f00bc0a8287cf6fb65e329fdab4acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (94 corresponding lines): ext/crypto/decrypt.rs:326-424 | ext/crypto/encrypt.rs:205-298 \u2014 These two members are one piece of code written twice and then edited apart: 94 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/decrypt.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"779129ea1341f3945c2f2ff52b1b39c129999625b29fed28482b0c67c0bc70c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): ext/node_crypto/cipher.rs:1006-1069 | ext/node_crypto/cipher.rs:1492-1555 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d0796d4a33764c484d2af551620b20c0e9e3bc2c50d99c51d353132c93112a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (85 corresponding lines): ext/node/ops/fs.rs:2538-2622 | ext/node/ops/fs.rs:2631-2717 \u2014 These two members are one piece of code written twice and then edited apart: 85 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e35cac1495b01b3c120f47cb2f9d0faa8ca9fa5b458f0f40ff657a78d565ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (114 corresponding lines): ext/node/ops/fs.rs:2094-2214 | ext/node/ops/fs.rs:2225-2338 \u2014 These two members are one piece of code written twice and then edited apart: 114 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35186170ff0e78e44ce03422d2610a7a520158cda4b8af470a3ca4032cefbfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (91 corresponding lines): ext/node/ops/vm.rs:89-179 | ext/node/ops/vm.rs:1501-1608 \u2014 These two members are one piece of code written twice and then edited apart: 91 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/vm.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca18836dfcd55d95e6d1054e1c97dc345d4db7f65494b97b6c9ad4a47a34c113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (93 corresponding lines): ext/node/ops/fs.rs:2914-3006 | ext/node/ops/fs.rs:3015-3109 \u2014 These two members are one piece of code written twice and then edited apart: 93 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":2914}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f10058765b490bd70d8dd291c246b8a1fe879c246ccb6726fb4f38f0e21ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): ext/ffi/ir.rs:591-660 | ext/ffi/ir.rs:673-743 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/ffi/ir.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ac6599da9a47cf1d9c96ca011744b896b62dd9ebc39993c8bbbae9ea9056a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (82 corresponding lines): ext/telemetry/lib.rs:2022-2111 | ext/telemetry/lib.rs:2124-2205 \u2014 These two members are one piece of code written twice and then edited apart: 82 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c151e826d5f903fc9bba7d1de40d63f5fdf79c6cc477fd4cb1e8b38248439d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): ext/node_crypto/x509.rs:730-781 | ext/node_crypto/x509.rs:1286-1341 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/x509.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"089318c859bd13a8f457292be8f353a34308060cbb488df181423bd89d44f670"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): cli/standalone/binary.rs:456-520 | cli/standalone/binary.rs:525-591 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/standalone/binary.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe15fdd822cc1824438d2f46c97902bad92d87081ebfe9d111608fb33eb38d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): libs/npm_installer/global.rs:215-285 | libs/npm_installer/local.rs:1425-1488 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/global.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"423afb64f949a5767e43479391a9687e36651f324c450ef0e09f78d1ed76bf96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): ext/node_crypto/lib.rs:512-563 | ext/node_crypto/lib.rs:570-617 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/lib.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9ed00466fe76259ffa22a1c8dbc1a7c123fb23841319b8876a917ec126ab0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): libs/http_h1/write.rs:217-280 | libs/http_h1/write.rs:286-350 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/write.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e792ff2fa1edcccb247123d5cf72f535bb46fa4a78825b31f8b8f25e27d413"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): cli/rt/binary.rs:810-872 | cli/tools/pack/mod.rs:600-672 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/binary.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"34dd39a845e8471353b4d76ebf0f45f47b565f4ea6ce8b390abd4552939ef75a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): ext/http/http_next.rs:5458-5522 | ext/http/http_next.rs:5543-5594 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":5458}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d112d6ba887539bb86e512f2da3c1973854d8d293cef20bdbe78c495680ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): libs/http_h1/parse.rs:156-201 | libs/http_h1/parse.rs:209-261 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/parse.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa998394841521dbc2bf54c19086a35832e349ea9761d50935a32e972e6fdebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): libs/npm_installer/bin_entries/windows_shim.rs:95-150 | libs/npm_installer/bin_entries/windows_shim.rs:153-210 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/bin_entries/windows_shim.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76ba9e0ddd89ac26058d82a7892cfea8e080d16b9c7221ca9fca058635f349b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): libs/dcore/src/inspector_server.rs:139-182 | libs/inspector_server/lib.rs:114-183 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e4369c7b456a66069ee449fa3dc0981e8c34fc7c47fa4982914b245c8330fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): ext/net/ops.rs:780-840 | ext/node/ops/udp.rs:74-120 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8357529a57a1f950736b73cd0bd49015e8566a135073e6d5b506d2ab1b86e53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): ext/node/ops/stream_wrap.rs:1916-1979 | ext/node/ops/stream_wrap.rs:1996-2065 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cef5e9a965dfa07c32628b7db85c1f738f596bb7644d23aec5c4353a2024b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): ext/node/ops/tls_wrap.rs:413-453 | ext/node/ops/tls_wrap.rs:465-524 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"54aaa1224962f52ec83d9d77fdb2ccec19835d802bb92669cf5cf7331ee62933"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): ext/node/ops/inspector.rs:349-399 | ext/node/ops/inspector.rs:414-451 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/inspector.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7d5f8f8c751bd20fa735e2234e517dc86e9d46b6d606e2d73e83479f563d29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): cli/lsp/code_lens.rs:319-364 | cli/lsp/testing/collectors.rs:581-644 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/code_lens.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc32873a4bd97b18dbb2fa1511dd4db1b34d56efded76b5c64a386cce1d3966a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): ext/node/ops/http2/session.rs:3366-3411 | ext/node/ops/http2/session.rs:3414-3459 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":3366}}}],"partialFingerprints":{"codehealthFindingId/v1":"379cfc9973a79365162bf65c89385fcd081398c95005128a92f864643cd45749"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): ext/node/ops/tcp_wrap.rs:200-269 | ext/node/ops/tty_wrap.rs:103-161 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9a9d4c253c4e9a4c2fe384597d2c4ea6ae616ee5fb95eb16b012518b9b0055"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): ext/node/ops/v8.rs:1200-1234 | ext/node/ops/v8.rs:1239-1266 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/v8.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30882b54188a7a1b60b3beed1f71c199a825c6bd31efcc03fb2e56a9e2b8564"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): ext/napi/uv.rs:1085-1125 | ext/napi/uv.rs:1128-1168 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/uv.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a73a6bff81fa198419e8a77d532de9d03e8819472ad90138d1fbc9969d402a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): ext/crypto/subtle_import_key.rs:1516-1555 | ext/crypto/subtle_import_key.rs:1614-1663 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"109d4e522f9b361b2c6f9f5e888b60418aff82b7090017c9b3cd5b1c760f12ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 55\u002B corresponding lines): ext/webgpu/webidl.rs:42-98 | ext/webgpu/webidl.rs:152-208 | ext/webgpu/webidl.rs:247-301 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 55 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/webidl.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"48208ce08cc85f7a0ec7177436b6e7199097e96fa330debaf66d351596973ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): ext/node/ops/fs.rs:361-412 | ext/node/ops/fs.rs:421-474 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d524a2155294f91d326c4e4a7f48847a39b3c2f2f94b40f2c1112fa6d202d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): ext/node/ops/fs.rs:1571-1630 | ext/node/ops/fs.rs:1898-1957 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"52eadac18e208eae0b8f55208be051f31195845fc097c607cce263c400038072"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): ext/node_crypto/lib.rs:400-431 | ext/node_crypto/lib.rs:440-482 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/lib.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81f831c4624f0990286fd5bd0fc25a3abc0b182210ab783e0599d4af6eac040"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): ext/crypto/node_interop.rs:121-153 | ext/crypto/node_interop.rs:159-194 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e9766ccb75fcd2ecc8fdb20776889f5ccc71f4eba9ad337ec6bbbe0d2d93a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): ext/net/quic.rs:1218-1272 | ext/net/quic.rs:1278-1330 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/quic.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bf7be314ee73bcc16963a99319b7afde92feb3d9d8aa7fad7be41c8ea2b29d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): ext/node/ops/wasi.rs:2146-2200 | ext/node/ops/wasi.rs:2211-2251 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bad76488a035680a88e116c23a693eeef174e1582d3b79dcc67d11c4d430aba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): ext/http/http_next.rs:2820-2870 | ext/http/http_next.rs:2884-2930 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"21033d302a47f82ddeb802ec5b7467b3943a0e2fd50baef27f68de29096cf6e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): ext/crypto/subtle_import_key.rs:1038-1073 | ext/crypto/subtle_import_key.rs:1850-1893 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"9345c3124799f95f7824712791dacb7732bd7b46d419b79e11b09aa99d22dd98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): ext/crypto/subtle_generate_key.rs:816-846 | ext/crypto/subtle_import_key.rs:142-172 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"8125450f613ccadd2b5b2b9a46c3204937c1314f47f70dd79b8edca3bc9ea895"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): cli/tools/bundle/mod.rs:621-693 | cli/tools/bundle/mod.rs:798-851 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/mod.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df02f8bcf248be2cd2d9796b58182d84612518f80116e0becb2b6ce07146dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): cli/lsp/ts_server.rs:809-854 | cli/lsp/ts_server.rs:1247-1309 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/ts_server.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb9246b35ccea4f4b408398f02c107c2d5da0a6f532032371d7c21b8880672a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): ext/http/http_next.rs:2243-2270 | ext/http/http_next.rs:2279-2314 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf8aadd350ce33a1579a7e66e720c5241396fd961a9c0be0625ae373a88ca02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): ext/http/http_next.rs:5185-5254 | ext/http/http_next.rs:5263-5342 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":5185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e420bdecf54eb9006505d5d67ed10386cd5711148483ecef32c73f85f2f3891c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): cli/lsp/ts_server.rs:718-767 | cli/lsp/ts_server.rs:937-991 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/ts_server.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b02e2d9f19e90a7f8e2bb9914fee8505bc79d91253101ca3d302bfc682e2716"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): ext/node/ops/tcp_wrap.rs:323-367 | ext/node/ops/tcp_wrap.rs:563-603 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d49f0fc602464d2f880339c5309db563385564ceb34568608809a9645951177"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): ext/node_crypto/keys.rs:379-394 | ext/node_crypto/keys.rs:398-414 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/keys.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c16b42d6e005fb7db4de86a94195200be5532599be10ab0dcc7cf50c73d540f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): libs/cli_parser/src/convert.rs:2982-3030 | libs/node_shim/lib.rs:3087-3136 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeff1bb6836731a0d3aa8d1ff76e2d2a6a1284a5cdf32675680b49aa3c22b454"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): libs/http_h1/conn.rs:1181-1235 | libs/http_h1/conn.rs:1256-1295 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"367f22c60a03ab4d6646a4827f10ecf6a4340c5ad9dc9365869d568a7aa16c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): cli/tools/bump_version.rs:637-674 | cli/tools/bump_version.rs:680-719 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bump_version.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e07994d36bcf7ba3af0be53384103bf7e4c7408db29d8cc81269217ffc15101"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): ext/crypto/subtle_encapsulate.rs:120-156 | ext/crypto/subtle_encapsulate.rs:162-202 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_encapsulate.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac11bb1958c7942bc7c084594aaccb247709206978ce008a569d76989d27b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): ext/ffi/call.rs:330-375 | ext/ffi/call.rs:387-441 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/ffi/call.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d133f4a8a12604dbac90ac5a6e0e376eee93f92858794fa798d9899422126d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): ext/node/ops/http2/session.rs:876-903 | ext/node/ops/http2/stream.rs:408-433 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b3da2fd378035f4ba548e5e5996e7053a8262da5fcf158a6cae3f7364410f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): ext/node/ops/ipc.rs:272-304 | ext/node/ops/ipc.rs:477-508 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/ipc.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b3a9e9a61cf8b3501d90d803ca3613b959a2199a2c1340ce1257c5b8b0efd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): ext/node/ops/zlib/mod.rs:1468-1504 | ext/node/ops/zlib/mod.rs:1517-1546 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2719f0f3f26b484f0275cb8068d9f919a02886da419afbd878fafc4690c0416"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): ext/web/lib.rs:713-751 | ext/web/lib.rs:781-813 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/lib.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e6c5c3fa3cc3c9a10cdab0cdd23c9ffab1dd0981d2bffb409a9003214b3dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): ext/crypto/decrypt.rs:160-203 | ext/crypto/encrypt.rs:127-155 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/decrypt.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7808ad4db9b736875a12b7aa86a9cf7fedbb423f187a663dbee692510eb2e1f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): libs/cli_parser/src/convert.rs:980-1021 | libs/cli_parser/src/convert.rs:1025-1061 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"6763a4f0d927d4b501d2a82483958954530ee02085470d4456dc6079bd4559df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): cli/module_loader.rs:1345-1394 | cli/rt/run.rs:745-781 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c241c07e69c96dd5b2187ad9713a891516f828a29ea4a627d71b6fd6bf7dc181"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): ext/fetch/proxy.rs:849-865 | ext/fetch/proxy.rs:876-892 | ext/fetch/proxy.rs:897-913 | ext/fetch/proxy.rs:918-934 | ext/fetch/proxy.rs:958-978 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/proxy.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d196e9401a0d60d765ea6c25da64aeb5046b544f3e7480d091e97910b09ba7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): ext/napi/js_native_api.rs:2828-2859 | ext/napi/js_native_api.rs:2869-2909 | ext/napi/js_native_api.rs:2919-2951 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2417fc5c6d675ccf387130b1c157579873953e659a553952e8f81019d8d20e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/resolver/cjs/analyzer/deno_ast.rs:179-216 | libs/resolver/cjs/analyzer/deno_ast.rs:238-260 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/cjs/analyzer/deno_ast.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"960ace9e6b9239f499d63f974255d0474463185f974c6988c900009b1eabbf73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): runtime/ops/permissions.rs:73-87 | runtime/ops/permissions.rs:93-107 | runtime/ops/permissions.rs:113-127 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/ops/permissions.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7e7fe2d4e123b697d058d9339087148a9efad6d8dfa9905f57866be893afb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): ext/cache/lsc_shard.rs:75-103 | ext/cache/lsc_shard.rs:110-137 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cache/lsc_shard.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2238b46791da909b8a742e5af3610b17497c7215425c050602eb44c825babe3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/config/workspace/mod.rs:2484-2507 | libs/config/workspace/mod.rs:2723-2753 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/mod.rs"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"810100976a997c11084f9748a90201bef5fffebf33d5c2c10cb2b56b4a7f73b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): ext/crypto/mldsa.rs:204-228 | ext/crypto/mlkem.rs:342-366 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/mldsa.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51734d6a3e851c803f7fed3113e4e134c1b194f8604f0e1c233fc9bc467076a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): ext/crypto/decrypt.rs:291-317 | ext/crypto/encrypt.rs:314-340 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/decrypt.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee507e31ddfed975ec03f5f5885e812455e315e416f5cb09b54f7e94138f054"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): ext/crypto/decrypt.rs:93-133 | ext/crypto/encrypt.rs:89-119 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/decrypt.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcee14e4f6a58c93c0565c827b2f4abc8b0a0eb1caa959275e5d5556feb609c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): ext/net/ops.rs:259-295 | ext/net/ops.rs:962-993 | ext/net/ops_unix.rs:116-140 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f031b697ada2659332b5482528003819c786df30560add399b21ebbb049614e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): ext/process/lib.rs:1597-1622 | ext/process/lib.rs:1631-1660 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/lib.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb13a11672fca1e710861e193bb19e98cf027b44954dd3ba6b0bf658df391cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): ext/telemetry/lib.rs:905-925 | ext/telemetry/lib.rs:933-953 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"df351b699fe4bec50aaef728fd30c3086b8a29ef76a3ca40743afaaabde23090"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): ext/web/console/inspect.rs:3121-3140 | ext/web/console/inspect.rs:3148-3172 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":3121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39f6e16a9c2c3bc927c35a70f33c1778e2fbc5c3504c521b1767e3441f34897"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): libs/http_h1/conn.rs:535-574 | libs/http_h1/conn.rs:738-769 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fd3501b023efd06505da470102f0639f25c136cbe9dba21763d657e8b6ba3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): cli/lsp/language_server.rs:3296-3332 | cli/lsp/language_server.rs:3339-3374 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b8ae7b5fa2ed6c7b0ebe913f4fe78d2e84fd61765549ea510cc424ac6c356"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): ext/canvas/byow.rs:219-251 | ext/canvas/canvas.rs:124-154 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/byow.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fc3d06c3a1ec5cd7531fffc45aa1ebd0215f4e4aa947119403b076b47f9183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): ext/node/ops/fs.rs:670-694 | ext/node/ops/fs.rs:701-732 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c04dd7b596b6927092007d094f848becc2c2b39b99d5b8cb90ecbdbd337093"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): ext/node_crypto/x509.rs:286-316 | ext/node_crypto/x509.rs:322-353 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/x509.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaaaa5af89e2e6ea743525fcf88da416e8e42e5a8080d4a0ebc7f8cef4ca108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): cli/tools/bump_version.rs:1117-1140 | ext/node/ops/v8.rs:164-176 | ext/web/console/inspect.rs:2622-2633 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bump_version.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3a6f5113f11a6ae3c491e8b47d4034feb94ca940459d76470df18a12177309"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): ext/telemetry/lib.rs:1574-1598 | ext/telemetry/lib.rs:1603-1626 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abbac7a8b9d0904b18a2be4af624686fff0b91764bacd400d90de7b0303605d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): ext/web/geometry.rs:1021-1043 | ext/web/geometry.rs:1090-1112 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"e884b86e29a2f475efae666dc6c40438b67f30d375f49af43ef308b201de14c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): cli/lsp/language_server.rs:3508-3538 | cli/lsp/language_server.rs:3545-3583 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":3508}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43ec6136f7e41e262c40aab8333c7cf32668d54879157f0272f282dbe8eeb28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): ext/web/geometry.rs:2922-2944 | ext/web/geometry.rs:2952-2974 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec3269a9d8f6a29642bd57643fd831bb061c2f31e0490a45dbf6509c4f1ba4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): cli/rt_desktop/lib.rs:1039-1087 | cli/rt_desktop/lib.rs:1091-1117 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt_desktop/lib.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b22244ab7f26ff44962e3a610b475e37b4ab81e21d832ae5cbb0be142e8d2a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): ext/fs/ops.rs:578-600 | ext/fs/ops.rs:829-852 | ext/fs/ops.rs:885-908 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cba2fb0d48c7948c0617c7c3cdb5f483610effec228205feabeb2a4f5e3129"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): ext/node/ops/fs.rs:2725-2760 | ext/node/ops/fs.rs:2766-2800 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1974db5e2fc4a1f7f1fe5bb414244d731ab569910674b1281bed2637e339dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): ext/node/ops/wasi.rs:601-620 | ext/node/ops/wasi.rs:646-666 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfdac69b5fa8832e79492f4d94828df2ac37236b208ec7be3105ecd241a8a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:2398-2414 | cli/tools/lint/ast_buffer/ts_estree.rs:2421-2435 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7ed20162a2a893ca14eb97c3ab15ed0b7f673807f672dab1bf245dd091d4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): libs/core/runtime/op_driver/futures_unordered_driver.rs:139-168 | libs/core/runtime/op_driver/futures_unordered_driver.rs:180-210 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/op_driver/futures_unordered_driver.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffb51804d0f39e31bf34936ba5673c72ed26942135ae34e42e4d1ce960ee643"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): cli/lsp/language_server.rs:1365-1408 | cli/lsp/language_server.rs:1496-1532 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2e0256b4b8b3866a72246dc552c04aafd70fb423558f963d5b4bf1b5a8cbca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/core/arena/raw_arena.rs:318-340 | libs/core/arena/raw_arena.rs:348-369 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/raw_arena.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc45b2f48eea7628bab669bea86d365991cff59d027b8cf76172043909f6cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/config/deno_json/mod.rs:661-686 | libs/config/deno_json/mod.rs:763-786 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/mod.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"465b94f59b03c24433e27acff7650ebe7c11235f92693dfca027678e75c38db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): libs/dcore/src/inspector_server.rs:53-88 | libs/inspector_server/lib.rs:325-363 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c10e3ce32502d55ef891b029f70ef823bb8b75d2cd2ba861ed48b664e14760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/eszip/lib.rs:50-65 | libs/eszip/lib.rs:76-90 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/lib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"214c473fa5fda4ad80781f941c81f80a1ccbb70aafb6d423f07755e7eaf43545"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): ext/websocket/lib.rs:785-804 | ext/websocket/lib.rs:829-850 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/lib.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cb466b4ef7792fc024fdd0be55c9261f3dc67b20a8998714520a47c3646568"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): libs/core/arena/raw_arena.rs:172-203 | libs/core/arena/raw_arena.rs:219-250 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/raw_arena.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"826940fe89d48ead3fcab06e68beb820a5001691d770924a4a103c82eeb9bb1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): runtime/ops/worker_host.rs:543-581 | runtime/ops/worker_host.rs:587-618 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/ops/worker_host.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4a0955cbbabf94080c18f3fe11de4b48eaf1a8e7454edc1b6fa5e6e2b4699a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): libs/core/uv_compat.rs:1084-1116 | libs/core/uv_compat.rs:1138-1171 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4969bd7eb666f2a5fc0acfe96593e2b3a6730641c6ce854ca86fe74dedb0b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): runtime/permissions/lib.rs:1381-1413 | runtime/permissions/lib.rs:1580-1605 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ea9c881fa943e6e54748a9a324583391ff526454ea32be1867e0461ffe6e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): ext/io/lib.rs:938-965 | ext/io/lib.rs:996-1019 | ext/io/lib.rs:1020-1053 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/lib.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb9357e5d9d0944386f030cdc7e0cc6ee8e4697f9710b4395202d569bcc84c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): ext/io/lib.rs:1125-1152 | ext/io/lib.rs:1153-1188 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/lib.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a1c40fdc493694644a714c802ad94fdbb15daa85b9c5c50dc3e9830c894cc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): ext/web/console/inspect.rs:2505-2524 | ext/web/console/inspect.rs:2529-2565 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"deee3afe601b43c1fdec0a4094a489caec123da9bc67cdb7b53098c3eaad68d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): cli/tools/bundle/mod.rs:732-757 | cli/tools/bundle/mod.rs:769-787 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/mod.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14a24841740da8fdc709a07a1f6e8915bfa5b6b2bbd232ad4faaa925adca1ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): runtime/permissions/lib.rs:4452-4478 | runtime/permissions/lib.rs:4490-4515 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21b4346b92c2310ee0a178601ee0b7eb326a5c4fd9f108e75a94e7926a1e857"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): ext/web/console/mod.rs:840-863 | ext/web/console/mod.rs:874-896 | ext/web/console/mod.rs:908-929 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/mod.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43b6cd7738da231e2e69a2d8651da8dd494c3d07c83c45332547872af8bad1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): libs/http_h1/write.rs:85-105 | libs/http_h1/write.rs:110-134 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/write.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2199b41ca4904d88d0e9f931d34fbf2025b4c506035563edbedbabb864e08b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:905-920 | cli/tools/lint/ast_buffer/ts_estree.rs:937-957 | cli/tools/lint/ast_buffer/ts_estree.rs:973-994 | cli/tools/lint/ast_buffer/ts_estree.rs:2070-2093 | cli/tools/lint/ast_buffer/ts_estree.rs:2447-2465 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e118273797657a713dbd6156fe9a8363a41f998275950e7ea06dbe6f18bf37b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): ext/fs/ops.rs:194-214 | ext/fs/ops.rs:222-252 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"deebe264d8aa5768f6b9a65924e0d26245d64048ad4b9c98bd011f418a1f3999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): ext/http/http_next.rs:3727-3755 | ext/http/http_next.rs:3866-3891 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":3727}}}],"partialFingerprints":{"codehealthFindingId/v1":"7344df4b9d180c048cbbd0083bb77c72672bf1385cee7a521926fac1dc865d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): libs/npm_cache/fs_util.rs:30-49 | libs/npm_installer/fs.rs:83-109 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_cache/fs_util.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9af2af154898edba75c73ab2fda3ec94eca10cc3e8ca520fea40551df02a3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/serde_v8/magic/v8slice.rs:155-178 | libs/serde_v8/magic/v8slice.rs:180-203 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/serde_v8/magic/v8slice.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdef2a2ea315b55c4c0f7d5693f577d1ab5b594a5b30a6506997009796762a33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 34\u002B corresponding lines): cli/lsp/tsc.rs:751-786 | cli/lsp/tsc.rs:836-870 | cli/lsp/tsc.rs:882-915 | cli/lsp/tsc.rs:1125-1161 | cli/lsp/tsc.rs:1525-1566 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"296c615934f658c7186348e29d32c7a6b34b64efd298bc2c3952b1e2c2c04498"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): cli/tools/repl/session.rs:688-717 | cli/tools/repl/session.rs:723-752 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/session.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d8e04447646b53448cf73ee503e91195edc55c7292227734c159320f6c2f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): ext/crypto/subtle_encapsulate.rs:82-101 | ext/crypto/subtle_encapsulate_key.rs:40-58 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_encapsulate.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6736f6bdd6f9aef1e608128d4b9bc0516d8d1a287bc6d69a5a9d024b0a4225d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): ext/napi/node_api.rs:460-484 | ext/napi/node_api.rs:529-558 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/node_api.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"203e65933f6248ca247aac9348aa75ccd33b9dc920a1feea50b850fcb4271f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): ext/telemetry/lib.rs:2466-2496 | ext/telemetry/lib.rs:2511-2552 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":2466}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b7be0ea6f27e235c2381e11d2761f5bb6b2a5e6c2d99859a75fee701376bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): cli/lsp/jsr.rs:406-420 | cli/lsp/npm.rs:65-82 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/jsr.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d4b1b6d2fe51e744e8cdaa73c348c9c5fbe13a62480a8ecf8a46c80e75f3e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): cli/util/v8.rs:19-48 | libs/dcore/src/main.rs:273-300 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/v8.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f0290d57e774a8657455fb6bef86a1507044868997d87566869c915cf373d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ext/http/response_body.rs:176-192 | ext/http/response_body.rs:194-210 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/response_body.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b121e1145e1afda29d4e5754b791c6e92b4f9ee99480004e322db19d3d8899f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): cli/tools/pack/extensions.rs:9-29 | cli/tools/pack/extensions.rs:33-57 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/extensions.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"874a109f357038bb729921a2865e2b69faee5f372a406cb23d4fa6b868b5bae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): ext/net/ops.rs:869-904 | ext/net/ops.rs:922-945 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a46da9ebdfe2f254e55602aa052e599ac1d4598fa4b5693c8d91ea12fcfb92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/core/runtime/ops.rs:364-380 | libs/core/runtime/ops.rs:391-416 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/ops.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cb30a7a574fb98b64902ed3b21bf10846bfcf5ebc39c0593ad602581350f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): cli/lsp/performance.rs:165-185 | cli/lsp/performance.rs:197-213 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/performance.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"67adc7d639948b8b2500e0b302ee00ff507bc1ecd843f07947e6bc05fbb8935a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): libs/npm/fast_registry_json/simd/width_128.rs:267-284 | libs/npm/fast_registry_json/simd/width_128.rs:286-303 | libs/npm/fast_registry_json/simd/width_128.rs:305-328 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/fast_registry_json/simd/width_128.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d921c1a6c4071365f23b2207476525e04bc4fe4c5d0aea4b72b7c6041d9f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): ext/crypto/subtle_crypto.rs:856-879 | ext/crypto/subtle_crypto.rs:918-931 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe64aaa3a4e1524230ddd29095e7dd96b684cbbde36b3381df1b2a47c93db30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): ext/node/ops/zlib/alloc.rs:20-52 | ext/node/ops/zlib/alloc.rs:69-93 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/zlib/alloc.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de49893c0c67bafdcef0e9f03545d9274783051053f57c956b4ff79d8784872"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): cli/standalone/native_addons.rs:265-288 | cli/tools/compile.rs:450-475 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/standalone/native_addons.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e365b29d7e153aa284ec10a6aa466b2bac39a4e31f3f6e3d81d130c78b3fae0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): cli/tsc/tsconfig_gen.rs:686-705 | cli/tsc/tsconfig_gen.rs:709-731 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"349f8651efd9ad85e6dcb6f93346ecc623f661c0ba1dae8c6475b4bfe8a30ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): ext/cache/sqlite.rs:164-190 | ext/cache/sqlite.rs:218-250 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cache/sqlite.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"db31ed026643c7a3fb11990c5fcfe642aac472a130e7701e0ca7d2ecd7efce8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): ext/crypto/subtle_wrap_key.rs:254-267 | ext/crypto/subtle_wrap_key.rs:272-285 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_wrap_key.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ac1a31b52aa710d4047ccb9eb527dc22cdd63d634c4bad432a2ff7998ab6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): ext/web/geometry.rs:2292-2311 | ext/web/geometry.rs:2352-2373 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1f6597c5e923a009c5691cf1593cd2568febd7a7690c1222bed84af6b867ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 25\u002B corresponding lines): libs/config/deno_json/mod.rs:2202-2228 | libs/config/deno_json/mod.rs:2305-2331 | libs/config/deno_json/mod.rs:2333-2359 | libs/config/deno_json/mod.rs:2364-2392 | libs/config/deno_json/mod.rs:2607-2631 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/mod.rs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"835ffce7b78df20d48d0263f0d7505801193e9d9057cceb077d28f6649ffc6cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/node_resolver/resolution.rs:673-707 | libs/node_resolver/resolution.rs:713-738 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7c6b456b99a89e2a37bc7a1e553f93ac66bcd7bb4e1cd80aec2d40d15e0acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/ops/conversion/from_v8/enum.rs:168-191 | libs/ops/conversion/mod.rs:60-83 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/enum.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0993d13894b62b6e649de146f40018a4edc6026591e0085cc68a5e269658a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/ops/op2/dispatch_slow.rs:977-1002 | libs/ops/op2/dispatch_slow.rs:1010-1035 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/dispatch_slow.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e56c8add88b6721d11713c235b10604ceb0f3b3edb110654a0aacbdeacb179"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): runtime/ops/desktop.rs:1681-1720 | runtime/ops/desktop.rs:1751-1770 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/ops/desktop.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e71d795ea4e10dccec7c548d03d166f94632891d1ba8b761a46edae52f4c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): ext/napi/js_native_api.rs:2621-2641 | ext/napi/js_native_api.rs:2648-2669 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce98d47b8995df3d3646a19f07f3bdb6c807be81f9a242578b5de94773c721b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): ext/webgpu/device.rs:541-558 | ext/webgpu/device.rs:566-583 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/device.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3181c3d0ce6198775145f22ab8a0074a84405586c86a1f7c603ca5725f54bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): cli/tools/fmt.rs:614-648 | cli/tools/fmt.rs:655-691 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/fmt.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80617cfcbd33bee308b22cfe874d113e2cb0a439f91859c637fb1629ac50d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): ext/crypto/subtle_encapsulate_key.rs:81-120 | ext/crypto/subtle_encapsulate_key.rs:130-170 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_encapsulate_key.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad24960e38c750bd7608480d1c68093a90ebb771d42e8d78bea704df1fed07d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/ops/conversion/from_v8/mod.rs:16-33 | libs/ops/conversion/to_v8/mod.rs:18-45 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e4b97fd19503d54da5fc7c429ab4f9ceaf4e7aff85a99562625cff19ab58ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): ext/node_sqlite/database.rs:3047-3060 | ext/node_sqlite/database.rs:3066-3079 | ext/node_sqlite/database.rs:3087-3100 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a283280c526700e48ee8bf73bc8f587bbf4f4078f211f5364e4986da6d2664"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/core/runtime/host_defined_options.rs:62-85 | libs/core/runtime/host_defined_options.rs:91-104 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/host_defined_options.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"927f6b979c0af682af33d6f47e5ac787b88cdda30bdbef6197e890e21901a98c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): cli/lsp/language_server.rs:1534-1556 | cli/lsp/language_server.rs:1558-1583 | cli/lsp/language_server.rs:1612-1632 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeea5ac4984cf0a3598f22c56abfd3e7cb96630fd97c31e9a2097ae45a25cb1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/node/ops/ipc.rs:816-837 | ext/node/ops/ipc.rs:870-884 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/ipc.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e59c1e1958a6392b3b6d1ce8b024e3ca12d450df8d533bd14dd54dcd92577f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): ext/web/lib.rs:666-704 | libs/core/ops_builtin_v8.rs:582-622 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/lib.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"99de551d246dbd4dab4afb50d44a3a84e190aa4b9a9b92e0bd2bd712ee818b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): runtime/ops/desktop.rs:1787-1807 | runtime/ops/desktop.rs:1813-1829 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/ops/desktop.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7a7230574177de2a74f3bcd7d334214c8efa09ab5d50057b82ac5bb59f3eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): ext/kv/sqlite.rs:82-106 | ext/node_sqlite/database.rs:99-123 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/kv/sqlite.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d12b8bdaf7d1dc2662a36cb3ab2d5e6e09f8dab408e7dd41281759f78f4a4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): libs/resolver/display.rs:113-133 | libs/resolver/display.rs:135-155 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/display.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f827996a6c82c3aca5c502ceaf2cf699ed37206882da611ff2fac87bb14c440"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): cli/lsp/jsr.rs:422-439 | cli/lsp/jsr.rs:444-461 | cli/lsp/npm.rs:84-106 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/jsr.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"326989c84a9f2cd52aa43ee7e669a8863042d0339a5a454159d27879f062f68b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): cli/lsp/language_server.rs:510-530 | cli/lsp/language_server.rs:562-580 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a85ad08a6a59d2630d3b4c3d4dd39b7e1ccefcb8b9ebe62f531fa66e14b8f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): ext/fs/ops.rs:552-571 | ext/fs/ops.rs:803-822 | ext/fs/ops.rs:859-878 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"942112336c5491f3a6f8da859572d63b95cc904b2f8a4c631c3f34d5f70a5b4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): ext/node/ops/tcp_wrap.rs:854-874 | ext/node/ops/tcp_wrap.rs:884-904 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f92ad0ccced2611f88880d0b865d4394bee5eef98be87ff98b0da13ed91505f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/ops/fs_events.rs:82-108 | runtime/ops/fs_events.rs:606-621 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/ops/fs_events.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ef8da8ac7a4529db4f005542ed33b6831005037dbe397873ffc4bcff712cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): cli/lsp/ts_server.rs:862-887 | cli/lsp/ts_server.rs:895-925 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/ts_server.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca3d6ee18406642669858445504fdce4ce3158a4ef00fd46527a68ce05f2685"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): ext/net/quic.rs:927-944 | ext/net/quic.rs:974-992 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/quic.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1af5f31996e9c571ce6481cdfdc0f62b97ec57eeb881137b7e8e049a55153b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/net/win_pipe.rs:103-115 | ext/net/win_pipe.rs:117-128 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/win_pipe.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b022a1734fc4a26a1f456690579da24c1056b5839d8740d58ee1e158f54efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): ext/fetch/lib.rs:333-362 | ext/websocket/lib.rs:419-447 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/lib.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1367c1c15dc7c56c18770fff336b7bb631a33a32b3821f5e033c80fcc7b11303"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): ext/node_crypto/x509.rs:134-152 | ext/node_crypto/x509.rs:253-274 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/x509.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03813f66a66355d1f56ce775a3f76b7968e68052ee994dacfff0b9407c4096f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): cli/jsr.rs:187-205 | cli/lsp/jsr.rs:315-327 | cli/lsp/jsr.rs:332-346 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/jsr.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0f5104ad83f03e50ef4af67c7e56abf2ee7f0db88eee475ec10fc692ad06a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): cli/tools/repl/session.rs:262-280 | cli/tools/run/hmr.rs:301-319 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/session.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad8a6480906445aef5f054b147679e54924b6ad74a4e92aadfb160108be3e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): ext/node/ops/fs.rs:1515-1537 | ext/node/ops/fs.rs:1695-1713 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe4de7f4362618b90a947c2de6b6134be8feedb6a6189d05c48e8342195fafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): ext/io/lib.rs:1478-1496 | ext/io/lib.rs:1502-1522 | ext/io/lib.rs:1528-1546 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/lib.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"887456275d3f1ba427436871a3eef20da3317064cc2f0bb4d51586ed33b00b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): ext/napi/js_native_api.rs:2706-2726 | ext/napi/js_native_api.rs:2734-2754 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a808ebf99bd1f36c882aa1e7b0f79c79a0f8a1580d3dbf4c08a5b33dfe9d363"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): ext/crypto/subtle_import_key.rs:1329-1347 | ext/crypto/subtle_import_key.rs:1348-1371 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d6748c16d04195e58a5c1705077cd6747ee4408a67335ce2dbf976b26cfff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): ext/crypto/subtle_wrap_key.rs:68-86 | ext/crypto/subtle_wrap_key.rs:103-121 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_wrap_key.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd35227cbca7c2f91a5f35908991354bf79311bfe78a08f246d91db1d9a10a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/fetch/proxy.rs:68-82 | ext/fetch/proxy.rs:87-101 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/proxy.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"07446d0c41524c4985ff08b1c0439ddb2773a46c6290f0ddacd5e55609a941db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): ext/node/ops/fs.rs:1044-1059 | ext/node/ops/fs.rs:1068-1083 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a4dbd4788aed2f3ec86ec41417c606e3c361642127c80f0fddb3db8a1f349e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): ext/web/geometry.rs:2139-2155 | ext/web/geometry.rs:2181-2196 | ext/web/geometry.rs:2792-2807 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2b4bd9e01eb29ef7b9354834def935d0d02b8f56820938d869808e46b8f2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): libs/http_h1/conn.rs:614-640 | libs/http_h1/conn.rs:646-670 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e2b9323132f8f758fb13b0ce2c257c43a1e8608be93698b57686a24a6e3318"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 16\u002B corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:755-772 | cli/tools/lint/ast_buffer/ts_estree.rs:788-805 | cli/tools/lint/ast_buffer/ts_estree.rs:853-873 | cli/tools/lint/ast_buffer/ts_estree.rs:1298-1314 | cli/tools/lint/ast_buffer/ts_estree.rs:1326-1341 | cli/tools/lint/ast_buffer/ts_estree.rs:2106-2126 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a261a4663525079874e887f2a24ce57a42e71f60a2232e4b098b245cb4c90c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/node/ops/tls_wrap.rs:2995-3013 | ext/node/ops/tls_wrap.rs:3016-3030 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2995}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd12ace4da90b7669f2589e8bed0742d36156569c5e202e6f402e947e5cc5911"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/dcore/src/inspector_server.rs:274-286 | libs/inspector_server/lib.rs:513-527 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbe5a4230ffaab88c13c3986de51f090b97f9ff94a2d1c8422de4876424f94a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): cli/tools/fmt.rs:186-208 | cli/tools/lint/mod.rs:232-251 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/fmt.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f3e27b6913d395675b6385c8f76e94068182c76cee8b5afc1cfd98e1a0f63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/crypto/crypto_key.rs:218-229 | ext/crypto/node_interop.rs:371-387 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/crypto_key.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ec66b66b6fe28ed23cee1bd6c22315c9b64c604b4faab381e5266c096534b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): ext/io/lib.rs:1260-1277 | ext/io/lib.rs:1278-1301 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/lib.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a33b44d17342382aae4c2ee233936db0bfb92b500911a79aeafc78a14666c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): libs/ops/conversion/to_v8/enum.rs:307-329 | libs/ops/conversion/to_v8/struct.rs:227-248 | libs/ops/webidl/dictionary.rs:255-272 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/to_v8/enum.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56049b4994d17525bee9f5ced709cd5cb972046e36e23807d6878eeb3d74e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): cli/lsp/lint.rs:178-200 | cli/lsp/resolver.rs:1605-1624 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/lint.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"32eaf0920b43ac887d3a8925da9723347fa97d3ed7fd710784b175322c962192"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): ext/fs/ops.rs:626-643 | ext/fs/ops.rs:669-686 | ext/fs/ops.rs:759-783 | ext/fs/ops.rs:1018-1037 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2452e7b0607637d545b439101e6d2d4df62fff90bf03b3b8cb34e6b68d40360"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): ext/node/ops/vm.rs:1091-1110 | ext/node/ops/vm.rs:1201-1218 | ext/node/ops/vm.rs:1358-1377 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/vm.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"60464ed7cef182d61a07debce7c43f4ae6c83828c040af187a3c919fb02a264f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/eszip/v2.rs:411-437 | libs/eszip/v2.rs:448-482 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v2.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdef91769cbb741266dede00f052c0baa32463b0cfe76096ca06a695d876429"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): runtime/worker.rs:1071-1084 | runtime/worker.rs:1089-1102 | runtime/worker.rs:1105-1118 | runtime/worker.rs:1156-1171 | runtime/worker.rs:1176-1196 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/worker.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde26dc3af325ba430595f70af044e9b916a8080e1b997cfe9abbe20bae9b44b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): ext/http/http_next.rs:1285-1313 | ext/http/http_next.rs:1505-1528 | ext/http/service.rs:1109-1130 | ext/http/service.rs:1134-1157 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"795b917f9246df3a1a6a7c2c05334d84c481ff0f65082b91445bb5f92c0fb62d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): ext/webgpu/command_encoder.rs:329-356 | ext/webgpu/command_encoder.rs:365-390 | ext/webgpu/queue.rs:211-237 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/command_encoder.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc292e12517a7c8e88a721ed4e6a6d65853131c006ea85f0592fded1dc54696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): ext/napi/js_native_api.rs:653-676 | ext/napi/js_native_api.rs:684-705 | ext/napi/js_native_api.rs:713-736 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e461797218ae37335da37b845755a0da804f9c006ca39123fb27df44a395c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): ext/crypto/subtle_wrap_key.rs:381-401 | libs/cli_parser/src/convert.rs:3425-3444 | libs/core/modules/import_graph.rs:183-201 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_wrap_key.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"89340263ff1c29be77346f456ee2992838c2cd74e3a9ef5b4d6e2e82d18db326"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/node/ops/udp.rs:128-148 | ext/node/ops/udp.rs:280-294 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/udp.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f1b349c05aa62b522c518b056aec98007d1e980ce2586c14107ebd575253e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): libs/core/convert.rs:668-687 | libs/serde_v8/magic/bytestring.rs:69-85 | libs/serde_v8/magic/u16string.rs:88-101 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/convert.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a22d19277b363030f219c84ab023d3a289d401c81a2f7509368da23d54d96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): cli/graph_container.rs:83-107 | cli/tools/bundle/mod.rs:2101-2128 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/graph_container.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d4bad72fc0b9387371790b3f05dca4bcbbf1dd4ecb0df63b2c6eafcf842e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): cli/lsp/tsc.rs:556-582 | cli/lsp/tsc.rs:1227-1250 | cli/lsp/tsc.rs:1259-1285 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca4cfc0a4741399b971e09f47b1db99265a8d8dd102751dc5dedbc452964510"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): ext/cron/socket.rs:276-288 | ext/cron/socket.rs:296-308 | ext/cron/socket.rs:313-325 | ext/cron/socket.rs:330-342 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cron/socket.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbca81c5249cbeddca893efd7ec8909b7a7dfa28e3fb54d7b4149ff7de83963"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/web/geometry.rs:230-241 | ext/web/geometry.rs:266-276 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"49577b789eaa6a52dbf930a1a4a06a398e3c6701a65ddfc28e47d1cb4578d61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): ext/web/geometry.rs:2205-2225 | ext/web/geometry.rs:2842-2860 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecced045092a1c22f6e46453c380c6d2d29c406edf323e60e75dbe3a1be586f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/core/modules/mod.rs:427-442 | libs/core/modules/mod.rs:679-693 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/mod.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7b56f937db0b87b7cd68e39983e49c9a856ae177554d9109f8d5eb02b29633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ext/crypto/shared.rs:239-255 | ext/crypto/shared.rs:378-394 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/shared.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"05194c896e6f663f07eda794b711fac7a00d6c28adda1ade084689ce071da43d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): libs/core/modules/map/dynamic.rs:332-351 | libs/core/modules/map/dynamic.rs:399-427 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map/dynamic.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d17858543e2d9fe394b986e15d4b19edd584308261c6527f2403b7247715a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/resolver/deno_json.rs:773-789 | libs/resolver/deno_json.rs:791-814 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/deno_json.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"df65ce7c3fbe7ced7768791363d90776d7b7f0f31d28882e0d5c8e19d032d04e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): cli/tools/bump_version.rs:36-52 | cli/tools/pm/mod.rs:96-113 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bump_version.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"74eb0f20a75bfc4cd599e7260961df4ff24d975d045dd4645073c24fc96aee36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): ext/node/ops/udp.rs:527-547 | ext/node/ops/udp.rs:556-576 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/udp.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"00255e3788d7c507d27c1b70304ee84a7d4fef9f266769bda9c933b3cfcffbe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): cli/tools/check.rs:19-42 | cli/tools/compile.rs:45-68 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/check.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba709277587c70b2b01338c428e0ff40f3946f42868aef86c123da6198fd518"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/http/http_next.rs:2989-3008 | ext/http/service.rs:427-438 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":2989}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fb78814075e664fdf17e468d178bec338d33f12ada4229e7905dd379e62a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): cli/lsp/ts_server.rs:545-568 | cli/lsp/ts_server.rs:576-600 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/ts_server.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"048b356cb4b70551b51d4b8c808b51e2770f882368a21e4d312fbcd3b72bc9c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): ext/napi/uv.rs:988-1007 | ext/napi/uv.rs:1010-1028 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/uv.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c12c5ef9269e6466b29e62f0feb66286b9913e8f43cc886709f77f06561cf0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/config/deno_json/permissions.rs:104-126 | libs/config/deno_json/permissions.rs:138-165 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/permissions.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"db010692530f1376d466d1205dcccee988ab23b1ce26e66695ba1e023232fd5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/http_h1/conn.rs:432-449 | libs/http_h1/conn.rs:458-476 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b588f1f3fe8b08569f519c1c2a69a8aa174504082c68f7af8d9b50ffdc34b7f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): runtime/web_worker.rs:1079-1088 | runtime/web_worker.rs:1090-1104 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/web_worker.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56c5beec95b37f6d4eebaa6b090247c2546ecf18f5da0ca8b160d3955b16c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/crypto/x25519.rs:55-65 | ext/crypto/x448.rs:50-62 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/x25519.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cec7ca2066eee56aba2711519516d5e2f09e2a371ea8a153d75b12ab686089c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/fs/ops.rs:693-707 | ext/fs/ops.rs:714-734 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"41752fb23faf61a718b069bd466aa544d19123dd3dc570e6cba453964c805330"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:826-839 | cli/tools/lint/ast_buffer/ts_estree.rs:2136-2147 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f98152510fa44197038763f439058a2f9ee4ab0118ad641444a351d3fe9c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:1715-1731 | cli/tools/lint/ast_buffer/ts_estree.rs:2036-2053 | cli/tools/lint/ast_buffer/ts_estree.rs:2179-2194 | cli/tools/lint/ast_buffer/ts_estree.rs:2624-2637 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee74fe6c905f5204738b169e9ac71b001c2ab5f242221b92a61ad3cad4ce18cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): cli/tools/repl/editor.rs:162-187 | cli/tools/repl/session.rs:965-989 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/editor.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"668a71678a6e4c06ede46c0f8431d19f20378811163501a38d9981c0d53df919"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): ext/node_crypto/cipher.rs:398-420 | ext/node_crypto/cipher.rs:422-443 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a45569ac1451098396db2237f47605a63dbb46db540c013fd5b72a4c4ab065"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/node/ops/v8.rs:538-552 | ext/node/ops/v8.rs:584-598 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/v8.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"aceb7eb642839f9b23fe96723bfe21b2d868f72fea6eceb8952a8d8a794af873"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/core/io/buffers.rs:100-115 | libs/core/io/buffers.rs:346-362 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/io/buffers.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9537a509a05c3a0ae3c25db8b5189f15aaafb9c7e37d5b69d85b8e8bb0df40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/serde_v8/de.rs:537-557 | libs/serde_v8/de.rs:649-663 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/serde_v8/de.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b128412c5d54bd160e42f9ac40955e2d002c805a05916df7e7bf0d917778105c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): cli/jsr.rs:149-166 | cli/npm.rs:343-361 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/jsr.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cd29ab0b8e73ceeab40d32931e587919ecdf89a7fe203ea2af070ad01009dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): ext/fs/ops.rs:491-512 | ext/fs/ops.rs:519-545 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcf657f75b13f39868e3dbe3fd206b1750525fe46acfbd77455e3c3159b3349"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 13\u002B corresponding lines): ext/crypto/shared.rs:273-285 | ext/crypto/shared.rs:289-301 | ext/crypto/shared.rs:305-317 | ext/crypto/shared.rs:412-425 | ext/crypto/shared.rs:429-442 | ext/crypto/shared.rs:446-462 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/shared.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"caedb9835475b8d37be60d99a09f748f3961fe8dae6265e5cdc9a56b87de3905"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ext/net/quic.rs:904-920 | ext/net/quic.rs:950-967 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/quic.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba2de323b3e9fd3411bb088a5a659e3b4659d634e473c47af9ebd7b7af99ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): ext/os/lib.rs:286-305 | ext/os/lib.rs:426-439 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/os/lib.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb29453564cb2224b444845b13be0696ee405de4611798a3b2e6b0633075398"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ext/web/geometry.rs:2119-2127 | ext/web/geometry.rs:2250-2259 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8558767e4413117f253b0204bb050412283decd8afe6dfe44eaf49d1a2e00aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/crypto/slhdsa.rs:210-224 | ext/crypto/slhdsa.rs:229-243 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/slhdsa.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd0983f98344209266c53bc500faff372a7cac4ebe59546d002035eb15747a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): ext/node_sqlite/sql_tag_store.rs:371-386 | ext/node_sqlite/sql_tag_store.rs:451-469 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e8c95fcec4fbbe29d607cbbe44445f9badc5327817c053fd40cca3125e105e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): cli/tools/repl/session.rs:635-657 | cli/tools/repl/session.rs:662-682 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/session.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc402e99f8c149921a74fd7f387641a12a52837b3486c4bd57402429c341bfd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/ffi/ir.rs:504-515 | ext/ffi/ir.rs:558-567 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/ffi/ir.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb640d7d443802e574a5aa0b19aa5c83545d87f0470c77a78c33df47c96092d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/dcore/src/inspector_server.rs:525-538 | libs/inspector_server/lib.rs:931-944 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"080c4b49df241c288497ebc0bea94f9bdbd140afa7cee1b6c003fd79b532e7f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/eszip/v1.rs:82-93 | libs/eszip/v1.rs:96-110 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v1.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7f9270fb32485a5776593494448dc2eb23fe6aa568042526842f039fc16d63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/napi/uv.rs:1406-1420 | ext/napi/uv.rs:1603-1617 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/uv.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5829ef8fc5b42491ac748212a584e0dda70431fae283c40b82d3d2ad6e06a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/node/ops/wasi.rs:628-638 | ext/node/ops/wasi.rs:674-689 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec32b0933bef665006e36efd0903a0d85b7cfa68bd531c90655548b9cc400b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): ext/ffi/ir.rs:344-357 | ext/ffi/ir.rs:363-376 | ext/ffi/ir.rs:382-395 | ext/ffi/ir.rs:401-414 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/ffi/ir.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a09beaaec8c8ac8eddd4f7b934abd6907888e964f28feb92631f93068becdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/resolver/bun_lockfile_import.rs:199-207 | libs/resolver/yarn_lockfile_import.rs:170-178 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/bun_lockfile_import.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13e8c7c3aca49640be629476c8d3331f5df91efb2bb6db1eed8b963e4a2f63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): cli/args/mod.rs:988-1001 | cli/args/mod.rs:1022-1034 | cli/args/mod.rs:1061-1073 | cli/args/mod.rs:1085-1097 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/args/mod.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"d105e06c1826d56ae49ebaa3fd7e4a8a81af39ec9e2b2c930b1de8d764c94317"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): ext/cache/lib.rs:427-444 | ext/cache/lscache.rs:325-348 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cache/lib.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c9f4145eceba859d8e584b70bbb09729b4572feab8aa1262706aeba43dd16e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ext/napi/js_native_api.rs:2598-2614 | ext/napi/js_native_api.rs:2676-2698 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2598}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf46ad14f21b2bd28e7312572fb3e42393a4dfe1ec242c7e486c5e6c9844d29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ext/napi/js_native_api.rs:3438-3457 | ext/napi/js_native_api.rs:3641-3657 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":3438}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb04b8f060cac3e9002bcd341077b1bd0def941a7dfabc009c3f44ae06111d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/dcore/src/inspector_server.rs:126-137 | libs/inspector_server/lib.rs:100-110 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3108590d7f329cc4b7b48bdfa056a60acea92df87caad590e5c003ec7d1ae130"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cli/lsp/language_server.rs:4535-4553 | cli/lsp/language_server.rs:4558-4568 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":4535}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa78dc0d6b99c6537019cc9cc76790cadd2ab88de82afc4ecdd4698b66845f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/io/lib.rs:1317-1331 | ext/io/lib.rs:1332-1351 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/lib.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef15633c2ec318ebe7ed483f91cb0de0e3926cf2bec86afc15f30c5a19097a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/napi/uv.rs:792-803 | ext/napi/uv.rs:847-856 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/uv.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd704c732dfd3b5bd80c1a80efdc434d489fe46c7300799f07034d13cbfe477"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): ext/node/ops/http2/session.rs:102-114 | ext/node/ops/http2/session.rs:120-132 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6a1fd67686d0d001a581c487528db9d3eb89ee627601dc3ef17a90e8d783b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): ext/node_sqlite/sql_tag_store.rs:158-181 | ext/node_sqlite/statement.rs:335-358 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"277581355b24dc1ab0458d8043588845bd4c2850ac74027b0769692256625bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): libs/core/uv_compat.rs:481-501 | libs/core/uv_compat.rs:505-525 | libs/core/uv_compat.rs:529-549 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c6d82f9e911faef394604c5fbdb1792b04133337630c0f14c28e33be45997b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/http_h1/conn.rs:771-787 | libs/http_h1/conn.rs:1565-1576 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5faf7bad064282aa949cec15ef3c122d8ecbebde8a369712d8f52e067b9aa45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): cli/tools/pm/deps.rs:277-286 | libs/config/deno_json/mod.rs:1956-1965 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/deps.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda31136ddff5c116260dace6900817a6ec81765cce30207b858fb2ce94adf1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/net/quic.rs:861-873 | ext/net/quic.rs:878-888 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/quic.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70615bc1d76fa14f5da7468479e29bc0ff64a7483fd68cbd11871c8a8911b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/crypto/crypto_key.rs:180-191 | ext/crypto/crypto_key.rs:250-260 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/crypto_key.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6092f7b824387563773a61b0657a990298d53ba1816eeeefd7764ea9826f4ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): ext/napi/js_native_api.rs:3738-3761 | ext/napi/js_native_api.rs:4402-4421 | ext/napi/node_api.rs:632-657 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":3738}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dbe44099da150a208938ad1b2921ab77314f09d5265880a50f8b7906d8b313"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): runtime/permissions/lib.rs:4949-4960 | runtime/permissions/lib.rs:4982-4993 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":4949}}}],"partialFingerprints":{"codehealthFindingId/v1":"729baa041073da7f9b394731e6853812e29ab120e3e61a364cd51321fa5c41b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): cli/rt_desktop/lib.rs:515-528 | cli/rt_desktop/lib.rs:536-555 | cli/rt_desktop/lib.rs:661-679 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt_desktop/lib.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f79beff3c81ee6ae039702652fe8a4702bc5600201a3626f65a180d02cc82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cli/tools/fmt.rs:291-301 | cli/tools/lint/mod.rs:508-518 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/fmt.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cc3a82a4479d3f62ace3127997dc00cc38121ade2da1662c939f0655d4dc9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): cli/tools/pm/mod.rs:132-149 | cli/tools/pm/mod.rs:152-163 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"141fc033c74dffa2724c1a6941691a06af10924bbd21c552eb80296a7c7b4999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): ext/node/ops/wasi.rs:1099-1111 | ext/node/ops/wasi.rs:1114-1126 | ext/node/ops/wasi.rs:1222-1234 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a3aea4243289e45506100eec5d5af5b6f291ac856f446fc63a453585706da5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/webgpu/adapter.rs:481-490 | ext/webgpu/lib.rs:247-256 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/adapter.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d547be84ced108bfbdebdae01d37cd3435d63918711347d463a90733ec137824"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): ext/webgpu/webidl.rs:416-438 | ext/webgpu/webidl.rs:465-487 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/webidl.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac6246a59fcdfdbc12dc09df77f5e25e414d3324de49c031e6ebbc33de9de9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/crypto/subtle_decrypt.rs:260-274 | ext/crypto/subtle_encrypt.rs:315-330 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"785390ce5c791eb358edaa0ffae09f02c901a53eec4f133ec89c018421c2ffe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/fetch/lib.rs:1544-1558 | ext/fetch/lib.rs:1567-1583 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/lib.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa89830a0c1e621e64af68fa0a94a8d683a06ef8c1ed2a41cf339729970ea14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/telemetry/grpc_exporter.rs:269-281 | ext/telemetry/grpc_exporter.rs:306-317 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/grpc_exporter.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c652cddad0a40944a0cf6d0776275b56a17a1cbbf6a634d292e6c8809c2f69cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/config/workspace/mod.rs:1149-1161 | libs/config/workspace/mod.rs:1166-1178 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/mod.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1651292e3ed64d3453feedfdab0bcb5289d40b3d6b87a7db8146bcb8532ddb7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): libs/http_h1/protocol.rs:92-106 | libs/http_h1/protocol.rs:113-136 | libs/http_h1/protocol.rs:143-162 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/protocol.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"99591898f22e802a75905dfcfb333dfed0e2dc8481c245e928d81b39c477c1f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): cli/module_loader.rs:632-644 | cli/rt/run.rs:193-205 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c71558c5c746826d8117382f4e2be60f08ee9c903bc37bc67378ef087acde98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): ext/fs/ops.rs:1764-1780 | ext/fs/ops.rs:1786-1801 | ext/fs/ops.rs:1903-1917 | ext/fs/ops.rs:1927-1944 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4edda4216ae8c188ba2a4bc89d4198b462e4424e646ae653ed1528bc249112e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): ext/napi/uv.rs:1645-1664 | ext/napi/uv.rs:1671-1688 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/uv.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b30c49f1aa28909f2c72bf09a9b0be8977eee6c52a336bfdee1e1a50936d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): libs/core/arena/shared_arena.rs:320-340 | libs/core/arena/shared_arena.rs:353-375 | libs/core/arena/shared_atomic_arena.rs:363-383 | libs/core/arena/shared_atomic_arena.rs:396-419 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/shared_arena.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bcb725f01d78783e2fb10dd793bdfb0994889f7407ba45d77a9a6d13411dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/core/io/buffers.rs:82-96 | libs/core/io/buffers.rs:327-342 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/io/buffers.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f2e839db5b24525cd38ccba712032e7063c644f8fb7740c14e366a8a26df33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/dcore/src/inspector_server.rs:430-444 | libs/inspector_server/lib.rs:804-820 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"552c35b12e8b0f0834cc627a648ff7dea15db318b3e8d909345d6e373efe7361"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/coverage.rs:119-134 | runtime/cpu_profiler/mod.rs:234-263 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/coverage.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45b6e86e8c103106a5b17546c56b5803e350ec5c784331016b771c508ca91bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): cli/lsp/testing/collectors.rs:25-43 | cli/lsp/testing/collectors.rs:52-70 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/testing/collectors.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c06c21ff851e31a107cfb9dfee4f7a613f5169865f746cfbc2d68931d77aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): cli/rt/run.rs:133-153 | cli/rt/run.rs:1030-1056 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/run.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2606bd6ded41aab7d26ac3c5a73aa88da00554810b09c344258860e5291481"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:527-537 | cli/tools/lint/ast_buffer/ts_estree.rs:545-555 | cli/tools/lint/ast_buffer/ts_estree.rs:600-610 | cli/tools/lint/ast_buffer/ts_estree.rs:669-680 | cli/tools/lint/ast_buffer/ts_estree.rs:700-710 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e36067a70c64442e410173a45440e15ba90e1421676df900c86cf06599b033b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ext/crypto/node_interop.rs:280-288 | ext/crypto/subtle_get_public_key.rs:241-250 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0c9b26f54982010a769ed38c9b636531c0b57bf2ab4a833f08b9365f6ce04e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): ext/node/ops/process.rs:316-330 | ext/node/ops/process.rs:362-376 | ext/node/ops/process.rs:394-408 | ext/node/ops/process.rs:426-440 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/process.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1469b86c0706a67b550eb80a28f1fe35c87c9ad004fc7cde46bdf29fc4ec3f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:2203-2212 | cli/tools/lint/ast_buffer/ts_estree.rs:2275-2286 | cli/tools/lint/ast_buffer/ts_estree.rs:2351-2363 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d280e056271d43934a8e90d009cc9846c79b48312831d99054c20587017d748e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/core/runtime/op_driver/mod.rs:73-82 | libs/core/runtime/op_driver/mod.rs:111-121 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/op_driver/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89e50f3a469fbdee212e9d89eb781584673cbf75debfaaf5ee4a3635422c06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): libs/http_h1/conn.rs:1615-1633 | libs/http_h1/write.rs:435-451 | libs/http_h1/write.rs:504-520 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"4869fa095df21e7e954ed2b06e1e680726f7a4b3d2c8c099131be9b72a91ac57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/coverage.rs:151-166 | runtime/cpu_profiler/mod.rs:292-309 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/coverage.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ad7d5133be9131c812da2430273701a67dff999df78693eb3a30c261e3127d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): cli/ops/jupyter.rs:189-202 | cli/ops/jupyter.rs:209-221 | cli/ops/jupyter.rs:227-239 | cli/ops/jupyter.rs:247-265 | cli/ops/jupyter.rs:273-289 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/ops/jupyter.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fccb05e82cfc91500f50dd250cb7d0b9f36243ea255f859fb66cb358e795ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/http/http_next.rs:982-993 | ext/http/http_next.rs:999-1014 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e173f75e2fa829daaa94d26653464b560512869e0e42864a71b6c3c6fb1275"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): ext/http/http_next.rs:1490-1503 | ext/http/service.rs:1177-1189 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a22dac497ad858c4b296e2ed842d5baca7f37f09fa5a073551c0b32a40b194a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): ext/web/geometry.rs:802-809 | ext/web/geometry.rs:912-920 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d44f01a7738aae01975abd77dea14789c612723c4d1dc04af1fb3392820bcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): ext/fs/ops.rs:607-620 | ext/fs/ops.rs:650-663 | ext/fs/ops.rs:740-753 | ext/fs/ops.rs:997-1011 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa32cb6d2d9ce35815afba741602684b93bf960ffc803506ba265d4ac4f45d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/io/pipe.rs:278-288 | ext/io/pipe.rs:292-298 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/pipe.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4c7435935fc991f46022fe1f04276f639eebf1f5dbfdd353b37a278e784c43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/ops/op2/dispatch_fast.rs:355-365 | libs/ops/op2/dispatch_fast.rs:373-383 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/dispatch_fast.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd751c71f9ca78c4ed1155cb89f776f2b4f8680585b540e7b003b53016cfca01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/permissions/lib.rs:5055-5070 | runtime/permissions/lib.rs:5153-5170 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":5055}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0f0f992e8819926f7fb4d6e41de7e74ae7afdb222312d677c0f3ed62ef0c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): cli/factory.rs:1040-1056 | cli/factory.rs:1093-1111 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/factory.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e6691487330e84dfea071952d57c460eb5c3dabe503a1ae0be4869212035fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): cli/lsp/resolver.rs:572-581 | cli/lsp/resolver.rs:583-596 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/resolver.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fe9e765b505ceea85dd63d1f976e8ac518c8f9e8b4fdd826b574adda2d6ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): ext/canvas/byow.rs:119-131 | ext/canvas/byow.rs:143-155 | ext/canvas/canvas.rs:61-74 | ext/canvas/canvas.rs:86-99 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/byow.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"882d9fd318a42c4f55838a3457e0b25f5dcfdf05732246c69df99dbb20926f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): ext/webgpu/command_encoder.rs:436-455 | ext/webgpu/render_bundle.rs:73-91 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/command_encoder.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3390688352b24fcb49780b9be6bbbee92b7ae804c8e370705b1c0884fe7b0a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/cli_parser/src/parse.rs:637-651 | libs/cli_parser/src/parse.rs:692-706 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/parse.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0d7f2eed4bc4590e62ae46af317e1d3d73434cbba5f64e46d2ec72ee48b5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/core/io/resource_table.rs:188-199 | libs/core/io/resource_table.rs:206-217 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/io/resource_table.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dbbc95598f81c3a0325385a09f9735a9b7881472d6b95088dc641b3171e1f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/http_h1/write.rs:153-164 | libs/http_h1/write.rs:198-211 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/write.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fb0261ee9c78b7e7aa8e33f908c8f5f86f016e032297969ff524c0293f5449"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): ext/crypto/node_interop.rs:103-115 | ext/crypto/subtle_key.rs:129-141 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"134202893cac05e662a9deebdc47072f02868d7bc1b260db11c034ee5d03fe7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ext/kv/lib.rs:796-806 | ext/kv/lib.rs:808-816 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/kv/lib.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"074a171a232ac3697b9f495d6efa9c9a13671e3f024c92eca5ceb4dfefc3f985"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ext/node/ops/fs.rs:65-81 | ext/process/lib.rs:102-118 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17db21d6b6d6e4a3367bd8aefdab3357affe90e78639f1cfea5cbdbe9cc48d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): ext/web/message_port.rs:402-412 | runtime/ops/web_worker.rs:56-63 | runtime/ops/worker_host.rs:659-668 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/message_port.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9d5249c3e41bf6a489897ba9c52592dded9bd8a4b429f128475d487276edbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): libs/core/uv_compat.rs:1218-1233 | libs/core/uv_compat.rs:1276-1291 | libs/core/uv_compat.rs:1334-1349 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a941f63e4ba9c0bdf84772ed2ce32bebd71134544c161d3abfcd54674656563a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:1075-1083 | cli/tools/lint/ast_buffer/ts_estree.rs:1457-1465 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70b0c85a23d636ae2804a10e76f283f06ee706fe8a91d6bc42de36ec2a397bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): ext/crypto/mldsa.rs:336-349 | ext/crypto/slhdsa.rs:248-263 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/mldsa.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a1be41fa9feb435fb4fdee573072a190d434fe58b3604e7b226dabbb77e8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/fs/std_fs.rs:447-456 | ext/fs/std_fs.rs:463-477 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/std_fs.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7ae7dfa5fa03fe6f23254bdf9e99629891fcb7f758fd9b5b1c43cd4049f19f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): ext/web/console/inspect.rs:3264-3271 | ext/web/console/inspect.rs:3279-3286 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":3264}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a1b74c35e1c9493743142b2f72d2080624b34f7dac9c9ef2d16fce56969cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/core/convert.rs:568-579 | libs/serde_v8/magic/external_pointer.rs:36-44 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/convert.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df3d0c32e6d52f4c4aed30b21cf1405e09cab24e684031c8877000d8ca5338"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/core/modules/mod.rs:804-815 | libs/core/modules/mod.rs:832-844 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/mod.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"061814330de40014e5f5673c5a628576665efee52f09a843746bee905ece098a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): libs/lockfile/lib.rs:1119-1133 | libs/lockfile/lib.rs:1188-1202 | libs/lockfile/lib.rs:1251-1269 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/lockfile/lib.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71aa566d91b23a1c3e8e69fc1ecf0f9cae6aaa6f6cfa2e496d321dd14b8ffae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): cli/lsp/analysis.rs:173-186 | cli/lsp/analysis.rs:1219-1232 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/analysis.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff86eabdaa85017af5bf4babb05998153ed9e99d455058ca6cda55a419d31a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): ext/crypto/ed25519.rs:89-102 | ext/crypto/x25519.rs:85-98 | ext/crypto/x448.rs:92-105 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/ed25519.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b8fcbb9b6d27e2eb2341ce458c00a3b77e24ddc095b9d8b753e353aba2e088"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): ext/napi/function.rs:75-88 | ext/napi/function.rs:96-108 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/function.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cf0f92d003af0a69e40da059bcf4dcf0adf994f9a03d28e22e2030d4c0264d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 19\u002B corresponding lines): ext/napi/js_native_api.rs:540-559 | ext/napi/js_native_api.rs:567-586 | ext/napi/js_native_api.rs:594-614 | ext/napi/js_native_api.rs:769-787 | ext/napi/js_native_api.rs:795-813 | ext/napi/js_native_api.rs:821-839 | ext/napi/js_native_api.rs:1051-1069 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4e822d899b98b331f43480b84f8ec29d1548fe989c5aa0cca14e94cd8ee52c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): ext/net/ops_tls.rs:160-168 | ext/net/ops_tls.rs:173-187 | ext/net/ops_tls.rs:189-198 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops_tls.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0c0b17961b68a4a81b91761b313dfd06968eab94a533d77d9ec65f3478518c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ext/webgpu/render_bundle.rs:97-114 | ext/webgpu/render_bundle.rs:131-147 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/render_bundle.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6307662ca26f3619ce55ddd737ae808b3c52a35b8c6dbd417585422fd41a88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:1847-1857 | cli/tools/lint/ast_buffer/ts_estree.rs:1919-1927 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c8ac7be76ee63959fd5d2c8f8291af39229ee195dbbae03b7f61a19e1b830f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): cli/tools/pm/list.rs:33-42 | cli/tools/pm/why.rs:26-37 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/list.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"62eb3248971a5e8f7fb87989080cd16f8fbfc45fa66caa6467394e712aee2aa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): ext/net/ops.rs:492-507 | ext/net/ops.rs:514-525 | ext/net/ops.rs:532-542 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bd00e68d7401281c7e1753c462cbddd8e098c862b986d8c24b1daa581674e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): ext/node/ops/stream_wrap.rs:338-351 | ext/node/ops/stream_wrap.rs:391-407 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ad889c5e9befefae3f5e4431d4aeba743128cfc00cca1b7eba95951b2c7e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/serde_v8/de.rs:595-613 | libs/serde_v8/de.rs:618-628 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/serde_v8/de.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b7a4578deffe73cb3adb460596fe9028587b76e38d225805a4a3b77545cf83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): runtime/permissions/lib.rs:5001-5022 | runtime/permissions/lib.rs:5028-5049 | runtime/permissions/lib.rs:5086-5100 | runtime/permissions/lib.rs:5106-5120 | runtime/permissions/lib.rs:5126-5147 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":5001}}}],"partialFingerprints":{"codehealthFindingId/v1":"d598a2e0734563f26d8f8241bcd37410ae5e80b682ec936746a28aadd01ac15d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): runtime/permissions/lib.rs:5178-5194 | runtime/permissions/lib.rs:5200-5216 | runtime/permissions/lib.rs:5273-5289 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":5178}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dc0d2fbc91364744862297b58f7ceb2cb4682c10d91790c8985c4e51339149"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): runtime/permissions/lib.rs:5315-5331 | runtime/permissions/lib.rs:5337-5353 | runtime/permissions/lib.rs:5410-5426 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":5315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5bcab8a8d1417214c7551b09f9cf0c457b01eb6835058925d9bf58f4358dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): cli/lsp/language_server.rs:3884-3898 | cli/lsp/language_server.rs:3917-3937 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":3884}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bf733c546ddbda5d77662877b9fff76053cff9b77b7253fab3003a53442c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cli/lsp/ts_server.rs:287-297 | cli/lsp/ts_server.rs:305-322 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/ts_server.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"119ff08ad280a42824af424a59366f8218c0ca0d53abef61d399ae0fc02a4276"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:1406-1417 | cli/tools/lint/ast_buffer/ts_estree.rs:2824-2834 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba40c8bca8848c61ed2f8c726e8e36693de3b8ebfb80714379a4f8d776d518b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): cli/worker.rs:456-471 | runtime/web_worker.rs:885-902 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/worker.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bdf80f9f7a25995c98872c176f83512e02b89be44615d9fce4fa1c03f25c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/cron/socket.rs:438-447 | ext/cron/socket.rs:451-460 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cron/socket.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"22374fbabb9eb466c5c4feff2227aefbeef5a1ddcd96e92dab87532a23958a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/http/http_next.rs:3290-3304 | ext/http/http_next.rs:3312-3326 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":3290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b432c398edfb25a1ceb676798069c70a1d78327df1e4d5eb4a4ad2af8f72941b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): ext/http/http_next.rs:5080-5097 | ext/http/lib.rs:727-742 | ext/http/lib.rs:748-761 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":5080}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ac7ddc3aec380301508c6067243cb4f0fb14c9e5b807422c84b6ab39625f30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/process/ipc.rs:155-164 | ext/process/ipc.rs:450-459 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/ipc.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5637bc31bb80c88a50ab35ef74a295d6e262f4ae14b2f902b156f51ce603fb47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): ext/telemetry/lib.rs:613-624 | ext/telemetry/lib.rs:632-643 | ext/telemetry/lib.rs:648-659 | ext/telemetry/lib.rs:664-675 | ext/telemetry/lib.rs:694-705 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba92fee4981e014390b2d6073524b3a53d3831e6ebe4d05c0af7a423a69c618f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/config/deno_json/mod.rs:2266-2285 | libs/config/deno_json/mod.rs:2289-2303 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/mod.rs"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1e94e572d4a5b7abda7762501366e40fe063aae14c8a4535fae41fbe66290d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/core/modules/map/dynamic.rs:359-371 | libs/core/modules/map/dynamic.rs:378-392 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map/dynamic.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f666355ae1d8b950022cd446c84fcb5037992fd6cd9c7d4bb973bacd9b2f43c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): cli/rt_desktop/lib.rs:242-259 | cli/rt_desktop/lib.rs:271-287 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt_desktop/lib.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"989af2ccc3ba9c3f469506ac79d0a9554e80dcb66b2f2841b9cdd7dbde3d852e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:1373-1383 | cli/tools/lint/ast_buffer/ts_estree.rs:1537-1549 | cli/tools/lint/ast_buffer/ts_estree.rs:1866-1877 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18efb547249f24aa70ce59c05b42736d6e14159322eb28592ac569cc8b6e3b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): ext/node/ops/stream_wrap.rs:864-877 | ext/node/ops/stream_wrap.rs:909-922 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"487af047e7295c3e852db554734b5c9b239e26297af20afdfb2a1ea24268b763"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/cache_dir/global/mod.rs:175-190 | libs/cache_dir/global/mod.rs:195-211 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cache_dir/global/mod.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e4a1eb9d29d0b748fc5ff7e10bc3eaa67629f790225c76c36aa32f157c0b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/core/modules/import_graph.rs:113-125 | libs/core/modules/import_graph.rs:145-157 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/import_graph.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"750d852b838d2c38504103b57ce87ac2a9ea4efcb41fe59173d8c9c1965349be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/core/uv_compat/tty.rs:777-786 | libs/core/uv_compat/tty.rs:792-801 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"767e4e53de65c829571e25c08aa3861a2a914baf13b4713636d1e39b3fbb4bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:2155-2169 | cli/tools/lint/ast_buffer/ts_estree.rs:2381-2391 | cli/tools/lint/ast_buffer/ts_estree.rs:2848-2858 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"262508187a2b5daf8bb281400a3f87b503c65a795f2a5ad5a97fe9c94f96c6b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/napi/js_native_api.rs:2977-2991 | ext/napi/js_native_api.rs:3027-3041 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8e35c28b911be29f7ce12d5c450888c0d21ab3de2302d7e33a1e4eb99d5750"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): ext/node/ops/llhttp/binding.rs:349-356 | ext/node/ops/llhttp/binding.rs:362-369 | ext/node/ops/llhttp/binding.rs:375-385 | ext/node/ops/llhttp/binding.rs:391-399 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b535ac22c0f8c0f4ff28f0d51aa3ccebe15ef27cf08e2ec6419f80208ac3456a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/web/lib.rs:430-436 | ext/web/lib.rs:624-630 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/lib.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0421f553fe1169c9d57b62459452ace762e2da6c1084a4d583d53e92684d7852"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/cache_dir/file_fetcher/mod.rs:460-469 | libs/cache_dir/file_fetcher/mod.rs:473-482 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cache_dir/file_fetcher/mod.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"653945586ffd3c38c6e4d778ad7ccff724d415170aa261cda6f3d6b49e873370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): libs/core/arena/shared_arena.rs:423-443 | libs/core/arena/shared_atomic_arena.rs:471-490 | libs/core/arena/unique_arena.rs:322-341 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/shared_arena.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a8ca2a6b5ce29d06008c55377d94123101c415b751a23c3dee3a49b6e0bae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): cli/tools/fmt.rs:430-440 | cli/tools/fmt.rs:1604-1613 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/fmt.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"852b287ac85ea83fa7fe13a15fde828724cb5f5ee5952af7a0015be1bc953d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): cli/tools/pm/mod.rs:849-861 | libs/npm/resolution/common.rs:657-671 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/mod.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"810bca8db4412c586a270da3f8ac40865b4e5e29f1ffd06586353e3e37e86a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): ext/node/ops/fs.rs:550-560 | ext/node/ops/fs.rs:599-608 | ext/node/ops/fs.rs:635-644 | ext/node/ops/fs.rs:748-757 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dae3d8878591bcafdf42b6f2b99aa772a6860eed1bcd7e6c44a45cf7643c134"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/node/ops/tls_wrap.rs:3428-3437 | ext/node/ops/tls_wrap.rs:3444-3456 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dbf8375ac27f03143468531aa6e62970ba49248c7fe35da3f9676f912f1976"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/core/modules/mod.rs:397-406 | libs/core/modules/mod.rs:740-748 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a49773f7366426805688d9caf15db1779e2083fe3e920b3d5b0c8ebee62be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/npm_installer/hoisted.rs:1029-1035 | libs/npm_installer/local.rs:1252-1258 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc13cb13a5296b8d35fa38e6c686892ecc47097bdcc759a0a01c3d708afabc31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/ops/conversion/from_v8/mod.rs:39-55 | libs/ops/conversion/to_v8/mod.rs:85-101 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/mod.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b67262334060b1f1db4f73c1704a0898fc7edff96b07d96f4c6a723be94ead8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cli/tools/bump_version.rs:84-94 | cli/tools/pm/mod.rs:356-366 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bump_version.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62ed36bbb5ed7abd105b3d434652a49c5ac83068dcbd8c45b3e0863a78153ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:734-742 | cli/tools/lint/ast_buffer/ts_estree.rs:1154-1163 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce0d54f0c470f8c2b261816cb37d63eaf7f2b5f990075891a94c3b4cf28138d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 9\u002B corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:1171-1179 | cli/tools/lint/ast_buffer/ts_estree.rs:1188-1197 | cli/tools/lint/ast_buffer/ts_estree.rs:1261-1269 | cli/tools/lint/ast_buffer/ts_estree.rs:1277-1285 | cli/tools/lint/ast_buffer/ts_estree.rs:1441-1449 | cli/tools/lint/ast_buffer/ts_estree.rs:1623-1633 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1444b6950f8c36b35322029f5f9572cfa4056686014f8350b63113af468ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:1642-1655 | cli/tools/lint/ast_buffer/ts_estree.rs:1664-1677 | cli/tools/lint/ast_buffer/ts_estree.rs:1685-1697 | cli/tools/lint/ast_buffer/ts_estree.rs:2490-2501 | cli/tools/lint/ast_buffer/ts_estree.rs:2737-2747 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e562095f7f299546a20fee78b245d9d81775f0327d04c20b0e18543262fa6c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ext/crypto/mldsa.rs:104-114 | ext/crypto/mldsa.rs:323-331 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/mldsa.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee12d1098569e8954e6b489faabb54c251048da8a1dcecee1a327040653521e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/ffi/ir.rs:440-449 | ext/ffi/ir.rs:573-582 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/ffi/ir.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c4677453cfd0c857b2549966c9b2c1a8f8960e6f85e1b1080465f75f9f4525"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): ext/napi/js_native_api.rs:3390-3405 | ext/napi/js_native_api.rs:3412-3431 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":3390}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c8fcc62dd626d3a447c754609630755e531a97d7790c30cab5b59baead1bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/eszip/v1.rs:127-138 | libs/eszip/v2.rs:1730-1741 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v1.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcede30b977967b003b2055a3fdc57af36d6f39410446cf18ca48cba93ff5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/http_h1/parse.rs:446-454 | libs/http_h1/protocol.rs:411-419 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/parse.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cf5011378527af6b5cd2e541e8f29326446b434b6f36729f0d7cf576ae77a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/http_h1/write.rs:412-424 | libs/http_h1/write.rs:490-502 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/write.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4ed385eb92a959a6d90aa4d5800e429d9db367ae62c95cad4af08dc338c86f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/serde_v8/ser.rs:215-225 | libs/serde_v8/ser.rs:370-381 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/serde_v8/ser.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4dfdf9fb0eeebabd4d4df9a97913a437ea05598a731436ff5c86e84d3563da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): cli/lib/worker.rs:950-967 | cli/lib/worker.rs:969-982 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lib/worker.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd94a66656a9348d88f206b88634e64a2423b21e63297a9535ce8389840b5c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/image/image_ops.rs:77-88 | ext/image/image_ops.rs:226-237 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/image/image_ops.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96535a5dbad2c6fa35eaec9ef1aec591528833902f1ed42ffa2026d9e708577"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/core/inspector.rs:1010-1021 | libs/core/inspector.rs:1027-1037 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/inspector.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9228a5110575151be3dfe4f1d5ed535ef7da3054462ac443070921f135e335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/npm_cache/lib.rs:396-409 | libs/resolver/npm/managed/global.rs:79-92 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_cache/lib.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8274dea5e36487cbb3ca4d11b8319da4cdc91da56246d064d9556ea9198fdab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/resolver/deno_json.rs:816-835 | libs/resolver/deno_json.rs:837-853 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/deno_json.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"695b733cb61b86bdce3d06fc674159d2fc6fd55cf5b80d8139f11c05be8cf2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): runtime/subprocess_windows/src/process.rs:437-452 | runtime/subprocess_windows/src/process.rs:454-465 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"de835535b248f7fe60da8655593f74e0e5fe929b08e2f2fddfae4c177beeacec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): cli/http_util.rs:341-352 | cli/http_util.rs:363-374 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/http_util.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"78647b18a0f77e6e5fca19fd169449bb518ea55cbe2da49818e4657867e44c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): cli/lsp/documents.rs:902-914 | cli/lsp/documents.rs:919-932 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/documents.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"156b1054c28cc39463c1d3652a36042633d6ace69acc58aa1f6a4b8ca0aa0acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 7\u002B corresponding lines): ext/http/http_next.rs:1020-1029 | ext/http/http_next.rs:1035-1045 | ext/http/http_next.rs:1051-1061 | ext/http/http_next.rs:1067-1077 | ext/http/http_next.rs:1083-1089 | ext/http/http_next.rs:1094-1100 | ext/http/http_next.rs:1106-1115 | ext/http/http_next.rs:1120-1126 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e5dbb71afeb30da6fc13dc28e0ebe95e5f9909436101f1b3b788ccae4065a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): ext/napi/js_native_api.rs:744-761 | ext/napi/js_native_api.rs:952-967 | ext/napi/js_native_api.rs:970-985 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa13e3d9eb71dbdbfa07acbe5892a0e52c9ac79e46f6961f1ccbb316c2cc8b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): ext/node/ops/zlib/stream.rs:52-65 | ext/node/ops/zlib/stream.rs:67-80 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/zlib/stream.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc98a5377c865f3afd0ad7bd9dd40a4bb3b9d8afe66d43839a0ca19dee29b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/node_crypto/lib.rs:678-688 | ext/node_crypto/lib.rs:767-777 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/lib.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ed087e5ebf56027f80e490869e834892d1f67dbe817ad16bfa31da6d98f118"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/web/stream_resource.rs:480-490 | ext/web/stream_resource.rs:498-508 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/stream_resource.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd85cc95ee7c06c9585cd28a262d3d4c7587212f33f94108c521a9ecbee40eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/core/modules/mod.rs:817-828 | libs/core/modules/mod.rs:846-856 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/mod.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a499c88f070f56ebe1296e9c7ddb0ddf4ad684dc3a11b14140a4bce6d81065"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/npm/resolution/graph.rs:218-231 | libs/npm/resolution/graph.rs:250-261 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/graph.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"807ea48aae95ea34b09a400bd16d1494b6bba58c949566b19796461dab838e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 15\u002B corresponding lines): cli/lsp/tsc.rs:722-740 | cli/lsp/tsc.rs:1204-1218 | cli/lsp/tsc.rs:1376-1393 | cli/lsp/tsc.rs:1402-1423 | cli/lsp/tsc.rs:1434-1452 | cli/lsp/tsc.rs:1496-1517 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd1cb39b1e48a6a3967cda6e8d887f289007cf217cd3f0efaea5ded387aca7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): cli/lsp/tsc.rs:2631-2642 | cli/lsp/tsc.rs:2652-2663 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":2631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8aaa26f8260ff358390266dabddf0fd498ab947e23cab518ad18c065826c45a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/http/http_next.rs:1244-1253 | ext/http/http_next.rs:1458-1471 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"646077b669d8a6116e3c0aad776ce994a92f18671a90867fef74f0f5b28a5638"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ext/io/lib.rs:1381-1389 | ext/io/lib.rs:1396-1406 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/lib.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8d265dc125e64d0f4821e51a0e8d20376a7c8734deb6273dc0dc60207a685a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/node/ops/ipc.rs:891-901 | ext/node/ops/ipc.rs:908-918 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/ipc.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d5c344a5fa14c79a5fb3ff00a139528d15cd874bdf82f829d54425f4df57e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/node/ops/process.rs:153-165 | ext/node/ops/process.rs:168-179 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/process.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"56371066b33c70b2e1fb340fda3cdc0894ad1d98516dbec350240a0376e87d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/node/ops/require.rs:41-51 | ext/node/ops/worker_threads.rs:34-44 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/require.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ffd2b717b1e556419c0f8bb0af3804a2003d0cc1549fdcb26630acc0bd926c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/web/geometry.rs:552-561 | ext/web/geometry.rs:652-662 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ba51443b8a970f5b42b3996f1acc5e8f03358180294db63f4c67f17ac9436b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/node/ops/handle_wrap.rs:424-434 | ext/node/ops/handle_wrap.rs:436-448 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/handle_wrap.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad232917164d7703a208b65b7abbf439ea1b43022831739d070abddfb08c198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): ext/node/ops/http2/stream.rs:124-136 | ext/node/ops/tls_wrap.rs:2749-2761 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/stream.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3147e84cdd6689dbdd4daa695f1f41d517bac9987e3763e3c084ed49c61f7f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/telemetry/lib.rs:709-720 | ext/telemetry/lib.rs:736-747 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd50b372054b5dd00975554176c2eca4b7a7904aa997d3a976be11dbe71d843"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/web/geometry.rs:1542-1548 | ext/web/geometry.rs:1561-1570 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39af5c3bd268f9a43eb6299b50b2cb2e83cedeb9c81bb687ee78672ae8456ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): ext/web/geometry.rs:2163-2170 | ext/web/geometry.rs:2233-2240 | ext/web/geometry.rs:2266-2272 | ext/web/geometry.rs:2279-2285 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86bd00a79380167897a9aba999e97c9380437ce40a862d88a1d3f27b5c34803"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/core_testing/checkin/runner/ops.rs:261-270 | libs/core_testing/checkin/runner/ops.rs:369-380 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runner/ops.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4b65287a6c0965173b2c3194a7167d022108155ae6722eb07032c3352650ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/npm_installer/local.rs:2046-2057 | libs/resolver/npm/mod.rs:705-716 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/local.rs"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a58778022c2aa0a4662b0deefdfe44950ba6d0ceac16b41c535886e5751c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): cli/lsp/cache.rs:124-136 | cli/lsp/cache.rs:141-150 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/cache.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e414710a400985ce4843dfa3fcb22546a9841ef635894f0dc1bafbe70a9bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): cli/tools/upgrade.rs:1582-1594 | cli/tools/upgrade.rs:1600-1612 | cli/tools/upgrade.rs:1615-1627 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/upgrade.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6e8842b6010655b66e4eeca8def9fb5ea48a7130e229ae14882a3089c14b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): cli/util/text_encoding.rs:185-197 | cli/util/text_encoding.rs:264-278 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/text_encoding.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a95d06cc7a8fab9befc1df74677254ff668b58009145ed1dd366f7ed1df295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/crypto/subtle_generate_key.rs:664-676 | ext/crypto/subtle_generate_key.rs:686-695 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe666c493a1ee09d2d5eaf7616f2f7e2a47653a76a322b918844d44098c7691c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/napi/js_native_api.rs:1224-1234 | ext/napi/js_native_api.rs:1241-1251 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f7e5f9362f40a7ad27fad5d9d463cbacac35a35538dbf1acf8202f9f144743"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ext/node_crypto/cipher.rs:989-1003 | ext/node_crypto/cipher.rs:1475-1489 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92a10cb2d268553c4e110377f469df92ae3dae3dc3feebe56b91cb2fd295445"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/core/modules/map.rs:1457-1467 | libs/core/modules/map.rs:1476-1491 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aa1f1dbd59237595f47e15a9b4f85fc17b2e01210f98b903d04f2df874aae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): runtime/web_worker.rs:980-996 | runtime/worker.rs:937-955 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/web_worker.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"e553950c80593ac45829687248ce633d6aef2a053785a555cc834d55e0c26ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): cli/util/env.rs:47-57 | cli/util/env.rs:383-394 | cli/util/env.rs:399-409 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/env.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"239847409fa9ff47176f927d043ce7a379c72dd0d35a6b35e54f6e23074fd02d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ext/node/ops/llhttp/binding.rs:1109-1117 | ext/node/ops/llhttp/binding.rs:1123-1131 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea836330ac39c587685e225f3a9f70e8fde9506c9b8e66d35c16ac090a050660"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): ext/node/ops/os/mod.rs:225-238 | ext/node/ops/os/mod.rs:241-254 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/os/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7c53c24fd3bd45b8e1916fb95913fbe7d5aeb7c4a4e1b62a6059987e8f8392"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ext/webstorage/lib.rs:161-172 | ext/webstorage/lib.rs:206-214 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webstorage/lib.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"882888ea6c782529af96cf82d4a873d9a4ca81d1570e916afcdd78734d011861"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/cache_dir/local.rs:71-94 | libs/cache_dir/local.rs:243-257 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cache_dir/local.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ae1c1db70b7193d30dfc0490ea02a3534896ede36dcae0cac75acdda198c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/npm_installer/local.rs:1595-1609 | libs/npm_installer/local.rs:1618-1632 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/local.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f7af193c2762a8b123d4b516ae0ab9d69424b25ab74f41d70be58ebd7ee026"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/serde_v8/magic/v8slice.rs:271-279 | libs/serde_v8/magic/v8slice.rs:288-296 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/serde_v8/magic/v8slice.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1521148208c56f87dc2d8c85f952c0360b60e70002eb4d68b665d94915016c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cli/lsp/tsc.rs:3573-3584 | cli/lsp/tsc.rs:3607-3617 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":3573}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e518a86b47e837bf230499d618a6a99db215085dfe38d7041ed5630da1b446b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): cli/tools/desktop.rs:3911-3922 | cli/tools/desktop.rs:3926-3937 | cli/tools/desktop.rs:4398-4409 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":3911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9d2320e306279557f9a7a65ca740f91703baab9f2f707a49ca2603ce867710"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ext/crypto/subtle_export_key.rs:147-155 | ext/crypto/subtle_encapsulate.rs:107-115 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06fee0ee1dda205e02a09870fef5928ec084928d3f717f221cc186fcf933934"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): ext/tls/lib.rs:404-408 | ext/tls/lib.rs:413-418 | ext/tls/lib.rs:423-428 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/tls/lib.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bdb4ce1950e409edfe6b74be92bab559a2786f21e0d838e2f8f180d7db44a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): ext/webgpu/render_bundle.rs:305-319 | ext/webgpu/render_bundle.rs:329-343 | ext/webgpu/render_bundle.rs:354-369 | ext/webgpu/render_bundle.rs:377-389 | ext/webgpu/render_bundle.rs:397-409 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/render_bundle.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"850b6c5783c4d5d925a2c63010524a48626466f3721e5153e0e3973ad754bf59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): ext/websocket/lib.rs:858-871 | ext/websocket/lib.rs:879-891 | ext/websocket/lib.rs:913-925 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/lib.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97f3cdb39dd87093fcd522a9fa0e88d539a6fca3c46fbe272c4e41c3f38a04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/core/arena/mod.rs:32-40 | libs/core/arena/mod.rs:43-51 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6309753c8e6715a81311f41c5628772db62dc43c74170b3e766ebe8a9b911c66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/npm/registry.rs:489-501 | libs/npm/registry.rs:518-529 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/registry.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afbb5d72347d53440aa1a1cde13e2e031ca98c5851c2d77bd3c11099674ea3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/serde_v8/ser.rs:437-446 | libs/serde_v8/ser.rs:448-457 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/serde_v8/ser.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a393ffc7b4ae74e27a2c3991db505828963ad6438cde0beca0a828b31645e4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): cli/lsp/jsr.rs:375-390 | cli/lsp/npm.rs:36-53 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/jsr.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dc4a3fe7de4228c7fa97e9e3007ff8b00a7a4fdb1e34cfafa808e0813a5d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): cli/lsp/lint.rs:206-215 | cli/lsp/resolver.rs:1630-1635 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/lint.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"316e9ba656dbd14352f696f7c73651c9f6013135727087d4a587102f08839804"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ext/telemetry/lib.rs:2384-2400 | ext/telemetry/lib.rs:2409-2425 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":2384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c865251fa4ed5d12451eb5c5e23e7b31cf5ae527d6c3129dac0ca7e4003e4064"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/config/workspace/mod.rs:193-202 | libs/npm/resolution/common.rs:394-405 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5ab2e91e621bb0426e36c8521eda9221ef21bf412e0a8ec72c0e4f3f5737cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): ext/node/ops/udp.rs:156-168 | ext/node/ops/udp.rs:302-309 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/udp.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"910e87b30eb40cedc99a8c8e241d165dba9b0b000b2ae3bb47b64cf587751b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/core/fast_string.rs:269-284 | libs/core/modules/mod.rs:190-198 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/fast_string.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5ab07f4f31f449f4e98cb9e9358e6a8c64b325c95c5234445065b90512303e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/resolver/factory.rs:895-904 | libs/resolver/factory.rs:1066-1077 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/factory.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"19aa87b05d3cf3db414bc744423a8f026676dcd55d4b95ae25e5f834fa285c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/napi/js_native_api.rs:2043-2053 | ext/napi/js_native_api.rs:2452-2463 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e571ab0a67796c091f4ba6ac6bbbe526824f1e2d573d6614c344da9593eb3ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/core/async_cell.rs:694-704 | libs/core/async_cell.rs:714-724 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/async_cell.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"5806461b6265f6cb9244dfb21c9a4bad0be56d0a11545c9fac650b01c938aff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): runtime/permissions/lib.rs:4757-4767 | runtime/permissions/lib.rs:4904-4914 | runtime/permissions/lib.rs:4933-4943 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":4757}}}],"partialFingerprints":{"codehealthFindingId/v1":"0627d9344d144f88585b1985367d4af3c3a75d2307035b35b479c5cb55b6bf71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): cli/tools/lint/ast_buffer/ts_estree.rs:1521-1529 | cli/tools/lint/ast_buffer/ts_estree.rs:1747-1755 | cli/tools/lint/ast_buffer/ts_estree.rs:1786-1794 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"4833ae6db7f30ca106955a660d930b65add47470b75a5a75db28501192968762"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ext/net/quic.rs:501-511 | ext/net/quic.rs:714-725 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/quic.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7768c2a78cd712fefd5aae38b0af34ea36de1a2d42935be2c19bb329182c5a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/inspector_server/lib.rs:370-385 | libs/dcore/src/inspector_server.rs:95-107 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/inspector_server/lib.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa5c147771494289cc6d750d99e73e694a0205603de3d5154bf85df69e908a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): ext/telemetry/console_exporter.rs:40-48 | ext/telemetry/console_exporter.rs:176-183 | ext/telemetry/console_exporter.rs:288-297 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/console_exporter.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0670b91e93b9b3102b51a525b02815b1ab165997c91969f63e72c24accb52de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/eszip/v2.rs:1042-1052 | libs/eszip/v2.rs:1061-1072 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v2.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe75f9c61eac76a305f8498ad590a3f741eea0fec7160193e7cd355f890e49b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): cli/http_util.rs:265-273 | cli/http_util.rs:279-287 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/http_util.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cbdc11b39e405984b03dc9e8501044d0fe7825e33584eb705f30f10ed58e8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/napi/lib.rs:718-727 | ext/napi/lib.rs:733-744 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/lib.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea7806f0ac673723c1cd13abbbfe46e30be7921bef97d174f08619fb211a510"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): ext/node/ops/tls.rs:684-691 | ext/io/bi_pipe.rs:94-99 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c93b43fb4b0c6b5cca4c67a7d73cab122359aeb7eadd9992251fcf90a2e5c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): libs/cli_parser/src/convert.rs:2900-2909 | libs/cli_parser/src/convert.rs:2911-2919 | libs/cli_parser/src/convert.rs:2921-2930 | libs/cli_parser/src/convert.rs:2932-2940 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3f6088a548ce10344f62a7869b2863d338932fc79264517baad33234fe28a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/npm/registry.rs:1477-1484 | libs/npm/registry.rs:1510-1519 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/registry.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35b5547b0179dada1ba467c00ea9ee67cda761c136895ce8c14b15db016b379"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/npm_installer/hoisted.rs:331-347 | libs/npm_installer/local.rs:180-197 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6e1cd575077227d539b489386f6442a6d23b78c7224196c9df844385bdb82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): cli/cache/code_cache.rs:39-54 | cli/cache/fast_check.rs:37-52 | cli/cache/node.rs:41-56 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/cache/code_cache.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"26557f436924fd9fbcf7f5e65e82862e67d7a0d70d6e11a2879e1032987c71fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/http_h1/conn.rs:1578-1589 | libs/http_h1/protocol.rs:283-294 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf099ffe19f4b757454f09bd9a802908fcda0df436560653e8ddd2bcc7ad661"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): runtime/subprocess_windows/src/env.rs:225-234 | runtime/subprocess_windows/src/process.rs:1599-1608 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/subprocess_windows/src/env.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"87293c671309e88b4dc63dbc1ae62d4ce1d19b1d48ec46002de8e011f4b66a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): cli/lsp/tsc.rs:5434-5434 | ext/http/http_next.rs:260-260 | ext/web/stream_resource.rs:522-522 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":5434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9e4d169e16c896d395d0e3f0f9378d223f8139511a9a93307784af82350d4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): cli/util/v8.rs:8-13 | libs/dcore/src/main.rs:256-261 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/v8.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e77e073064552da95db427b484c91bfae95fb86b95e8507ef0d37fafe0fe7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): ext/crypto/make_key.rs:417-421 | ext/crypto/subtle_export_key.rs:226-230 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/make_key.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c050c9b0219b997fc7639a21f74f9a7dc604fd0567ecc31a890d25eabf4ffc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): cli/lsp/compiler_options.rs:216-233 | cli/lsp/documents.rs:2112-2127 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/compiler_options.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8686f8c12aa74e3158f4202634d81cf0a5142bc607849e42a74bff1acc10a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cli/module_loader.rs:1869-1883 | cli/rt/run.rs:1063-1073 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"0567ec97ebbcf98715f7962efc8707cab7d5b0f9aeddfd569bdc3e63f31b01bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/http/http_next.rs:1341-1348 | ext/http/service.rs:1159-1165 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ef5567863546115a67a9e9c34cc224916c9026988fa7c0cbdbdf08c9eebf3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): ext/node/lib.rs:944-949 | libs/core/runtime/host_defined_options.rs:34-39 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/lib.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"66725baddf1ccd0fc6a9b37ca70e69bd2e615281c1b29de538783a4cdf66e213"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/resolver/npm/managed/global.rs:56-67 | libs/npm_cache/lib.rs:360-368 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/npm/managed/global.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"728f827614f33dcd328ce677b181984e220e92ec5fd8e8fbb4d3bded056322eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/http/http_next.rs:1482-1488 | ext/http/service.rs:1167-1173 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc2a9aaf67fe362e42adb3b76f4ba29831741a6b00b2103c23c41c8b0356fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): libs/core/arena/shared_arena.rs:244-256 | libs/core/arena/shared_atomic_arena.rs:260-275 | libs/core/arena/unique_arena.rs:180-192 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/shared_arena.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dfadab9e209a40831f3bd8839c2e7b0ef70666dfecd4476289738add272d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/core/arena/shared_arena.rs:402-410 | libs/core/arena/unique_arena.rs:302-309 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/shared_arena.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8a65fff0552352c10dedd3d432bf879e3e306206ec0f3cdc78161c3a74b085"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): cli/lib/util/v8.rs:8-14 | libs/dcore/src/main.rs:266-271 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lib/util/v8.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63da04f27ef4db3e94e07a3121ac7908ab9ebcc48d0b7dd303e6bd7264ab1db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/http/response_body.rs:477-492 | ext/web/compression.rs:44-55 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/response_body.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d01715db0083a858bcdbcfe0d741c8e0db1be5e41b9584d2d31a7ce2b725e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): cli/cache/check.rs:42-55 | cli/cache/incremental.rs:159-171 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/cache/check.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"918544081d0a3820db92785b42fdf2d933ab71d705a9c0b490fffb7ee82c1616"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): cli/cache/module_info.rs:114-130 | cli/cache/node.rs:130-145 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/cache/module_info.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"359a1f73201048468b3d4afefaf3ee1e58ba51349f9e4ce197172f5583b30f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): cli/module_loader.rs:1419-1426 | cli/rt/run.rs:793-800 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b9d66d83f15ddebd9a326d845b8d413b47c5d9d2ddd8c214909d34a7567ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ext/webgpu/compute_pass.rs:79-90 | ext/webgpu/render_pass.rs:74-88 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/compute_pass.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc710f342507fd5f8ee11cac7d14fd1d286ccfdb48a553515f5fa2d98e672e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): ext/crypto/subtle_derive_bits.rs:244-250 | ext/crypto/subtle_encapsulate.rs:56-59 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3629400bfaef68d24b315e783a8228fdcab77de289e921f3d02d0c2a93c704"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/core/arena/shared_arena.rs:447-456 | libs/core/arena/shared_atomic_arena.rs:494-504 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/shared_arena.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3a69b0696180d03384c3bbf0db503484043f9b94a07d5de63a0f6b8c5445ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ext/napi/js_native_api.rs:4349-4360 | ext/napi/node_api.rs:1296-1305 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":4349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b145125dd36a95a4264129f68855243706af00440965aee5d9b1568323c8eef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): ext/node/ops/process.rs:258-265 | ext/process/lib.rs:2387-2394 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/process.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f808e82db8c9579413fb5b722051c28208d1ec83ac09e237b62c43ef08f406d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): ext/webgpu/adapter.rs:96-103 | ext/webgpu/device.rs:114-119 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/adapter.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4948ff99d6d726d18b9c8303f8f08a982d749b3560a06ea3518a7ba733fbdb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/core/arena/shared_arena.rs:384-391 | libs/core/arena/unique_arena.rs:285-291 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/shared_arena.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"53548b1c8d24217901775fa7c184dbde535d634c759670bda98aff40159d1038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/resolver/cache/emit.rs:175-184 | libs/resolver/emit.rs:395-401 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/cache/emit.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd680438aa9e9ecd7d07472475320830712f8face22c1a6918a38d2fccc75bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/config/deno_json/permissions.rs:249-254 | libs/npm/resolution/snapshot.rs:757-762 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/permissions.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a5e605400a922eb616084ee305bb05874c138b6e4694a676fd4238d656d3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): cli/lsp/lint.rs:219-222 | cli/lsp/resolver.rs:1639-1642 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/lint.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0348a8a8221d2bb5f4babb5320e548979960b9a004c6e7758a1044b9119badb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/webgpu/compute_pass.rs:111-117 | ext/webgpu/render_pass.rs:159-165 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/compute_pass.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaeefb39e37fb0fcf0964a3e1c7956c15607600ef140424b7360484351d6ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/webgpu/compute_pass.rs:134-140 | ext/webgpu/render_pass.rs:185-191 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/compute_pass.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc44cf7284426d63516e9ea8e5114a82ade8edf36eb7ccd1e17718b716845f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): cli/lsp/resolver.rs:1431-1435 | libs/resolver/graph.rs:567-572 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/resolver.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"46335c2f06082ac8b2b6746adbf7e89ea4e2a424565fd32221369efa4708ecf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): cli/lsp/resolver.rs:1440-1444 | libs/resolver/graph.rs:574-579 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/resolver.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e29a5e592aff6de4dd3bbbbf6ae039cd0b41d393211e26737082ec6155380e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ext/webgpu/adapter.rs:84-90 | ext/webgpu/device.rs:133-139 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/adapter.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e274e41d7f2549f93b612d26b112a13239f57cbc70f74524ed38132eecad72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): ext/napi/js_native_api.rs:3626-3635 | ext/napi/node_api.rs:791-798 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":3626}}}],"partialFingerprints":{"codehealthFindingId/v1":"5849e22adb8e1e762cd8e66a140692d707bd956e597d0c3758d95445b6572860"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): libs/eszip/v1.rs:112-115 | libs/eszip/v2.rs:1714-1717 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v1.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3b2005010bd216161d0616a17199a478e2b331f6d3696e7a6f3f408ec258f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (120 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:88-207 | ext/crypto/subtle_encrypt.rs:88-207 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:88\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef1d22cdc99ac02f847b3d51a2414bb83a07cab49baf561f7a94ef4b2e27c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (88 lines \u00D7 2): ext/crypto/subtle_sign.rs:103-190 | ext/crypto/subtle_verify.rs:97-184 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_sign.rs\u0060 and \u0060ext/crypto/subtle_verify.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 160 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_sign.rs:103\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_sign.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"97724c7b4e199dded9aafc46d9d0955f4eb0b1cb010b3cc51f3c563b8e74b080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (80 lines \u00D7 3): ext/crypto/import_key.rs:361-440 | ext/crypto/import_key.rs:445-524 | ext/crypto/import_key.rs:529-608 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/import_key.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2483166a1914c82ce075676b8592471a778ab41d7cff49e27320f3ccfe33b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67\u201377 lines \u00D7 2): libs/npm_installer/hoisted.rs:917-983 | libs/npm_installer/local.rs:417-493 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/hoisted.rs:917\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/npm_installer/local.rs:415\u0060 calls \u0060write_initialized_file\u0060 and \u0060libs/npm_installer/hoisted.rs:916\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"a406b0030cb03cc7bff6d66b9f6d7950c800b39a01ff3394da701ce2cd2b1124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (69 lines \u00D7 2): ext/node/ops/fs.rs:2131-2199 | ext/node/ops/fs.rs:2263-2331 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:2131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffa8a2b80192799cb88ba1876f24517080fccbebeec40fb9b91f0aadc2f3693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): ext/node/ops/zlib/mod.rs:1225-1283 | ext/node/ops/zlib/mod.rs:1309-1367 \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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"098eda1fb58c36cd39fa229a2c54ffd8660416009acd335c648043fe7ce35629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51\u201357 lines \u00D7 2): cli/lsp/code_lens.rs:452-502 | cli/lsp/testing/collectors.rs:445-501 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/code_lens.rs:452\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/code_lens.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab21a3ab82116b0da72fe9a16a2ef983f25fcf5ed964584982ae9fe2e2bb3e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53\u201357 lines \u00D7 2): ext/node/ops/tcp_wrap.rs:724-780 | ext/node/ops/tcp_wrap.rs:792-844 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bf00195077e30822cd2221aade213dc2b68a66a204c95a78c8dbc5b4cea215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201351 lines \u00D7 2): ext/node/ops/vm.rs:508-558 | ext/node/ops/vm.rs:622-663 \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":"ext/node/ops/vm.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62b106906b235a5e38eab63863a0213fa6b002901592fb925511a8ac040a38f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47\u201349 lines \u00D7 2): cli/tools/upgrade.rs:712-760 | cli/tools/upgrade.rs:884-930 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/upgrade.rs:712\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/upgrade.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"163c21f898cc7cefcc037f579fd52ad0ddc10c3730d096fdbcb30235ed34ed48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201348 lines \u00D7 2): ext/telemetry/lib.rs:2064-2111 | ext/telemetry/lib.rs:2160-2205 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/telemetry/lib.rs:2064\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb3f378f352806be45a1a2a9c2430a08868908a8584c96c196cbebecb6f2416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): libs/core/uv_compat/tty.rs:1868-1912 | libs/core/uv_compat/tty.rs:1940-1984 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/tty.rs:1868\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac76824aa3dafc3f6ab9d19504b7f2c737b305c4d6f37d806a893f8429e4daf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): libs/npm_installer/hoisted.rs:821-877 | libs/npm_installer/local.rs:1184-1240 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e63d8859163bb583795e73c9f08afc46b700587483dc3abb14c644a8f2260d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201343 lines \u00D7 3): ext/node_sqlite/sql_tag_store.rs:642-645 | ext/node_sqlite/sql_tag_store.rs:684-725 | ext/node_sqlite/statement.rs:894-936 \u2014 before extracting anything, compare \u0060ext/node_sqlite/sql_tag_store.rs\u0060 and \u0060ext/node_sqlite/statement.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/sql_tag_store.rs:642\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23fca0f16837b078114dbcc3d98fc6a01ec397f7adac73ff6dcb00c32eb2e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201343 lines \u00D7 2): libs/npm_installer/hoisted.rs:590-629 | libs/npm_installer/local.rs:948-990 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/hoisted.rs:590\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf286d1a33dd3863b2d955fe8e5c9d9587745f50ced518c3bedd86dc0ffdec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 3): ext/ffi/call.rs:104-144 | ext/ffi/ir.rs:601-641 | ext/ffi/ir.rs:683-723 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/ffi/call.rs:104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/ffi/call.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"003e30c06899ebf94519abe9ebf3d6bcb6be55fa38f50a2ba0b9b987a292c6d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201341 lines \u00D7 2): ext/node/ops/zlib/mod.rs:925-959 | ext/node/ops/zlib/mod.rs:1011-1051 \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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd50d4d40aa815c4f810106cf32f65880c3894bfcad99c9eb7ebf4567984e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201341 lines \u00D7 2): ext/webgpu/compute_pass.rs:185-225 | ext/webgpu/render_pass.rs:260-298 \u2014 before extracting anything, compare \u0060ext/webgpu/compute_pass.rs\u0060 and \u0060ext/webgpu/render_pass.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 146 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/webgpu/compute_pass.rs:185\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/compute_pass.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3bc1ae660c211d98263b0c7bae391da928d5e6c1c400a3b52733cab63b2ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201340 lines \u00D7 3): ext/signals/dict.rs:35-74 | ext/signals/dict.rs:86-109 | ext/signals/dict.rs:157-180 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/signals/dict.rs:35\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/signals/dict.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"197df37f8a11b6922ed537724b8ce9dbc3a3a8caccd5e28cbc5edb1af56be634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201339 lines \u00D7 2): cli/tools/upgrade.rs:780-818 | cli/tools/upgrade.rs:943-976 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/upgrade.rs:780\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/upgrade.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"c845e635bec2503257a7a7e629f82cab7399e9f44accb0c0621d5876b70e33f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201339 lines \u00D7 2): ext/crypto/digest.rs:195-233 | ext/crypto/subtle_encrypt.rs:239-274 \u2014 before extracting anything, compare \u0060ext/crypto/digest.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/digest.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a8d422a938ade8efc87b629c65a62d1d7bd13e0dd62bf13d4f5dc6c7980cab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201338 lines \u00D7 2): ext/node/ops/vm.rs:97-134 | ext/node/ops/vm.rs:1507-1542 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/vm.rs:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/vm.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80a1f8ee395334560e9fde286ccf38ca700b95467b9b3f26ff0b7648fc62dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): ext/node/ops/fs.rs:2586-2622 | ext/node/ops/fs.rs:2681-2717 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:2586\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d55a5b68903e6e7494686fed22908191db246a604fe1383289981e7386fb60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): libs/dcore/src/inspector_server.rs:195-231 | libs/inspector_server/lib.rs:424-460 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:195\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeea915249cf9fb89d587a91ee89cc3ac44b10fb24137c272ff8918371498da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201336 lines \u00D7 2): ext/node/ops/tcp_wrap.rs:324-359 | ext/node/ops/tcp_wrap.rs:564-595 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tcp_wrap.rs:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"3087d5b75cd7237365af9441ebe1405335eaa59edbff09e8783d612bc83a482e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201336 lines \u00D7 2): ext/telemetry/lib.rs:2472-2496 | ext/telemetry/lib.rs:2517-2552 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/telemetry/lib.rs:2472\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"732f19b5335e61c1c485cb782fcbb084b6ab1c79ae1425134a8ff0014f7e7a5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): runtime/web_worker.rs:504-538 | runtime/worker.rs:474-508 \u2014 before extracting anything, compare \u0060runtime/web_worker.rs\u0060 and \u0060runtime/worker.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 84 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/web_worker.rs:504\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026WebWorkerOptions\u0060 in one and \u0060\u0026WorkerOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/web_worker.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"8583f6e7117ad26d0da13ea74b1a3a99d33e9d1b0823bb4c36f4508fce88a53b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201334 lines \u00D7 2): ext/node/ops/fs.rs:2539-2572 | ext/node/ops/fs.rs:2632-2664 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:2539\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"69983d4ff6732f92c58f987c53efc2aecfdf483586da9216c1305c625f17e044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201332 lines \u00D7 3): ext/signals/dict.rs:27-58 | ext/signals/dict.rs:150-164 | ext/signals/dict.rs:185-199 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/signals/dict.rs:27\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/signals/dict.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ada4d3b5130b57d5f8d3e22c04c30e69c408b4ed4a16c21d74c6c54f6187f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201332 lines \u00D7 2): ext/telemetry/lib.rs:3131-3158 | ext/telemetry/lib.rs:3175-3206 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/telemetry/lib.rs:3131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":3131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d03eb76a991c6210c71874417b440b96481ac2ced1d07c15595e2e1848d5935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): libs/resolver/bun_lockfile_import.rs:302-333 | libs/resolver/pnpm_lockfile_import.rs:492-523 \u2014 before extracting anything, compare \u0060libs/resolver/bun_lockfile_import.rs\u0060 and \u0060libs/resolver/pnpm_lockfile_import.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/bun_lockfile_import.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6db90a9a9ecd9b5e96147c37a1f2e4e24b594774147a7ec99cc7af7c961b218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 3): ext/webgpu/compute_pass.rs:169-198 | ext/webgpu/render_bundle.rs:166-196 | ext/webgpu/render_pass.rs:244-273 \u2014 before extracting anything, compare \u0060ext/webgpu/compute_pass.rs\u0060 and \u0060ext/webgpu/render_bundle.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/webgpu/compute_pass.rs:169\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/compute_pass.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bbc77e3d28a9e7ad50d6c95738cd4dfb3d10458f640dc8b4d0c27437996afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:285-315 | ext/crypto/subtle_encrypt.rs:341-371 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:285\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9accce5837f8d85a88ace0577f4bad48202d8f5a1907b141eaea050540d4ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): ext/net/ops_tls.rs:385-414 | ext/net/ops_tls.rs:528-558 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/net/ops_tls.rs:385\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/net/ops_tls.rs:383\u0060 calls \u0060from\u0060, \u0060unwrap_or\u0060 and \u0060ext/net/ops_tls.rs:526\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops_tls.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c9926a9cf764846a2321745a5d42b1ce2cd6fd837cd7bb3541a771026ff680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): ext/node/ops/fs.rs:3242-3272 | ext/node/ops/fs.rs:3503-3533 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:3242\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":3242}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b574905aee272720e0aa2f3eb970dd4a384094dfada7de2dd81e1b94229e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): ext/node_sqlite/database.rs:2359-2389 | ext/node_sqlite/database.rs:2466-2495 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/database.rs:2359\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6e3f45d39c824e07a7443b1a9f0ec804d60a52358ef201530a3eef9e133ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): runtime/web_worker.rs:915-945 | runtime/worker.rs:876-906 \u2014 before extracting anything, compare \u0060runtime/web_worker.rs\u0060 and \u0060runtime/worker.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 84 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/web_worker.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"926275f4a229b418cf47bda7e0815f95dbc93e288d5883cbfd64a4c2f4b81397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): cli/tools/compile.rs:660-689 | cli/tools/compile.rs:931-958 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060cli/tools/compile.rs:927\u0060 calls \u0060set_extension\u0060, \u0060resolve_specified_import_map_specifier\u0060 and \u0060cli/tools/compile.rs:659\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/compile.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc498f9fc58a294afc3c0469bc0919abab06e026d8e0d674a5ea2477db1ee2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): ext/napi/js_native_api.rs:1356-1385 | ext/napi/js_native_api.rs:1944-1971 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f333a3cec37e2d89f530ccaea9b57c309c34c8e82cf8d0c9a9fd0b101797a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): ext/node_sqlite/database.rs:788-816 | ext/node_sqlite/database.rs:837-866 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/database.rs:788\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7886bebf0ff00e4a8448d57c28aa28408101bccbe915c5ea4c534bebe83bfd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): libs/eszip/v2.rs:931-960 | libs/eszip/v2.rs:972-1000 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/eszip/v2.rs:931\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v2.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"034d5e6aa349a90fca8338bdfae5be17ab4831576085c2674500731270e2ccba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 5): ext/http/http_next.rs:4613-4641 | ext/http/http_next.rs:4667-4695 | ext/http/http_next.rs:4848-4876 | ext/http/http_next.rs:4986-5014 | ext/http/http_next.rs:5036-5064 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/http/http_next.rs:4642\u0060 calls \u0060disarm\u0060 and \u0060ext/http/http_next.rs:4696\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":4613}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e4fcdd1e8bd55c9c049dd894b5df4b25dbf38ba6451da55ab35910d3d0f461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): cli/rt/hmr.rs:105-133 | cli/tools/run/hmr.rs:34-62 \u2014 before extracting anything, compare \u0060cli/rt/hmr.rs\u0060 and \u0060cli/tools/run/hmr.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/hmr.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b837defa753acd651f59d77e7db92931d99061186465673cb7ff0e9270ef86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201329 lines \u00D7 2): ext/node/ops/tls_wrap.rs:426-449 | ext/node/ops/tls_wrap.rs:480-508 \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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b2ba29871980a48a28f41bc18a4b61f804ad28fad33140fc4375abc665214d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): cli/lsp/registries.rs:1086-1113 | cli/lsp/registries.rs:1125-1152 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/registries.rs:1086\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/registries.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c0c42be7328bedc3874edac7646c2cec9760e9a970bae999b888680333b6fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): cli/tools/lint/ast_buffer/swc.rs:287-314 | cli/tools/lint/ast_buffer/swc.rs:1357-1384 \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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"995e5e5ac327c7d89c355e067858510152bb1aa1034ca3c75c82bf80d2e00989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): ext/node_crypto/lib.rs:513-540 | ext/node_crypto/lib.rs:571-598 \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":"ext/node_crypto/lib.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83c0d03ea6252b74a7ff8be7a1673cdab1307c095a6d2fe79d52c7c0df9400d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 4): cli/lsp/code_lens.rs:281-307 | cli/lsp/code_lens.rs:388-414 | cli/lsp/testing/collectors.rs:395-421 | cli/lsp/testing/collectors.rs:535-561 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/code_lens.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17855d1529d4a5af167e0019147c7a4ad198dc4c8848bebf07cbd69093d9698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): cli/tools/lint/ast_buffer/swc.rs:389-415 | cli/tools/lint/ast_buffer/swc.rs:1489-1515 \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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ef7f2240d13c47adcbca934ff0f82368d3a2da64bbae0603bcbc52cdd23d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): ext/http/http_next.rs:5186-5212 | ext/http/http_next.rs:5264-5290 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/http/http_next.rs:5291\u0060 calls \u0060clone\u0060 and \u0060ext/http/http_next.rs:5213\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":5186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f074c194276bea0828a8f51e1ddc46aa0e600b42fb2e3c7584fadd4fc9519a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): ext/node_crypto/x509.rs:742-768 | ext/node_crypto/x509.rs:1304-1330 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/x509.rs:742\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/x509.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56484c5b2af60689478640322b90b0aae324478339ae3e7fdf241437d18e94c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): libs/npm_installer/hoisted.rs:556-581 | libs/npm_installer/local.rs:911-937 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f32be1f3153dec4f8b9bcfb22b92529e36ab2ded916fed28892f7c101c3674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 4): ext/napi/js_native_api.rs:1262-1287 | ext/napi/js_native_api.rs:1309-1334 | ext/napi/js_native_api.rs:1846-1871 | ext/napi/js_native_api.rs:1897-1922 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/napi/js_native_api.rs:1262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd1bd976876f975a63582702304efbe42e35610082b05d5de71e04691415b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 3): libs/npm_installer/global.rs:220-242 | libs/npm_installer/hoisted.rs:1132-1154 | libs/npm_installer/local.rs:1430-1455 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/global.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/npm_installer/local.rs:1429\u0060 calls \u0060is_empty\u0060 and \u0060libs/npm_installer/hoisted.rs:1131\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/global.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e464413a1672ad5094a749a79a3e93bc90624423a6681d9ac9f23fe01425c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): ext/crypto/subtle_generate_key.rs:821-846 | ext/crypto/subtle_import_key.rs:147-172 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_generate_key.rs\u0060 and \u0060ext/crypto/subtle_import_key.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 118 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_generate_key.rs:821\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71a662e6a464291bb24a2fbd6974721b733b4bc6b7c718417ffaecc8aec220b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): ext/crypto/subtle_sign.rs:194-219 | ext/crypto/subtle_verify.rs:188-213 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_sign.rs\u0060 and \u0060ext/crypto/subtle_verify.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 160 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_sign.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f185e58f355bfb24c95f4d298030bf2da98f0c8a9c1d2518ee106e9bb682ef70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): ext/node/ops/fs.rs:1605-1630 | ext/node/ops/fs.rs:1932-1957 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:1605\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80770a627e02a3b43effd9838fc60e4bb53431bd2e3588aa4ed57f1f1ccb5c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): ext/node/ops/perf_hooks.rs:297-322 | ext/node/ops/perf_hooks.rs:328-353 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/perf_hooks.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0390d370b368f3d945617490282e5e8a7a50cb77905c3c8b6b7b1ead7cbd79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): libs/cli_parser/src/convert.rs:2998-3023 | libs/node_shim/lib.rs:3105-3129 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cli_parser/src/convert.rs:2998\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"8007cc22546ac7291fdf7009809b73cb860c164396ca85e8a4449c3541ccbb8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1482-1505 | libs/core/uv_compat/pipe.rs:1830-1855 \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/core/uv_compat/pipe.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"34804e2aeb5fe9430966f6f001aae333a2378ce81595789010cdc16e51f5bdbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201325 lines \u00D7 4): ext/signals/dict.rs:35-59 | ext/signals/dict.rs:87-94 | ext/signals/dict.rs:158-165 | ext/signals/dict.rs:193-200 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/signals/dict.rs:35\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/signals/dict.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"be81c46c505c2510fedea2659a4668078a91569c7a580de3409ef60305576b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): cli/lsp/testing/collectors.rs:269-293 | cli/lsp/testing/collectors.rs:297-321 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/testing/collectors.rs:269\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/testing/collectors.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d453c512d6b4ece7e77d1493d6f3df84c0b9796bab5996dc03b387f335febd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): cli/tools/bundle/mod.rs:638-662 | cli/tools/bundle/mod.rs:801-822 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/bundle/mod.rs:638\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/mod.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"4139a1023b217fb3b5c6fa7bc7e194c799cc1cc0d8d9d4a49441dbb1a0da5f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): cli/tsc/diagnostics.rs:22-46 | runtime/fmt_errors.rs:129-153 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/diagnostics.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"001ac841a81141022a9e6702a3cdd0c1bd0296815d59a647058888ee66e37788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): ext/crypto/subtle_export_key.rs:723-747 | ext/crypto/subtle_export_key.rs:803-827 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_export_key.rs:723\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cad2dbc46df588180c2180a067bb2dab3f07d33a632053a6cf306a827705937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): ext/net/ops.rs:649-673 | ext/net/ops_tls.rs:481-505 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/net/ops.rs:649\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbf83e5ce631620d23b6d5385725953d9d248f598f8ca08ef2ddb1a5d0c01a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201325 lines \u00D7 2): ext/net/ops.rs:791-815 | ext/node/ops/udp.rs:86-101 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/net/ops.rs:791\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/node/ops/udp.rs:102\u0060 calls \u0060is_ipv6\u0060, \u0060set_only_v6\u0060 and \u0060ext/net/ops.rs:816\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"f366576881d7f6eb473194f80cd30cef2cbddb22a3a9bdc479152245ed8faf9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): libs/core/modules/map.rs:1332-1352 | libs/core/modules/map.rs:1403-1427 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/modules/map.rs:1332\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4630f7899e73a999b47e4f13555879952fdb31dd40ee5e3746bbfde33e651326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): libs/core/uv_compat/tty.rs:1765-1789 | libs/core/uv_compat/tty.rs:1994-2015 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/tty.rs:1765\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84dbdac9d3fc4b7d233b16844cafd0c8cb550d103defcbb6e06aed79d841262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): libs/node_resolver/resolution.rs:514-538 | libs/node_resolver/resolution.rs:559-583 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42dc9d0fa91a993336569c498f80676fbe611510f84615d2c0ee6b3a287ce8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): libs/resolver/loader/module_loader.rs:426-449 | libs/resolver/loader/module_loader.rs:466-490 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/resolver/loader/module_loader.rs:426\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/loader/module_loader.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"da02b2ad4a1b00d92c0c5568a51ab5b085b90a35b4e20068bb2f1bd4e6030804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): ext/node/ops/stream_wrap.rs:1471-1494 | ext/node/ops/stream_wrap.rs:1952-1975 | ext/node/ops/stream_wrap.rs:2038-2061 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/stream_wrap.rs:1471\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fe46d80cc8a977e5ffde450e7c7753ad0e594108844f755611d1716af71f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): cli/lsp/code_lens.rs:542-565 | cli/lsp/code_lens.rs:596-619 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/code_lens.rs:542\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/code_lens.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"df97a5338883aa366f71b4a67a788a742e4c9cbe69b7e426e447cd80d3fa1e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): cli/tools/installer/local.rs:72-95 | cli/tools/installer/local.rs:98-121 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/installer/local.rs:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/installer/local.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"923c264925bc8eeedd5105cfdaf150fe840888b57d70e5456745523ba878f60c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): ext/node/ops/fs.rs:2952-2973 | ext/node/ops/fs.rs:3056-3079 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:2952\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":2952}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4c7f79f3dcc5f1922bbffe0b68a65444cde474f996a2402aeb84be2a04232f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): libs/core/runtime/jsruntime.rs:2752-2775 | libs/core/runtime/jsruntime.rs:2796-2816 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/runtime/jsruntime.rs:2752\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/jsruntime.rs"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"633ce6db9129e5969de86599c3f4adda7d8c51073333fb0747f118ac88ac6375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/http_h1/protocol.rs:380-403 | libs/http_h1/write.rs:364-387 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/protocol.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"628c8c8146a73d13914db48af7df30478545e9b2144c060e1f2bc928fdccb1bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): libs/node_resolver/analyze.rs:295-318 | libs/node_resolver/analyze.rs:391-413 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/node_resolver/analyze.rs:295\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/analyze.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff1b3619c3915bcc45375de48488fb55237dedceb3eb08710a1f199042d0356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/npm_installer/hoisted.rs:419-442 | libs/npm_installer/local.rs:285-308 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/hoisted.rs:419\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/npm_installer/local.rs:282\u0060 calls \u0060as_ref\u0060 and \u0060libs/npm_installer/hoisted.rs:417\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"162c2d927094665588f0e89311ee0c9770773cb4f13f43b9be6099fd0e3bedaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 3): cli/tools/lint/ast_buffer/swc.rs:337-359 | cli/tools/lint/ast_buffer/swc.rs:693-714 | cli/tools/lint/ast_buffer/swc.rs:2369-2390 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060cli/tools/lint/ast_buffer/swc.rs:335\u0060 calls \u0060as_ref\u0060 and \u0060cli/tools/lint/ast_buffer/swc.rs:691\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8623405107eef3a422f7623ecc6388fbbbd38552bab8b9171a689da1bcd0582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 3): ext/node/ops/fs.rs:1446-1468 | ext/node/ops/fs.rs:1643-1665 | ext/node/ops/fs.rs:1814-1835 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:1446\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/node/ops/fs.rs:1812\u0060 calls \u0060check_cp_path_with_permissions\u0060 and \u0060ext/node/ops/fs.rs:1446\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"076db789bc30a7c575641cb42d6b487d6ad821340f7ee9e8d96b3537946ff396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 3): ext/node/ops/http2/session.rs:2598-2620 | ext/node/ops/http2/session.rs:2631-2652 | ext/node/ops/http2/session.rs:2663-2685 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/http2/session.rs:2598\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":2598}}}],"partialFingerprints":{"codehealthFindingId/v1":"25175219add646801e1ed405c942937de4042ff709f68ae9135fe056e9dacdfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): cli/lsp/diagnostics.rs:1810-1832 | cli/lsp/diagnostics.rs:1837-1856 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/diagnostics.rs:1810\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/diagnostics.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"718991a07dc5587fc15bdf7879de3116f59504c2468c1349fe3aeff35ba5db48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): cli/rt/binary.rs:819-838 | cli/tools/pack/mod.rs:607-629 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/rt/binary.rs:819\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/binary.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1da70188c205f440602e4d202756611fd253d111d98720e1a27e41aa832dd19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): cli/tools/bundle/mod.rs:669-690 | cli/tools/bundle/mod.rs:828-850 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/bundle/mod.rs:669\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/mod.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13c2e3c4493183bffd38b630a2751ceb990b899b8508a81b95fa24dcac87abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): ext/fs/ops.rs:1337-1359 | ext/fs/ops.rs:1367-1389 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1367\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/fs/ops.rs:1366\u0060 calls \u0060borrow_mut\u0060 and \u0060ext/fs/ops.rs:1336\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"422b8f65ce1abd4e6406dff4945a861972756e645d1968396967ee42bb6f1b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): ext/node/ops/fs.rs:96-118 | ext/node/ops/wasi.rs:2377-2394 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:96\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa19334c67e1938768f9b922157b1dae99e17b15ba3a57b0d58f4f42534effe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): ext/node/ops/ipc.rs:282-304 | ext/node/ops/ipc.rs:486-508 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/ipc.rs:282\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/ipc.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a878cf4405277d3ce60a81c991cee49ab766ec022da8ba4626ee229a3c6912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): ext/node/ops/zlib/mod.rs:475-492 | ext/node/ops/zlib/mod.rs:509-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"8193352678db22f1c352e13cb9109fd67999d602b16cf56fbd1f22dd1fbd8e01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): ext/node/ops/zlib/mod.rs:1473-1495 | ext/node/ops/zlib/mod.rs:1521-1543 \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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed52304ea684b3b1b69a13f432f0fce27de408e3b8647edfb7d7cf38b28ba6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): cli/tools/desktop.rs:1629-1650 | cli/tools/desktop.rs:1762-1783 \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":"cli/tools/desktop.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"46604dbd2448bf4ee701840322b7bf465738459e6cfb5bc2b7dc8377afacf732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): ext/crypto/mldsa.rs:205-226 | ext/crypto/mlkem.rs:343-364 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/mldsa.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7050c870d7b58b9ce679b61ce6414021f09f40b446a6c36dd162babadafcb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): ext/http/http_next.rs:2821-2842 | ext/http/http_next.rs:2885-2906 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:2821\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c71f96c70dbe47435d6631f0aa2502a42af94c111b5f442bb96b3cde9565b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): ext/node/ops/llhttp/binding.rs:809-825 | ext/node/ops/llhttp/binding.rs:968-989 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/llhttp/binding.rs:809\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90a948698e532bb4d2fd1a1c4ba0c42c7bd4c39324327966aae82017151fd99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): ext/node/ops/wasi.rs:870-891 | ext/node/ops/wasi.rs:893-914 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c35587ff27143516bd8eaa2ec4a5b57f9a221b0760cc2708340b83c1838e9f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): ext/node_sqlite/sql_tag_store.rs:316-337 | ext/node_sqlite/sql_tag_store.rs:519-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":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a12b73c526f11b2af787d5b5656e0566bc2d1e5fba35ca4ca8d09c935c05e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1527-1548 | libs/core/uv_compat/pipe.rs:1911-1932 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1527\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1208a749b1f8d96dd18e256016ec00355d516c77731dfce9fcd1570ecf39aa23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): libs/npm_installer/hoisted.rs:353-372 | libs/npm_installer/local.rs:203-224 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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":"libs/npm_installer/hoisted.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba110b788e83239d1780e214820ea3d72d2aa066c7920d1f07090634240f3642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201321 lines \u00D7 4): libs/core/modules/map/ext_script.rs:116-136 | libs/core/modules/map/ext_script.rs:253-264 | libs/core/modules/map/ext_script.rs:272-283 | libs/core/modules/map/ext_script.rs:344-355 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map/ext_script.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7de4d1b8497925fe22fbeb82772475b71d07c658d43d40265e91f9260bc8d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): ext/crypto/subtle_generate_key.rs:852-872 | ext/crypto/subtle_import_key.rs:1985-2005 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_generate_key.rs\u0060 and \u0060ext/crypto/subtle_import_key.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 118 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"fced8fbddb289e63abd8f9ed64ab069da5a67636b4eed4ec11b5d967adf1d373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): ext/http/http_next.rs:4645-4665 | ext/http/http_next.rs:5017-5035 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:4645\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":4645}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62157c5bbff2739ec169d2280265cdf6b0242fdcb7ac3180474e273bb70f732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): ext/node/ops/vm.rs:486-506 | ext/node/ops/vm.rs:596-616 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/node/ops/vm.rs:617\u0060 calls \u0060install_gc_if_exposed\u0060, \u0060global\u0060 and \u0060ext/node/ops/vm.rs:508\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/vm.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"96369f476b30bed70947fc75a4aec07f45d5160b985d6bcbf0a1f0cfbb3d09b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): ext/node_crypto/keys.rs:2771-2791 | ext/node_crypto/keys.rs:2828-2848 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/keys.rs"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"985d4f2e3f47cb4a63e607faae210e5fe327d4d2df7b465e1ea23e36415b9f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): ext/telemetry/lib.rs:2970-2989 | ext/telemetry/lib.rs:3023-3043 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/telemetry/lib.rs:2970\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/telemetry/lib.rs:3044\u0060 calls \u0060Some\u0060, \u0060push\u0060 and \u0060ext/telemetry/lib.rs:2990\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"21df5f207df31e65157a8e81aaed0e630524d28a7626f1e5d9c731fba985815d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/core/modules/map.rs:450-470 | libs/core/modules/map.rs:555-575 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/modules/map.rs:555\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c09c755be6a98d5797688c16643607ddb66c5c55fd85f7d081d223105bdbd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/core/ops_builtin_v8.rs:377-397 | libs/core/ops_builtin_v8.rs:529-549 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/ops_builtin_v8.rs:377\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a892e76a12c5c7be1293b3304779565a7be77f08c2a32232995ec8d84b393675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/core/uv_compat/stream.rs:622-642 | libs/core/uv_compat/tty.rs:3183-3203 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/stream.rs:622\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/stream.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"60345668a1cce13739d4d092c4c222fceebd0ee8fb48d9d3c2790fb0dea228cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/dcore/src/inspector_server.rs:236-256 | libs/inspector_server/lib.rs:465-485 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:236\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3ce0654235ce14bb713419cae5edcf695585aa854f9feafb89a9743cf860c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/dcore/src/inspector_server.rs:382-402 | libs/inspector_server/lib.rs:750-770 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:382\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/inspector_server/lib.rs:771\u0060 calls \u0060recv\u0060 and \u0060libs/dcore/src/inspector_server.rs:404\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f9ca3e0441ab297e812c695adb805b9d9ee256aacf699eed40eef18a943162"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): libs/http_h1/parse.rs:157-178 | libs/http_h1/parse.rs:210-231 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/parse.rs:157\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/parse.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a8c3c4e1638621a13128137c222a40c1547b5c4f93b0c7e580cdfc8dda0362"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/http_h1/write.rs:228-248 | libs/http_h1/write.rs:297-317 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/write.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/write.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e962995ef5c90815c10c9397854301b5c7094b161aac4464a5e995f99f96ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/node_shim/lib.rs:2877-2897 | libs/node_shim/lib.rs:2902-2922 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/lib.rs"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a897e10a923cbf7ed8123972e23511712dec429f9cff8c3e8062f88c6cf9b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/ops/conversion/from_v8/struct.rs:187-207 | libs/ops/webidl/dictionary.rs:211-231 \u2014 before extracting anything, compare \u0060libs/ops/conversion/from_v8/struct.rs\u0060 and \u0060libs/ops/webidl/dictionary.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/conversion/from_v8/struct.rs:187\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/struct.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"95be99deacf5ea4ee3d1cd637ca37be5e00a703611505a06d3585aec2db8f78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/ops/op2/dispatch_async.rs:150-170 | libs/ops/op2/dispatch_slow.rs:141-161 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/op2/dispatch_async.rs:150\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/dispatch_async.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"23db6925991bb9bc0b6ccb5bc4ed609bfeb4a5d0cd36e15e69b22fe6f4e3aa87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201320 lines \u00D7 4): cli/tools/desktop.rs:199-214 | cli/tools/desktop.rs:220-237 | cli/tools/desktop.rs:264-283 | cli/tools/desktop.rs:300-311 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:199\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060cli/tools/desktop.rs:261\u0060 calls \u0060is_some\u0060 and \u0060cli/tools/desktop.rs:297\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c342542818926095fc24624df8b1487731d3d150f21650752c8b47b551ac71e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 3): ext/webgpu/compute_pass.rs:203-222 | ext/webgpu/render_bundle.rs:200-217 | ext/webgpu/render_pass.rs:278-295 \u2014 before extracting anything, compare \u0060ext/webgpu/compute_pass.rs\u0060 and \u0060ext/webgpu/render_bundle.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/webgpu/compute_pass.rs:203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/compute_pass.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6eeda146f6ba4a241412c60f3435d908d00e587e096fb2df3025bb002085dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): libs/npm_installer/hoisted.rs:954-973 | libs/npm_installer/local.rs:463-482 | libs/npm_installer/local.rs:525-544 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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":"libs/npm_installer/hoisted.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"4914589e5902fcb5006ac4d1f2f733ba97ac3c29f09bcdb193d6e5edae7c27de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): ext/canvas/bitmaprenderer.rs:199-218 | ext/canvas/bitmaprenderer.rs:315-334 \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":"ext/canvas/bitmaprenderer.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"637494bac8e0c104c1d265ab53e07eff349569cb9d78ceec6b38e815b80e6066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): ext/canvas/bitmaprenderer.rs:273-292 | ext/canvas/bitmaprenderer.rs:361-380 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/canvas/bitmaprenderer.rs:273\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/canvas/bitmaprenderer.rs:293\u0060 calls \u0060bind_group_drop\u0060, \u0060texture_view_drop\u0060, \u0060texture_drop\u0060 and \u0060ext/canvas/bitmaprenderer.rs:381\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/bitmaprenderer.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02fadae40397506d4a3b9ffaa10a064eb572ee97475617101974dd49101c37e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): ext/fs/std_fs.rs:1022-1040 | ext/fs/std_fs.rs:1043-1062 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/std_fs.rs:1043\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/std_fs.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9034a7003e084119d1564f5cdc88e7ace794afd07e5e24eb68eb1a59cb4667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): ext/net/ops_tls.rs:339-358 | ext/node/ops/tls.rs:717-735 \u2014 before extracting anything, compare \u0060ext/net/ops_tls.rs\u0060 and \u0060ext/node/ops/tls.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/net/ops_tls.rs:359\u0060 calls \u0060unwrap_or\u0060 and \u0060ext/node/ops/tls.rs:735\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops_tls.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7936b768430a81a59671b0af3c74cf505b8aaaf73d3a9b15924471b7d510994c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201337 lines \u00D7 2): ext/node/ops/inspector.rs:358-394 | ext/node/ops/inspector.rs:415-446 \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":"ext/node/ops/inspector.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b488d2ba67dee2125725624559d4dc8c73153917b85b6767ec37ea2f3de0592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201320 lines \u00D7 2): ext/node/ops/llhttp/binding.rs:960-979 | ext/node/ops/llhttp/binding.rs:1041-1054 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/llhttp/binding.rs:960\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/node/ops/llhttp/binding.rs:956\u0060 calls \u0060as_ptr\u0060 and \u0060ext/node/ops/llhttp/binding.rs:1039\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fe4e61e235ea05585169f0172d7c9b051b32c7d8e7d8462fd48f581aacf5ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): ext/node/ops/tls_wrap.rs:1757-1776 | ext/node/ops/tls_wrap.rs:1978-1997 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tls_wrap.rs:1757\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"674d27ffe3f457f0b6845fa55b43ca21ac6e48b8295763f4c270ccca347ad46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): ext/node/ops/tls_wrap.rs:2606-2625 | ext/node/ops/tls_wrap.rs:2632-2648 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tls_wrap.rs:2606\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2606}}}],"partialFingerprints":{"codehealthFindingId/v1":"381e5b5445284b9f658a149b6def51489834b47cd88ca8f28785d03c9830ecf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): ext/node_crypto/keys.rs:1286-1305 | ext/node_crypto/keys.rs:1679-1698 \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":"ext/node_crypto/keys.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9a24708aa51bda25e62152413c8b9b0da85aa8d9648aa50b384e913da270c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): ext/webgpu/compute_pass.rs:228-247 | ext/webgpu/render_pass.rs:301-320 \u2014 before extracting anything, compare \u0060ext/webgpu/compute_pass.rs\u0060 and \u0060ext/webgpu/render_pass.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 146 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/webgpu/compute_pass.rs:228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/compute_pass.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16fbef62af341b875e9b8130f2f0a42d4fc2dcc882e3c909be2af859db0dc97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): libs/npm/resolution/graph.rs:1215-1230 | libs/npm/resolution/graph.rs:1290-1309 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm/resolution/graph.rs:1215\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/graph.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8b269ce85f9d0406e6346ea066add2dbda9038dca4373dd9b6fb66b12ad6e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): libs/npm_installer/hoisted.rs:713-732 | libs/npm_installer/local.rs:1074-1092 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/hoisted.rs:713\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"d198089fd0deaaaaa4487b5a5ddf3bfb9c2c985e96439084828c1c48612c74aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/npm_installer/package_json.rs:290-309 | libs/npm_installer/package_json.rs:380-399 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/package_json.rs:290\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/package_json.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccb81c3b2c1949868b0fdd24ed5a9ac866d2ff5e23c92483008d9b1b1f6e38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/resolver/loader/module_loader.rs:534-553 | libs/resolver/loader/module_loader.rs:562-581 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/resolver/loader/module_loader.rs:534\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/loader/module_loader.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baed1f960f3af6907a8b966f205d672812955c0e05fae801ca7a7ed5b540e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 4): ext/node/ops/tcp_wrap.rs:328-345 | ext/node/ops/tcp_wrap.rs:568-582 | ext/node/ops/tcp_wrap.rs:728-746 | ext/node/ops/tcp_wrap.rs:796-812 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tcp_wrap.rs:328\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7a5ef5eaaba1bcfa05538f2734335db1202bea9a1813152c19789717180697"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): cli/lib/worker.rs:208-225 | ext/node/ops/process.rs:674-692 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/process.rs:674\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lib/worker.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"1891bd1312364dae6df2715d9651896d6d25a824c50b51058db691c6f2e1fcd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): cli/tools/bundle/mod.rs:440-458 | cli/tools/transpile.rs:250-267 \u2014 before extracting anything, compare \u0060cli/tools/bundle/mod.rs\u0060 and \u0060cli/tools/transpile.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/bundle/mod.rs:440\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/mod.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e5405de54dc5571711d1da2b31a840909d4cdd607bc0cabbd3d65795e932b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): cli/tools/bundle/mod.rs:739-757 | cli/tools/bundle/mod.rs:772-787 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/bundle/mod.rs:739\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/mod.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8c9f30b06cdb49a5689c32034c46514b59e586dae9eb8a6763c2acf9674146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): cli/tools/pack/unfurl.rs:239-257 | cli/tools/pack/unfurl.rs:292-309 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pack/unfurl.rs:239\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/unfurl.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"250ec6c38ac43b7c39c3c1f90c819efa6920eeab4f1e818b78ae8ca6ea0e3ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): cli/util/extract.rs:1082-1100 | cli/util/extract.rs:1120-1138 \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":"cli/util/extract.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ed06e4cf3bd39f554fcf6b7c805dba070f16285ee7c136f4f772aebf2d5660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): ext/http/http_next.rs:4281-4299 | ext/http/http_next.rs:4452-4470 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:4281\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":4281}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73c19f09d6b14e7283936006872312947a698990c1c3e5632df5049eafc3456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): ext/node/ops/fs.rs:3181-3199 | ext/node/ops/fs.rs:3425-3443 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:3181\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"595b55dd0d4d13834f61026fb1c4b36af9daf66d4746216ac14dd19319d7cefe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): ext/node/ops/fs.rs:3408-3426 | ext/node/ops/fs.rs:3458-3476 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:3408\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"e414ce3146c78f1a9bfa5a792731b5e4a23e5ca590f9044a50bd00e5fde5479e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): ext/node_crypto/cipher.rs:399-417 | ext/node_crypto/cipher.rs:423-440 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:399\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53df4630580509f4dbe7f218f5837119c670624d780959a14d5c193fdfbd69f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): ext/web/lib.rs:683-701 | libs/core/ops_builtin_v8.rs:601-619 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/lib.rs:683\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/lib.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e678adfe7d1eb1f72cfccc5d84e5e02d8e3a80fd7b7c8ada66856b3c894ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/config/workspace/discovery.rs:502-520 | libs/config/workspace/discovery.rs:613-631 \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/config/workspace/discovery.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"0226f58dc62080df9a656d18ec155c73c3b340f3ec43bc2e47501ca231625797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201319 lines \u00D7 2): libs/core/inspector.rs:1094-1112 | libs/core/inspector.rs:1137-1144 \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/core/inspector.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71d062dcf2043e2c43f45c4f913fe346ac2775d8c5047be4507b7b0819d723d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/core/ops_builtin_v8.rs:346-364 | libs/core/runtime/jsrealm.rs:551-569 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/ops_builtin_v8.rs:346\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"51adff99fd56a6c7af4d0e6aa95165cfdc52f7a7598dedf322fed327af407ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): cli/lsp/tsc.rs:644-661 | cli/lsp/tsc.rs:1046-1063 | cli/lsp/tsc.rs:1179-1196 | cli/lsp/tsc.rs:1350-1367 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/tsc.rs:644\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ecead9119703b874a0dcdc8dcaad33506ea25ba525d6ad53e0bfcb40e8ba7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 4): ext/crypto/subtle_import_key.rs:460-477 | ext/crypto/subtle_import_key.rs:1053-1069 | ext/crypto/subtle_import_key.rs:1447-1463 | ext/crypto/subtle_import_key.rs:1870-1887 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:460\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a3b8cefad25846fa7820b4f832af4c1928753d588394819bbdef838df72af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 4): ext/node/ops/stream_wrap.rs:1346-1363 | ext/node/ops/stream_wrap.rs:1466-1482 | ext/node/ops/stream_wrap.rs:1946-1963 | ext/node/ops/stream_wrap.rs:2032-2049 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/stream_wrap.rs:1346\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd006ac2224c15354115015a76624774d39c8697987eb5572c9eab37eb469a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): cli/tools/fmt.rs:1330-1347 | cli/tools/fmt.rs:1527-1544 | cli/tools/fmt.rs:1580-1597 \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":"cli/tools/fmt.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d30a5b5c09cbea8b6a8472d523a4b92dcc587f36df1b8cbb324395fa400720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): ext/telemetry/lib.rs:2436-2453 | ext/telemetry/lib.rs:2467-2484 | ext/telemetry/lib.rs:2512-2529 \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":"ext/telemetry/lib.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ddc2e8db5be56760122f50147c735343ae4f9b843ade1cb6c9a18d7d02a47f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): cli/lsp/language_server.rs:2467-2484 | cli/lsp/language_server.rs:2536-2553 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/language_server.rs:2536\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"13929edf35392fecce2dfe9e28f3103b2fd61245f9ea47e0e6ee9bc0cf1f14b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): ext/crypto/decrypt.rs:327-344 | ext/crypto/encrypt.rs:206-223 \u2014 before extracting anything, compare \u0060ext/crypto/decrypt.rs\u0060 and \u0060ext/crypto/encrypt.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/crypto/encrypt.rs:225\u0060 calls \u0060to_vec\u0060 and \u0060ext/crypto/decrypt.rs:349\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/decrypt.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ec76ef6719c6367293fc21c6cc8e0ef141c774df291663df0886aaf96cd606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:376-393 | ext/crypto/subtle_encrypt.rs:432-449 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:376\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c980cf65d47f614633788f04bad173fd375890de3caf10a5644fc192f7b8e043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:402-419 | ext/crypto/subtle_encrypt.rs:458-475 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf49b20895e343778064782c88aaa7e1c46f301d948ce2f144b39841a78161b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): ext/crypto/subtle_export_key.rs:763-780 | ext/crypto/subtle_export_key.rs:843-860 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_export_key.rs:763\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"946beb4350a41f3a0d129ed6db091e1228d78ce3dfa338d82da266579d8357a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): ext/crypto/subtle_import_key.rs:861-878 | ext/crypto/subtle_import_key.rs:973-990 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:861\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fd0634b4b685f2b86e324968ea0cf20ebf44d040e3af66d1e834c435a9bac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): ext/http/http_next.rs:2254-2270 | ext/http/http_next.rs:2297-2314 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:2254\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9286e7b1acfb7507e0091b2761a28652b73d563da59b960d42a9dd3057c19726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): ext/node/ops/fs.rs:1574-1591 | ext/node/ops/fs.rs:1907-1919 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:1574\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e149075ffe329a9fe6cdc73c4a3a081047cd76e7dc4b14796c5b2b6a34071cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): ext/node/ops/pipe_wrap.rs:210-227 | ext/node/ops/tcp_wrap.rs:217-234 \u2014 before extracting anything, compare \u0060ext/node/ops/pipe_wrap.rs\u0060 and \u0060ext/node/ops/tcp_wrap.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 79 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/pipe_wrap.rs:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/pipe_wrap.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0723c755573e23b7de3c93ca8bc0c149447116c8a5f0d208becc4fbaa02f086e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): ext/node/ops/stream_wrap.rs:1687-1704 | ext/node/ops/stream_wrap.rs:1871-1885 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/stream_wrap.rs:1687\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"60919ab37ff69c68061d754a6bc84e7de1f4ac173b4c1f66e7b263f0b55565da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): ext/web/console/mod.rs:1532-1549 | ext/web/console/mod.rs:1675-1692 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/mod.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e68f17619f6ca3338339672685a77387bb90f459ac80e47f17ff2ce0980f215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/ops/op2/dispatch_slow.rs:985-1002 | libs/ops/op2/dispatch_slow.rs:1018-1035 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/op2/dispatch_slow.rs:985\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/dispatch_slow.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcd45b6e06d588628d4be419454eb573ed710510f8e6ca8b9ebc26be804a04e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201317 lines \u00D7 5): ext/signals/dict.rs:34-50 | ext/signals/dict.rs:80-86 | ext/signals/dict.rs:115-121 | ext/signals/dict.rs:150-156 | ext/signals/dict.rs:185-191 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/signals/dict.rs:34\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/signals/dict.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aee8680f150939d529358780532beb6a0feb29bef473db212d5e62a4cdf61d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): cli/tools/desktop.rs:1645-1659 | cli/tools/desktop.rs:1778-1792 | cli/tools/desktop.rs:3222-3238 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060cli/tools/desktop.rs:1799\u0060 calls \u0060linux_colocated_runtime_name\u0060 and \u0060cli/tools/desktop.rs:1668\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eff4e54ffeac089d45bf9ad12cfa2454d522ad20a5c22aa0c447620eee7fd8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): libs/core/ops_builtin_v8.rs:355-371 | libs/core/ops_builtin_v8.rs:494-510 | libs/core/runtime/jsrealm.rs:560-575 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/ops_builtin_v8.rs:355\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"effcdb02adf12ebe88d66b2de0e901853fcacebe8a97fdd752f70eaeeaaa1834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): cli/lsp/completions.rs:661-677 | cli/lsp/completions.rs:820-836 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/completions.rs:661\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/completions.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"5531be6c30b80b5a6f6139721abe310dfe1c166511df0c6fb4c1391410525f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): cli/lsp/language_server.rs:1734-1750 | cli/lsp/language_server.rs:1782-1798 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/language_server.rs:1734\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"253c92d4324cc94229a6d684e1c96c345641d7e291362e9d2059854cfe93f130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): cli/lsp/registries.rs:809-826 | cli/lsp/registries.rs:953-970 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060cli/lsp/registries.rs:808\u0060 calls \u0060ends_with\u0060 and \u0060cli/lsp/registries.rs:952\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/registries.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5ca65def8fe8c7f6d6e876283bb73ad6fe236bef59c9f5682f5cedd67e3c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): cli/module_loader.rs:1530-1546 | cli/rt/run.rs:1005-1021 \u2014 before extracting anything, compare \u0060cli/module_loader.rs\u0060 and \u0060cli/rt/run.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/module_loader.rs:1530\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"2554df66e7ef294acb108a626d460dceb7bfe984bc35b32b9f64d97882bb9661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): cli/tools/bump_version.rs:638-654 | cli/tools/bump_version.rs:681-697 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/bump_version.rs:638\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bump_version.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b9fbcf90ba429fe1113753aaf010043ff8cb060e13db18a315850aceb086c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): cli/tools/fmt.rs:969-985 | cli/tools/fmt.rs:1091-1107 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/fmt.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be469e8cf2eb8eddd88d8c91c096777ce83f2f26068bff63c765b732116e7f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): cli/util/path.rs:96-112 | libs/core/error.rs:1512-1525 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060from\u0060 to \u0060\u0026ModuleSpecifier\u0060 in one and \u0060\u0026Url\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/path.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21988be10f0a21895476f785e54d10dd6e366373872d8291bb810cd9ab5121d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): ext/cache/lscache.rs:96-112 | ext/cache/lscache.rs:272-288 \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":"ext/cache/lscache.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3189ce0cf5304ac725619fde48cb90b4b0ad82d8830409a222c736d283fbe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): ext/canvas/bitmaprenderer.rs:670-686 | ext/canvas/bitmaprenderer.rs:704-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/canvas/bitmaprenderer.rs:670\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/bitmaprenderer.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11d10d72508fb076db85c978027e98f5048fdaf8b38f94a3d698aaabf716169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): ext/crypto/export_key.rs:260-276 | ext/crypto/export_key.rs:280-296 \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":"ext/crypto/export_key.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ec58cfba532f81c4c85761ce88476171fff1a1283179d631c99508cbd70aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:562-578 | ext/crypto/subtle_encrypt.rs:632-648 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/crypto/subtle_encrypt.rs:630\u0060 calls \u0060Err\u0060, \u0060op_error\u0060, \u0060to_string\u0060 and \u0060ext/crypto/subtle_decrypt.rs:561\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab76bc8399f8c19e7828d931be239c05d5a8aa20f486b53fa4d3c88de3d52fe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): ext/http/http_next.rs:4784-4800 | ext/http/http_next.rs:4862-4878 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:4784\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":4784}}}],"partialFingerprints":{"codehealthFindingId/v1":"133246b9613ee29360fd4c18ba1bc5dc40ca79891ff119bc77e8b314b582e7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): ext/node/ops/zlib/alloc.rs:30-46 | ext/node/ops/zlib/alloc.rs:75-87 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/zlib/alloc.rs:30\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/zlib/alloc.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cadc63c514b0ca3d737e862ffabf3ced91c4eae7a36de856e48f5bb36c0180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/core/ops_builtin_v8.rs:335-351 | libs/core/ops_builtin_v8.rs:472-488 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/ops_builtin_v8.rs:335\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"22366b8c8a1fdd7b23e5c6469d3dec09b864934a703908ee0675ea1a2438a8a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1866-1882 | libs/core/uv_compat/pipe.rs:2003-2019 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1866\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9666c4d7da488b5b060354667483f54856f111c408cc26127b5df26595c7375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): libs/core/uv_compat/stream.rs:673-685 | libs/core/uv_compat/stream.rs:706-722 \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/core/uv_compat/stream.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca86ff31152d39957dbcaab8764f3c3c005509820b88299ebad3b35a4f97d516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): libs/npm/resolution/snapshot.rs:618-634 | libs/npm/resolution/snapshot.rs:856-871 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm/resolution/snapshot.rs:618\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/snapshot.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"0139861a57b8f57e90c09cc381c1a4391694442277213e6d6fadeac877692bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/npm_installer/hoisted.rs:769-785 | libs/npm_installer/local.rs:1128-1144 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/hoisted.rs:769\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/npm_installer/local.rs:1126\u0060 calls \u0060as_ref\u0060 and \u0060libs/npm_installer/hoisted.rs:768\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"9813059d8d66c92c6fa9836eb937ba9c08c3585f296d7cace7be0d6bc0a16495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): libs/npm_installer/local.rs:1904-1920 | libs/npm_installer/local.rs:2204-2216 \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/npm_installer/local.rs"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"17258ce32c18fbde0cacae7460e6eac7be895b244e0475ca32c96f56e955ba0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/serde_v8/magic/v8slice.rs:159-175 | libs/serde_v8/magic/v8slice.rs:184-200 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/serde_v8/magic/v8slice.rs:159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/serde_v8/magic/v8slice.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7383a38bb59415e88944e906ebe774f2fe222c02886abc37ec7ff1f5fe9051f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 7): ext/node/ops/tls_wrap.rs:417-430 | ext/node/ops/tls_wrap.rs:469-484 | ext/node/ops/tls_wrap.rs:531-546 | ext/node/ops/tls_wrap.rs:574-589 | ext/node/ops/tls_wrap.rs:610-624 | ext/node/ops/tls_wrap.rs:691-706 | ext/node/ops/tls_wrap.rs:841-856 \u2014 all 7 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tls_wrap.rs:417\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/node/ops/tls_wrap.rs:414\u0060 calls \u0060Some\u0060 and \u0060ext/node/ops/tls_wrap.rs:690\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"e996810322e13703ace57c869dd642a8531a9dd2840ae8cf50768ccbba541380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): libs/resolver/bun_lockfile_import.rs:164-179 | libs/resolver/npm_lockfile_import.rs:248-263 | libs/resolver/pnpm_lockfile_import.rs:222-237 | libs/resolver/yarn_lockfile_import.rs:130-145 \u2014 before extracting anything, compare \u0060libs/resolver/bun_lockfile_import.rs\u0060 and \u0060libs/resolver/npm_lockfile_import.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/resolver/pnpm_lockfile_import.rs:218\u0060 calls \u0060sort\u0060, \u0060dedup\u0060 and \u0060libs/resolver/bun_lockfile_import.rs:161\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/bun_lockfile_import.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb13efea4d406592be4462ebeb459f5182a4d76fbc6024f4fde2b8145bfb04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): ext/node/ops/llhttp/binding.rs:421-435 | ext/node/ops/llhttp/binding.rs:466-481 | ext/node/ops/llhttp/binding.rs:646-660 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/llhttp/binding.rs:421\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a35b619da9daadaea5ad4702c6a294ae98ec0fea3bc90efdffdfe75d28018f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): ext/node_sqlite/database.rs:1108-1123 | ext/node_sqlite/sql_tag_store.rs:311-325 | ext/node_sqlite/sql_tag_store.rs:514-528 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/node_sqlite/sql_tag_store.rs:512\u0060 calls \u0060borrow\u0060, \u0060exists\u0060 and \u0060ext/node_sqlite/database.rs:1104\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40a2d6f9daddfb058e489ee4fb8db5f29f978663b2d2b82a6291dcf7ca06205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): libs/core/uv_compat.rs:486-501 | libs/core/uv_compat.rs:510-525 | libs/core/uv_compat.rs:534-549 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat.rs:486\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ca81f5a514aff0eaddef9a3a7c5363090c474fd670823a0b169e409e3c9b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): cli/lsp/tsc.rs:1270-1285 | cli/lsp/tsc.rs:1551-1566 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/tsc.rs:1270\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2660a4eec0d5880e8d1f767cb0c730b2d3856fd2cd904bc58ae3992f4c61c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): cli/lsp/tsc.rs:2911-2928 | cli/lsp/tsc.rs:2944-2961 \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":"cli/lsp/tsc.rs"},"region":{"startLine":2911}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44b18bb7d12f874e7cf4c19487dbed4e723eebcbd31ca3f1a0db5295e2db738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): cli/module_loader.rs:1474-1485 | cli/rt/run.rs:955-970 \u2014 before extracting anything, compare \u0060cli/module_loader.rs\u0060 and \u0060cli/rt/run.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/module_loader.rs:1474\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11015edeb810979962f27600f3102a3bff55eae64821525490c770017347520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): cli/module_loader.rs:2010-2025 | cli/rt/run.rs:2091-2106 \u2014 before extracting anything, compare \u0060cli/module_loader.rs\u0060 and \u0060cli/rt/run.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be91fc2347a95548905911500b8d72be48120f2cbe0dc5df9f0057698be76e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): cli/ops/bench.rs:58-73 | cli/ops/testing.rs:88-102 \u2014 before extracting anything, compare \u0060cli/ops/bench.rs\u0060 and \u0060cli/ops/testing.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/ops/bench.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"630b380a68cb9b125835be481c02d085660e1cc34a56d6a8d42a06e031b9385e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): cli/tools/pm/mod.rs:1258-1273 | cli/tools/pm/outdated/mod.rs:267-282 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pm/mod.rs:1258\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/mod.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec17edf7ffb5d633cb6a911394ece0770579f7d6ee774455889e20d54939fdf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): cli/tools/repl/session.rs:265-280 | cli/tools/run/hmr.rs:304-319 \u2014 before extracting anything, compare \u0060cli/tools/repl/session.rs\u0060 and \u0060cli/tools/run/hmr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/repl/session.rs:265\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/session.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"950fa19710a4a34bb4780369fb80232cbd44d14d35e44ca455f5ef4a9d028a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ext/cache/lsc_shard.rs:88-103 | ext/cache/lsc_shard.rs:122-137 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/cache/lsc_shard.rs:88\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cache/lsc_shard.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e012094146ea3d5626146c06e1433b742069e041f1ed5779cf7f03c4d1d663d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ext/canvas/byow.rs:236-251 | ext/canvas/canvas.rs:139-154 \u2014 before extracting anything, compare \u0060ext/canvas/byow.rs\u0060 and \u0060ext/canvas/canvas.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/canvas/byow.rs:236\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/byow.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85d9b2e18256ab35c915228a8d7d79fba80ee3fd5438587a7911d885f84ac38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): ext/crypto/subtle_import_key.rs:404-419 | ext/crypto/subtle_import_key.rs:559-573 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:404\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"7252f7b684d9f5fd929666ac8d6fa756504a266b23f9eebfa5bb27f1bfae87f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ext/crypto/subtle_import_key.rs:424-439 | ext/crypto/subtle_import_key.rs:590-605 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:424\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c710f4db19aea9755f84ee42ae9bc0dbf340db97eb52703c5b6d65dcd3dee5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ext/crypto/subtle_sign.rs:72-87 | ext/crypto/subtle_verify.rs:66-81 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_sign.rs\u0060 and \u0060ext/crypto/subtle_verify.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 160 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_sign.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"735e6b3365ac36e946ea2951a1f8053a7d618ebf714967716d562ec85f9a4413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ext/fs/ops.rs:351-366 | ext/fs/ops.rs:375-390 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060mode\u0060 to \u0060u32\u0060 in one and \u0060i32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71c1fe21f8df817e216a804011ee89f10bcf8d0441876d3d92c13f0ebdd4509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): ext/http/http_next.rs:2413-2428 | ext/http/http_next.rs:2477-2491 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:2413\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"da69cb844fc38ea85d29848f385a45bf4d0cbddb4006c326637fe40b32dc3465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): ext/http/http_next.rs:4216-4231 | ext/http/http_next.rs:4373-4387 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:4216\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":4216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffac3ab7abf85e1e51accafdd8b366e392ded0059e212124151368227362b17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ext/node/ops/dns.rs:118-133 | ext/node/ops/dns.rs:203-218 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/dns.rs:118\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/dns.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bedc9253d3702cdaeb11ffecd22bc3fb2b2ae6b89310c2e00ff299d71d6c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): ext/node/ops/stream_wrap.rs:979-995 | ext/node/ops/stream_wrap.rs:1038-1054 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/stream_wrap.rs:979\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"e955db67490102022dbfcf746131a375f24ffdf4e47b7ad4b3ea058c79dd6648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ext/node/ops/zlib/mod.rs:737-752 | ext/node/ops/zlib/mod.rs:783-798 \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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d47add7720f3937f884e6cf564014bc5f491c21d23397def58a306eed00fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): ext/node_crypto/sign.rs:383-398 | ext/node_crypto/sign.rs:570-580 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/sign.rs:383\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/sign.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eae421c6285207ff1620c6cef37d878c057273062f9a2e4b779fd5dd6b48e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ext/node_crypto/x509.rs:291-306 | ext/node_crypto/x509.rs:328-343 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/x509.rs:291\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/x509.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c46ce732712aa79791c59854209c9b585e2f63f68be84d88fbce7899e29b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): ext/node_sqlite/database.rs:2428-2443 | ext/node_sqlite/database.rs:2700-2713 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed28e92d0852c9039342ff1dd5fe23e55858bc4a0eaded854b04617ada057ca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/core/arena/raw_arena.rs:325-340 | libs/core/arena/raw_arena.rs:354-369 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/arena/raw_arena.rs:325\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/core/arena/raw_arena.rs:324\u0060 calls \u0060drop\u0060 and \u0060libs/core/arena/raw_arena.rs:353\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/raw_arena.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b200efe74d7d0879e5b5b59b620c8c33e258d22f35c720ad065647c5faabe82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/core/ops_builtin_v8.rs:310-333 | libs/core/ops_builtin_v8.rs:437-460 \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/core/ops_builtin_v8.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c5853355a6213be753cec80a1f02b9a2e7c543a4273743744aa43236e6ea9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/http_h1/parse.rs:186-201 | libs/http_h1/parse.rs:246-261 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/parse.rs:186\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/parse.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94701511ff2cc6383e7b51506af3007056dd640d8a82e7b7bc9d37b608968c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/ops/conversion/from_v8/enum.rs:208-223 | libs/ops/conversion/to_v8/enum.rs:394-409 \u2014 \u0060libs/ops/conversion/from_v8/enum.rs\u0060 and \u0060libs/ops/conversion/to_v8/enum.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 54 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/enum.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab95043f0ff44d30928dde8849193999349242c4404258ed83daff459d358d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): cli/lsp/completions.rs:606-620 | cli/lsp/completions.rs:656-670 | cli/lsp/completions.rs:767-781 | cli/lsp/completions.rs:815-829 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/completions.rs:606\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/completions.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"defc2e67bd212983045ef2c21c900a8cd8aafc2d75b730a6b9056bd941c79c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): ext/node_sqlite/statement.rs:1097-1111 | ext/node_sqlite/statement.rs:1115-1129 | ext/node_sqlite/statement.rs:1133-1147 | ext/node_sqlite/statement.rs:1151-1165 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/statement.rs:1097\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/statement.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bced75d0c4ddeaea4a0036db941425f26961c2deccc1d4f11bd9e54c45b7b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): cli/tools/lint/ast_buffer/swc.rs:293-307 | cli/tools/lint/ast_buffer/swc.rs:1038-1052 | cli/tools/lint/ast_buffer/swc.rs:1363-1377 \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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d670692383dc2b2c5efadb28daa4050df8d407595f4ef0d517022202fad8ecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): ext/crypto/export_key.rs:390-404 | ext/crypto/export_key.rs:408-422 | ext/crypto/export_key.rs:425-439 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/export_key.rs:390\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/export_key.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ce87dafbd06410f0ea824ba5fcdfdfaaf2ffc5075b3c597f38f8cdb3a6c14e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): ext/node/ops/fs.rs:3351-3365 | ext/node/ops/fs.rs:3403-3417 | ext/node/ops/fs.rs:3453-3467 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:3351\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":3351}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3da22e70229d8d62b30c346a2ccaafd73ad4bb8d76589dbc0e7604d50fc227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): libs/eszip/v2.rs:101-115 | libs/eszip/v2.rs:157-171 | libs/eszip/v2.rs:182-195 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/eszip/v2.rs:101\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v2.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89a0124c3e8f2246218cf6eca37cfb5b11fc0a088805f990a4ebf6e6013a0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): cli/lsp/completions.rs:696-710 | cli/lsp/completions.rs:855-869 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/completions.rs:696\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/completions.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e97a285e96df1183f0795b657c4b1c54dc2556f99aee9955d0e8daf20559a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): cli/lsp/tsc.rs:1014-1028 | cli/lsp/tsc.rs:1147-1161 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/tsc.rs:1014\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee62acc0e89aa27e9dc144a52ccfbd73a0cc24fa1197172ce217a924d86a418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): cli/ops/bench.rs:80-94 | cli/ops/testing.rs:109-123 \u2014 before extracting anything, compare \u0060cli/ops/bench.rs\u0060 and \u0060cli/ops/testing.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/ops/bench.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da7578df3154e496c31ab535f45a10093a9d552a08a712c45067e99bc418f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): ext/crypto/subtle_derive_bits.rs:444-455 | ext/crypto/subtle_derive_bits.rs:478-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_derive_bits.rs:444\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/crypto/subtle_derive_bits.rs:456\u0060 calls \u0060Err\u0060, \u0060op_error\u0060, \u0060to_string\u0060 and \u0060ext/crypto/subtle_derive_bits.rs:493\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcc7ea7d0731e11534e54213b97cf2edca562129ec33628844cc42d4bc38ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): ext/fs/ops.rs:1166-1180 | ext/fs/ops.rs:1209-1223 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1166\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5d4b5544f174f0954a7b61f02deae70ab7a86b1594b5ca33d0852073345de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): ext/fs/ops.rs:1254-1268 | ext/fs/ops.rs:1300-1313 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1254\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f50d7d21298ee850c7a497dc4ad53f38a319447a1298c59d7da68d153cdd5e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): ext/io/lib.rs:1136-1150 | ext/io/lib.rs:1167-1181 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/io/lib.rs:1136\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/lib.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02f666c5c82e59e8cecd613775a80f27d8fc151d75d63023c20c777c57005c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): ext/node/ops/vm.rs:165-179 | ext/node/ops/vm.rs:1594-1608 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/vm.rs:165\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/node/ops/vm.rs:163\u0060 calls \u0060make_cppgc_object\u0060 and \u0060ext/node/ops/vm.rs:1592\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/vm.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1d0d98a50deb0165591030fe1baac709ab6060b98b39ab0692cdcb67917084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201315 lines \u00D7 2): ext/tls/lib.rs:311-325 | ext/tls/lib.rs:350-358 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/tls/lib.rs:311\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/tls/lib.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36f30450a6c0c1df1fdecafc9c7e5c54de0ae814953b22f633229b138d60639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/cache_dir/file_fetcher/mod.rs:1122-1136 | libs/cache_dir/file_fetcher/mod.rs:1146-1160 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cache_dir/file_fetcher/mod.rs:1122\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cache_dir/file_fetcher/mod.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"590488981cfe2d4253f54f921ad04b6f8f1e885d13cb468f5447b1aa82b4920d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/config/workspace/discovery.rs:858-872 | libs/config/workspace/discovery.rs:922-936 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/config/workspace/discovery.rs:858\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/discovery.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"807d3b80ed71a6863ba1633238798046998ad6ced8cd9f9b0351179f5f06b43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/core/modules/map/dynamic.rs:117-131 | libs/core/modules/map/dynamic.rs:148-162 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/modules/map/dynamic.rs:117\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map/dynamic.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"852550d695874c8c90e3b90fca7ac208bfcc36fe1d7ceefa2829fe0bc0c6d80b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/core/ops_builtin_v8.rs:864-878 | libs/core/ops_builtin_v8.rs:970-984 \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/core/ops_builtin_v8.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7fa928220b0a995907cb48e41dfca15073d3e0d0e72f0ef1d6fcc14dc3dd5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1702-1721 | libs/core/uv_compat/pipe.rs:2117-2131 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1702\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/core/uv_compat/pipe.rs:1699\u0060 calls \u0060is_some\u0060 and \u0060libs/core/uv_compat/pipe.rs:2114\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda02425aef89521483f1974cdb02c8a331ac58aa3c0ecd40141994d01bdbc78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/dcore/src/inspector_server.rs:335-349 | libs/inspector_server/lib.rs:693-707 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:335\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be8c811107963e01ffe256affd55eb50311c7960f16a67d580f46a8ee0c9ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/eszip/v2.rs:293-307 | libs/resolver/workspace.rs:1855-1869 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v2.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7702c54ac73a37a1af656bbf9e44906fc11d13a99d72fc0ff478fea9d3d01e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): libs/http_h1/write.rs:91-105 | libs/http_h1/write.rs:121-134 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/write.rs:91\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060response\u0060 to \u0060ResponseHeaderFast\u003C\u0027_\u003E\u0060 in one and \u0060ResponseContentTypeFast\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/write.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"079663b2efd2b24e5066332908f05aeb49986c11e437fb789f96b07d102e890b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/ops/conversion/from_v8/enum.rs:177-191 | libs/ops/conversion/to_v8/enum.rs:363-377 \u2014 \u0060libs/ops/conversion/from_v8/enum.rs\u0060 and \u0060libs/ops/conversion/to_v8/enum.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 54 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/conversion/from_v8/enum.rs:177\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/enum.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3bdf4fa2d619460e3c05a00684933b715a80b495c89ae433473914ea430d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): libs/ops/conversion/from_v8/struct.rs:96-110 | libs/ops/conversion/to_v8/struct.rs:116-129 \u2014 \u0060libs/ops/conversion/from_v8/struct.rs\u0060 and \u0060libs/ops/conversion/to_v8/struct.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/conversion/from_v8/struct.rs:96\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/struct.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3caaa43d227875326a86248ae8f6094a66d37d89fb0382dae2c9cb233ba0adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/ops/conversion/from_v8/struct.rs:279-299 | libs/ops/conversion/to_v8/struct.rs:260-280 \u2014 \u0060libs/ops/conversion/from_v8/struct.rs\u0060 and \u0060libs/ops/conversion/to_v8/struct.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/struct.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9fdff9520f3e40b72d282eb5b7413e272ce47d0b156310d8fd2ef9d8334fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/resolver/deno_json.rs:1305-1319 | libs/resolver/deno_json.rs:1331-1345 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/resolver/deno_json.rs:1305\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/deno_json.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31d4b0bda6448869e3ce7f65c73459c91dcfbfd510e2f368bbbefa19030e72c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): runtime/cpu_profiler/cpuprof.rs:206-220 | runtime/cpu_profiler/cpuprof.rs:381-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/cpu_profiler/cpuprof.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060runtime/cpu_profiler/cpuprof.rs:221\u0060 calls \u0060display_function_name\u0060 and \u0060runtime/cpu_profiler/cpuprof.rs:396\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/cpu_profiler/cpuprof.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e1e8942ba64b3589587c937f88d1b618891d37f72eec362d93deff68db303e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 6): cli/lsp/completions.rs:588-601 | cli/lsp/completions.rs:639-651 | cli/lsp/completions.rs:679-691 | cli/lsp/completions.rs:749-762 | cli/lsp/completions.rs:798-810 | cli/lsp/completions.rs:838-850 \u2014 all 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/completions.rs:588\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/completions.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c9463596e66676edddbc6c61eacf4406b5a6470b7f4ebf48e56b5658b6a9f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): cli/lsp/language_server.rs:2754-2767 | cli/lsp/language_server.rs:2841-2854 | cli/lsp/language_server.rs:2883-2896 | cli/lsp/language_server.rs:3220-3233 | cli/lsp/language_server.rs:3385-3398 | cli/lsp/language_server.rs:3594-3607 \u2014 all 6 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060DocumentHighlightParams\u0060 in one and \u0060GotoDefinitionParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"d535bb146336b17ae77a44243583f6d7c94f7cfe339c187d5baa976578f91840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): ext/napi/js_native_api.rs:1260-1273 | ext/napi/js_native_api.rs:1307-1320 | ext/napi/js_native_api.rs:1354-1367 | ext/napi/js_native_api.rs:1844-1857 | ext/napi/js_native_api.rs:1895-1908 | ext/napi/js_native_api.rs:1942-1955 \u2014 all 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/napi/js_native_api.rs:1260\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58b978708f47208eb08917e028f5b2c04bef7275c2ba82abd9e396f2caea47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): cli/tools/desktop.rs:438-451 | cli/tools/desktop.rs:661-674 | cli/tools/desktop.rs:738-751 \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":"cli/tools/desktop.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca4bc86cdbf502616ce42ff4163a56f335d4d3ef570bfc5e2dba1a3bbe10314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): ext/net/ops_tls.rs:390-402 | ext/net/ops_tls.rs:533-546 | ext/node/ops/tls.rs:754-766 \u2014 before extracting anything, compare \u0060ext/net/ops_tls.rs\u0060 and \u0060ext/node/ops/tls.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/net/ops_tls.rs:390\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops_tls.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d0671bb5d88061570f06d6ff77d09b44b684031fff7097378b1784a2087bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): ext/node/ops/zlib/mod.rs:747-760 | ext/node/ops/zlib/mod.rs:1280-1292 | ext/node/ops/zlib/mod.rs:1492-1504 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/zlib/mod.rs:747\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"19da903f92f9b7d97a8f9e3e1638e7a9edf060c1bf187f8f0177d7269dbcf850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): ext/web/console/inspect.rs:1300-1312 | ext/web/console/inspect.rs:1425-1438 | ext/web/console/inspect.rs:1567-1579 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/console/inspect.rs:1300\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b2b987cb39064f64119946beb2ef8719ed049f0e91748bfd8287be6caef9e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/lib/worker.rs:486-499 | cli/lib/worker.rs:736-749 \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":"cli/lib/worker.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eef8e9540b628ffec945107bc93806738f86d5d1e0cd0b6f42d1561609d386c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/lsp/language_server.rs:2797-2810 | cli/lsp/language_server.rs:3425-3438 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060ReferenceParams\u0060 in one and \u0060RenameParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"99af5a4d41531d83a3d069ca0aedf8762a9900ddb87f4a395feac6b69994bcfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/lsp/language_server.rs:3300-3313 | cli/lsp/language_server.rs:3343-3356 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060CallHierarchyIncomingCallsParams\u0060 in one and \u0060CallHierarchyOutgoingCallsParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":3300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fe841c2fb8ea7bdf73e3a46f641463344d51e29653708a225793cb408bf400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/lsp/language_server.rs:3512-3525 | cli/lsp/language_server.rs:3549-3562 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060SemanticTokensParams\u0060 in one and \u0060SemanticTokensRangeParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":3512}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7e351aea051639f7662e2733e15d61280169f3893794c682f283ea5b7f611b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): cli/lsp/registries.rs:834-847 | cli/lsp/registries.rs:972-984 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/registries.rs:834\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/registries.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a783edc607f9c8856695922e355dbd968b343f6664caa023fc823aa7aff0589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/lsp/testing/execution.rs:808-821 | cli/lsp/testing/execution.rs:997-1010 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/testing/execution.rs:808\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/testing/execution.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7a8535fee9ccc96f75a84a86555c6cecc16a2bd35f70ab4aa957d35197f81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/rt/run.rs:1624-1637 | libs/resolver/workspace.rs:1276-1289 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/rt/run.rs:1624\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/run.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c867b6c8d8a1ffe49e0a1b1f97f431b018240d1b09ab59b302538a821ddf6eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/tools/pm/list.rs:321-334 | cli/tools/pm/outdated/mod.rs:280-293 \u2014 before extracting anything, compare \u0060cli/tools/pm/list.rs\u0060 and \u0060cli/tools/pm/outdated/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pm/list.rs:321\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/list.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b090b38ef6b949a3107964af188f0a7738ed3cc85cb35c947f0d621512f80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/tools/repl/session.rs:644-657 | cli/tools/repl/session.rs:669-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/repl/session.rs:644\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/session.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5bdd550ea457aeed7c0ca1424b70bb0452eeeeea1f24e5fbfe7e8c5dc3dd90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): cli/tools/run/mod.rs:302-315 | cli/tools/serve.rs:186-198 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/run/mod.rs:302\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/run/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"017c15b3d266e5fef7b4a8af9e154dc4b87e86cec98703d713f2c6e3d36a1e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201314 lines \u00D7 4): ext/crypto/lib.rs:390-393 | ext/crypto/lib.rs:406-409 | ext/crypto/lib.rs:423-436 | ext/crypto/lib.rs:694-707 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/lib.rs:390\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/lib.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da9876c7fcacaee21babb188d1593e0dc1b8b810157e16a1dab5fb83ded715f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:262-274 | ext/crypto/subtle_encrypt.rs:317-330 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:262\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f0d67885f178519cb2179b3968941e6c4dd0e94ed298b14c1657f5a911f179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/crypto/subtle_get_public_key.rs:74-87 | ext/crypto/subtle_get_public_key.rs:117-130 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_get_public_key.rs:74\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_get_public_key.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3e85361ecc7600cf9e24a24e2bf202442db2772d1e88f672ed1ba1238c7f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): ext/crypto/subtle_wrap_key.rs:387-400 | libs/core/modules/import_graph.rs:186-198 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_wrap_key.rs:387\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/modules/import_graph.rs:199\u0060 calls \u0060push\u0060 and \u0060ext/crypto/subtle_wrap_key.rs:400\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_wrap_key.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"084caae40af715cf667fa5f1b35faf18f1030f62a6b8b57ed5bca21476cc1d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/ffi/ir.rs:647-660 | ext/ffi/ir.rs:730-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/ffi/ir.rs:647\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/ffi/ir.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"76356a35872ce635dfaca9513eb60c8fb1004af6e38d65aaec8fab6ed45fb775"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): ext/http/http_next.rs:5512-5522 | ext/http/http_next.rs:5581-5594 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:5512\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":5512}}}],"partialFingerprints":{"codehealthFindingId/v1":"080bddf79d2bb54945a258bd4ff80dd5d495d3035c1c320510756591f10f42ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/node/ops/fs.rs:68-81 | ext/process/lib.rs:105-118 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1862e37f1a0cf89e54d847361fabdf402e9eba1030412f596d52c50b7f91dc8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/node/ops/fs.rs:377-390 | ext/node/ops/fs.rs:438-451 \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":"ext/node/ops/fs.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd1e41f4a11384562ee875b8909b4c36b827bc4977954eec89655b76214c081"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/node/ops/fs.rs:395-408 | ext/node/ops/fs.rs:456-469 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/node/ops/fs.rs:471\u0060 calls \u0060borrow_mut\u0060 and \u0060ext/node/ops/fs.rs:410\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"052da8682edac474be0d9662ecfc032e108102ef2b08f91448712a739a5cbbdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/node/ops/fs.rs:3160-3173 | ext/node/ops/fs.rs:3389-3402 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:3160\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2c4cd4155941a2f7b38f0c8228d092518774c83c8e26a38f59314d3d7bb6bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/node/ops/process.rs:539-552 | ext/os/lib.rs:716-729 \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":"ext/node/ops/process.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ce35e5a7b547a3bd1df2ddf19de00364c58c29ba09455bf5f07b2f7ce1f5f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201314 lines \u00D7 4): ext/node/ops/llhttp/binding.rs:751-754 | ext/node/ops/stream_wrap.rs:698-701 | ext/node/ops/stream_wrap.rs:953-966 | ext/node/ops/stream_wrap.rs:1021-1034 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10a8de4223db4934532a3a06121197fa439c5372845f76241533395df65bd74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/node_crypto/cipher.rs:70-83 | ext/node_crypto/cipher.rs:216-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eae2079ada7e8c203a73ca1b4277d63f1b515e071adb7f6024a0bf5a6db79be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/process/lib.rs:848-861 | ext/process/lib.rs:978-991 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/process/lib.rs:845\u0060 calls \u0060push\u0060 and \u0060ext/process/lib.rs:975\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/lib.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c92dd8cd001ca78c6e3595f6898fe1baf1a220a7d0d60d6561c8a6e345933cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/web/console/mod.rs:841-854 | ext/web/console/mod.rs:875-888 \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":"ext/web/console/mod.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ac6f7d6f12d165ba4f07731081a485d1ef4e30e198c0f2c41c6a9fd9048649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/web/geometry.rs:1022-1035 | ext/web/geometry.rs:1091-1104 \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":"ext/web/geometry.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"433ac55e8203615af1875e3e1f726e123b6e847ccc254cfdfc3f40d1fdf8433d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/web/url.rs:96-109 | ext/web/url.rs:365-378 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/url.rs:96\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/url.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c7c77707a61a37d4b90cd35d784be9e64f4fafe9103a5f23228559c178208b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/webgpu/webidl.rs:53-66 | ext/webgpu/webidl.rs:163-176 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/webgpu/webidl.rs:53\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/webidl.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8fae207d305c4c945bb3f81eeb4b0192fb4caa172a88c5f6c86935d7bceec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/config/workspace/discovery.rs:384-397 | libs/config/workspace/discovery.rs:478-491 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/discovery.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a79972036094328944fa1c548c009f7850c8120b692bc249b83505a5cc6cab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/core/runtime/op_driver/futures_unordered_driver.rs:155-168 | libs/core/runtime/op_driver/futures_unordered_driver.rs:197-210 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/runtime/op_driver/futures_unordered_driver.rs:155\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/op_driver/futures_unordered_driver.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b90fc8e3f2cf9ffbe57bcb37ef71445505cf32d6f6372471c442186b1a908c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/core/uv_compat/pipe.rs:194-207 | libs/core/uv_compat/tcp.rs:559-572 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:194\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcad9ccc8cead8899683a0c971608bf6159ec89bc62fc98c41265a0f24061975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1686-1699 | libs/core/uv_compat/pipe.rs:2102-2115 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1686\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/uv_compat/pipe.rs:1700\u0060 calls \u0060is_some\u0060 and \u0060libs/core/uv_compat/pipe.rs:2116\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"5733992e579c4bf728d827e538a751d53d68af32be7e492473b59cb20a4af6e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): libs/dcore/src/inspector_server.rs:351-368 | libs/inspector_server/lib.rs:709-727 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:351\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"464a9cbb5a4296301c7bdee4d69caee6a59052b7d30ad0e357252e5130352af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/eszip/v2.rs:895-908 | libs/eszip/v2.rs:910-923 \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/eszip/v2.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07b3a1079ce9fe418aad2a27ecc044f870bf39c5f9d0b79d9c319111781747d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/http_h1/conn.rs:1219-1232 | libs/http_h1/conn.rs:1273-1286 \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/http_h1/conn.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e45ef46a409af3415314b929264046d7b73bdaf06f16cf8a997e7214dacacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/http_h1/write.rs:436-449 | libs/http_h1/write.rs:505-518 \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/http_h1/write.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc780e35c3329c6b3d5d648188566fd3fe75653c44ae8a7156d1356f9568c85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): libs/npm_installer/global.rs:256-269 | libs/npm_installer/local.rs:1459-1471 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/global.rs:256\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/global.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"66568d71647940c0be30f5639481206f55b42e078f2c9f887b472ae7fd85a111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/npm_installer/hoisted.rs:378-391 | libs/npm_installer/local.rs:226-239 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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":"libs/npm_installer/hoisted.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dcc92b953c6c6a434f7ed5f6c014d392ef6e340d52d919ac2698e0cb90963f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): libs/npm_installer/hoisted.rs:754-767 | libs/npm_installer/local.rs:1112-1124 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/hoisted.rs:754\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/npm_installer/local.rs:1126\u0060 calls \u0060as_ref\u0060 and \u0060libs/npm_installer/hoisted.rs:769\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fee1010054ca9fc70a6c9cb255ba64271bb3e88166c1693fc2cea0f8da5e130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/npm_installer/lib.rs:224-237 | libs/npm_installer/lib.rs:244-257 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/lib.rs:224\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/lib.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5e4f08ff15c17fb799b67230a2da37dd624e1f17dadc1e413b94ab982f3bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): ext/node_sqlite/statement.rs:1095-1107 | ext/node_sqlite/statement.rs:1113-1125 | ext/node_sqlite/statement.rs:1131-1143 | ext/node_sqlite/statement.rs:1149-1161 | ext/node_sqlite/statement.rs:1167-1179 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/statement.rs:1095\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/statement.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e79cd345ba14fdebce2750eb16ebaa817f1a7644a408228dd8c766a551f1c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): cli/lsp/lint.rs:254-266 | cli/lsp/lint.rs:308-320 | cli/lsp/lint.rs:381-393 | cli/lsp/lint.rs:405-417 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/lint.rs:254\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/lint.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3fc9f7441dc82b2c6b80b180ca994b2916114eba75fbca9c04045771a17df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): ext/node/ops/wasi.rs:1511-1523 | ext/node/ops/wasi.rs:1538-1550 | ext/node/ops/wasi.rs:1565-1577 | ext/node/ops/wasi.rs:1742-1754 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/node/ops/wasi.rs:1739\u0060 calls \u0060Some\u0060, \u0060read_string\u0060 and \u0060ext/node/ops/wasi.rs:1510\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15768d0a281d6f6e72ad5e999a37a38945d765fe9c21483862cf5636de158f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): libs/resolver/bun_lockfile_import.rs:117-129 | libs/resolver/npm_lockfile_import.rs:183-195 | libs/resolver/pnpm_lockfile_import.rs:129-140 | libs/resolver/yarn_lockfile_import.rs:99-111 \u2014 before extracting anything, compare \u0060libs/resolver/bun_lockfile_import.rs\u0060 and \u0060libs/resolver/npm_lockfile_import.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/resolver/bun_lockfile_import.rs:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/bun_lockfile_import.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"615fc552183496460f50bd186ef7056e35a99e549f3405af89c41f0c4e4bb437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): cli/lsp/tsc.rs:565-577 | cli/lsp/tsc.rs:1268-1280 | cli/lsp/tsc.rs:1549-1561 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/tsc.rs:565\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"932972843c27f94d2456148f7c7a7e9ec7ab960f221211be0466aa36f84641b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): ext/node/ops/tls_wrap.rs:4921-4934 | ext/node/ops/tls_wrap.rs:5446-5459 | ext/node/ops/tls_wrap.rs:5489-5502 \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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4921}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3c86ca74af76e30278af0175465b86201a74bf3157f3ec97008f4a0c392743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): ext/node_sqlite/database.rs:2367-2379 | ext/node_sqlite/database.rs:2473-2485 | ext/node_sqlite/database.rs:2675-2687 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/database.rs:2367\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abd52994365813aa63e966b5223f6c4a45368e3fcf2f567df5f82cab17643f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): libs/http_h1/protocol.rs:95-106 | libs/http_h1/protocol.rs:124-136 | libs/http_h1/protocol.rs:150-162 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/protocol.rs:95\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/protocol.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"276ca75434e888a00f3ce671efa9ead5449488ff008893d20556144aba6aa0ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): libs/ops/conversion/from_v8/enum.rs:175-187 | libs/ops/conversion/to_v8/enum.rs:345-357 | libs/ops/conversion/to_v8/enum.rs:361-373 \u2014 \u0060libs/ops/conversion/from_v8/enum.rs\u0060 and \u0060libs/ops/conversion/to_v8/enum.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 54 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/conversion/from_v8/enum.rs:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/enum.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8f6e6b2b46467176309b74310701d787681d4fa3dde621c953e238e9d940fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): libs/ops/conversion/from_v8/struct.rs:201-213 | libs/ops/conversion/to_v8/struct.rs:192-204 | libs/ops/webidl/dictionary.rs:225-237 \u2014 \u0060libs/ops/conversion/from_v8/struct.rs\u0060 and \u0060libs/ops/conversion/to_v8/struct.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/conversion/from_v8/struct.rs:201\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/struct.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"508902bec927916098baf3f1a460cb22250ee97f722d1c06903aa4dfcbdd187a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): cli/module_loader.rs:1501-1513 | cli/rt/run.rs:976-990 \u2014 before extracting anything, compare \u0060cli/module_loader.rs\u0060 and \u0060cli/rt/run.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/module_loader.rs:1501\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ebcb44baca040bc99566f96683bec17ffad63216bb08e1b3aa52691c20c506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): cli/tools/bundle/mod.rs:526-538 | cli/tools/transpile.rs:198-208 \u2014 before extracting anything, compare \u0060cli/tools/bundle/mod.rs\u0060 and \u0060cli/tools/transpile.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/bundle/mod.rs:526\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/mod.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"537e3f0782a29f0375dc6a6019116fb71f44ec0d521e82a37c6709975dd3dd6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): cli/tools/lint/ast_buffer/swc.rs:1443-1455 | cli/tools/lint/ast_buffer/swc.rs:1472-1484 \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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ca3d8734879e2cf9a514667ac10fb36eb7315931df2cb36cc29e2f646149e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): cli/tools/pack/mod.rs:509-521 | cli/tools/publish/paths.rs:331-342 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pack/mod.rs:509\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/mod.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc73a60a2906544a076225a1577a838ef5c6488191be03ca83532a3c00cc1179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/crypto/shared.rs:243-255 | ext/crypto/shared.rs:382-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/shared.rs:243\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/shared.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c4999dc83351df31bb22f98525af6731752aa8cf16db34079c9a8911b55c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:321-333 | ext/crypto/subtle_encrypt.rs:377-389 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"945727d07bc71201a7b05e4629c57e4c2887bb3e761e37d867120b1bc6cb302e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/crypto/subtle_export_key.rs:749-761 | ext/crypto/subtle_export_key.rs:829-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_export_key.rs:749\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4b9d622d7aa775dda1e067e9a982c43a2a390086ae5457169da466c4ec5df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/crypto/subtle_import_key.rs:1131-1143 | ext/crypto/subtle_import_key.rs:1151-1163 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:1131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b1d6a59814bd52aa0aa4902f3aff38dece18c837ac0c9e0c61a1deeeb47afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/http/http_next.rs:2767-2779 | ext/http/lib.rs:1467-1479 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78a36df786ce05b487ae5901b7ed376c4989b1e638be730fed24cb8343e4db7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/http/http_next.rs:3648-3660 | ext/http/http_next.rs:3977-3989 \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":"ext/http/http_next.rs"},"region":{"startLine":3648}}}],"partialFingerprints":{"codehealthFindingId/v1":"c025be952410d26d671698222f34e7158bb85f82437bd6c1dc7d643354eb58b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): ext/http/http_next.rs:4599-4611 | ext/http/http_next.rs:4974-4985 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:4599\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":4599}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f84a2459c6a2459feba6ffc7a01291b377d7131e7989f01cc79cb9e306d69fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): ext/http/http_next.rs:5468-5490 | ext/http/http_next.rs:5550-5572 \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":"ext/http/http_next.rs"},"region":{"startLine":5468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aaaf441d1be05ddcb51a379c084e4833d45fb7ef59d3195809625f242d25915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/http/response_body.rs:177-189 | ext/http/response_body.rs:195-207 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/response_body.rs:177\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/response_body.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"982e209145c5206636a959a261086640a5f9505a4ef10d6e6dcf671a6ddce8f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/kv/lib.rs:357-369 | ext/kv/lib.rs:898-910 \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":"ext/kv/lib.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"731fce820290ecfb7e19a3360e372cd0854423d3f08139c9b39b869b3340c7b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node/ops/dns.rs:144-156 | ext/node/ops/dns.rs:235-247 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/dns.rs:144\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/dns.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"943de125aaf8dd374ce039f27884651c8d9e3065f9b72053ba31c2f67c9a6a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node/ops/fs.rs:682-694 | ext/node/ops/fs.rs:720-732 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:682\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"3365145522ffc795d24cd32e34bbbaebb5a4a75cb8eec41b47daefedcb08efe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node/ops/fs.rs:1516-1528 | ext/node/ops/fs.rs:1696-1708 \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":"ext/node/ops/fs.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce25020fee705577f1518cc1905020a1b61651f7c615a71b67e6e185073fbd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): ext/node/ops/http2/session.rs:1043-1054 | ext/node/ops/http2/session.rs:1119-1131 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/http2/session.rs:1119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"454f928983795bb966cbf69f5732ddddada47ed98284095bfd0bd035607ca1cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node/ops/http2/session.rs:2982-2994 | ext/node/ops/http2/stream.rs:591-603 \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":"ext/node/ops/http2/session.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b79b70a281223657e2e84ee8095e1e19dcc95ec4c34c7bad23f05d5b6090a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): ext/node/ops/llhttp/binding.rs:327-343 | ext/node/ops/llhttp/binding.rs:669-685 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/llhttp/binding.rs:327\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0999cb9930268540269380e5f047e9410a2099521aea79416d05dc27a8b0aed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node/ops/wasi.rs:2153-2165 | ext/node/ops/wasi.rs:2218-2230 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/wasi.rs:2153\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"be46cfd80e9883b6a8dec7d4a816dda1665aa0cc823d7f09f2f372f611408a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node_crypto/cipher.rs:872-884 | ext/node_crypto/cipher.rs:891-903 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:872\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf55d0be75319603d497d11576cdfc1b53bb28bdaba4f9d5156ea9c8390c5d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node_crypto/cipher.rs:1328-1340 | ext/node_crypto/cipher.rs:1347-1359 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:1328\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc98a960de8b608f856f2d21fdea98e12dbf3b0c103d2e021e485ace1c7fbfe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node_crypto/cipher.rs:1651-1663 | ext/node_crypto/cipher.rs:1665-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"da26276a5c51002e872a3e1912cc97e5a4673eeaa00c5c919734532698dfd3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node_crypto/keys.rs:1562-1574 | ext/node_crypto/keys.rs:1590-1602 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/keys.rs:1562\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/keys.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efe2bd57fd1617a7fbe32ef0e3a5a373fa1aa3e173fcce0cd3adaa9d64219bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node_crypto/sign.rs:332-344 | ext/node_crypto/sign.rs:541-553 \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":"ext/node_crypto/sign.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c4d837039d88fcff1ba5019246635bace71e81e4a79af904f293a66825da5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/web/console/error_fmt.rs:53-65 | ext/web/console/error_fmt.rs:69-81 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/console/error_fmt.rs:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/error_fmt.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"286da05c970b85470d57881be90a6df24b9bfd8557bffca222b976bb23af1b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/webgpu/device.rs:546-558 | ext/webgpu/device.rs:571-583 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/webgpu/device.rs:546\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/device.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"652dafa95512160061d8bd3cc5f80700f9769fdd714dba17ac9ae409ef34e63b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/cli_parser/src/convert.rs:2983-2995 | libs/node_shim/lib.rs:3089-3101 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cli_parser/src/convert.rs:2983\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":2983}}}],"partialFingerprints":{"codehealthFindingId/v1":"e379b2b800898b51b11661fa1845d902b6faf8caadd9c5a36e85696d9346ee0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/core/runtime/stats.rs:479-491 | libs/core/runtime/stats.rs:496-508 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/runtime/stats.rs:479\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/stats.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f245f4d663351936afe3f8934c4c15461d5831e1a962da7d95a2e3293b97034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/core/uv_compat.rs:1104-1116 | libs/core/uv_compat.rs:1159-1171 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat.rs:1104\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/core/uv_compat.rs:1101\u0060 calls \u0060Some\u0060 and \u0060libs/core/uv_compat.rs:1157\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6631f9a60bfca31f199a56f2c06e2bfe2bf658035c42a2f1202987d64a0b21bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1656-1665 | libs/core/uv_compat/tty.rs:2333-2345 \u2014 before extracting anything, compare \u0060libs/core/uv_compat/pipe.rs\u0060 and \u0060libs/core/uv_compat/tty.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1656\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/uv_compat/tty.rs:2347\u0060 calls \u0060io_error_to_uv\u0060 and \u0060libs/core/uv_compat/pipe.rs:1666\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e909d4aad6bf8016bafe0393d5ab8d96ab3abdf3384dcbd0038933258db2fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/core/uv_compat/stream.rs:138-150 | libs/core/uv_compat/tcp.rs:1195-1207 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/stream.rs:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/stream.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0953f1fc355b05517e96d0b62b432bf251e1e15ed64aeedf878e51cf159e1723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): libs/core/uv_compat/stream.rs:304-315 | libs/core/uv_compat/stream.rs:346-358 \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/core/uv_compat/stream.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b70aca9f2bd15598811140ca914b2d26620476d29855f4a972f735fd33681a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/core/uv_compat/tcp.rs:441-453 | libs/core/uv_compat/tcp.rs:459-471 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/tcp.rs:441\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tcp.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f1be445e7d38ecce0ed08beb97f092a15d7eab611652d63cad0f97d941b115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/eszip/v2.rs:1168-1180 | libs/eszip/v2.rs:1183-1195 \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/eszip/v2.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f168fda7711bbf2edd89e857336b7e218a39cffc7f20d208bbc4855914f3e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/http_h1/conn.rs:539-551 | libs/http_h1/conn.rs:557-569 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/conn.rs:539\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"640961b6e6296bcc66a7090fbe3b5198afa80d77ea0399800e9e955d2ddf312b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/lockfile/lib.rs:1169-1181 | libs/lockfile/lib.rs:1257-1269 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/lockfile/lib.rs:1169\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/lockfile/lib.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2374a46c84858762f075893a3e55ebb7b84e33c8644c25f2ee965ec48b5bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/npm_installer/local.rs:589-603 | libs/npm_installer/local.rs:637-649 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/local.rs:589\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/local.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79192ed9f6a1b8b787571e3543e02de24584bd6ab124b2c753ae60832cd9695"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): libs/npmrc/lib.rs:273-284 | libs/npmrc/lib.rs:298-310 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npmrc/lib.rs:298\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npmrc/lib.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c3a65f6dc8ee8386a28317d89e6475e8bae9eeae1d53cbba06d3b3dad4fb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/resolver/workspace.rs:1397-1409 | libs/resolver/workspace.rs:1454-1466 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/resolver/workspace.rs:1397\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/workspace.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9922d68e6ee691d2fb404019956279b2c21417c69b97d99017560865f6b9ecd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): runtime/permissions/lib.rs:4453-4465 | runtime/permissions/lib.rs:4491-4503 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/permissions/lib.rs:4453\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":4453}}}],"partialFingerprints":{"codehealthFindingId/v1":"380114d1771902f0f618fa062f5f0f291350d1f8001b405a0942e0ceeb5e466a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 11): cli/lsp/language_server.rs:1835-1846 | cli/lsp/language_server.rs:2756-2767 | cli/lsp/language_server.rs:2799-2810 | cli/lsp/language_server.rs:2843-2854 | cli/lsp/language_server.rs:2885-2896 | cli/lsp/language_server.rs:3222-3233 | cli/lsp/language_server.rs:3265-3276 | cli/lsp/language_server.rs:3387-3398 | cli/lsp/language_server.rs:3427-3438 | cli/lsp/language_server.rs:3472-3483 | cli/lsp/language_server.rs:3596-3607 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/language_server.rs:1835\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d7f7bb14c4d73f3a386ffe98dd33d9165448575f07c08ccab445cb2cc6c157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): cli/lsp/language_server.rs:1833-1844 | cli/lsp/language_server.rs:2205-2216 | cli/lsp/language_server.rs:2652-2663 | cli/lsp/language_server.rs:3263-3274 | cli/lsp/language_server.rs:3470-3481 | cli/lsp/language_server.rs:4609-4620 | cli/lsp/language_server.rs:4785-4796 \u2014 all 7 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060DocumentSymbolParams\u0060 in one and \u0060CodeLensParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060cli/lsp/language_server.rs:4797\u0060 calls \u0060snapshot\u0060 and \u0060cli/lsp/language_server.rs:1845\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b834a8817102623b8435843480e9fe982201edfa343d140f5035b3447184e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 5): ext/node_crypto/lib.rs:1361-1372 | ext/node_crypto/lib.rs:1384-1394 | ext/node_crypto/lib.rs:1406-1416 | ext/node_crypto/lib.rs:1428-1438 | ext/node_crypto/lib.rs:1450-1460 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/lib.rs:1361\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/lib.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d61fe47a2e36f81dfaefe99374ee2bdaaecdc5471e4119121b71a2f8a7a8f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): ext/node/ops/stream_wrap.rs:1487-1498 | ext/node/ops/stream_wrap.rs:1968-1979 | ext/node/ops/stream_wrap.rs:2054-2065 | ext/node/ops/tls_wrap.rs:2187-2198 \u2014 before extracting anything, compare \u0060ext/node/ops/stream_wrap.rs\u0060 and \u0060ext/node/ops/tls_wrap.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/stream_wrap.rs:1487\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"51627ecdfaec1cf3939ed026d69931fb597fa1f0a4c866a4f9d2d2a5ef8edb03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): runtime/permissions/lib.rs:2524-2535 | runtime/permissions/lib.rs:2543-2554 | runtime/permissions/lib.rs:2562-2573 | runtime/permissions/lib.rs:2581-2592 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/permissions/lib.rs:2524\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060other\u0060 to \u0060\u0026Self::AllowDesc\u0060 in one and \u0060\u0026Self::DenyDesc\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6b18d89d5a090216c4fe6ae454825187e8bb2dc9afb170f0a3aa84b55a086e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): cli/lsp/ts_server.rs:719-730 | cli/lsp/ts_server.rs:810-821 | cli/lsp/ts_server.rs:938-949 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/ts_server.rs:719\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/ts_server.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"38902afb60d1a878d5775a3bd17f3aa1e03566c95e45f283cffcc4cd2fbbf6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): cli/rt/hmr.rs:227-238 | cli/tools/repl/session.rs:249-260 | cli/tools/run/hmr.rs:119-130 \u2014 before extracting anything, compare \u0060cli/rt/hmr.rs\u0060 and \u0060cli/tools/run/hmr.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/rt/hmr.rs:227\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/hmr.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef930d35250c152c92e4486fda2e03e0ea196b4009279290543bd220414d51d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): cli/tools/pm/list.rs:316-327 | cli/tools/pm/mod.rs:1266-1277 | cli/tools/pm/outdated/mod.rs:275-286 \u2014 before extracting anything, compare \u0060cli/tools/pm/list.rs\u0060 and \u0060cli/tools/pm/outdated/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pm/list.rs:316\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/list.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d369bf430ec19f9efb7773938bf66a6e08f25e763a2ed6c9f0448f393f67f727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): ext/crypto/subtle_export_key.rs:763-774 | ext/crypto/subtle_export_key.rs:843-854 | ext/crypto/subtle_export_key.rs:917-928 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_export_key.rs:763\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3d854c982b6dc5acab7996b2e70a843b0471b8c662b21faa908bb4317bdee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): ext/webgpu/compute_pass.rs:233-244 | ext/webgpu/render_bundle.rs:229-240 | ext/webgpu/render_pass.rs:306-317 \u2014 before extracting anything, compare \u0060ext/webgpu/compute_pass.rs\u0060 and \u0060ext/webgpu/render_bundle.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/webgpu/compute_pass.rs:233\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/compute_pass.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da682a5601481a8a151a76a40f3504382568d52f281bdb423f66c978eb877ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): ext/webgpu/webidl.rs:45-56 | ext/webgpu/webidl.rs:155-166 | ext/webgpu/webidl.rs:250-261 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/webgpu/webidl.rs:45\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/webidl.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d213570839ec3e12481c1e22346aeec9b0cb0bc7ca973a50e7fe8b4739ce4fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): libs/config/deno_json/mod.rs:671-682 | libs/config/deno_json/mod.rs:773-784 | libs/config/deno_json/mod.rs:864-875 \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":"libs/config/deno_json/mod.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"de87f9b34d312f1d173b9c7ccbb621d095ded0a0117c800deb47988fa42cb5d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): libs/node_resolver/resolution.rs:1413-1424 | libs/node_resolver/resolution.rs:1517-1527 | libs/node_resolver/resolution.rs:1531-1541 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/node_resolver/resolution.rs:1413\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"e184c4c224d4efe0b592d84a66f820a36cd5d4aa4b8c8bbb86e0d66644c43825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/lib/worker.rs:1030-1041 | cli/worker.rs:264-275 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lib/worker.rs:1030\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lib/worker.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b81891f735f80f9e6118cf54a96b2d24b7fbbd2caf214c9066650269311c990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/lsp/diagnostics.rs:1293-1304 | cli/lsp/diagnostics.rs:1348-1359 \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":"cli/lsp/diagnostics.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e33d3e3b38c8d1699faf802728454aa11b0c837f0a9b0bf7ae82ac2d3f2818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/lsp/documents.rs:679-690 | cli/lsp/documents.rs:737-748 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/documents.rs:679\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/documents.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c486478aac14afb2575d52f55088a474b100c9cdbaf0aa666b29a7a486714991"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/lsp/performance.rs:166-177 | cli/lsp/performance.rs:198-209 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/performance.rs:166\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/performance.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"347f143b12b09858400cd722aa2c5296428a06aa0bcac07d682414a721f7a115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/lsp/tsc.rs:1645-1656 | cli/lsp/tsc.rs:1676-1687 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/tsc.rs:1645\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"002c0d8bb3c952e1a6d36ecf29dc2f69740bb51f5a92e7a85c84ffd465aa201d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/rt_desktop/lib.rs:1040-1051 | cli/rt_desktop/lib.rs:1092-1103 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/rt_desktop/lib.rs:1040\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt_desktop/lib.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"078312c21510661ad5ad903aaf46efcc827222c25df5cdd749fd86f03ea50141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/tools/bump_version.rs:37-48 | cli/tools/pm/mod.rs:97-108 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/bump_version.rs:37\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bump_version.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9ec2e4486990383b29912226b3fae01a5357e968d25d2bf032c086bf460b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): cli/tools/desktop.rs:4184-4194 | cli/tools/desktop.rs:4204-4215 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:4184\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":4184}}}],"partialFingerprints":{"codehealthFindingId/v1":"609fd026ee63485c09d68679c10dafa0f0c5c15f17fe75b2d8f6fe2846cc32cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/tools/pm/mod.rs:1147-1158 | cli/tools/pm/mod.rs:1165-1176 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pm/mod.rs:1147\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/mod.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadb8b353c9cf241a94d9a28ad789dca37b2cf31e1e72e0665ae7733a27ab961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): cli/tools/repl/mod.rs:335-345 | cli/tools/repl/mod.rs:393-404 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/repl/mod.rs:393\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/mod.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fca8f5c1399713f75b903dc5053777a0790e608e90cefab946272f497d043f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/crypto/digest.rs:396-407 | ext/crypto/subtle_sign.rs:332-343 \u2014 before extracting anything, compare \u0060ext/crypto/digest.rs\u0060 and \u0060ext/crypto/subtle_sign.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/digest.rs:396\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/digest.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"77335c37be163bfbd7f35cf6456f28f7ef1e5220048c1cddb7b756e42c8c2f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/crypto/import_key.rs:890-901 | ext/crypto/import_key.rs:906-917 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/import_key.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"9660537b7bc292ca3bec5816d3b05e8928e3c6517d3db51a091cc5250791c965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/crypto/subtle_derive_bits.rs:355-366 | ext/crypto/subtle_key.rs:73-84 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_derive_bits.rs\u0060 and \u0060ext/crypto/subtle_key.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_derive_bits.rs:355\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a327a55fe17a490eb948defef3f12cc956b2e146f6ce663be0a201807548c579"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/crypto/subtle_generate_key.rs:548-559 | ext/crypto/subtle_generate_key.rs:569-580 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_generate_key.rs:548\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cfdc70cecee7784e2ba54d5a6c3dd7ddbe5fbe1be6b106d91c7fef329ad63a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/crypto/subtle_sign.rs:468-479 | ext/crypto/subtle_verify.rs:290-301 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_sign.rs\u0060 and \u0060ext/crypto/subtle_verify.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 160 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_sign.rs:468\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_sign.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"429b009c21f0202ba1def8cc9df4fd6a787c1e0aab41ae2b15f1ce14f52c064e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): ext/fs/ops.rs:1236-1246 | ext/fs/ops.rs:1281-1292 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1236\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fcdbbf048d647a44445390ae0fcad7d3fe1c19b1d957f4f805f781dcddbef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/fs/ops.rs:1588-1599 | ext/fs/ops.rs:1654-1665 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1588\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060state\u0060 to \u0060\u0026mut OpState\u0060 in one and \u0060Rc\u003CRefCell\u003COpState\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d634d96ce79c965a1603d7238827ce0173870f293bf7b90c2a0011ca644525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/http/http_next.rs:1643-1654 | ext/http/http_next.rs:1682-1693 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b56fdc3d670886dda7273f8bdf8e876a25b5fa8d1d7be109fcf4152877a38d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): ext/napi/js_native_api.rs:3884-3893 | ext/napi/node_api.rs:633-644 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/napi/js_native_api.rs:3884\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":3884}}}],"partialFingerprints":{"codehealthFindingId/v1":"115a0bce6c05abf5bb0084a2f677220d8d7379e5f724998f1d710438f5691076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): ext/node/ops/fs.rs:3301-3311 | ext/node/ops/fs.rs:3563-3574 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:3301\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":3301}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c70b2485ddbf8dbd8b9da9711e6d486fc2872e361b712def793e73867b0572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ext/node/ops/tls.rs:411-423 | ext/node/ops/tls.rs:530-542 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41386090d1c6a843da20562b1471eeaf16e2d8b2c0881dd102519fe1aa7ef5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/node/ops/tls_wrap.rs:2706-2717 | ext/node/ops/tls_wrap.rs:2728-2739 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2706}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f79d6af3e23826999498e3373998d30f3c45ef208341b33ce05a12adc4128cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): ext/node/ops/v8.rs:1027-1038 | ext/node/ops/v8.rs:1053-1062 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/node/ops/v8.rs:1063\u0060 calls \u0060gc_type_name\u0060 and \u0060ext/node/ops/v8.rs:1039\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/v8.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75bf7f7632f6298fd07f1231119e59f4de7d2615f5233895dd7615f36b4dcca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): ext/node/ops/vm.rs:91-102 | ext/node/ops/vm.rs:190-200 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/vm.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f63e09d99f16b5aa2de3cdce444b9216446480dbfd295a7d519f7ff1bb4f58d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): ext/node/ops/vm.rs:582-592 | ext/node/ops/vm.rs:775-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/vm.rs:582\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/node/ops/vm.rs:774\u0060 calls \u0060Some\u0060 and \u0060ext/node/ops/vm.rs:581\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/vm.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5492ee2c25b10a70c4196c5ba526524e25ec2a94bf8682963f19bf60c26c6950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/node/ops/wasi.rs:609-620 | ext/node/ops/wasi.rs:655-666 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/wasi.rs:609\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"9125d767592a8e11e49c6143270755abeae0f1e3ca4b2f1a66cc48d19651a7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/node/ops/wasi.rs:1256-1267 | ext/node/ops/wasi.rs:1832-1843 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/wasi.rs:1256\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5385ccf695a92862cce49837a2aad3a8f53c1707b8498f2360e1b0379c2e04e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/node_crypto/cipher.rs:1047-1058 | ext/node_crypto/cipher.rs:1533-1544 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:1047\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7092208ccbfe8f9da912b30a64355907d8ec21c2ee3871732e7b5319d8ed429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): ext/node_sqlite/database.rs:2842-2850 | ext/node_sqlite/statement.rs:191-202 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/database.rs:2842\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"766adbd4707990ea2c1c2b2d0d21d9b5719ac1dc3ef759df4cd13cbbb15a7589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/webgpu/buffer.rs:239-250 | ext/webgpu/queue.rs:101-112 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/webgpu/buffer.rs:239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/buffer.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaabc1a6b352a2683eb9ac7b8deecd97ba389edace108e0657439707f13b045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/cli_parser/src/convert.rs:622-633 | libs/cli_parser/src/convert.rs:3108-3119 \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/cli_parser/src/convert.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09f9e59ef6a65fc0459d21f7156dd3867508ea7b6359b3080fe89ff2cb29c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/cli_parser/src/convert.rs:1001-1012 | libs/cli_parser/src/convert.rs:1041-1052 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cli_parser/src/convert.rs:1001\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a526b9041f0d981267422c3f1d4b4a8f1b1d64ecd134b42a42a091b5c72e0d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/config/workspace/mod.rs:1407-1418 | libs/config/workspace/mod.rs:1421-1432 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/config/workspace/mod.rs:1407\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/config/workspace/mod.rs:1420\u0060 calls \u0060values\u0060 and \u0060libs/config/workspace/mod.rs:1406\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/mod.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d0be736f31764dfc69a60947504965155bdc859dc0c05ae9ea30093b1a5b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/core/ops_builtin.rs:816-828 | libs/core/ops_builtin.rs:874-886 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/ops_builtin.rs:816\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b053059de754f30140712166ad5e4709ea3ff944d5462b52af4408237526fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/core/ops_builtin_v8.rs:1001-1012 | libs/core/ops_builtin_v8.rs:1179-1190 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/ops_builtin_v8.rs:1001\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adf64d15328a4cdd2e9d6ad19a4e51f204c99ea3acca1efb08d091902dd9f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/dcore/src/inspector_server.rs:317-328 | libs/inspector_server/lib.rs:673-684 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:317\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/inspector_server/lib.rs:686\u0060 calls \u0060resubscribe\u0060 and \u0060libs/dcore/src/inspector_server.rs:331\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b0a32f819e913b0062f08720604d3121d36205ff372d494139dd25302c502d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/eszip/v2.rs:1450-1461 | libs/eszip/v2.rs:1467-1478 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/eszip/v2.rs:1450\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v2.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7bb86758919e6288846ec54e6ede352f72bed1c3ff459b6fd29896408723bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): libs/http_h1/conn.rs:1099-1109 | libs/http_h1/conn.rs:1257-1268 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/conn.rs:1099\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"3736189cecb563e8ef4823e28ea96fb45001d11ef9fd38eb86dbdaa09fd7de9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/http_h1/conn.rs:1325-1336 | libs/http_h1/conn.rs:1344-1355 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/conn.rs:1325\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8c59c357374b79098abed3251c3066709e554f44cdccc9de4223b210de41bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/node_shim/lib.rs:3662-3673 | libs/node_shim/lib.rs:3712-3723 \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/node_shim/lib.rs"},"region":{"startLine":3662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b219b26bafe21e885208bb98259133a22a1e0a44ccfed32e56218a1900d1695c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/npm_installer/bin_entries.rs:525-536 | libs/npm_installer/bin_entries/windows_shim.rs:308-319 \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":"libs/npm_installer/bin_entries.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24b6bfc047fb1ee170f545b30a455a25c9c5acd3ab958c6b61bbdbecab1824f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/ops/op2/dispatch_fast.rs:971-982 | libs/ops/op2/dispatch_fast.rs:1017-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":"libs/ops/op2/dispatch_fast.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec6ab99eaf52af801cdd528e49945b99d72a2f57a6ca9bbb412b45a15ded46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): libs/package_json/lib.rs:676-686 | libs/package_json/lib.rs:713-724 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/package_json/lib.rs:713\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/package_json/lib.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"6819270059c3a8742e7c6d2836f6e39df8546791c399c4ff5b0ac0103391c3a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): runtime/permissions/lib.rs:1386-1397 | runtime/permissions/lib.rs:1581-1592 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/permissions/lib.rs:1386\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060Cow\u003C\u0027a, Path\u003E\u0060 in one and \u0060Cow\u003C\u0027_, Path\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060runtime/permissions/lib.rs:1399\u0060 calls \u0060env_current_dir\u0060, \u0060map_err\u0060 and \u0060runtime/permissions/lib.rs:1593\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"506dce7acd7bd312d0c7b877972f3843173b5215bfd30f9b0509f56f4b4f89d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): runtime/subprocess_windows/src/process.rs:887-898 | runtime/subprocess_windows/src/process.rs:901-912 \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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"0832692efc7ac1ed73ae2e8985d66dbf8c4fe4f7257ba92f966aac287dda3421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): runtime/web_worker.rs:743-754 | runtime/worker.rs:721-732 \u2014 before extracting anything, compare \u0060runtime/web_worker.rs\u0060 and \u0060runtime/worker.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 84 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":"runtime/web_worker.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"61edb06bf135af699a9774f3c2f29ecf9c0df8ebd218d69c9e33290053250478"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): cli/tools/publish/unfurl.rs:190-200 | cli/tools/publish/unfurl.rs:205-215 | cli/tools/publish/unfurl.rs:220-230 | cli/tools/publish/unfurl.rs:235-245 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/publish/unfurl.rs:190\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/unfurl.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ab8a23d3e08b6cfc90b108e85ea213d034a4af1d747f26c5786f09b46a21bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): ext/node/ops/stream_wrap.rs:1399-1409 | ext/node/ops/stream_wrap.rs:1686-1696 | ext/node/ops/stream_wrap.rs:1870-1880 | ext/node/ops/tls_wrap.rs:2129-2139 \u2014 before extracting anything, compare \u0060ext/node/ops/stream_wrap.rs\u0060 and \u0060ext/node/ops/tls_wrap.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/stream_wrap.rs:1399\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09bf48887585751f4c0edefa5dc49f11d1680ab7c38011dfca816d5c04d8b38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): libs/eszip/v2.rs:98-108 | libs/eszip/v2.rs:123-133 | libs/eszip/v2.rs:154-164 | libs/eszip/v2.rs:179-189 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/eszip/v2.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/v2.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0e3a74c411f516d6092371ac55b51cd14bad6ac095a1851e80bc93526954b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/crypto/subtle_crypto.rs:903-913 | ext/crypto/subtle_generate_key.rs:800-810 | ext/crypto/subtle_import_key.rs:1944-1954 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_crypto.rs\u0060 and \u0060ext/crypto/subtle_generate_key.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30f8008e17fd448428cd33afb0ecf68f3c7528992c13a765cd89fc87edb8565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/crypto/subtle_decrypt.rs:285-295 | ext/crypto/subtle_encrypt.rs:341-351 | ext/crypto/subtle_sign.rs:344-354 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:285\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0417498d105354e92d03f166a39a93a190da77e3fa9619669df9d57c538ff124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): ext/crypto/subtle_generate_key.rs:832-842 | ext/crypto/subtle_import_key.rs:158-168 | ext/crypto/subtle_import_key.rs:209-218 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_generate_key.rs\u0060 and \u0060ext/crypto/subtle_import_key.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 118 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_generate_key.rs:832\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ff27c6b3791e6305596f0d8180701b7f051cbb736a9fa1c54e175c355812e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/crypto/subtle_import_key.rs:403-413 | ext/crypto/subtle_import_key.rs:423-433 | ext/crypto/subtle_import_key.rs:557-568 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:403\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab498639b62b07fd54b1e79a07b325fbc2911dea3a495de0d13a3a758719901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/napi/js_native_api.rs:2829-2839 | ext/napi/js_native_api.rs:2870-2880 | ext/napi/js_native_api.rs:2920-2930 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/napi/js_native_api.rs:2829\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba8ac1cf1bd41d1aaada0fee8ae668ecf5a8dce01cca26ed1a740f4fcf13af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): ext/node/ops/pipe_wrap.rs:446-456 | ext/node/ops/tcp_wrap.rs:755-765 | ext/node/ops/tcp_wrap.rs:821-829 \u2014 before extracting anything, compare \u0060ext/node/ops/pipe_wrap.rs\u0060 and \u0060ext/node/ops/tcp_wrap.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 79 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/pipe_wrap.rs:446\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/pipe_wrap.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd29fd40abd6980d2d586979c924e7229507377b7a54d94cce5e51a258f10d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/telemetry/lib.rs:2924-2934 | ext/telemetry/lib.rs:2969-2979 | ext/telemetry/lib.rs:3022-3032 \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":"ext/telemetry/lib.rs"},"region":{"startLine":2924}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae226941a89139fa7d6e4e74cfa11dbdbd2df7a7e146c8b6dacc9bd4dcb74001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/telemetry/lib.rs:3092-3102 | ext/telemetry/lib.rs:3130-3140 | ext/telemetry/lib.rs:3174-3184 \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":"ext/telemetry/lib.rs"},"region":{"startLine":3092}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac806ecf33978f5ff2cd6d3dea25675e56f4093b0af1451380e8845539d595b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/web/console/inspect.rs:3042-3052 | ext/web/console/mod.rs:1532-1542 | ext/web/console/mod.rs:1675-1685 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/console/inspect.rs:3042\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":3042}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b51a06050671d10f787254357d10e04f8917da28d2574dcd08ad0aa8c41f47f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): libs/resolver/cjs/analyzer/deno_ast.rs:180-190 | libs/resolver/cjs/analyzer/deno_ast.rs:221-231 | libs/resolver/cjs/analyzer/deno_ast.rs:239-249 \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":"libs/resolver/cjs/analyzer/deno_ast.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"596b53a5f4210edc87534b331fcd35d7ecb8f9787da85a514afcaf6083b715b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): cli/lsp/completions.rs:625-635 | cli/lsp/completions.rs:785-794 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/completions.rs:625\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/completions.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f783c419c112bc0b5ae105ae1aebcda55b9b82d3770434b7e7794e659e8c9a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/lsp/registries.rs:794-804 | cli/lsp/registries.rs:939-949 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/registries.rs:794\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/registries.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"da19b6f418ee81395dbf3144c4132ffb06e62e7e5359e2d96417950050aa7dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/standalone/binary.rs:482-492 | cli/standalone/binary.rs:557-567 \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":"cli/standalone/binary.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"2908f61f0427a7aae2cd323836de80eb09e014345d2f4da203657a2139312e94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/tools/desktop.rs:1018-1028 | cli/tools/desktop.rs:1113-1123 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:1018\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b1a48df908f9d7b1268e3b1bc21459335924c0a1151ef421f774ae0f94c25e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/tools/fmt.rs:1295-1305 | cli/tools/fmt.rs:1568-1578 \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":"cli/tools/fmt.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fa34e7af1dcba13fba425363ac1b102283e4ccfb035e9db4ebc6709a9e673e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/tools/pm/mod.rs:1468-1478 | cli/tools/pm/mod.rs:1562-1572 \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":"cli/tools/pm/mod.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"f282c6265e1d155f19a103af14c904b4dfc7a5ddbbe85036a721b2ce02e47d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/tools/publish/graph.rs:69-79 | cli/tools/publish/graph.rs:95-105 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/publish/graph.rs:69\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/graph.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"727941789704b11361d0032519d8edec268501909fe612e5a1402eb4b8d3ee1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/tools/repl/session.rs:689-699 | cli/tools/repl/session.rs:724-734 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/repl/session.rs:689\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/session.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"08eb581b22dac8c20f104746f7c9f89c3562287873618fec84a1cbf4ea36a069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/crypto/decrypt.rs:165-175 | ext/crypto/decrypt.rs:177-187 | ext/crypto/decrypt.rs:188-198 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/decrypt.rs:165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/crypto/decrypt.rs:165\u0060 calls \u0060map_err\u0060 and \u0060ext/crypto/decrypt.rs:188\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/decrypt.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"211ebcd289ad8ca058f0991079a2d5e6f5943a4185e7547463c4b7b0b4a4db69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/crypto/subtle_derive_bits.rs:291-301 | ext/crypto/subtle_sign.rs:301-311 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_derive_bits.rs\u0060 and \u0060ext/crypto/subtle_sign.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"352a5806d58cd46f56cfd95b3613d540f66f88e414604fe87d9cae0a2c5f1aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): ext/crypto/subtle_derive_bits.rs:368-377 | ext/crypto/subtle_key.rs:95-105 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_derive_bits.rs\u0060 and \u0060ext/crypto/subtle_key.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_derive_bits.rs:368\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffd030c66864bba0de5171fb273a224a9301e34a1045af791105dbbf4f47dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/fs/ops.rs:313-323 | ext/fs/ops.rs:332-342 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060mode\u0060 to \u0060u32\u0060 in one and \u0060i32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d2a04ffabcbfc9083f4eb0959de7bf1a38b07f2d3e9bf52c1d3053c1f745b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): ext/fs/ops.rs:1203-1213 | ext/fs/ops.rs:1296-1304 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"50387cd115092eb8377cb38ad0895feed3d10ce31c566c4675de1db0afab6a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/http/http_next.rs:1901-1911 | ext/http/http_next.rs:1919-1929 \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":"ext/http/http_next.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53d05a8d9d70c55be0996f15944f2c1f4d4d51584cc6c3a671f69ab2b13a6dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/http/http_next.rs:2121-2131 | ext/http/http_next.rs:2216-2226 \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":"ext/http/http_next.rs"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"585c5780b00ddeaea2b51605fbd19144ff5027762845fdf026435efde24783f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): ext/http/lib.rs:462-469 | ext/http/lib.rs:484-494 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/lib.rs:462\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/lib.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6fea06588f8d03b34ad06a3fcc91ceb510885fb08c638811618291315744ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/io/lib.rs:1320-1330 | ext/io/lib.rs:1339-1349 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/io/lib.rs:1320\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/lib.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"7837f1f660de8e0771b4d1891b39eb0f4df190e5d79f440ec8b8cb3239de50d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/node/ops/fs.rs:1046-1056 | ext/node/ops/fs.rs:1070-1080 \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":"ext/node/ops/fs.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf3f02d1b69ab08e6e8877a93983fd27f47a40573988aeb5b1ed5045f507088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/node/ops/http2/stream.rs:60-70 | ext/node/ops/http2/stream.rs:72-82 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/stream.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"531e87161b2ee5cf867ca37bdcd3442dd4a3c1af87f292f86dd08e22799262c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): ext/node/ops/pipe_wrap.rs:141-164 | ext/node/ops/tcp_wrap.rs:142-165 \u2014 before extracting anything, compare \u0060ext/node/ops/pipe_wrap.rs\u0060 and \u0060ext/node/ops/tcp_wrap.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 79 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/pipe_wrap.rs:141\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/pipe_wrap.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42e6cd2159890f30f87aa789a5f0277c8e32e1cce397ccc1bf8131b99fbd9d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/node/ops/tls_wrap.rs:1782-1792 | ext/node/ops/tls_wrap.rs:3401-3411 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tls_wrap.rs:1782\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"180ca91662b9fe53a24b6ef3681aea0145c7927dded8453662ed620aa5af7533"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/node/ops/tls_wrap.rs:2126-2136 | ext/node/ops/tls_wrap.rs:2184-2194 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tls_wrap.rs:2126\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cecfea2ae8326b7ec5bbf693c76bca538fe0e143211d6033dc4204e98d5aff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/node/ops/wasi.rs:770-780 | ext/node/ops/wasi.rs:2212-2222 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/wasi.rs:770\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"d565daa16008fc595dea1e9d1d2bc4d6f2f6f723ffcabce73b0194ccc7828644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/node/ops/wasi.rs:837-847 | ext/node/ops/wasi.rs:2147-2157 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/wasi.rs:837\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b772065454ba750d1afd63cf6c8b2de34d200a4a2b8f2fd2d0f81eb4114969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/node/ops/wasi.rs:1595-1605 | ext/node/ops/wasi.rs:1739-1749 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/wasi.rs:1595\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e5f5015b2c5536ff27ce28ae5dbdf1e071d27968ef98cbc10c4cab50023d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/node_crypto/sign.rs:405-415 | ext/node_crypto/sign.rs:582-592 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/sign.rs:405\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/sign.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e62cbfcea1291ee49673c167a1b80462a6983d82294d6f8cb585e6bec401c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): ext/node_sqlite/sql_tag_store.rs:565-572 | ext/node_sqlite/statement.rs:797-807 \u2014 before extracting anything, compare \u0060ext/node_sqlite/sql_tag_store.rs\u0060 and \u0060ext/node_sqlite/statement.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/sql_tag_store.rs:565\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2a89201264c3abd768c725759910d3bcc63d74aee74b20f8ad1de897ca3fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/web/css_value.rs:2545-2555 | ext/web/css_value.rs:2560-2570 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/css_value.rs:2545\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/css_value.rs"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"10023949a4aae73d324a3b6154d2565f995715ef08c25f73508258f589eee22e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/web/geometry.rs:2206-2216 | ext/web/geometry.rs:2843-2853 \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":"ext/web/geometry.rs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0445c336959e702c76d1e6ca89fad32ca5f8d08925a1430a0526e3c8c8f9842a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/core/error.rs:983-999 | libs/core/error.rs:1178-1194 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/error.rs:983\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/error.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"03de85ebbdbffb2309dc3964e2d1f38cc19dcaedd2a3b249b78ca3a6eb10e053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/core/modules/map.rs:650-659 | libs/core/modules/map.rs:716-726 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/modules/map.rs:650\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c07cab44b1ef2fe00dc5209ff898a404f73067330c38bb59703c89c1f52fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/modules/map/ext_script.rs:687-697 | libs/core/modules/map/ext_script.rs:731-741 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/modules/map/ext_script.rs:687\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map/ext_script.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"0038394d52d91e88a9b516b49813b7a6b72cc295fb25595d8075ce9c66ff54e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/core/ops.rs:222-231 | libs/core/ops.rs:239-249 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/ops.rs:222\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6192ec9194f5727f61a527502bd8b97efe7e696c6157306580f160aff1670e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/runtime/jsruntime.rs:1841-1851 | libs/core/runtime/jsruntime.rs:1872-1882 \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/core/runtime/jsruntime.rs"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d79cdcb7092a855c6734aee8f37f6acadbe0d65028b96849add8c29d877be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/core/uv_compat/pipe.rs:724-734 | libs/core/uv_compat/pipe.rs:936-945 \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/core/uv_compat/pipe.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a69ce736fa13037a34fd32fcf3609d85e3f2059ce9454ae614929690d51a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1281-1291 | libs/core/uv_compat/pipe.rs:1335-1345 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1281\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf2079ceb00ac20b2d9c6fc5773901d2357f8dbb499d8c171776e64fa44dd8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1680-1690 | libs/core/uv_compat/tty.rs:2595-2603 \u2014 before extracting anything, compare \u0060libs/core/uv_compat/pipe.rs\u0060 and \u0060libs/core/uv_compat/tty.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38b9024651d2703066444b45008944b89c6531dc1a2e9179b3e63483fce18bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1974-1984 | libs/core/uv_compat/tty.rs:2220-2230 \u2014 before extracting anything, compare \u0060libs/core/uv_compat/pipe.rs\u0060 and \u0060libs/core/uv_compat/tty.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1974\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"db92c0aaa51cc302223d54ec7c6088afcba9078d470238065c65130ccea94205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/uv_compat/tcp.rs:594-604 | libs/core/uv_compat/tcp.rs:1165-1175 \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/core/uv_compat/tcp.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6f25b1f6dbf3139c62922b3f381280f2a3b182822cac6f37c20898ff97fe3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/uv_compat/tcp.rs:1591-1602 | libs/core/uv_compat/tty.rs:2523-2533 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/tcp.rs:1591\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/core/uv_compat/tcp.rs:1590\u0060 calls \u0060as_ref\u0060, \u0060unwrap\u0060 and \u0060libs/core/uv_compat/tty.rs:2522\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tcp.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f2ea1051fbf1a338a6d295189e3e2c4d72a392e13776b4e8ac2f2884a997ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/uv_compat/tty.rs:1544-1554 | libs/core/uv_compat/tty.rs:1566-1576 \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/core/uv_compat/tty.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"21aaa4c4bc6a1957129c03edcc34ded7090ae5762d059f52fbc73ab8f359bc07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/dcore/src/inspector_server.rs:528-538 | libs/inspector_server/lib.rs:934-944 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:528\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060host\u0060 to \u0060\u0026Option\u003CString\u003E\u0060 in one and \u0060Option\u003C\u0026str\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d41235223c9e5d930dcafe425730f7c5bb3ebb5172b301e22ba030a16903d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/npm_installer/hoisted.rs:895-904 | libs/npm_installer/local.rs:386-396 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/hoisted.rs:895\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee428c0bb1edae93f6e4f7865d775c286328d25611922838bf612e0feb2ad0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/ops/op2/dispatch_slow.rs:1140-1150 | libs/ops/op2/dispatch_slow.rs:1159-1169 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/dispatch_slow.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e635d341ae87c07661dfe25293c78d51666f5919407e5fc672233131f37e789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): ext/node/ops/stream_wrap.rs:1398-1407 | ext/node/ops/stream_wrap.rs:1486-1495 | ext/node/ops/stream_wrap.rs:1685-1694 | ext/node/ops/stream_wrap.rs:1869-1878 | ext/node/ops/stream_wrap.rs:1967-1976 | ext/node/ops/stream_wrap.rs:2053-2062 | ext/node/ops/tls_wrap.rs:2128-2137 | ext/node/ops/tls_wrap.rs:2186-2195 \u2014 before extracting anything, compare \u0060ext/node/ops/stream_wrap.rs\u0060 and \u0060ext/node/ops/tls_wrap.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"050945cada71fdc71b4149d260d0f07a8598250d4d3c06a509db02ed4a54eb5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): ext/image/bitmap.rs:104-113 | ext/image/bitmap.rs:117-126 | ext/image/bitmap.rs:130-139 | ext/image/bitmap.rs:142-151 | ext/image/bitmap.rs:154-163 | ext/image/bitmap.rs:168-177 \u2014 all 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/image/bitmap.rs:104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/image/bitmap.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9179b5a9b62e28fd52f7360e6f6bb21fc1fd3bf54055ed5f04ea69847e1c29d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): ext/node/ops/stream_wrap.rs:710-719 | ext/node/ops/stream_wrap.rs:739-748 | ext/node/ops/tls_wrap.rs:434-443 | ext/node/ops/tls_wrap.rs:488-497 \u2014 before extracting anything, compare \u0060ext/node/ops/stream_wrap.rs\u0060 and \u0060ext/node/ops/tls_wrap.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d7d1d19a6641ef636a25571b9bfa175c5ddf29ed22e9f0a7da491d34e76eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): libs/ops/conversion/from_v8/enum.rs:174-183 | libs/ops/conversion/to_v8/enum.rs:344-353 | libs/ops/conversion/to_v8/enum.rs:360-369 | libs/ops/webidl/enum.rs:70-79 \u2014 \u0060libs/ops/conversion/from_v8/enum.rs\u0060 and \u0060libs/ops/conversion/to_v8/enum.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 54 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/conversion/from_v8/enum.rs:174\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/enum.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e951c9fbab21724093520eb73825e5f93919e6f4611a9314ed1a95994212fce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): cli/lsp/tsc.rs:1014-1023 | cli/lsp/tsc.rs:1098-1107 | cli/lsp/tsc.rs:1147-1156 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/tsc.rs:1014\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd2244e4f5d9e5ed01ab31749ca78839bab07b54a1a1b99f263347a7e8d72d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): cli/tools/desktop.rs:4185-4194 | cli/tools/desktop.rs:4205-4214 | cli/tools/desktop.rs:4245-4252 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:4185\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":4185}}}],"partialFingerprints":{"codehealthFindingId/v1":"59365e8e12bb0df0dd2aaff9c4f4555abd9878bafb61f7b1dd9af32cc58ce3f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): ext/crypto/digest.rs:458-466 | ext/crypto/subtle_decrypt.rs:336-345 | ext/crypto/subtle_encrypt.rs:392-401 \u2014 before extracting anything, compare \u0060ext/crypto/digest.rs\u0060 and \u0060ext/crypto/subtle_decrypt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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":"ext/crypto/digest.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94f51334d357a134a877073471509d9caa5127319e1b87e8f9d2a737f7ecf03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): ext/crypto/subtle_crypto.rs:818-827 | ext/crypto/subtle_generate_key.rs:817-826 | ext/crypto/subtle_import_key.rs:143-152 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_crypto.rs\u0060 and \u0060ext/crypto/subtle_generate_key.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_crypto.rs:818\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"934c5b3e7927125ffe3e0a21d81de7839dda67e349443e1c42a0cca99c137d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): ext/crypto/subtle_decrypt.rs:298-307 | ext/crypto/subtle_encrypt.rs:354-363 | ext/crypto/subtle_sign.rs:378-387 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:298\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/crypto/subtle_decrypt.rs:296\u0060 calls \u0060Ok\u0060, \u0060view_to_bytes\u0060 and \u0060ext/crypto/subtle_sign.rs:376\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d245ce3594864efb2d42225b40d9485e32c9ee50ac76dcf2394229bf3514ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): ext/crypto/subtle_derive_bits.rs:671-680 | ext/crypto/subtle_sign.rs:576-585 | ext/crypto/subtle_verify.rs:386-395 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_derive_bits.rs\u0060 and \u0060ext/crypto/subtle_sign.rs\u0060 as WHOLE FILES: this scan already matched 5 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2d1d6fb485e9fbd46eab29f336f7b61efd3885b21c1f0cb786a0645b6a552d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): ext/fs/ops.rs:1587-1594 | ext/fs/ops.rs:1653-1660 | ext/net/ops.rs:1201-1210 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1587\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060state\u0060 to \u0060\u0026mut OpState\u0060 in one and \u0060Rc\u003CRefCell\u003COpState\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6150003dbf960c954720ef56b15f46bf373c4ea306c1a1e4210c349b88df84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): ext/napi/js_native_api.rs:657-665 | ext/napi/js_native_api.rs:687-696 | ext/napi/js_native_api.rs:717-725 \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":"ext/napi/js_native_api.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f9bde07a1b3dbcfaf9dd3bfc05c2306b05773bcaaa11e88676c8565a05f774"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): ext/node/ops/vm.rs:1092-1100 | ext/node/ops/vm.rs:1202-1211 | ext/node/ops/vm.rs:1359-1368 \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":"ext/node/ops/vm.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"a715ccba0a5d3063d9e6c25441b26ee04d6ac30035f5d5c69a4efd315dfb89a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): ext/node/ops/wasi.rs:870-879 | ext/node/ops/wasi.rs:893-902 | ext/node/ops/wasi.rs:2166-2175 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/wasi.rs:870\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/node/ops/wasi.rs:2176\u0060 calls \u0060seek\u0060, \u0060Start\u0060 and \u0060ext/node/ops/wasi.rs:880\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c9c135a0e884854bef36f65946addbf450f54d5292f899d2d766849e8d9ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): ext/node_crypto/lib.rs:1211-1220 | ext/node_crypto/lib.rs:1224-1233 | ext/node_crypto/lib.rs:1249-1258 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/lib.rs:1211\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/lib.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe1754a9cfa3a8bf703750ee173ae22cf335813e6bcddaae468eeb885fdd87b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): ext/node_sqlite/sql_tag_store.rs:372-381 | ext/node_sqlite/sql_tag_store.rs:393-402 | ext/node_sqlite/sql_tag_store.rs:452-461 \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":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab6183032e31c8e3b9144a88dce456f53b902558c366010cb15ca0b560b0a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): ext/telemetry/lib.rs:3102-3111 | ext/telemetry/lib.rs:3141-3150 | ext/telemetry/lib.rs:3186-3195 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/telemetry/lib.rs:3151\u0060 calls \u0060Some\u0060, \u0060push\u0060 and \u0060ext/telemetry/lib.rs:3112\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2714869b3b57a62c291a28500e83dfa83487488f02e481e0ff0d5fb481deec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): libs/core/uv_compat.rs:1220-1229 | libs/core/uv_compat.rs:1278-1287 | libs/core/uv_compat.rs:1336-1345 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat.rs:1220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"09468d3d3be7ae46e21ddb36d3098e91050e57d8d7f80e610ae2ca9b62d334c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/lib/standalone/virtual_fs.rs:895-904 | cli/lib/standalone/virtual_fs.rs:943-952 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lib/standalone/virtual_fs.rs:895\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lib/standalone/virtual_fs.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e6b56e2397520ab2318668f050e5e4f87904695bdb8ef385c2d5660789b7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): cli/lsp/jsr.rs:432-439 | cli/lsp/npm.rs:97-106 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/jsr.rs:432\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/jsr.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"6573717f904e435a76bbf4e8999b5a734eb16b712177a5c4586f462ce7453243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/lsp/language_server.rs:976-985 | cli/lsp/language_server.rs:4490-4499 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/language_server.rs:976\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4eaa81640aa8c97f8d18db0d5be1ba7aab16484c28265437482693658a1360"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/lsp/registries.rs:761-770 | cli/lsp/registries.rs:927-936 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/registries.rs:761\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/registries.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42819806115f074a73474c978080ea833cae198dd0fdc2195fd6f4ecad4335f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): cli/standalone/binary.rs:1739-1747 | libs/eszip/v2.rs:1213-1222 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/standalone/binary.rs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"7960a17c1c7355f54986f5bc0a6d37ff0bcbc230fac1167ed0a8ba03d370a2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): cli/tools/bundle/esbuild.rs:71-79 | cli/tsc/native.rs:118-127 \u2014 before extracting anything, compare \u0060cli/tools/bundle/esbuild.rs\u0060 and \u0060cli/tsc/native.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tsc/native.rs:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/esbuild.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79ca2786df744fe75d5c2835618445b452d34a41e61d67d6485aff4ee331a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/desktop.rs:481-490 | cli/tools/desktop.rs:1290-1299 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:481\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1cc5a59aa5ea92bb73cd627874d40f5c5bdad56d0b15c13d15a146ff40cd73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/lint/ast_buffer/swc.rs:911-920 | cli/tools/lint/ast_buffer/swc.rs:1146-1155 \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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1a9979a3ffcc4dee097d6886056ba0490fa6be54a445f19145efa0d24fc0b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/lint/ast_buffer/ts_estree.rs:758-767 | cli/tools/lint/ast_buffer/ts_estree.rs:791-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":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"1456616b09e6374539a2bbb248dff361f5fbd4532e8f64faa44de92125d2d32f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/tools/pack/package_json.rs:121-131 | cli/tools/pack/package_json.rs:139-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pack/package_json.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/package_json.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf923df09757b9ffddf4b143e63f4c1709f40f064c44d83b521f55eae0a191d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/pm/list.rs:339-348 | cli/tools/pm/mod.rs:1282-1291 \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":"cli/tools/pm/list.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe817cd068c22bbe2bbf59744270c69423aca40cbca83684ced4011cb328155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/pm/mod.rs:579-588 | cli/tools/pm/mod.rs:1253-1262 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pm/mod.rs:579\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/mod.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f200cb1b492ce49212ee3c983e02a695ec2c02a8427d558a22a7b86ca2418a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/task.rs:1381-1390 | cli/tools/task.rs:1399-1408 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/task.rs:1381\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/task.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8e0680c8a5ecfbe64cc579f1a40a1889985dff8f322d0feb38bb656f02e0b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/canvas/canvas.rs:65-74 | ext/canvas/canvas.rs:90-99 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/canvas/canvas.rs:65\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/canvas.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e377f76903e4633691339d1c1c4a71a6b3007accf3f46bf288d8a55d5771b1e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/crypto/node_interop.rs:104-113 | ext/crypto/subtle_derive_bits.rs:401-410 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/crypto/subtle_derive_bits.rs:411\u0060 calls \u0060to_string\u0060 and \u0060ext/crypto/node_interop.rs:114\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc625de1ca50336a7efe4fa49792e36ea5df2db1eae54b2fc141fb89c06640a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/crypto/node_interop.rs:339-348 | ext/crypto/subtle_generate_key.rs:784-793 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/node_interop.rs:339\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c79f257bd119329543809e05eb702f08feea70d5059581442224a028e98fe58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/crypto/node_interop.rs:356-365 | ext/crypto/subtle_import_key.rs:1928-1937 \u2014 before extracting anything, compare \u0060ext/crypto/node_interop.rs\u0060 and \u0060ext/crypto/subtle_import_key.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/node_interop.rs:356\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"37982e6ec39fc7276985be6d7577d3c4ccfa94d3803e2dfc771af057179a3812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:63-72 | ext/crypto/subtle_encrypt.rs:63-72 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc733c88fafb5dbaa24b51405a09cbedf3d62c6cb1e5e7fae915d62b85f92040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:243-252 | ext/crypto/subtle_encrypt.rs:298-307 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fde7cd33380922406b41f69769ea594412572cafa22b7297f68245aa20a7074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/crypto/subtle_derive_bits.rs:659-668 | ext/crypto/subtle_key.rs:195-204 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_derive_bits.rs\u0060 and \u0060ext/crypto/subtle_key.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_derive_bits.rs:659\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"530e04e946d1dfeadc7d9f195153e99a8b5503ecb2ef71c8f6fb249845d0f3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/crypto/subtle_key.rs:130-139 | ext/crypto/subtle_key.rs:148-157 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_key.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7cac0f430e8a0a9aff687dc64a5b124fb968bb65dc373ee6773445a98c4ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/ffi/callback.rs:61-70 | ext/ffi/dlfcn.rs:206-215 \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":"ext/ffi/callback.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03490c5f9f1ac158096d27874f48222cfd5f2f82e95698d6eda6368a677a4cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/http/http_next.rs:4195-4204 | ext/http/http_next.rs:4348-4357 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:4195\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":4195}}}],"partialFingerprints":{"codehealthFindingId/v1":"426b20d0f9e3f157bc8788d2f9e97ca49e34fd0e1428b6c6cc2a1196445d70f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/http/request_properties.rs:166-175 | ext/http/request_properties.rs:233-242 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/request_properties.rs:166\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/request_properties.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9833f1fd54e236f14e770ae0300554f9d452e7da0f99ef837aa76f03c4ba36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/napi/js_native_api.rs:1096-1105 | ext/napi/js_native_api.rs:1162-1171 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/napi/js_native_api.rs:1096\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"765065a6a311e749e3b092f748853d2bbd329758ae227863f539ad75e7aedcd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/napi/js_native_api.rs:2707-2716 | ext/napi/js_native_api.rs:2735-2744 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2707}}}],"partialFingerprints":{"codehealthFindingId/v1":"d862722034c6c0f3977e52bc0239ac274a330fc8332c6e0fa87e56793e4f94de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): ext/net/ops.rs:282-291 | ext/net/ops.rs:716-722 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/net/ops.rs:282\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ea9bb01693d00c3c9eee3f6a279bde028bdbb43ef0da0bd9a31cac5ad248cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/node/ops/fs.rs:3131-3140 | ext/node/ops/fs.rs:3335-3344 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:3131\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":3131}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaca74aa27d67942cc900df4e4f8993784676fe70da0a6e55447ecb52e72def"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/node/ops/stream_wrap.rs:942-951 | ext/node/ops/stream_wrap.rs:1010-1019 \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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2225a3e68e2c42410d2bbbaa59f6c8a69d3bec833e465b6fa2bed791f03261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/node/ops/zlib/mod.rs:1361-1370 | ext/node/ops/zlib/mod.rs:1537-1546 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/zlib/mod.rs:1361\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"73231a92da71f93cbd0b6a1b0b95f2eb5ab0dd0120707e4091bcb666a1612a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/node_sqlite/sql_tag_store.rs:609-620 | ext/node_sqlite/statement.rs:839-850 \u2014 before extracting anything, compare \u0060ext/node_sqlite/sql_tag_store.rs\u0060 and \u0060ext/node_sqlite/statement.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/sql_tag_store.rs:609\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9a25c223358294239ef6623a6cdcb958ff640b1be36ab558fe5c1309750f8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/node_sqlite/sql_tag_store.rs:742-751 | ext/node_sqlite/statement.rs:950-960 \u2014 before extracting anything, compare \u0060ext/node_sqlite/sql_tag_store.rs\u0060 and \u0060ext/node_sqlite/statement.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/sql_tag_store.rs:742\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d24af79ebb4d5200d341d7c2fe728faf124a5cc26c77145420548343d4e1d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/process/ipc.rs:382-391 | ext/process/ipc.rs:520-529 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/process/ipc.rs:382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/ipc.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cbb58b0e23f7735dfee5328d59cd06087ccfa91c6c9ad2c3b26efcf5abbc19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/telemetry/lib.rs:2842-2851 | ext/telemetry/lib.rs:2864-2873 \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":"ext/telemetry/lib.rs"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f1003a403fdfd6015149ce499740d4d6bc05cd1f29784c433637979f3f1653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/web/console/inspect.rs:721-730 | ext/web/console/inspect.rs:2140-2149 \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":"ext/web/console/inspect.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e604f383cfd717505446432eaa5c5db69543e760d479c0a66a4f24fa1da3d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/web/css_value.rs:1031-1040 | ext/web/css_value.rs:1046-1055 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/css_value.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2b6c81f47d059251b9c1467244ea1decfde50f4a44caf1c4ff32ddcc0116e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/web/lib.rs:732-741 | ext/web/lib.rs:794-803 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/lib.rs:732\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/lib.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21214a7f64a78c9879ac19ea7302c1e7a42b04a6250a3bb74206d3782c46ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): libs/config/workspace/discovery.rs:827-836 | libs/config/workspace/discovery.rs:903-911 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/config/workspace/discovery.rs:827\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/discovery.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec5963493ed62d130b3d8e6f05b193fa9950f35e37878298c9879f0eb3fceb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): libs/core/runtime/bindings.rs:436-445 | libs/core/runtime/bindings.rs:735-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/core/runtime/bindings.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"08eceeffc32bd532c955411cf7dac447113cb7cd0ea3a8120683aba6575851ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/core/runtime/bindings.rs:853-862 | libs/core/runtime/bindings.rs:874-883 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/runtime/bindings.rs:853\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/runtime/bindings.rs:884\u0060 calls \u0060length\u0060 and \u0060libs/core/runtime/bindings.rs:863\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/bindings.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"e104bfdc22e2b61f01928fe09568a922d21ebade01fd254c68c6db4688d9d4d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): libs/core/uv_compat/stream.rs:497-505 | libs/core/uv_compat/stream.rs:601-610 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/stream.rs:497\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/stream.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"98723226d21755ac272d64bfed42240f880cf597c9b2de99d58bda54ec7d09b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/core/uv_compat/tty.rs:2225-2234 | libs/core/uv_compat/tty.rs:2312-2321 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/tty.rs:2225\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/tty.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"100d2e5e1dd77088a1e4f25e9e4d907591dc2a5a6979fdafdfffc6b5e3999cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): libs/core_testing/checkin/runner/ops_worker.rs:165-174 | libs/core_testing/checkin/runner/ops_worker.rs:176-184 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core_testing/checkin/runner/ops_worker.rs:165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runner/ops_worker.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f7f3958434d7cf583009dbab6373de6ef42ba3d730242e9dd0483dd88b8357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/dcore/src/inspector_server.rs:260-269 | libs/inspector_server/lib.rs:499-508 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:260\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfb6f606bf68a16fc16f12e3f85a88c0f0aa7b7abfa2e096ddbe39dc770eb06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/npm/fast_registry_json.rs:1373-1382 | libs/npm/fast_registry_json.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":"libs/npm/fast_registry_json.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4ab25f0616a064415b7fd7a572872f27f0d61a2f849d7dd87c92e5ba9a395f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): libs/npm_cache/fs_util.rs:32-41 | libs/npm_installer/fs.rs:86-94 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_cache/fs_util.rs:32\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_cache/fs_util.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b6fa5fbd804678c035bd44325cab3deb89fbd6321f92a2c368d5c65ae9fc61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/npm_cache/lib.rs:400-409 | libs/resolver/npm/managed/global.rs:83-92 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_cache/lib.rs:400\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_cache/lib.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8f12a0ead9ea54449245461a6719ef8a6e5c64e6dd8de107611cb65df8f44e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/npm_installer/local.rs:2048-2057 | libs/resolver/npm/mod.rs:707-716 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/local.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77a3e82e6c161432404b04d37c501957602af9315fbeaddcacbfeaabb91b839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/ops/conversion/from_v8/struct.rs:38-47 | libs/ops/webidl/dictionary.rs:48-57 \u2014 before extracting anything, compare \u0060libs/ops/conversion/from_v8/struct.rs\u0060 and \u0060libs/ops/webidl/dictionary.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/conversion/from_v8/struct.rs:38\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/struct.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"339b51307ff3a3dfbc0a579f4cea98b60c6c70104c2bc5fd15a9639944c2c952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): ext/crypto/subtle_decrypt.rs:242-250 | ext/crypto/subtle_decrypt.rs:375-383 | ext/crypto/subtle_derive_bits.rs:278-286 | ext/crypto/subtle_encrypt.rs:297-305 | ext/crypto/subtle_encrypt.rs:431-439 | ext/crypto/subtle_sign.rs:241-249 | ext/crypto/subtle_sign.rs:289-297 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:242\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee1dd153fab252865a9e038592188dd8030fd62dab828429253e63c2b9fcb5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): ext/crypto/node_interop.rs:338-346 | ext/crypto/node_interop.rs:355-363 | ext/crypto/subtle_crypto.rs:841-849 | ext/crypto/subtle_generate_key.rs:783-791 | ext/crypto/subtle_import_key.rs:1927-1935 \u2014 before extracting anything, compare \u0060ext/crypto/node_interop.rs\u0060 and \u0060ext/crypto/subtle_import_key.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dc262cc90ca0f118c6db60435781ea9c42344825067ffde9256476e54bf9eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): libs/core/uv_compat/pipe.rs:700-708 | libs/core/uv_compat/pipe.rs:856-864 | libs/core/uv_compat/pipe.rs:912-920 | libs/core/uv_compat/pipe.rs:1311-1319 | libs/core/uv_compat/pipe.rs:1349-1357 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:700\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba40c11d2383974c956ad04796462683dd4dfa9d89d07397a25e5d81a0dd96de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): cli/lsp/language_server.rs:1769-1777 | cli/lsp/language_server.rs:1811-1819 | cli/lsp/language_server.rs:4471-4479 \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":"cli/lsp/language_server.rs"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9f7666d0756c5e9be48c42d472e4a26b248f90180035a3d66300375cd75fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): ext/crypto/crypto_key.rs:220-229 | ext/crypto/node_interop.rs:378-387 | ext/crypto/subtle_import_key.rs:1970-1979 \u2014 before extracting anything, compare \u0060ext/crypto/node_interop.rs\u0060 and \u0060ext/crypto/subtle_import_key.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/crypto_key.rs:220\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/crypto/subtle_import_key.rs:1967\u0060 calls \u0060is_undefined\u0060, \u0060is_null\u0060 and \u0060ext/crypto/node_interop.rs:377\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/crypto_key.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc99931735fc51608b64d52148b020f1c7b5b65f71da9ee1c825022f3df7b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ext/crypto/node_interop.rs:517-525 | ext/crypto/subtle_import_key.rs:1909-1917 | ext/crypto/subtle_import_key.rs:1961-1969 \u2014 before extracting anything, compare \u0060ext/crypto/node_interop.rs\u0060 and \u0060ext/crypto/subtle_import_key.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"355f107ad6c92f21d0340bc8f3c478883048d8fea6bd580ca05f37c7e900184c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ext/crypto/subtle_derive_bits.rs:405-413 | ext/crypto/subtle_import_key.rs:1912-1920 | ext/crypto/subtle_key.rs:152-160 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_derive_bits.rs\u0060 and \u0060ext/crypto/subtle_key.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_derive_bits.rs:405\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9525a00c148110256ce7c0101edfdb524a37ca80d3b0f83852fc94974009c677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ext/crypto/subtle_derive_bits.rs:559-567 | ext/crypto/subtle_derive_bits.rs:596-604 | ext/crypto/subtle_derive_bits.rs:615-623 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc56ac93958e7a609f9e970f0bf28f7a2f1fa9e076fe703bd19a9900db1ccd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ext/crypto/subtle_generate_key.rs:487-495 | ext/crypto/subtle_generate_key.rs:503-511 | ext/crypto/subtle_generate_key.rs:519-527 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_generate_key.rs:487\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4d6cb4ec3e2f709aefab29963362fc44a3202925fe19ae0a5b2ff20c7abebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): ext/crypto/subtle_get_public_key.rs:76-84 | ext/crypto/subtle_get_public_key.rs:101-108 | ext/crypto/subtle_get_public_key.rs:119-127 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_get_public_key.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_get_public_key.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"47db165128b9084bba0d63a6c1b08ce6dcda5364ad08a441b6ace92cec46d610"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ext/http/http_next.rs:1037-1045 | ext/http/http_next.rs:1053-1061 | ext/http/http_next.rs:1069-1077 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:1037\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060writer\u0060 to \u0060\u0026mut h1::SharedChunkedResponseHeadWriter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut h1::SharedFixedResponseHeadWriter\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c595b1bbf23f88df4144f72b8020cc5eb682422653b2eadf13289f62daa8c7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ext/node/ops/http2/session.rs:282-290 | ext/node/ops/http2/session.rs:340-348 | ext/node/ops/http2/session.rs:362-370 \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":"ext/node/ops/http2/session.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0c234e3be1c40110de074b69e2ab63ac699a66f7e08915a9b28c1231247850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ext/web/console/mod.rs:841-849 | ext/web/console/mod.rs:875-883 | ext/web/console/mod.rs:909-917 \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":"ext/web/console/mod.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0729e336f6e4c80d5fe2736c62ce7672ec5bfde7bf54366e06a48e0b77b94ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 3): libs/core/uv_compat/pipe.rs:1658-1663 | libs/core/uv_compat/tty.rs:2251-2259 | libs/core/uv_compat/tty.rs:2336-2343 \u2014 before extracting anything, compare \u0060libs/core/uv_compat/pipe.rs\u0060 and \u0060libs/core/uv_compat/tty.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1658\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/uv_compat/tty.rs:2262\u0060 calls \u0060clear_ready\u0060 and \u0060libs/core/uv_compat/pipe.rs:1664\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea400886bac6de6374c00463f08a6662af63f015389ae4ec1379145cb5774606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): runtime/worker.rs:1076-1084 | runtime/worker.rs:1094-1102 | runtime/worker.rs:1110-1118 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/worker.rs:1076\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/worker.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff022c3369888da9513278f9b3935ba491d28b5520a8ea6c9aab91b7642e8595"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/standalone/native_addons.rs:218-226 | cli/standalone/native_addons.rs:237-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/standalone/native_addons.rs:218\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/standalone/native_addons.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"511485fe0af7c1abc3b6bfdb108e3d07aa9e4593b024f4b81c481541e0d08ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/tools/desktop_devtools.rs:1034-1042 | cli/tools/desktop_devtools.rs:1046-1054 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop_devtools.rs:1034\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop_devtools.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee10ca21878602e4d9c21dd404eaaf1408c3d827b6dd9b52e8bd894cffe6275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/tools/installer/npm_compat.rs:1289-1297 | cli/tsc/tsconfig_gen.rs:690-698 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/installer/npm_compat.rs:1289\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/installer/npm_compat.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"375f3a5c06abfc7b75b6ccb574c77e74081f7f07982f49046b04738f7ebaa7ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): cli/tools/pack/package_json.rs:199-207 | cli/tools/pack/package_json.rs:212-219 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pack/package_json.rs:212\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/package_json.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1234a9072797f612e88c12b3bc3eaccb5b967cd081784e1e7bdfeb94ce77fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/pm/cache_deps.rs:227-236 | cli/tools/pm/deps.rs:813-822 \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":"cli/tools/pm/cache_deps.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb910a8014a497eb44dd57a4b9259835095a6562fe3f25e14fc48bc77a39562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/tools/publish/wasm.rs:187-195 | cli/tools/publish/wasm.rs:233-241 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/publish/wasm.rs:187\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/wasm.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a71d317e62777a418964ac1a710943071c62304f841402912f7555ab4a76906"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): cli/tsc/tsconfig_gen.rs:165-173 | cli/tsc/tsconfig_gen.rs:291-298 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tsc/tsconfig_gen.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25fa194c4869517eb1efe5cecfbd794491914b911172232969d9bd008cd62b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/canvas/byow.rs:122-131 | ext/canvas/byow.rs:146-155 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/canvas/byow.rs:122\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/byow.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6d6f58980603a10c2bdcec9be826d8c4fd383bee35101e058aa272431408b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/crypto/lib.rs:640-648 | ext/crypto/lib.rs:666-674 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/lib.rs:640\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/lib.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdec0704a11073c991f72b36d8e528f5a6ff65fb307db97a39a605926679491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/crypto/make_key.rs:357-365 | ext/crypto/make_key.rs:398-406 \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":"ext/crypto/make_key.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5308d17d056b05da5e60f5b85d5feb3094b2d63502161fce49946281feef1e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/crypto/node_interop.rs:131-139 | ext/crypto/node_interop.rs:169-177 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/node_interop.rs:131\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cee22cf1ffc599bb92006ad474fa65dfc942aca93c2cd0be0f088ca5088d48e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/crypto/subtle_generate_key.rs:357-365 | ext/crypto/subtle_generate_key.rs:388-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_generate_key.rs:357\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d71de57558c2b961bf8ce6246d03030f4d01964698bc9011dfd43cda7b8dce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/fs/ops.rs:1162-1170 | ext/fs/ops.rs:1250-1258 \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":"ext/fs/ops.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7f83248c699375fe299aa881078a80d8db3fb0dab7e62bddbce9f3395222ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): ext/fs/ops.rs:1193-1201 | ext/fs/ops.rs:1288-1294 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1193\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2fe27593c26130c8af2d3878f1e950d7867164850a8ad416c3a0562e112e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/http/http_next.rs:2756-2764 | ext/http/lib.rs:1452-1460 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f02f689e682b6374fc92bd8ca03484871850706ba228d8ec3d352b1727b3512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): ext/http/http_next.rs:3956-3963 | ext/http/http_next.rs:4489-4497 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":3956}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e71a1e5d3b75e98f02dd3369ff731e7af8d43b31168e54921f70330270b5c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/http/http_next.rs:3997-4005 | ext/http/http_next.rs:4365-4373 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:3997\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":3997}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a2a202523dab97b7f2e60c0215996bb0395215b219cfddacec842dec924d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/http/http_next.rs:5108-5116 | ext/http/http_next.rs:5294-5302 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":5108}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aee5e65445044b1fa117f26b749791b9f75eeb5b36b6983a9893f354ca0823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/io/bi_pipe.rs:155-163 | ext/io/bi_pipe.rs:291-299 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060buf\u0060 to \u0060\u0026mut [u8]\u0060 in one and \u0060\u0026[u8]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/bi_pipe.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c6c8729b57d6cac3fc6c413df8d88d3144f770858a385ff5cf9aecf7a80af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/napi/js_native_api.rs:2599-2607 | ext/napi/js_native_api.rs:2677-2685 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060result\u0060 to \u0060*mut f64\u0060 in one and \u0060*mut i64\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15c0b282337ffd6ac2187a059706e3ec7d047e105b871158e7925d9c0412830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/napi/js_native_api.rs:3225-3233 | ext/napi/js_native_api.rs:3275-3283 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/napi/js_native_api.rs:3225\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":3225}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a007654df2a45bb169380f58b60699dc0fed33b140ca060109ac5f0ffd0526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 3): ext/net/ops.rs:265-273 | ext/net/ops.rs:970-978 | ext/net/ops.rs:1029-1032 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/net/ops.rs:1029\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"16170079c3ba914da2c2971f823f2774881135014ee8ab8dc5c5a5c83ce396c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/node/ops/fs.rs:3288-3296 | ext/node/ops/fs.rs:3543-3551 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:3288\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":3288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8991439c13d031738557a7526d6ac174bf1d8f5e1ae44377909e82a922fd26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/node/ops/http2/session.rs:1013-1022 | ext/node/ops/http2/session.rs:1080-1089 \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":"ext/node/ops/http2/session.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"793402af29ec222a526508b9cce8b03c8652d24711ecb7148b81a503f5b43327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/node/ops/stream_wrap.rs:1425-1433 | ext/node/ops/stream_wrap.rs:1924-1932 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/stream_wrap.rs:1425\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ca6446455050c2cfed54f7b64c3036abf8fc9b1bdfb8906d9e90f8189a2e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/node/ops/wasi.rs:1636-1644 | ext/node/ops/wasi.rs:1807-1815 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/wasi.rs:1636\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74465fe534b25e8d05bf07cf652bf45b169f5599859341ff62ac4ad7e934149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/node_crypto/cipher.rs:127-135 | ext/node_crypto/cipher.rs:283-291 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/node_crypto/cipher.rs:282\u0060 calls \u0060truncate\u0060 and \u0060ext/node_crypto/cipher.rs:126\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91ab79cfb0ca8e729ca1e867740c708f15348021842fbcaaf73a2d817f09da1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): ext/node_crypto/lib.rs:417-425 | ext/node_crypto/lib.rs:466-473 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/lib.rs:417\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/lib.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a5b6947e77ef002881a25e334b2e9e9f7ac7d69d47770a74537723502085f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/node_sqlite/database.rs:482-490 | ext/node_sqlite/database.rs:556-564 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/database.rs:482\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"1066211fa2be90ef5d46c3a4aecacf9d7c8a4eab518d17781c8328709148b550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/process/lib.rs:871-880 | ext/process/lib.rs:1005-1013 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/process/lib.rs:871\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/process/lib.rs:1003\u0060 calls \u0060push\u0060, \u0060Some\u0060 and \u0060ext/process/lib.rs:871\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/lib.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20193a0914043a329dbe11ee9ff2d1dec31845e56fa061281470865f7cce57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/web/console/error_fmt.rs:741-749 | ext/web/console/error_fmt.rs:763-771 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/console/error_fmt.rs:741\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/error_fmt.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8eaea88cf16ca147671d2a89773e4184e5f26b184c580f2552b5fbc0bfa2a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/webgpu/queue.rs:148-156 | ext/webgpu/queue.rs:168-176 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/webgpu/queue.rs:146\u0060 calls \u0060length\u0060, \u0060byte_length\u0060, \u0060checked_div\u0060 and \u0060ext/webgpu/queue.rs:167\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/queue.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f9471143d7706efbe540e19b94543446f140d51f4379e278474062b29274a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/cli_parser/src/convert.rs:3426-3434 | libs/core/modules/import_graph.rs:184-192 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cli_parser/src/convert.rs:3426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":3426}}}],"partialFingerprints":{"codehealthFindingId/v1":"442dc9c5dbe798475acc7c7edcf797db3538b26d5649e8acc99e2419fd2577d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/core/modules/mod.rs:807-815 | libs/core/modules/mod.rs:836-844 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/modules/mod.rs:807\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/mod.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a6c22edcd1b1d6781e6de36359198ff2a5dbafbaf9f35bd7edcb650ff84927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/core/ops_builtin_v8.rs:1075-1083 | libs/core/ops_builtin_v8.rs:1155-1163 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/ops_builtin_v8.rs:1075\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6b285303fac1f0dfbd5929d413e91ddbb1e77eccc6b7b6f85127f693fb2500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/core/uv_compat/stream.rs:894-902 | libs/core/uv_compat/tty.rs:2070-2078 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/stream.rs:894\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/stream.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"108d2c27873542f7d8858fa89924a7180489acd53c86629e3f5355e882605896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/dcore/src/inspector_server.rs:291-299 | libs/inspector_server/lib.rs:532-540 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdee287a0653406c5f8b98e5e44d9d4a6a0e1893337c5fb07cb97f56ee66bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/http_h1/conn.rs:742-750 | libs/http_h1/conn.rs:756-764 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/conn.rs:742\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"450454c818de7f22deab4d7d146dd26e3b6087927d85cdc30d176c892389df17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): libs/npm/resolution/graph.rs:1800-1806 | libs/npm/resolution/graph.rs:2099-2107 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm/resolution/graph.rs:1800\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/graph.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ba780af7d0b33fa236c0c6b33206483cb557f98361766628f4858d5b2ed0df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/npm_installer/bin_entries/windows_shim.rs:97-105 | libs/npm_installer/bin_entries/windows_shim.rs:154-162 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/bin_entries/windows_shim.rs:97\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/bin_entries/windows_shim.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b33f42a0e5b502a4f780b75043cc9c204d6f7fddea1381257da99b53ff530c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/npm_installer/hoisted.rs:449-457 | libs/npm_installer/hoisted.rs:491-499 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/hoisted.rs:449\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"482aeb970d231142ea069f5e2f5fd612cd0f3150a5660453c17ce8e554949bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): libs/npm_installer/hoisted.rs:910-916 | libs/npm_installer/local.rs:405-413 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/hoisted.rs:910\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/npm_installer/local.rs:415\u0060 calls \u0060write_initialized_file\u0060 and \u0060libs/npm_installer/hoisted.rs:917\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11511be1277954119908e108dfb27bc87adb08ba807449a410539fa01fd35b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): runtime/cpu_profiler/cpuprof.rs:64-72 | runtime/cpu_profiler/flamegraph.rs:19-27 \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":"runtime/cpu_profiler/cpuprof.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3569cfbc7323f8f9b7973da55d6979c644359252ac650b38ab1516c7b47207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): runtime/ops/desktop.rs:1788-1796 | runtime/ops/desktop.rs:1814-1821 \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":"runtime/ops/desktop.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"7959d9a750433484089f0db52df92d222bba20090a7dddaedcebacb82d749cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): ext/crypto/digest.rs:340-347 | ext/crypto/subtle_decrypt.rs:240-247 | ext/crypto/subtle_decrypt.rs:373-380 | ext/crypto/subtle_derive_bits.rs:276-283 | ext/crypto/subtle_encrypt.rs:295-302 | ext/crypto/subtle_encrypt.rs:429-436 | ext/crypto/subtle_sign.rs:239-246 | ext/crypto/subtle_sign.rs:287-294 \u2014 before extracting anything, compare \u0060ext/crypto/digest.rs\u0060 and \u0060ext/crypto/subtle_decrypt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/digest.rs:340\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/digest.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c47ff816d621cee129959074d9dea0476ce0102781c62b66e01e16ac2aa965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): ext/node/ops/llhttp/binding.rs:331-338 | ext/node/ops/llhttp/binding.rs:578-585 | ext/node/ops/llhttp/binding.rs:620-627 | ext/node/ops/llhttp/binding.rs:673-680 \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":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a7ecc5150f19b36eec0d4bccf5f95aee7571693742fb235e14623c9f76e871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): ext/web/console/mod.rs:1108-1115 | ext/web/console/mod.rs:1231-1238 | ext/web/console/mod.rs:1262-1269 | ext/web/console/mod.rs:1350-1357 \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":"ext/web/console/mod.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7f59db567ce4d8a77dd9ed2255bb8db131ca1cf7fa7be84f22ffc1063dab39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): ext/web/css_value.rs:1171-1177 | ext/web/css_value.rs:1189-1195 | ext/web/css_value.rs:1207-1213 | ext/web/css_value.rs:1356-1363 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/css_value.rs:1171\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/css_value.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5933defba1c8a45f89d5dd3c08d2a43d4b934fd91c3b5695aeadbbfb299551de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): libs/core/uv_compat/pipe.rs:1022-1029 | libs/core/uv_compat/pipe.rs:1048-1055 | libs/core/uv_compat/stream.rs:503-510 | libs/core/uv_compat/stream.rs:608-615 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1022\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae31cd65da68b9f26cc6107f07a727df16399ddf7b99732337c9983143953ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): libs/resolver/bun_lockfile_import.rs:340-347 | libs/resolver/npm_lockfile_import.rs:288-295 | libs/resolver/pnpm_lockfile_import.rs:743-750 | libs/resolver/yarn_lockfile_import.rs:181-188 \u2014 before extracting anything, compare \u0060libs/resolver/bun_lockfile_import.rs\u0060 and \u0060libs/resolver/npm_lockfile_import.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/resolver/bun_lockfile_import.rs:348\u0060 calls \u0060starts_with\u0060 and \u0060libs/resolver/npm_lockfile_import.rs:296\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/bun_lockfile_import.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abcb12e962c335fa1a81bec965e53d162221fddde3c9b337cd632ae0ee7371e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): cli/tools/bundle/mod.rs:526-533 | cli/tools/transpile.rs:198-205 | cli/tools/transpile.rs:322-329 \u2014 before extracting anything, compare \u0060cli/tools/bundle/mod.rs\u0060 and \u0060cli/tools/transpile.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/mod.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a00c76bc0656a212d46726bdaf18d39076153e6af9972bc7f5c803fcb4e72d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 3): cli/tools/lint/ast_buffer/ts_estree.rs:759-766 | cli/tools/lint/ast_buffer/ts_estree.rs:792-799 | cli/tools/lint/ast_buffer/ts_estree.rs:1301-1306 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"733d5bca430b45ac5c01e9119b62ffcf59630b16570cc94e004c1e61efae0416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): ext/crypto/subtle_crypto.rs:920-927 | ext/crypto/subtle_generate_key.rs:857-864 | ext/crypto/subtle_import_key.rs:1990-1997 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_crypto.rs\u0060 and \u0060ext/crypto/subtle_generate_key.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe62691cc7b87ee3b4c6ea6811e790f11c110ebaf3749408929f13fcb4cbec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): ext/crypto/subtle_export_key.rs:749-755 | ext/crypto/subtle_export_key.rs:829-835 | ext/crypto/subtle_export_key.rs:908-915 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_export_key.rs:749\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa21881465686df3812c7f5b536821f640a3bed9d3594a925af943a2118cb62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ext/crypto/subtle_export_key.rs:783-791 | ext/crypto/subtle_export_key.rs:864-872 | ext/crypto/subtle_export_key.rs:932-940 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_export_key.rs:783\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"e813e7cbdd52fd9151cb9091d7f6d174a264b04435b27c56e53dba74042867e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): ext/napi/js_native_api.rs:541-548 | ext/napi/js_native_api.rs:568-575 | ext/napi/js_native_api.rs:623-630 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b34b98439437f6c75626adb2bd7a6a98ed39b72cef83a54eb601dde8ba0d2c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): ext/napi/js_native_api.rs:2709-2716 | ext/napi/js_native_api.rs:2737-2744 | ext/napi/js_native_api.rs:2765-2772 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc0251ef5eb9c9f1833d38f4473e424bc56d12f8dacf8bffdf6ff6da1698add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/node/ops/stream_wrap.rs:1418-1428 | ext/node/ops/stream_wrap.rs:1917-1927 | ext/node/ops/stream_wrap.rs:1997-2007 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/stream_wrap.rs:1418\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"091f63e6c28ba5301e5471f5fa658d7ada892c1ababdc68f2cf80b22cd59f3a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): ext/node_crypto/lib.rs:418-426 | ext/node_crypto/lib.rs:467-474 | ext/node_crypto/lib.rs:551-558 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/lib.rs:418\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/lib.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60712d3c30572237552c82e9c201f4b3efdfd8377b1c506cf07fa77098a736f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/cli_parser/src/convert.rs:1517-1524 | libs/cli_parser/src/convert.rs:1581-1588 | libs/cli_parser/src/convert.rs:2637-2644 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cli_parser/src/convert.rs:1579\u0060 calls \u0060allow_and_deny_import_parse\u0060 and \u0060libs/cli_parser/src/convert.rs:1515\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffe0e8f5d19a003fd80a83271847a93aad8870d0e6c8b1a13b976ee99ee54a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/core/uv_compat/pipe.rs:1135-1142 | libs/core/uv_compat/pipe.rs:1162-1169 | libs/core/uv_compat/pipe.rs:1171-1178 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1135\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a465c3b63b47ec7811e4e507bb46412de0076e484feb8ed5b9e7e3fa7b96303e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/core/uv_compat/pipe.rs:1978-1985 | libs/core/uv_compat/tty.rs:2224-2231 | libs/core/uv_compat/tty.rs:2311-2318 \u2014 before extracting anything, compare \u0060libs/core/uv_compat/pipe.rs\u0060 and \u0060libs/core/uv_compat/tty.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1978\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"871622173c0b3ffd9c1c9feb7c6b001bff82ef291fd5309820d5ad264a52a2fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/node_shim/lib.rs:3585-3592 | libs/node_shim/lib.rs:3664-3671 | libs/node_shim/lib.rs:3714-3721 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/node_shim/lib.rs:3661\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060libs/node_shim/lib.rs:3581\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/lib.rs"},"region":{"startLine":3585}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5873662a6b49c9cc0eedf1546a181738cd4b1af6fc3820d1f808d478e3f9b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/npm_installer/package_json.rs:294-301 | libs/npm_installer/package_json.rs:343-350 | libs/npm_installer/package_json.rs:384-391 \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":"libs/npm_installer/package_json.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"22449bd8c4f01cde4f9d82ee565f4dbe9204314fe81012e08b6f982311727b54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/ops/bench.rs:111-118 | cli/ops/testing.rs:146-153 \u2014 before extracting anything, compare \u0060cli/ops/bench.rs\u0060 and \u0060cli/ops/testing.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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":"cli/ops/bench.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a59690224b74f764c708c318bbaee3a035f497e0b4ca669528c226265cc46f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/standalone/binary.rs:495-503 | cli/standalone/binary.rs:570-578 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/standalone/binary.rs:495\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/standalone/binary.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8d86bab7f62176382e18e884a4b9fbcce84b8b91dd7c63f98faec2ba72a38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/standalone/native_addons.rs:267-274 | cli/tools/compile.rs:452-459 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/standalone/native_addons.rs:267\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/standalone/native_addons.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c8b7ebd1805da5357dc0139e47bb577d80bdd8d3a893bcfa80b5786496bc89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/tools/compile.rs:642-649 | cli/tools/compile.rs:908-915 \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":"cli/tools/compile.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43113bb063eacf3f8e1a1e2e5806f5efb8d658bed99d1063731f6df1d3cd336"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/tools/fmt.rs:294-301 | cli/tools/lint/mod.rs:511-518 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/fmt.rs:294\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/fmt.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"029602a074b622fd6080620811f39bf95519dbdd736a7a2cbce062f856116a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/tools/pm/list.rs:35-42 | cli/tools/pm/why.rs:29-37 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pm/list.rs:35\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/list.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e34fa2579845c98b74d191cc80b99a4ba8b09ea98b5a43018765d4fa3e04d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/tsc/tsconfig_gen.rs:687-694 | cli/tsc/tsconfig_gen.rs:710-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tsc/tsconfig_gen.rs:687\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b52b2a3b8be51df2c75cbc4c21d11b8f43ec7fa90df7637c3124992ee642182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/crypto/node_interop.rs:123-130 | ext/crypto/subtle_get_public_key.rs:131-138 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/node_interop.rs:123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3c3a4700ff372a41b5196437fa35e279ff4cfa8ec6f4e88471bd89d784d3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:497-504 | ext/crypto/subtle_decrypt.rs:531-538 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:497\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"9144c6914d642c43539cd2b61a37b47b2f5c1c97f083b57b933842b0e6042c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/crypto/subtle_import_key.rs:748-755 | ext/crypto/subtle_import_key.rs:874-881 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:748\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dfbab3e2f80edb615865e8117d6141292cf9e7e74676f8bda05dc9598114f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/crypto/subtle_import_key.rs:1525-1532 | ext/crypto/subtle_import_key.rs:1573-1580 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:1525\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"33463309fbaf7f6b9f55defc804a56d089c8bcc0c4c7f5c8acb1220eef06df0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/fs/ops.rs:1494-1501 | ext/fs/ops.rs:1637-1644 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1494\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f5deb9ee40a0319946d1a41fde08d171c27d3d7d6b23008be4a2d0b4252965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/fs/ops.rs:1787-1794 | ext/fs/ops.rs:1928-1935 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1787\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"780c81cf471414799f602d636522388e6b2b982a2133b8cbb96ee52ecaa6e923"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/io/bi_pipe.rs:179-186 | ext/io/bi_pipe.rs:308-315 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/io/bi_pipe.rs:179\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060buf\u0060 to \u0060\u0026mut [u8]\u0060 in one and \u0060\u0026[u8]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/bi_pipe.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09a22aff9d05f01cb928cbf5143e7ffcef5dd0986d5e7bc4e3ef68d74808628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): ext/napi/js_native_api.rs:3055-3062 | ext/napi/js_native_api.rs:3113-3119 \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":"ext/napi/js_native_api.rs"},"region":{"startLine":3055}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cc27f8b0ffb6c4295bd7d72688d9d7b71059cf1406fa06be06701441f20db7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 3): ext/napi/node_api.rs:461-468 | ext/napi/node_api.rs:509-512 | ext/napi/node_api.rs:530-537 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/napi/node_api.rs:509\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/napi/node_api.rs:468\u0060 calls \u0060null\u0060, \u0060into\u0060, \u0060Some\u0060 and \u0060ext/napi/node_api.rs:512\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/node_api.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"86098944da9d2ea9c2823ed2f541a2ff8688065b8bc78a313c2657140c487e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node/ops/http2/session.rs:879-886 | ext/node/ops/http2/session.rs:992-999 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/http2/session.rs:879\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060session\u0060 to \u0060\u0026Session\u0060 in one and \u0060\u0026mut Session\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"723a9dbc30d37f756cce0db4aac782d0fdfdc0ab62e17830f12f3c40c652da9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node/ops/http2/stream.rs:425-432 | ext/node/ops/tls_wrap.rs:2831-2838 \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":"ext/node/ops/http2/stream.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"67763b1eaa2f2618d37545c2296446884c1f063dd13f69bb255b00a426a6f6ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node/ops/stream_wrap.rs:424-431 | ext/node/ops/tls_wrap.rs:2491-2498 \u2014 before extracting anything, compare \u0060ext/node/ops/stream_wrap.rs\u0060 and \u0060ext/node/ops/tls_wrap.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fa37bd36b1495de8d8cd0b08d094d60b5b507e13535346db91616cbff41ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node/ops/tcp_wrap.rs:855-862 | ext/node/ops/tcp_wrap.rs:885-892 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tcp_wrap.rs:855\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"5440ac69071887dcb9edb65ba4e2693b2f3278ea6106e638429f7387d42b4e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node/ops/tls_wrap.rs:2996-3007 | ext/node/ops/tls_wrap.rs:3017-3024 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tls_wrap.rs:2996\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2996}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8624507275cacc320196a1adcb9e6a2028eee59e2f942ad34536807ba2aa9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node/ops/vm.rs:1547-1554 | ext/node/ops/vm.rs:1558-1565 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/vm.rs:1547\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/vm.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc7f653b0f8fb22fc99907fe3eefa2d086e4ef2145b4efa7324b0d13e2eac6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node_crypto/keys.rs:2762-2769 | ext/node_crypto/keys.rs:2819-2826 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/keys.rs"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a8341d7f8aa800b076fc6b83a33ae0df47962fcc37131fba51e8a68c52f783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node_crypto/keys.rs:3624-3631 | ext/node_crypto/keys.rs:4095-4102 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/keys.rs:3624\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/keys.rs"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"402008615dc236a4655962e76945290af635e36107502f862477076ac23d18ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node_crypto/lib.rs:405-412 | ext/node_crypto/lib.rs:454-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/lib.rs:405\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/lib.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff6e6a60922fd457ddbb89e89383301591916d44356f525b25c4f23c3121200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): ext/node_crypto/x509.rs:1103-1109 | ext/node_crypto/x509.rs:1150-1157 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/x509.rs:1103\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/x509.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c74939c19a6f87705c82064ea3e3faa3884463bae7287008def145b55aa5151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): ext/node_crypto/x509.rs:1111-1117 | ext/node_crypto/x509.rs:1159-1166 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/x509.rs:1111\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/x509.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56b82674dbd9272d9753e52839f4d1a7a4220922b524342bb082d8c3efafe48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): ext/node_crypto/x509.rs:1119-1125 | ext/node_crypto/x509.rs:1168-1175 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/x509.rs:1119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/x509.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eed39e5aa92d376b16297dc019ed07e7d8dfdd20d53c19d6e0076e99a66eb2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/telemetry/lib.rs:1990-1997 | ext/telemetry/lib.rs:2639-2646 \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":"ext/telemetry/lib.rs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe1074cc00950686e2e6bc545466ece8477923575db1512b090aa604ca7a6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/web/console/inspect.rs:1565-1572 | ext/web/console/inspect.rs:3049-3056 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/console/inspect.rs:1565\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a43d5da4833dd47b2af3f4716685f77aabeade6f25584f71397f047438ee7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/web/css_value.rs:1001-1008 | ext/web/css_value.rs:1015-1022 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/css_value.rs:1001\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/css_value.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b327b571b800ebd82f17ac7bc40b22f54b10075798b8e5b1268fdfe9fac3209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/web/css_value.rs:1144-1151 | ext/web/css_value.rs:1157-1164 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/css_value.rs:1144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/css_value.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"10afdf2c69a0fcec636c83f307d88d824406cea64e46878c530fd62bfa2aa3bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): ext/web/geometry.rs:2797-2803 | ext/web/geometry.rs:2821-2828 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/geometry.rs:2797\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d97825f2920e22e69af2eac6f2b9ba6045516c0a7101c0d2199a4688865fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/web/geometry.rs:2937-2944 | ext/web/geometry.rs:2967-2974 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/geometry.rs:2937\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a221b867203577352ee36233d9e8569c64db8e7648e75c8f381e5a9d37222d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cli_parser/src/convert.rs:2102-2109 | libs/cli_parser/src/convert.rs:2692-2699 \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/cli_parser/src/convert.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d621170ce05ce0fe140ec29bbc6281c9a6a838b2e4cff455a9693521983a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/core/modules/map/dynamic.rs:260-267 | libs/core/modules/map/dynamic.rs:642-651 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map/dynamic.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"985dc87439484994549a2feebd1d9a0adde676126d395b05c4617c629b18fb50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1569-1576 | libs/core/uv_compat/pipe.rs:1634-1641 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1569\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"b360af9466b7e49b0dbe401a20141927c8c071d8126788ba3261299119276a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/dcore/src/inspector_server.rs:279-286 | libs/inspector_server/lib.rs:520-527 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbd27c6a74c5bf09da14939872f10c93fccdf3d0d737007bbc7a2ac03408654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/http_h1/conn.rs:123-130 | libs/http_h1/conn.rs:583-590 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060response\u0060 to \u0060Response\u003C\u0027a\u003E\u0060 in one and \u0060Response\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"29faa1a5c3ed844af1a8d00b51f3de14b6cdfdfa9563c84f899e65c412ea124d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/http_h1/conn.rs:1119-1126 | libs/http_h1/conn.rs:1135-1142 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/conn.rs:1119\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e164c14e996c7309486297d98012e0874afba520228dec7d945c280978acb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/npm_installer/bin_entries/windows_shim.rs:256-270 | libs/npm_installer/bin_entries/windows_shim.rs:275-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":"libs/npm_installer/bin_entries/windows_shim.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebc8f7741f87c47e33c498bbe3024e05d555399b25dae0fd0b5e14fcd91a0ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/ops/op2/dispatch_shared.rs:97-104 | libs/ops/op2/dispatch_shared.rs:137-144 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/op2/dispatch_shared.rs:97\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/dispatch_shared.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a4588e89615b0d80e9c5d1c639fa1f151e175309b4f0d05fd4345983398a22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/resolver/deno_json.rs:878-885 | libs/resolver/deno_json.rs:902-909 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/resolver/deno_json.rs:878\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/deno_json.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc6481d9e74790b85a9a1756c819d12b015736a5cc3256d861ada580bb5fc7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/resolver/pnpm_lockfile_import.rs:212-219 | libs/resolver/pnpm_lockfile_import.rs:474-481 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/resolver/pnpm_lockfile_import.rs:212\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/pnpm_lockfile_import.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7c92505e551db59e47b10441de03aa24219d96962b8d115f63827447e05f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/resolver/yarn_lockfile_import.rs:75-82 | libs/resolver/yarn_lockfile_import.rs:86-93 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/resolver/yarn_lockfile_import.rs:75\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/yarn_lockfile_import.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b0066a59d4cc4b74fd8e0f85be8b1c4ef68ed8041faf2b250a6f771aeac406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): ext/crypto/digest.rs:367-373 | ext/crypto/digest.rs:395-401 | ext/crypto/subtle_decrypt.rs:261-267 | ext/crypto/subtle_encrypt.rs:316-322 | ext/crypto/subtle_sign.rs:331-337 \u2014 before extracting anything, compare \u0060ext/crypto/digest.rs\u0060 and \u0060ext/crypto/subtle_decrypt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/digest.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"94deed1b08e2724f7005c5b434f18660f4d55693aa73f452f3ce943602253eb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): cli/lsp/diagnostics.rs:818-823 | cli/lsp/diagnostics.rs:886-892 | cli/lsp/diagnostics.rs:912-918 | cli/lsp/diagnostics.rs:938-943 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/diagnostics.rs:818\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/diagnostics.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf50f44c76b5dc9c31927d587164c7bdf123657eeed424e8896f160f1899a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): ext/crypto/crypto_key.rs:182-188 | ext/crypto/subtle_generate_key.rs:864-870 | ext/crypto/subtle_import_key.rs:1997-2003 | ext/crypto/subtle_key.rs:184-190 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_generate_key.rs\u0060 and \u0060ext/crypto/subtle_import_key.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 118 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":"ext/crypto/crypto_key.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33965e54ea2f545c784cad45118492fa1b192314ed372b57c308c712f624d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): ext/crypto/digest.rs:407-413 | ext/crypto/subtle_decrypt.rs:284-290 | ext/crypto/subtle_encrypt.rs:340-346 | ext/crypto/subtle_sign.rs:343-349 \u2014 before extracting anything, compare \u0060ext/crypto/digest.rs\u0060 and \u0060ext/crypto/subtle_decrypt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/digest.rs:407\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/digest.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"8241c949af4414de23c3779f397de9e7c9e59ba5dc5433fae899042630c8f481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): ext/node_sqlite/database.rs:1279-1285 | ext/node_sqlite/database.rs:1296-1302 | ext/node_sqlite/database.rs:1312-1318 | ext/node_sqlite/database.rs:1329-1335 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/database.rs:1279\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2da192711e9e07961fb7fc5a3e43562eda45a72294d9ac54840644cfb63176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): ext/crypto/subtle_wrap_key.rs:387-393 | libs/cli_parser/src/convert.rs:3428-3434 | libs/core/modules/import_graph.rs:186-192 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_wrap_key.rs:387\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_wrap_key.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38b120d75b5b08107542eec208100a90ff0b295028ace1a4c82f2983d1993bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): ext/fs/ops.rs:1510-1517 | ext/fs/ops.rs:1588-1594 | ext/fs/ops.rs:1654-1660 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1510\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060state\u0060 to \u0060\u0026mut OpState\u0060 in one and \u0060Rc\u003CRefCell\u003COpState\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a63677976cb022f8db559d3aad09e851e3e22ee2b4d2d3e5eb9edc04e6c3d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): ext/node/ops/http2/session.rs:880-886 | ext/node/ops/http2/session.rs:993-999 | ext/node/ops/http2/session.rs:1373-1379 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/http2/session.rs:880\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060session\u0060 to \u0060\u0026Session\u0060 in one and \u0060\u0026mut Session\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3c4ac2e198327b0bc1e6fd091e9b2b3c01a901bd414cae95313c2f0a2c1486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): ext/node_crypto/x509.rs:296-302 | ext/node_crypto/x509.rs:333-339 | ext/node_crypto/x509.rs:683-689 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/x509.rs:296\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/x509.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f6946b474335db5860abc08cbaec3f8b07976fe01a82627057b652ed6e7da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): ext/node_sqlite/database.rs:3054-3060 | ext/node_sqlite/database.rs:3073-3079 | ext/node_sqlite/database.rs:3094-3100 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/database.rs:3054\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcff640dbe34d851c9647471aa8b244ced81546037e33bee77276e8eade31cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/dcore/src/inspector_server.rs:217-223 | libs/inspector_server/lib.rs:446-452 | libs/inspector_server/lib.rs:557-563 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"750494071ac30915d43b03094c0425641b94e2a70476428bde964417eaeb1128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): cli/lsp/testing/execution.rs:313-319 | cli/tools/bench/mod.rs:316-321 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/testing/execution.rs:313\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/testing/execution.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a52e7ce1415c894dffb53447bece580286719560f4866fdb7cb55c0dbc06d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): cli/lsp/testing/execution.rs:798-803 | cli/lsp/testing/execution.rs:986-992 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/testing/execution.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f4612b7d0801253617dcfd1da1bbd0abeb34b8eaba6728aeaa380c1677aab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/tools/clean.rs:200-206 | cli/tools/clean.rs:221-227 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/clean.rs:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/clean.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de617ae03f830d3166a89f565af497d7a99e3922802293fc4bbaf6387804bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/tools/desktop.rs:5523-5529 | cli/tools/desktop.rs:5595-5601 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:5523\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"219fce5cdd5a04031a0b1c204de224895da3e5f97f7a533f187b16e1ee2ffb7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/tools/lint/ast_buffer/swc.rs:1640-1650 | cli/tools/lint/ast_buffer/swc.rs:1682-1688 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b101f0cddc939ac516fca7ecf2710f536416e93ed0ca53f8365672c9922c9d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/tsc/tsconfig_gen.rs:794-800 | cli/tsc/tsconfig_gen.rs:814-820 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tsc/tsconfig_gen.rs:794\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd394a898645708d0e5207946362fdd155e9fe31a3585dd7e828c54c79ee741"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/cache/lsc_shard.rs:77-84 | ext/cache/lsc_shard.rs:111-118 \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":"ext/cache/lsc_shard.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab199fdca423b18d7a35aa5bbb80787f9a64f6c1f9b81db9db0fee856b033ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/canvas/byow.rs:221-227 | ext/canvas/canvas.rs:126-133 \u2014 before extracting anything, compare \u0060ext/canvas/byow.rs\u0060 and \u0060ext/canvas/canvas.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/byow.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"145daaaa11c128f7927e0da07c4c05fd8f7723b25ef1b3536f0b79939f256aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/crypto/subtle_crypto.rs:870-879 | ext/crypto/subtle_crypto.rs:922-931 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_crypto.rs:870\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e54472a9b87a29322db9bbf1d9f7e68642254294cdde43a3b9c2af9f9cf64f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:494-500 | ext/crypto/subtle_encrypt.rs:559-565 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d07b161f5248a26a023cb17798d169e890a80254c3e0edd8379f60aa351959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/crypto/subtle_import_key.rs:757-765 | ext/crypto/subtle_import_key.rs:883-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:757\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdec3d6adac1a9aef8d2a3542d779f05032a525c929092401004eb65b3e5f080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/crypto/subtle_import_key.rs:769-775 | ext/crypto/subtle_import_key.rs:895-901 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:769\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"660695782f6fb7c7a88b9eacc22b743239681208bd427279906cd9dae6a350a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/fs/ops.rs:830-836 | ext/fs/ops.rs:886-892 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:830\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"4724580661142c8bc287167176e9b98498ac6cd117068d5e363443b902029cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/http/http_next.rs:3945-3951 | ext/http/http_next.rs:4401-4408 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":3945}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f62c09a4e42a7787ff5a06bcef50282deef3852c527d46f139fed3847f32fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/http/http_next.rs:3967-3973 | ext/http/http_next.rs:4174-4181 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":3967}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e77478fc75805273ff6f374db7fc450ab98325ca8897857b24ecee149d793dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/http/http_next.rs:4301-4307 | ext/http/http_next.rs:4472-4478 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:4301\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":4301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a69dc13d45c816258a6ea273cfb1b186aab962949de78c98b16db9df9a7db27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/http/lib.rs:156-162 | libs/cache_dir/file_fetcher/http_util.rs:29-35 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/lib.rs:156\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6793c8abe2842a545299f0f924da0d641186183d44324eae91628b4172ffbf43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/http/service.rs:1229-1235 | ext/http/service.rs:1287-1293 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/service.rs:1229\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/service.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce626e2de38c1c889f0266e7b8a06857f3019b5d4409fbcd9f4cbe3116f94e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/napi/uv.rs:997-1003 | ext/napi/uv.rs:1019-1025 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/napi/uv.rs:997\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/uv.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea19f5f0ab11356af2c296c4014e1fdc134463b9ff7442cef3be979ea9e564f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node/ops/http2/session.rs:329-335 | ext/node/ops/http2/session.rs:2534-2540 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/http2/session.rs:329\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae42737e176d3f1e2fb8486a9cfb914651c61e41015caa350c2198cfe4c9d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node/ops/inspector.rs:81-87 | libs/cli_parser/src/convert.rs:57-63 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/inspector.rs:81\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/inspector.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c828edeb17568a6a1066977d7f5c027e0a97934cb1cd0c963b4eefbaa2256b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node/ops/require.rs:45-51 | ext/node/ops/worker_threads.rs:38-44 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/require.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"995aef363ab36bb06d0ad16145936b795cc175ba685ec3f5d5f3b0ad27de066e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node/ops/tls.rs:429-435 | ext/node/ops/tls.rs:561-567 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tls.rs:429\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"3234932d6bbcee685da0230d6c97bdfd5b3b17656d823270ae9ff4dc988b095f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node/ops/tls_wrap.rs:595-601 | ext/node/ops/tls_wrap.rs:629-635 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tls_wrap.rs:595\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cf1caf8598bbfee4a7e56c5ddac9b94feb8ab7e77ff7287a8b99b89d674c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node/ops/tls_wrap.rs:2912-2918 | ext/node/ops/tls_wrap.rs:2952-2958 \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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"98778064ad30291912ea797bc815d748e5e0159a67fa38dd5f5df53e58373688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node/ops/udp.rs:528-534 | ext/node/ops/udp.rs:557-563 \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":"ext/node/ops/udp.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf26de7025a10e9cc5fade7f9a05665f2a2e30415ba779ac97b525f0b7789f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node_crypto/cipher.rs:884-890 | ext/node_crypto/cipher.rs:1340-1346 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:884\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"5196fc74d1185053ac40b1c29e870d13667ef9dcb2bd523445dd806efbf1554f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node_crypto/cipher.rs:903-909 | ext/node_crypto/cipher.rs:1359-1365 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:903\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a1d591b08e826d047739a376166ca55d00954fb5b3ed29ff41b67523f533f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node_sqlite/sql_tag_store.rs:651-657 | ext/node_sqlite/statement.rs:871-877 \u2014 before extracting anything, compare \u0060ext/node_sqlite/sql_tag_store.rs\u0060 and \u0060ext/node_sqlite/statement.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/sql_tag_store.rs:651\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3687bb16b9cec3ccd4f285f4ad16e5ff9a3c1031fc4f32de70bf2062c7c7663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): ext/web/geometry.rs:335-337 | ext/web/geometry.rs:371-377 | ext/web/geometry.rs:385-391 \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":"ext/web/geometry.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8cf7b3795149d9858f205a1bef059dea82bd0022466c619e95dc534596f74f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cache_dir/global/cache_file.rs:70-76 | libs/cache_dir/global/cache_file.rs:102-108 \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/cache_dir/global/cache_file.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5e564c47a2864a316da977f1e5d8b0e3a54fc55c670f5e033fcbbdc81a52e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cli_parser/src/completions.rs:59-65 | libs/cli_parser/src/completions.rs:84-90 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cli_parser/src/completions.rs:59\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/completions.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6959b362ded10b3a4ca748b9ff777effff67c40da37d2ce9349d24673872e43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/config/workspace/mod.rs:679-685 | libs/config/workspace/mod.rs:688-694 | libs/config/workspace/mod.rs:696-703 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/config/workspace/mod.rs:679\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/mod.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3427157b63778a893a588acdca1537365aeca584ebd894f19bb9f2cf6dee049"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/core/modules/map/evaluation.rs:140-146 | libs/core/modules/map/evaluation.rs:153-159 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/modules/map/evaluation.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map/evaluation.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2ecfc2314f57139cc2915bd578b127c98dbbbee1385af50d0344b2423f5c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/core/runtime/bindings.rs:950-964 | libs/core/runtime/bindings.rs:966-980 \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/core/runtime/bindings.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8ae5b0e5061f478f5593b34c39be07b560b187124831016f582bd1ca791544"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/core/runtime/bindings.rs:997-1004 | libs/core/runtime/bindings.rs:1081-1087 \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/core/runtime/bindings.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"b276876d9acc5e210169bddf4bc9998f3301ebe1a6c1acb28c876ac8b9680578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): libs/core/uv_compat/pipe.rs:1298-1303 | libs/core/uv_compat/stream.rs:876-882 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/uv_compat/pipe.rs:1298\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c94b2fdc424b35018d595a44056caf5553fd58e5dab5e3f94f0359d597f0a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/http_h1/parse.rs:447-454 | libs/http_h1/protocol.rs:412-419 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/parse.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee745a964d71c523dca6701cff0bb9b2ef61abc4471c88e1d6612504eb110eb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/node_resolver/resolution.rs:1849-1855 | libs/node_resolver/resolution.rs:2526-2539 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/node_resolver/resolution.rs:1849\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"219db8f0ff5fc048285e87f34fced94b07faf1fbc1721a90f48cbdd27c1a8f92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/resolver/cjs/analyzer/deno_ast.rs:204-210 | libs/resolver/cjs/analyzer/deno_ast.rs:266-272 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/resolver/cjs/analyzer/deno_ast.rs:204\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/cjs/analyzer/deno_ast.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9b7e36efddc99b8cfceda5526b639f846ac587ceaff5aabd980a724462e337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): runtime/ops/worker_host.rs:544-550 | runtime/ops/worker_host.rs:588-594 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/ops/worker_host.rs:544\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/ops/worker_host.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6171f67b4297bc05d27066ca42490dc5c4036547fae4128c32ef2f84311ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): runtime/permissions/lib.rs:4950-4956 | runtime/permissions/lib.rs:4983-4989 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/permissions/lib.rs:4950\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/lib.rs"},"region":{"startLine":4950}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f315100795a10c5d288d19c414d119824d9bc4e02997a2a303f2a1978ef203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): runtime/snapshot.rs:66-72 | runtime/worker.rs:1218-1224 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060runtime/worker.rs:1225\u0060 calls \u0060init\u0060, \u0060lazy_init\u0060, \u0060create_from_env\u0060 and \u0060runtime/snapshot.rs:73\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/snapshot.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5851ca82f51364180458791cf1c9a43d1f401e4c9fdddf2a96093da1e0806721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): libs/core/uv_compat/pipe.rs:700-705 | libs/core/uv_compat/pipe.rs:856-861 | libs/core/uv_compat/pipe.rs:912-917 | libs/core/uv_compat/pipe.rs:1022-1027 | libs/core/uv_compat/pipe.rs:1048-1053 | libs/core/uv_compat/pipe.rs:1311-1316 | libs/core/uv_compat/pipe.rs:1349-1354 | libs/core/uv_compat/stream.rs:503-508 | libs/core/uv_compat/stream.rs:608-613 | libs/core/uv_compat/tcp.rs:728-733 \u2014 there are 10 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 10 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ca55dff47dbfa7508fa7a1257b0f575d33aafe801c32f311dd321c347d316a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): ext/node/ops/http2/session.rs:950-955 | ext/node/ops/http2/session.rs:1017-1022 | ext/node/ops/http2/session.rs:1058-1063 | ext/node/ops/http2/session.rs:1084-1089 | ext/node/ops/http2/session.rs:1139-1144 | ext/node/ops/http2/session.rs:1173-1178 | ext/node/ops/http2/session.rs:1224-1229 | ext/node/ops/http2/session.rs:1275-1280 \u2014 all 8 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/node/ops/http2/session.rs:946\u0060 calls \u0060drop\u0060, \u0060clear_headers\u0060, \u0060find_stream_obj\u0060 and \u0060ext/node/ops/http2/session.rs:1273\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6637f75d9a54ba937806247b099054c6170302c0901690286cbc0e5f14e2075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): cli/lsp/diagnostics.rs:818-823 | cli/lsp/diagnostics.rs:835-840 | cli/lsp/diagnostics.rs:886-891 | cli/lsp/diagnostics.rs:912-917 | cli/lsp/diagnostics.rs:938-943 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/diagnostics.rs:818\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/diagnostics.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"195e58e32d35121a4e3841912119a47392b1686cf81a037474c2408e63e85d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): ext/net/ops.rs:303-308 | ext/net/ops.rs:385-390 | ext/net/ops.rs:418-423 | ext/net/ops.rs:450-455 | ext/net/ops.rs:472-477 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/net/ops.rs:393\u0060 calls \u0060from_str\u0060, \u0060as_str\u0060 and \u0060ext/net/ops.rs:427\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdda6fa38d8889c78e23109aedc342dcef46bb114d31ac47daf624f31b7f66a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): ext/signals/dict.rs:67-72 | ext/signals/dict.rs:102-107 | ext/signals/dict.rs:138-143 | ext/signals/dict.rs:173-178 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/signals/dict.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af2574385fbdfa72973c7ab8a77c3a47e88b3aaabaeb5c50262173c27dc57d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): ext/telemetry/lib.rs:2907-2913 | ext/telemetry/lib.rs:2949-2955 | ext/telemetry/lib.rs:3000-3006 | ext/telemetry/lib.rs:3061-3067 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/telemetry/lib.rs:2907\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8412788239da1b8d848890a8f2106d37b971eeae9d99391273975fc361b40f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): ext/web/console/inspect.rs:1300-1305 | ext/web/console/inspect.rs:1425-1430 | ext/web/console/inspect.rs:1567-1572 | ext/web/console/inspect.rs:3051-3056 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/console/inspect.rs:1300\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d052d54f974f3ebaf464d826d2eebde6752143a2be5cbdc7cceae72a23bc201d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): runtime/ops/desktop.rs:842-847 | runtime/ops/desktop.rs:1870-1875 | runtime/ops/desktop.rs:1938-1943 | runtime/ops/desktop.rs:2103-2108 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/ops/desktop.rs:842\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/ops/desktop.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9eb84c6d3ec17f4db9026d8ed4419c2954f78011c31c794bf9e25ef45daa3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): cli/standalone/native_addons.rs:218-223 | cli/standalone/native_addons.rs:267-272 | cli/tools/compile.rs:452-457 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/standalone/native_addons.rs:218\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/standalone/native_addons.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf10151965fb17158407f293041853b2dae01e2c528ccd6ae1e7c6dcdb2b59b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): ext/cron/socket.rs:427-432 | ext/cron/socket.rs:442-447 | ext/cron/socket.rs:455-460 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/cron/socket.rs:427\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cron/socket.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29ea0d764c23d17c5dbd5bcea549e560346288245dbe5970faed9ea42b6eceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): ext/crypto/subtle_import_key.rs:757-762 | ext/crypto/subtle_import_key.rs:883-888 | ext/crypto/subtle_import_key.rs:996-1001 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:757\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8208d69c0c42f7a47e30728feb4ce949dd669018133b8fec3a1eb24d41906a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): ext/crypto/subtle_import_key.rs:767-772 | ext/crypto/subtle_import_key.rs:893-898 | ext/crypto/subtle_import_key.rs:1006-1011 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:767\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"a689219002d5e798278763d353e761cc585db01c56f9784b1d702f424f151902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): ext/crypto/subtle_import_key.rs:1131-1136 | ext/crypto/subtle_import_key.rs:1151-1156 | ext/crypto/subtle_import_key.rs:1167-1172 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:1131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8565c41dcde2a7f8653d880a5b224b8f76345836fa98fa90b06b295d8c6781dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): ext/node/ops/http2/session.rs:329-334 | ext/node/ops/http2/session.rs:2534-2539 | ext/node/ops/http2/session.rs:3205-3210 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/node/ops/http2/session.rs:3215\u0060 calls \u0060close_native_resources\u0060 and \u0060ext/node/ops/http2/session.rs:335\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8de05088dd3ed3f977a28722b64546f222c782070b54729ae594044ab9fd355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): ext/node/ops/process.rs:539-544 | ext/os/lib.rs:716-721 | runtime/ops/worker_host.rs:943-948 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/process.rs:539\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/process.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc1baafe857ea4ced91bf66a4b595b027994a7fbc6cf254e44400ae264f0f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 3): ext/node_sqlite/sql_tag_store.rs:597-602 | ext/node_sqlite/statement.rs:828-833 | ext/node_sqlite/statement.rs:859-863 \u2014 before extracting anything, compare \u0060ext/node_sqlite/sql_tag_store.rs\u0060 and \u0060ext/node_sqlite/statement.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/sql_tag_store.rs:597\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a90d1d05e51f5f23e61370909060b3c683391b9cebe92cc2195bf751897fd09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/resolver/cjs/analyzer/deno_ast.rs:202-209 | libs/resolver/cjs/analyzer/deno_ast.rs:251-258 | libs/resolver/cjs/analyzer/deno_ast.rs:264-271 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/resolver/cjs/analyzer/deno_ast.rs:250\u0060 calls \u0060as_ident\u0060 and \u0060libs/resolver/cjs/analyzer/deno_ast.rs:201\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/cjs/analyzer/deno_ast.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"17212757fdd754a4a3fcd87ee7b757449645587ee71a957e53ce1ec7524c3591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/http_util.rs:429-434 | cli/http_util.rs:447-452 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/http_util.rs:429\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/http_util.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0bb4cc8f7c9ff30c0b6199ef849843736d7bfa8852f648d6191ff5b5a795ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/lib/worker.rs:479-484 | cli/lib/worker.rs:729-734 \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":"cli/lib/worker.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"d861be7d8c02a5dd2b372f325044bf80fe6452ccc2fe24f9c7f783fe16304c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/lsp/tsc.rs:5857-5862 | runtime/web_worker.rs:742-747 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/tsc.rs:5857\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/tsc.rs"},"region":{"startLine":5857}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6512917d2ae50ec8575702582e0a10770530506860c7d9d9c5c289dc6740db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/tools/bundle/mod.rs:135-140 | cli/tools/bundle/mod.rs:209-214 \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":"cli/tools/bundle/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa35416adf5a67baa9dc1ad95efba50fcb8ce1dbba774abc0b9c81510456012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/tools/fmt.rs:432-437 | cli/tools/fmt.rs:1606-1611 \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":"cli/tools/fmt.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"006e3180ceadfc5b6dd971bdc823dab0e01c8b1ee0f03186fd39ef60fc1b4710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/tools/lint/ast_buffer/swc.rs:2145-2151 | cli/tools/lint/ast_buffer/swc.rs:2319-2324 \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":"cli/tools/lint/ast_buffer/swc.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8889802ec9a1e479347d9104e1d10c587b49c3d9aee683771565aac053c3f513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/tools/lint/ast_buffer/ts_estree.rs:828-833 | cli/tools/lint/ast_buffer/ts_estree.rs:855-860 \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":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"90babaef1baba03301831015f4a7f4e8d85487a3a2f36535d32f7dc5228de7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/tools/lint/ast_buffer/ts_estree.rs:1174-1179 | cli/tools/lint/ast_buffer/ts_estree.rs:1192-1197 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/lint/ast_buffer/ts_estree.rs:1174\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060cli/tools/lint/ast_buffer/ts_estree.rs:1191\u0060 calls \u0060write_bool\u0060 and \u0060cli/tools/lint/ast_buffer/ts_estree.rs:1172\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a011f4a62baf661c05ae3c678058bd5519999ba118177c0edb8374a76f4e291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/tools/pm/list.rs:355-360 | cli/tools/pm/outdated/mod.rs:303-309 \u2014 before extracting anything, compare \u0060cli/tools/pm/list.rs\u0060 and \u0060cli/tools/pm/outdated/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pm/list.rs:355\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/list.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3002685d760e9fe44f48147e844aa94dc343c3eedca7dda50580bb78fda2674a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/crypto/mldsa.rs:107-112 | ext/crypto/mldsa.rs:271-276 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/mldsa.rs:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/mldsa.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c6337402daf3d36f27eb6f2af802823da379e3e240f393765a1bdd33880dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/crypto/mlkem.rs:199-204 | ext/crypto/mlkem.rs:253-258 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/mlkem.rs:199\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/mlkem.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"293f42fdfb758af220ad67e9dd6c72e2774626b8835dcb5e5ba246f08ec7694b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/crypto/subtle_derive_bits.rs:608-613 | ext/crypto/subtle_derive_bits.rs:627-632 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_derive_bits.rs:608\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68e3546503e7cb228e82c7fee01c3a2b5bed6b0154ed849b5b01dc6f70c7bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/http/http_next.rs:4259-4264 | ext/http/http_next.rs:4425-4430 \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":"ext/http/http_next.rs"},"region":{"startLine":4259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a895a3b2c5119b2e2316c679ad71e4f3c3d5fe73371a84ac991b73f1dcbc609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/kv/lib.rs:800-806 | ext/kv/lib.rs:811-816 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/kv/lib.rs:800\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/kv/lib.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7802ece0fb17431b9daa09a02cf04185cfb6910f60c8074caf52271e337d284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/napi/js_native_api.rs:2622-2627 | ext/napi/js_native_api.rs:2649-2654 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060result\u0060 to \u0060*mut i32\u0060 in one and \u0060*mut u32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fb47da94d6f905fc3a41626d48e3958a9f163ccc91d7677989f105d8bb4804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/net/ops_tls.rs:174-179 | ext/net/ops_tls.rs:190-195 \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":"ext/net/ops_tls.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c414c4721cac50aecca8b3187139b5d87c2c9c22f3f67a819086a9a36d40e496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/node/ops/http2/session.rs:1310-1315 | ext/node/ops/http2/stream.rs:389-394 \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":"ext/node/ops/http2/session.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e562742de856a12d07473e13092722e15927c9046a90f85ec13afec89ebf07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/node/ops/http2/stream.rs:384-389 | ext/node/ops/http2/stream.rs:415-420 \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":"ext/node/ops/http2/stream.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59a60849d6318753056775323288fcdce31306240f98acf9e5ba0c262db4999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/node/ops/pipe_wrap.rs:106-116 | ext/node/ops/tcp_wrap.rs:108-118 \u2014 before extracting anything, compare \u0060ext/node/ops/pipe_wrap.rs\u0060 and \u0060ext/node/ops/tcp_wrap.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 79 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/pipe_wrap.rs:106\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/pipe_wrap.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e2f1bea25f6b8f044cb53370cc0dcabeabfd5fa692d0c6e82c0b587af291b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/node/ops/tls_wrap.rs:554-559 | ext/node/ops/tty_wrap.rs:184-189 \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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a732e117f4439dea0618a25403220e0b287ebb9ef38892fea7e487aef835e286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node/ops/tls_wrap.rs:4908-4915 | ext/node/ops/tls_wrap.rs:5402-5409 \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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4908}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2eb45f93b1972613cd93d294a2b8c217846d481df01484ffdd28502ee20cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/node_sqlite/backup.rs:66-71 | ext/node_sqlite/backup.rs:79-84 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/backup.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/backup.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e35dd992736435b06157faeb39567d955c23ce91360ee086db2e0f5fe10dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/process/lib.rs:812-817 | ext/process/lib.rs:2136-2141 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/process/lib.rs:812\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/lib.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa1941121f576722510e0ec25e5e7b57f2e95e221825d9a39d3b9fb6e8cf384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/process/lib.rs:1606-1611 | ext/process/lib.rs:1643-1648 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/process/lib.rs:1606\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/lib.rs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fec2e7d54f7e66bfa16d8d011340e784e3db37257eb43c7ba192d2658c6875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/telemetry/lib.rs:3029-3034 | ext/telemetry/lib.rs:3181-3186 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/telemetry/lib.rs:3029\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/lib.rs"},"region":{"startLine":3029}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f20afd307214457689b9066feba6600c4646bc4007c9f3a080e97ac0a47fd5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/web/console/inspect.rs:3124-3129 | ext/web/console/inspect.rs:3151-3156 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/console/inspect.rs:3124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":3124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1709f0cabed9b97265ac6f5d15f9be78c236c28c960c805e76d2518d2c82cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/web/console/inspect.rs:3314-3319 | ext/web/console/inspect.rs:3367-3372 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/console/inspect.rs:3314\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":3314}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bc2599ee1b2387879fc9c10b15b6963a286ffe76d8b1c94aa992ff96cb0fd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/web/console/width.rs:146-151 | ext/web/console/width.rs:165-173 \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":"ext/web/console/width.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d1e6e95b4ce22ded00c41915af454ad3cc5e7eed831271116f13e708442731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/web/geometry.rs:553-560 | ext/web/geometry.rs:654-659 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ec4c5533ec440bf8dece97a6de30129af2046ebe8d83310bc44aa48917b407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): ext/web/geometry.rs:2145-2150 | ext/web/geometry.rs:2185-2190 | ext/web/geometry.rs:2252-2255 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/geometry.rs:2145\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/web/geometry.rs:2182\u0060 calls \u0060unwrap_or\u0060, \u0060UnrestrictedDouble\u0060 and \u0060ext/web/geometry.rs:2250\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e953d21dc0c189111e87c41260dfaea206bb1604b27fcd6eb8615f665331c339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/core/extensions.rs:758-763 | libs/core/extensions.rs:779-784 \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/core/extensions.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8d8ebd3c934aea71b8f31f183f2f5f3c48bc56fa8b409da39fd4e4e31222bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/core/runtime/bindings.rs:1794-1799 | libs/core/runtime/bindings.rs:1806-1811 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/runtime/bindings.rs:1794\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/bindings.rs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aa11900b5377defbde19e65e6aa13a55979bdf2cf783b6c4a34c5c7eb6bae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/core/runtime/jsruntime.rs:1896-1901 | runtime/worker.rs:792-797 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/runtime/jsruntime.rs:1896\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/jsruntime.rs"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5533fa50241265484eca1ad929799e28f2031d21e78efc45e39d53f8b42ee44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/core/runtime/jsruntime.rs:2136-2141 | libs/core/runtime/jsruntime.rs:2271-2276 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/runtime/jsruntime.rs:2136\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/jsruntime.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb11595c9ce6296fd348428d3bfcdffb1991c1644c14406e762267eee543dde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/core/uv_compat/tcp.rs:359-364 | libs/core/uv_compat/tcp.rs:1115-1120 \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/core/uv_compat/tcp.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d98d2fd827c7469b33db344f93aadc7cea7b1dadaffc929f02df10fdf04f358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/http_h1/conn.rs:826-831 | libs/http_h1/conn.rs:863-868 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/http_h1/conn.rs:826\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/conn.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"6261d7c593b41649f9a633592831d100e3a81e196d907b48bf2af8abee07f5fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): libs/ops/op2/dispatch_fast.rs:496-506 | libs/ops/op2/dispatch_slow.rs:251-262 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/op2/dispatch_fast.rs:496\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/dispatch_fast.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6bfcf052e0570360746dfc9be65d9bd4b4fb3208c7596186470f5c1e37cb28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/ops/op2/dispatch_slow.rs:682-687 | libs/ops/op2/dispatch_slow.rs:717-722 \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/ops/op2/dispatch_slow.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"551e3ca297a56fbd384feb0c01e2da9af6dc54b28e7abfa896b28b66087c88cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/resolver/bun_lockfile_import.rs:200-207 | libs/resolver/yarn_lockfile_import.rs:171-178 \u2014 before extracting anything, compare \u0060libs/resolver/bun_lockfile_import.rs\u0060 and \u0060libs/resolver/yarn_lockfile_import.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/bun_lockfile_import.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0301ec8c9742faa1ee1d68bfdcdaa6b3d99a0f1fff2c07fbdf37c3f683e80c31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/resolver/npmrc.rs:205-210 | libs/resolver/npmrc.rs:215-220 \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/resolver/npmrc.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2c7b2bda0351f8209bd23e55880d4af7324144bbbf32189c0940b119932f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): runtime/subprocess_windows/src/lib.rs:432-437 | runtime/subprocess_windows/src/lib.rs:447-452 | runtime/subprocess_windows/src/lib.rs:461-469 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/subprocess_windows/src/lib.rs:432\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/subprocess_windows/src/lib.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"925edf990f97072eb330e31444dc55355027f65a64b5dcd4463e3afa4911d6b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): ext/crypto/subtle_import_key.rs:758-762 | ext/crypto/subtle_import_key.rs:768-772 | ext/crypto/subtle_import_key.rs:884-888 | ext/crypto/subtle_import_key.rs:894-898 | ext/crypto/subtle_import_key.rs:997-1001 | ext/crypto/subtle_import_key.rs:1007-1011 \u2014 all 6 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"006c53fb74a4dc6489e39fac6ecfc6b5bc521d41edf314813a7e85db808a1a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): ext/node_crypto/cipher.rs:1010-1014 | ext/node_crypto/cipher.rs:1016-1020 | ext/node_crypto/cipher.rs:1022-1026 | ext/node_crypto/cipher.rs:1028-1032 | ext/node_crypto/cipher.rs:1042-1046 | ext/node_crypto/cipher.rs:1057-1061 \u2014 all 6 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"960f5a176066b27835fcd0c45b5938616acb1d34dae4902be192f79c5b33b766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): ext/node_crypto/cipher.rs:1496-1500 | ext/node_crypto/cipher.rs:1502-1506 | ext/node_crypto/cipher.rs:1508-1512 | ext/node_crypto/cipher.rs:1514-1518 | ext/node_crypto/cipher.rs:1528-1532 | ext/node_crypto/cipher.rs:1543-1547 \u2014 all 6 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"371c77bcd2a0568b32528a36c2ee2ae9f59be1d7598e9e5dfb3ef37f72510d03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): cli/tools/desktop_devtools.rs:827-831 | cli/tools/desktop_devtools.rs:848-852 | cli/tools/desktop_devtools.rs:1072-1076 | cli/tools/desktop_devtools.rs:1119-1123 | cli/tools/desktop_devtools.rs:1151-1155 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop_devtools.rs:827\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060cli/tools/desktop_devtools.rs:1148\u0060 calls \u0060clone\u0060 and \u0060cli/tools/desktop_devtools.rs:1116\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop_devtools.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0e62a513418ad7f275d431f1bf852399d728d2fdfe4f43de1057227cebe842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): ext/crypto/digest.rs:407-411 | ext/crypto/digest.rs:495-499 | ext/crypto/subtle_decrypt.rs:284-288 | ext/crypto/subtle_encrypt.rs:340-344 | ext/crypto/subtle_sign.rs:343-347 \u2014 before extracting anything, compare \u0060ext/crypto/digest.rs\u0060 and \u0060ext/crypto/subtle_decrypt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/digest.rs:407\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/digest.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c9d98e8e636917e3826ae20073bd1b34ce30d2d7f2d285db977e345ae40eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 7): ext/web/geometry.rs:339-343 | ext/web/geometry.rs:351-353 | ext/web/geometry.rs:357-358 | ext/web/geometry.rs:365-369 | ext/web/geometry.rs:379-383 | ext/web/geometry.rs:393-397 | ext/web/geometry.rs:405-409 \u2014 all 7 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54fbf6f0bdcef43b196f082e6f944a96303a9696dac20f989499d11d74e2c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): ext/webgpu/adapter.rs:219-225 | runtime/ops/desktop.rs:837-843 | runtime/ops/desktop.rs:1865-1871 | runtime/ops/desktop.rs:1933-1939 | runtime/ops/desktop.rs:2098-2104 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/adapter.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7508de506a85e04bc4e0d1e4fa0c1402d3dd8c31e3c5cc8ed8f27fde21ae68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): ext/crypto/subtle_import_key.rs:748-752 | ext/crypto/subtle_import_key.rs:874-878 | ext/crypto/subtle_import_key.rs:986-990 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:748\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"5376b4f3b0e8ede46459e0957755bddf8d737a1a8c9976716c99d268cfb82a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): ext/http/http_next.rs:1025-1029 | ext/http/http_next.rs:1085-1089 | ext/http/http_next.rs:1111-1115 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/http_next.rs:1025\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f555af9a2d2b2ca262f4f40301edf9c8fdf4ff9a7b2abac0f20d20a95d131c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): ext/node/ops/zlib/mod.rs:306-311 | ext/node/ops/zlib/mod.rs:968-972 | ext/node/ops/zlib/mod.rs:1056-1060 \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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5db5fc96b9cc793d6fafe17ed7f0731c2c4f108e62249eb288bfeab2df8e31e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): ext/web/geometry.rs:345-350 | ext/web/geometry.rs:359-364 | ext/web/geometry.rs:399-404 \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":"ext/web/geometry.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"024125586fea32965251cdf8e3a771f0e82d7648dbd3fc1981d1005b1987ca05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): libs/core/uv_compat/stream.rs:501-505 | libs/core/uv_compat/stream.rs:606-610 | libs/core/uv_compat/stream.rs:704-708 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/uv_compat/stream.rs:710\u0060 calls \u0060drop\u0060 and \u0060libs/core/uv_compat/stream.rs:506\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/stream.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a329902f8d18f4cf740e46f6f78362bf258aa03f80cc9b47c39b138a62731504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): libs/core/uv_compat/tty.rs:1771-1775 | libs/core/uv_compat/tty.rs:2000-2004 | libs/core/uv_compat/tty.rs:2067-2071 \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":"libs/core/uv_compat/tty.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b557f24aa4fff1aa15839f0539ff6f1a689c2bbd331f3f2e65c5ab6a03b0e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/lib.rs:1252-1257 | ext/telemetry/lib.rs:816-821 \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":"cli/lib.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bdd48d6e50aa61701d6f709bc31d26a9988651de0ba2133bb5940f50f8e781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/tools/desktop.rs:1001-1005 | cli/tools/desktop.rs:1082-1086 \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":"cli/tools/desktop.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec993b60a20b4bb523b59f63785850344a950de2e6b6496fd8c162378cf7e818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/tools/desktop.rs:4223-4228 | cli/tools/desktop.rs:4254-4258 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:4223\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":4223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d04b495e464470f92fbea2cbd145c15696108e60c318abdb63041986a5de4ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): cli/tools/lint/ast_buffer/ts_estree.rs:910-914 | cli/tools/lint/ast_buffer/ts_estree.rs:942-947 | cli/tools/lint/ast_buffer/ts_estree.rs:976-979 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060cli/tools/lint/ast_buffer/ts_estree.rs:908\u0060 calls \u0060write_bool\u0060 and \u0060cli/tools/lint/ast_buffer/ts_estree.rs:974\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"5743b4be42286c88ed8b0f9d6cf5dabf6e1e2888c27e34c3442853a8d104452b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/tools/lint/ast_buffer/ts_estree.rs:2399-2403 | cli/tools/lint/ast_buffer/ts_estree.rs:2422-2426 \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":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66974999a983212460ebec3498dd908855eeabc130c1d05dcccc0fc75f4816a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/tools/lint/plugins.rs:466-470 | cli/tools/lint/plugins.rs:475-479 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/lint/plugins.rs:466\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/plugins.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e17941f8924ec9fc39eced1cdd201ef2970fd60d510e40a6f604faf008aea7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/ffi/ir.rs:506-512 | ext/ffi/ir.rs:559-565 \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":"ext/ffi/ir.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"400d7d7a2adf8ab18836d88736de3da7bb6731f5102d4be564aa193298ed022c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/fs/ops.rs:1156-1160 | ext/fs/ops.rs:1244-1248 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:1156\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a1ccbc305c623504b143184cffd5e867f21b0e30a6e7afc78e41bc6a3f4cc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/node/ops/fs.rs:278-289 | ext/node/ops/fs.rs:292-303 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"35eb75b4bb4500f62554f871208773ad57e05d088553777b445eee09429fb9d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/node/ops/http2/session.rs:887-891 | ext/node/ops/http2/session.rs:1380-1385 \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":"ext/node/ops/http2/session.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d04b8b102ba521a0a179faf8a922324fa4f791dd3df44239c80160e716dd0d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/node/ops/http2/session.rs:909-913 | ext/node/ops/http2/session.rs:1198-1202 \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":"ext/node/ops/http2/session.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001e6e84e0e611acb62b6145dd15fff72be7752e4f5414e254a76ffc7253831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node/ops/llhttp/binding.rs:434-440 | ext/node/ops/llhttp/binding.rs:659-665 \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":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f652fd006aa0efacdc180a37b4f824becffcda3b6bdb18998181a75f4ce7972e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/node/ops/tls_wrap.rs:4969-4974 | ext/node/ops/tls_wrap.rs:5426-5430 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tls_wrap.rs:5426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4969}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cf8c634173c7447a6c01e9deb83d1013ecaf73e41eac9d46b4857658708bd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/node/ops/zlib/mod.rs:917-921 | ext/node/ops/zlib/mod.rs:1003-1007 \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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"177db23056990a1e23737467d1a4937a7835f0131fa8f6273493c8eec053ff38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/node_crypto/keys.rs:389-394 | ext/node_crypto/keys.rs:409-414 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/keys.rs:389\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/keys.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e61d7c3f79b2c8f73f184f51fe664a7df6ec6fb4146a2fcae033e159688e51a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/node_crypto/x509.rs:735-739 | ext/node_crypto/x509.rs:1294-1301 \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":"ext/node_crypto/x509.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7c976b5bb12f3f1651675de5f88229fc3af5d37de1b0c8a18bcb47ac351491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/node_sqlite/backup.rs:92-96 | ext/node_sqlite/database.rs:268-272 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/backup.rs:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/backup.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"425d767d93eb37e11f3edb469ac9d7424699a0c4ac4bebb2aaffe36cb845155b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/web/console/css.rs:278-284 | ext/web/console/css.rs:295-301 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/css.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a016ecb38f3f0e0f953ea6b3c2d2e08e1601d0d07ec367ac9fe57e7590df3c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/web/console/inspect.rs:2024-2028 | ext/web/console/inspect.rs:2036-2040 \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":"ext/web/console/inspect.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab77f7cc00f16813bbe75aab75e81118ad3325825b1f0557fdd08866cac2fbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/web/geometry.rs:235-239 | ext/web/geometry.rs:271-275 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/geometry.rs:235\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f12a6a094795407232acc390fb9d06b9cef1dd00e01b5856c1a3f8a24b3cf4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): ext/web/geometry.rs:304-308 | ext/web/geometry.rs:316-320 | ext/web/geometry.rs:411-413 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9db0339029b2a578284b1f4de0fc373d8763b74065af4e2d263c9dcbc071eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/web/geometry.rs:310-314 | ext/web/geometry.rs:322-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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"86560a03cd44e57ac682377d5e8408a7675a3b8404d7eee60c6c2355235e55e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/websocket/lib.rs:788-792 | ext/websocket/lib.rs:831-837 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/websocket/lib.rs:788\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/lib.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b364a9631ca8ac1937711380dc15b94b9dc37ff84026c4919ccdc776c57b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/core/convert.rs:569-573 | libs/serde_v8/magic/external_pointer.rs:37-41 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/convert.rs:569\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/convert.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52821ad9aef268925383f958b202a2c9bebe26104a0c15de9820a593a7321a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/core/inspector.rs:2186-2190 | libs/core/inspector.rs:2213-2217 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/inspector.rs:2186\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/core/inspector.rs:2212\u0060 calls \u0060get_str_param\u0060 and \u0060libs/core/inspector.rs:2185\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/inspector.rs"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bc1f5fad56c92b2adbbc311d7d3c6aa69d71182183ad4c8492b7d47b2f6064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/core/ops_builtin.rs:809-813 | libs/core/ops_builtin.rs:868-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":"libs/core/ops_builtin.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9cde48052661446b4b955e422840366808e48f78b00f66b7060c2b23df477f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/core/runtime/bindings.rs:583-590 | libs/core/runtime/bindings.rs:703-707 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/runtime/bindings.rs:583\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/bindings.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4213516a1106f2eda205a7ccd4aa69d2668d8bec9ddd35c10827e976d4bb2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 5): libs/core/uv_compat/pipe.rs:695-699 | libs/core/uv_compat/pipe.rs:852-855 | libs/core/uv_compat/pipe.rs:907-911 | libs/core/uv_compat/pipe.rs:1044-1047 | libs/core/uv_compat/pipe.rs:1347-1348 \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":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c01f407692cf203395d249f1e61e5ba9df2651a4fba75769a2d8e788b2ea3f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/eszip/lib.rs:60-65 | libs/eszip/lib.rs:85-90 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/eszip/lib.rs:60\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/eszip/lib.rs:59\u0060 calls \u0060chain\u0060 and \u0060libs/eszip/lib.rs:84\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/eszip/lib.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"782873a8a9d149b9bf7cb69f19aaebe9dae1ec5daaf1f71a8143832539700a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/npm/fast_registry_json.rs:423-427 | libs/npm/fast_registry_json.rs:437-441 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm/fast_registry_json.rs:423\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/fast_registry_json.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc9fb1306bc2e3b7ff19bad9c057e3f1579697c96e36b8b023b6d9d355d84b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/npm/fast_registry_json/simd/width_128.rs:274-278 | libs/npm/fast_registry_json/simd/width_128.rs:293-297 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm/fast_registry_json/simd/width_128.rs:274\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/fast_registry_json/simd/width_128.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad306d8e90a799ff8fb71a971d77a1f1dafab3c26f67e013da47254897b3a674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/npm_installer/hoisted.rs:1030-1035 | libs/npm_installer/local.rs:1253-1258 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bafdc40dca2d7c522c37e93bdf201eefa514ac961789d0db116d2d1edd01169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): runtime/ops/desktop.rs:216-220 | runtime/ops/desktop.rs:231-235 \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":"runtime/ops/desktop.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f9f8db7804ff5f5b443bfa459522159ea4590baa521866acd6acfa029c3879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): runtime/web_worker.rs:797-802 | runtime/worker.rs:842-847 \u2014 before extracting anything, compare \u0060runtime/web_worker.rs\u0060 and \u0060runtime/worker.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 84 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026BootstrapOptions\u0060 in one and \u0060BootstrapOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/web_worker.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a1e877acdcdb83e5ead0c36efe882c6ea20af984b582c35e2c33bdb65342b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): ext/crypto/decrypt.rs:211-235 | ext/crypto/encrypt.rs:366-390 \u2014 before extracting anything, compare \u0060ext/crypto/decrypt.rs\u0060 and \u0060ext/crypto/encrypt.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/decrypt.rs:211\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/decrypt.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8c24d0a9f90a16df4a79fa3fbe34ed7c6142ca3c6095621ac03396d8dc6cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/cdp.rs:245-252 | cli/rt/hmr.rs:77-84 \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":"cli/cdp.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c997cf10138a5c2efba013fc5c697bb44d179ce092ac2da1838e56c22d273e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/lib.rs:737-744 | cli/rt/lib.rs:35-42 \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":"cli/lib.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f994901fd9b5936396a878a92475c556e375fc106289c27a267057fb42345d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/lib/standalone/binary.rs:393-397 | cli/rt/binary.rs:1229-1233 \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":"cli/lib/standalone/binary.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc6563494537b8bdafa9b8ff25dfd86771c74ec58631a790f7bd305e5db7dab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/lib/standalone/binary.rs:414-418 | cli/rt/binary.rs:1235-1239 \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":"cli/lib/standalone/binary.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff14eb8c4c05361baeb25608b9ace8e1e22af72764b89ae684548411b1ee4644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/lib/standalone/binary.rs:421-430 | cli/rt/binary.rs:1242-1251 \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":"cli/lib/standalone/binary.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbd52957ef97aaef3f0aa91aee5f6b0a95f2ac204fce2d34589fc7bc7621886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): cli/lib/util/text_encoding.rs:11-18 | ext/fs/interface.rs:497-505 | libs/resolver/loader/npm.rs:305-312 \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":"cli/lib/util/text_encoding.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68ac128e0595f49b9bbaaf2461fd49bc819ad7db46aae4a2432e7bf8b38a3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/lib/util/text_encoding.rs:21-26 | libs/resolver/loader/npm.rs:296-301 \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":"cli/lib/util/text_encoding.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7f27513118dd9a1be03ede539fd9340fda55948cb6dda3d966b97d69d57cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/lsp/jsr.rs:396-401 | cli/lsp/npm.rs:55-60 \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":"cli/lsp/jsr.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa82d819b7c9c775229f79f68be6d30f5d5f4a4fda809d4d80c3f14bb9a2f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/module_loader.rs:1991-1999 | cli/rt/run.rs:2074-2082 \u2014 before extracting anything, compare \u0060cli/module_loader.rs\u0060 and \u0060cli/rt/run.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/module_loader.rs:1991\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060registry\u0060 to \u0060\u0026deno_runtime::deno_node::ops::module_hooks::LoaderHookRegistry\u0060 in one and \u0060\u0026LoaderHookRegistry\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2423521cb5fd111cdbfa0b2fc7bd4dea300587d5b68e40c40e9bfdba8d0fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/rt/hmr.rs:389-396 | cli/tools/run/hmr.rs:193-200 \u2014 before extracting anything, compare \u0060cli/rt/hmr.rs\u0060 and \u0060cli/tools/run/hmr.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/hmr.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d30eb6857b248018055e2fb05cdff272411cc4b145b13f4b51a47333ea773cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): cli/rt/hmr.rs:623-635 | cli/tools/run/hmr.rs:333-345 \u2014 before extracting anything, compare \u0060cli/rt/hmr.rs\u0060 and \u0060cli/tools/run/hmr.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060cli/rt/hmr.rs:640\u0060 calls \u0060to_string\u0060 and \u0060cli/tools/run/hmr.rs:348\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/hmr.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3adc8f4a8aae22d808afe9a4a83f640b20c7e8f346d3e7c35be3fae5e841be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/tools/bump_version.rs:54-58 | cli/tools/pm/mod.rs:115-119 \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":"cli/tools/bump_version.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"537a6caaa2be590f76ea04d0cc78a37093faca6d06a1cfbc5ec90c15f7bb4cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/repl/session.rs:283-292 | cli/tools/run/hmr.rs:322-331 \u2014 before extracting anything, compare \u0060cli/tools/repl/session.rs\u0060 and \u0060cli/tools/run/hmr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/repl/session.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9979e9e9e2108eb44137abe77784e3f38937b395055e7de6d4981fc35f6847fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/util/path.rs:175-181 | libs/core/error.rs:1503-1509 \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":"cli/util/path.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb20bb9c742f7b7d96de8bcc9eb70287fc011c86ea3f43f065a5505da2c2ca2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/util/v8/convert.rs:33-38 | libs/core/convert.rs:748-753 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/util/v8/convert.rs:33\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/v8/convert.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"504c94b78f4aeab1d8436469518542b5d975b2524d7e88190e72c03f6803b3cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/util/v8/convert.rs:50-56 | libs/core/convert.rs:765-771 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/util/v8/convert.rs:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060v8::Local\u003C\u0027a, v8::Value\u003E\u0060 in one and \u0060OptionNull\u003CT\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/v8/convert.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ae1f2103d91ee4f844165e2dc1134026111a40a102b0750d62b88626d8f710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:210-220 | ext/crypto/subtle_encrypt.rs:210-220 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db1145c19c6038e9ecc1bb19d0c3bfccb2eb3fba3a43f6928b9f26c91ffd691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:354-364 | ext/crypto/subtle_encrypt.rs:410-420 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:354\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"89afce7332dbc6c7d42346513a8b92a7cf3c521387300ab0579511d8aeed646a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): ext/crypto/subtle_derive_bits.rs:682-689 | ext/crypto/subtle_sign.rs:587-594 | ext/crypto/subtle_verify.rs:397-404 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_derive_bits.rs\u0060 and \u0060ext/crypto/subtle_sign.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"ext/crypto/subtle_derive_bits.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1b2b7cf3ade6f646585a3db9ffb75acd4b4f90181eeaba85f30351df0cd605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/crypto/subtle_generate_key.rs:633-643 | ext/crypto/subtle_get_public_key.rs:225-235 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_generate_key.rs:633\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cd36409a6b103ce189b536938e059553c55ebe01737783ecf9347ace4beded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): ext/fetch/lib.rs:135-140 | ext/kv/remote.rs:39-44 | ext/net/lib.rs:103-108 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/net/lib.rs:103\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/lib.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3716ac3008c4097fd4c659541b6c67eb2b07616be5b7c71abe9e06ee9107372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/http/response_body.rs:499-510 | ext/web/compression.rs:57-68 \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":"ext/http/response_body.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ed00b605a245faaf29304461e27a82a681cfb31eafe72e78fe50d602814a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node_sqlite/sql_tag_store.rs:83-89 | ext/node_sqlite/statement.rs:414-420 \u2014 before extracting anything, compare \u0060ext/node_sqlite/sql_tag_store.rs\u0060 and \u0060ext/node_sqlite/statement.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 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":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a3673d816d1a742774dc173d7fa35e107d0e6f74e54330c20f270b4c4ffa6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/web/console/inspect.rs:397-401 | ext/web/console/mod.rs:1811-1815 \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":"ext/web/console/inspect.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"154a8ae58130706e7a519c663185d3d551364502823cd76fbaf767562d19bf15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cache_dir/global/mod.rs:63-67 | libs/resolver/cache/disk_cache.rs:31-36 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060sys\u0060 to \u0060Sys\u0060 in one and \u0060TSys\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cache_dir/global/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d97e43572d4691c29ba6ceb578f4579442a78e4e8c2ac6d2b811b930e9d216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/dcore/src/inspector_server.rs:513-523 | libs/inspector_server/lib.rs:919-929 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/dcore/src/inspector_server.rs:513\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"90eb1af3f2f4d1036805e4a03588f34199b948c90e0bc758d4acb3ec7fd827cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/dcore/src/inspector_server.rs:551-561 | libs/inspector_server/lib.rs:957-967 \u2014 before extracting anything, compare \u0060libs/dcore/src/inspector_server.rs\u0060 and \u0060libs/inspector_server/lib.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/dcore/src/inspector_server.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"422aba52225a3cbb8b2d1e43ddd1fec1ecfc740518b5377e31b2c808be5b8506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): libs/http_h1/parse.rs:456-460 | libs/http_h1/protocol.rs:405-409 | libs/http_h1/write.rs:389-393 | libs/http_h1/write.rs:395-399 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/http_h1/parse.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa733f0e55cbb4e9dd23f9620aaf87e00ed5aea947920cf1f7c27afc76ab3372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): libs/npm_cache/rt.rs:14-24 | libs/npm_installer/rt.rs:14-24 | libs/resolver/rt.rs:15-25 \u2014 \u0060libs/npm_cache/rt.rs\u0060 and \u0060libs/npm_installer/rt.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 11 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_cache/rt.rs:14\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_cache/rt.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cdff3414e5c18cefa5de9b8ecb4b1bac2a246e4a2cc398fa9df5fdfe34238f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/npm_installer/hoisted.rs:1108-1117 | libs/npm_installer/local.rs:1271-1280 \u2014 before extracting anything, compare \u0060libs/npm_installer/hoisted.rs\u0060 and \u0060libs/npm_installer/local.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 397 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/npm_installer/hoisted.rs:1108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"146047e0f966e017d4c3a5c46bf3a4c1c1d3a0ce43ee8a27ddf7d6e8e7df37d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/ops/conversion/from_v8/struct.rs:310-319 | libs/ops/conversion/to_v8/struct.rs:291-300 \u2014 \u0060libs/ops/conversion/from_v8/struct.rs\u0060 and \u0060libs/ops/conversion/to_v8/struct.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/struct.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"6babd1a1301cc905f2dd7bbb5dc7143af32568977f7ab4f67a010fe3a84e5006"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/resolver/npm_lockfile_import.rs:268-275 | libs/resolver/yarn_lockfile_import.rs:162-168 \u2014 before extracting anything, compare \u0060libs/resolver/npm_lockfile_import.rs\u0060 and \u0060libs/resolver/yarn_lockfile_import.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 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":"libs/resolver/npm_lockfile_import.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c6f637921b2cceb0625bfe5c2541dabf3ed4e792fecc3a9e2a9bf0211150d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/graph_container.rs:140-147 | cli/module_loader.rs:2061-2068 \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":"cli/graph_container.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3280a8a2d0f1499badf004e445519d6211177498e4fca1a92073403d6376c000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): cli/lib/standalone/binary.rs:403-407 | cli/rt/binary.rs:1264-1268 | libs/eszip/v2.rs:1887-1891 \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":"cli/lib/standalone/binary.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d55e54e3f6681df0eec08c81d14614077d78fffb20ad82ef33c613e095bdf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/crypto/decrypt.rs:142-151 | ext/crypto/encrypt.rs:349-358 \u2014 before extracting anything, compare \u0060ext/crypto/decrypt.rs\u0060 and \u0060ext/crypto/encrypt.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 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":"ext/crypto/decrypt.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5503ae06c421e793fd86d38f221361a43134dc73b0bd742da6cff517ac6c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): ext/crypto/ed25519.rs:76-85 | ext/crypto/x25519.rs:74-83 | ext/crypto/x448.rs:81-90 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/ed25519.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/ed25519.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf4c368fb9dff7ec23182e306ed8b670c22132c0015bbd7d498f870c88e14da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/io/lib.rs:498-502 | ext/net/io.rs:82-89 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/net/io.rs:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/lib.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"219bdb76806aaef58d30a72bdfbb43ca2b117c39a112fdcf345809c6c4cd0abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): ext/napi/js_native_api.rs:3664-3674 | ext/napi/js_native_api.rs:4005-4015 | ext/napi/js_native_api.rs:4168-4178 | ext/napi/js_native_api.rs:4205-4215 | ext/napi/node_api.rs:614-624 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/napi/js_native_api.rs:3664\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/js_native_api.rs"},"region":{"startLine":3664}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fb324b63163df601080248656d8458b03950bf3fa89cd3dbca57a2e0f1f552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/net/ops_tls.rs:679-686 | ext/node/ops/tls.rs:791-798 \u2014 before extracting anything, compare \u0060ext/net/ops_tls.rs\u0060 and \u0060ext/node/ops/tls.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/net/ops_tls.rs:679\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops_tls.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e59cc3552558c9627107e7bf72cfba30a8fe0d6ed17c833d6f44d238ca6a910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/node/ops/pipe_wrap.rs:288-301 | ext/node/ops/tcp_wrap.rs:500-514 \u2014 before extracting anything, compare \u0060ext/node/ops/pipe_wrap.rs\u0060 and \u0060ext/node/ops/tcp_wrap.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 79 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":"ext/node/ops/pipe_wrap.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"93424a4c0e8ab441498cabb02c1ec2ffa00380ce02b177658da3538df6cfa945"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/node_sqlite/lru_cache.rs:56-60 | libs/core/inspector.rs:126-130 \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":"ext/node_sqlite/lru_cache.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8438832ac912233830b4aadb82f4ccc3f14be50554e414d1e531f204589e2a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/webgpu/adapter.rs:106-111 | ext/webgpu/device.rs:122-127 \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":"ext/webgpu/adapter.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e257629c47e23e2cd2fe743f976f3f743201592cb60e6c4bd8bfb5e7bacbc474"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/webgpu/compute_pass.rs:97-107 | ext/webgpu/render_pass.rs:443-453 | ext/webgpu/render_pass.rs:461-471 \u2014 before extracting anything, compare \u0060ext/webgpu/compute_pass.rs\u0060 and \u0060ext/webgpu/render_pass.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 146 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/webgpu/compute_pass.rs:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/compute_pass.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"85335ae164b0c89355bedeb3175f76502f3c6bf272a5978a30cf614e4ce77f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ext/webgpu/compute_pass.rs:120-130 | ext/webgpu/compute_pass.rs:143-153 | ext/webgpu/render_pass.rs:194-204 \u2014 before extracting anything, compare \u0060ext/webgpu/compute_pass.rs\u0060 and \u0060ext/webgpu/render_pass.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 146 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":"ext/webgpu/compute_pass.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d59cdee8575beed4b4d1c816542267bb20091835036db4ec6626be7041d4ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ext/webgpu/compute_pipeline.rs:63-76 | ext/webgpu/render_pipeline.rs:67-80 \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":"ext/webgpu/compute_pipeline.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61d5f93c3f0ce29a1b957aadbe1407177a2c957fc7797370deaaa661b293a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): libs/core/arena/shared_arena.rs:94-102 | libs/core/arena/shared_atomic_arena.rs:94-102 | libs/core/arena/unique_arena.rs:76-84 \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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/shared_arena.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f799dabdf30138618a5a87361ab70a044c9139f8ac6c0ea8cb9837bcf982c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/core/arena/shared_arena.rs:260-266 | libs/core/arena/unique_arena.rs:206-212 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060NonNull\u003CArenaSharedData\u003CT\u003E\u003E\u0060 in one and \u0060NonNull\u003CArenaUniqueData\u003CT\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/shared_arena.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24cd28f6c47460c8480d7d7b8a930e56c8bb38f9bbb36cbb22043b578066e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): cli/tools/bundle/esbuild.rs:82-96 | cli/tsc/native.rs:137-153 \u2014 before extracting anything, compare \u0060cli/tools/bundle/esbuild.rs\u0060 and \u0060cli/tsc/native.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/esbuild.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf70b9f50dd98ff25b6b17606e15a3d0181b7c2298d217239937a18de9dc1206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/lsp/language_server.rs:3567-3583 | cli/lsp/language_server.rs:3613-3626 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/language_server.rs:3567\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":3567}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d90ef7d4c6ad38131f1e51e99355b673b2075e4a4d33a47cacee3595be19da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 10): cli/lsp/language_server.rs:2772-2788 | cli/lsp/language_server.rs:2817-2830 | cli/lsp/language_server.rs:2859-2872 | cli/lsp/language_server.rs:2901-2914 | cli/lsp/language_server.rs:3239-3252 | cli/lsp/language_server.rs:3319-3332 | cli/lsp/language_server.rs:3361-3374 | cli/lsp/language_server.rs:3403-3416 | cli/lsp/language_server.rs:3446-3459 | cli/lsp/language_server.rs:3488-3501 \u2014 all 10 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/language_server.rs:2772\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2c8aad7462f96dd8ba3ca56cbdc209802a22dc6122705deb15d864e52560df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/lsp/language_server.rs:2088-2101 | cli/lsp/language_server.rs:2769-2784 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/language_server.rs:2088\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060HoverParams\u0060 in one and \u0060DocumentHighlightParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"e672ac8de5e54b419c76c97c71d6e66415249e71b6ac1b1600946e9197d40549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/core/error.rs:1147-1161 | libs/core/error.rs:2292-2303 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/error.rs:1147\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/error.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fa88ffb5499e7fa617ec9cddb3bf61e593a154a395d2cb2437d602c208b7ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/tools/bundle/esbuild.rs:132-145 | cli/tsc/native.rs:185-199 \u2014 before extracting anything, compare \u0060cli/tools/bundle/esbuild.rs\u0060 and \u0060cli/tsc/native.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/bundle/esbuild.rs:132\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/esbuild.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"80121a87ba561712acde4b7b9a30470f917cfc981a909c7802783d03fec6aae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/upgrade.rs:1741-1750 | cli/tools/upgrade.rs:1769-1782 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/upgrade.rs:1741\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/upgrade.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ce58a8ee5acb4332dfc43da9f3869ebf442baa339e7f355926c4aaf43f5f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): cli/tools/desktop.rs:1705-1717 | cli/tools/desktop.rs:1836-1848 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:1705\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b48d82aefa008605ea5409480179bde43ca2756e5ae694ca862a95f91d65512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/resolver/workspace.rs:599-611 | libs/resolver/workspace.rs:633-644 \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/resolver/workspace.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f11df57e325ab6edd631c3288da999b7477b562ef0b325fff165b5d35676ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): cli/lsp/ts_server.rs:169-179 | cli/lsp/ts_server.rs:732-744 | cli/lsp/ts_server.rs:951-963 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/ts_server.rs:169\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/ts_server.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6639d8f893f117a71f6319f8c1cde6b17560baae3e2d7751aff5252e898bf06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): runtime/worker.rs:746-755 | runtime/worker.rs:766-776 | runtime/worker.rs:778-789 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/worker.rs:766\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/worker.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a16b637e4f569bb36f8c45394b37b7f7674d87eaa1df804387aeca6b2501f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/util/archive.rs:24-35 | cli/util/archive.rs:40-51 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/util/archive.rs:24\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/archive.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b63a03b83789cddbc924ac77f2aac7022e07ef0a4d5385ac6ecc621e8cbb522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ext/crypto/subtle_import_key.rs:1388-1399 | ext/crypto/subtle_import_key.rs:1491-1502 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:1388\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4226ef1b377e20c948aa5da88cb1e8071c97697b2b19cda5c3a79e263df9b9c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): ext/crypto/subtle_import_key.rs:470-481 | ext/crypto/subtle_import_key.rs:1208-1219 | ext/crypto/subtle_import_key.rs:1880-1891 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:470\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"162e9e1a9b540ac47481beb543c5ab93ac155d4a63edc5da83bd50576cda1f7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): cli/lsp/language_server.rs:3278-3289 | cli/lsp/language_server.rs:3667-3678 | cli/lsp/language_server.rs:4630-4641 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/language_server.rs:3278\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":3278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2927b12169335ef65c20d81225618aab098408ce7bad03d06e4debbf5884baf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/tools/installer/mod.rs:311-322 | cli/tools/installer/mod.rs:328-336 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/installer/mod.rs:311\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/installer/mod.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32e761b5a5633da4a0dca17eeabe868cdc5c5dedf1052f261da3d10bdd45412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/lsp/language_server.rs:1658-1667 | cli/lsp/language_server.rs:4514-4525 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/language_server.rs:1658\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed42de68623f822023b83ce2b1b3058fa1b94ec4fb0c3f5d214c797418da916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/core/convert.rs:676-687 | libs/serde_v8/magic/bytestring.rs:77-85 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/convert.rs:676\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/convert.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf3d369e3bc677b56c1561c4ce81ef38d7e1d7674059428ad08d42ab2ad410a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/lsp/language_server.rs:523-530 | cli/lsp/language_server.rs:570-580 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/language_server.rs:523\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8272846e93568c2f24ceb48b59db9dd3bc20ffd97da6ba73f292afa78eea6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/crypto/subtle_import_key.rs:1536-1544 | ext/crypto/subtle_import_key.rs:1631-1641 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:1536\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee746199af99051358b20c92b1ca4d775241f64d7d0e40e452e5bb7b9c2a52a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): libs/config/deno_json/mod.rs:2315-2325 | libs/config/deno_json/mod.rs:2343-2353 | libs/config/deno_json/mod.rs:2422-2432 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/config/deno_json/mod.rs:2315\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/mod.rs"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7d0d0572801dc424e06deade6a7bbca04bf0484e8f468541ec3d3cceba325b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/tools/publish/unfurl.rs:539-549 | cli/tools/publish/unfurl.rs:552-562 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/publish/unfurl.rs:539\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/unfurl.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac576804b9ce1567e931c31619bd6bf1e0300a3fe9d390f9f886a662707f2d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ext/crypto/subtle_encapsulate.rs:121-131 | ext/crypto/subtle_encapsulate.rs:163-173 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_encapsulate.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_encapsulate.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d749cd77324d8d5ed1baf1161996d24b98c6a3977729783597bfb82b7065da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/config/deno_json/mod.rs:2212-2222 | libs/config/deno_json/mod.rs:2374-2384 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/config/deno_json/mod.rs:2212\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/mod.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac079b6526cdcda95857e3daf8adf68c6eb922473eb96a5ae202abe33a80463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/lsp/documents.rs:396-406 | cli/lsp/documents.rs:409-419 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/documents.rs:396\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/documents.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43db575a04e0724aedd930c18137f8f90be30a7ba0ff993e0d65f2aa558e8a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): ext/node_sqlite/database.rs:503-511 | ext/node_sqlite/database.rs:516-525 | ext/node_sqlite/database.rs:530-538 | ext/node_sqlite/database.rs:543-551 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/database.rs:503\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b0197c4238af8ac0bedfd0a3e1dfc3005546e056d03bb70271a2fca0e48c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/crypto/subtle_import_key.rs:457-466 | ext/crypto/subtle_import_key.rs:1195-1204 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_import_key.rs:457\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8188c92fb05deb65eabedbee9e3f8dfa7c030346bb1a8618c5286e90a271a0c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): libs/config/deno_json/mod.rs:2207-2216 | libs/config/deno_json/mod.rs:2310-2318 | libs/config/deno_json/mod.rs:2338-2346 | libs/config/deno_json/mod.rs:2369-2378 | libs/config/deno_json/mod.rs:2612-2621 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/deno_json/mod.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ebf91e4044a92cebc1a24a842d1d9e0db9f1ecb5b701b2af9aa394f3b61d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/node/ops/fs.rs:2984-2992 | ext/node/ops/fs.rs:3302-3311 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:3302\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4300720f2c91d2b28456d947033156f5a96c3d115108cb2e8f96c6b396ceea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/rt/binary.rs:813-820 | cli/tools/pack/mod.rs:647-656 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/rt/binary.rs:813\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/binary.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c25fde49ea5400d50a398b81c5a96f39bdc4e099d754bae6c0f18f34e96c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/node_crypto/keys.rs:2357-2366 | ext/node_crypto/keys.rs:2370-2379 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/keys.rs:2357\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/keys.rs"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe399de711993cb25ee349da698d81ca95aafbbc141897dee9d09571ad0e7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/tools/transpile.rs:359-367 | cli/tools/transpile.rs:550-559 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/transpile.rs:359\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/transpile.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb85e577874170ebf8ba4df4860be14ca079cee249974cf8511c3d180dfcb8c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/util/temp.rs:248-257 | cli/util/temp.rs:287-295 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/util/temp.rs:248\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/temp.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd3e9c8b4546314c9a2bb9ff61c2e977832106b50d906c8860620593880737e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/fs/ops.rs:763-772 | ext/fs/ops.rs:1022-1031 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:763\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"4223745c804ff47bc34191503772f30442be176014ea52812488616efe573903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/util/env.rs:185-193 | cli/util/env.rs:203-212 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/util/env.rs:185\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/env.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"415427de66d6eaadf735a56d56b90ad7bbc8867d0e094a6282aa93783bee2a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/pack/extensions.rs:10-19 | cli/tools/pack/extensions.rs:34-43 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pack/extensions.rs:10\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/extensions.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb12341f7b6397253f60c03c78b55cb420c9543bc6f410f02c17cd837de899d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/node/ops/tls_wrap.rs:5056-5065 | ext/node/ops/tls_wrap.rs:5591-5596 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/tls_wrap.rs:5056\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":5056}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b19adaf5125dcf7f027f13ff9569076f9bf3d46f5b2a887ed3f00b8d4597e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ext/fetch/proxy.rs:73-82 | ext/fetch/proxy.rs:92-101 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fetch/proxy.rs:73\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/proxy.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd4884e60312d66aeb923ab10426574b60b83dff0caa095919f3712c5723d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/tools/pm/audit.rs:181-190 | cli/tools/pm/audit.rs:193-202 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pm/audit.rs:181\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/audit.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61b925582d58efa4733500ba241535d6ebb4e73271a220a19b6ea84ca8c82a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/canvas/byow.rs:259-267 | ext/canvas/canvas.rs:162-170 \u2014 before extracting anything, compare \u0060ext/canvas/byow.rs\u0060 and \u0060ext/canvas/canvas.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/canvas/byow.rs:259\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/byow.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6061a2fe0ee44eee7b2abc61d99b9ec43aef7065d264d198ed3b6b5f7f5ff1af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ext/crypto/node_interop.rs:105-113 | ext/crypto/subtle_derive_bits.rs:402-410 | ext/crypto/subtle_key.rs:172-180 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_derive_bits.rs\u0060 and \u0060ext/crypto/subtle_key.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ext/crypto/subtle_derive_bits.rs:411\u0060 calls \u0060to_string\u0060 and \u0060ext/crypto/node_interop.rs:114\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d6f759f339f4c603990bc3bcff1d1e014465a036ad2693de649aa7caaa7b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): runtime/worker.rs:736-741 | runtime/worker.rs:753-761 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/worker.rs:753\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/worker.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c38540406467d53ec64aec02d431b599eefd18c6e81091cfee053f9940fc40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node_sqlite/session.rs:51-59 | ext/node_sqlite/session.rs:69-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/session.rs:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/session.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ee34ebfe9a926b82c312b898aa92ca61be42f0edcfe1d1aa8e1371a81be8db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/core/error.rs:891-898 | libs/core/error.rs:905-913 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/error.rs:891\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/error.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bc3a0515cce5d3c23094dfcb355c68618e5a2ac07a0c4984f9be1268b4a348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cli_parser/src/completions.rs:220-228 | libs/cli_parser/src/completions.rs:360-365 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cli_parser/src/completions.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/completions.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7fd744005598d3eab1f528583a6f0f038ca206b3f3cc6bdef4e53f1f5b4e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): ext/fs/ops.rs:608-615 | ext/fs/ops.rs:651-658 | ext/fs/ops.rs:741-749 | ext/fs/ops.rs:998-1006 \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":"ext/fs/ops.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b96009fc75b7a671009d00167d5034b9144c0be3b2964f08407674330a1828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/tools/desktop.rs:1697-1701 | cli/tools/desktop.rs:1824-1832 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:1697\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c839a0aa53e8eff07251bc004cd579d95fba46845b63c3bfce547be3c61a1c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/crypto/subtle_encapsulate.rs:87-95 | ext/crypto/subtle_encapsulate_key.rs:44-52 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_encapsulate.rs:87\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_encapsulate.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b155a6efd478eca7738f3f5a6807b8d90ac2f2be82aaa53c96834e2e568f390c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ext/crypto/subtle_export_key.rs:723-731 | ext/crypto/subtle_export_key.rs:803-811 | ext/crypto/subtle_export_key.rs:884-892 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_export_key.rs:723\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a4a6156082660fa860cde4ca6eb1035eda689bb4c7e83beca2f374dd3818de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/crypto/subtle_generate_key.rs:94-102 | ext/crypto/subtle_import_key.rs:105-113 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_generate_key.rs\u0060 and \u0060ext/crypto/subtle_import_key.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 118 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":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"743f2f1ed97f5dd55b375f8415c1b65a248643bb2dec0171690a10aec48b16eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/tools/desktop_devtools.rs:931-939 | cli/tools/desktop_devtools.rs:941-949 \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":"cli/tools/desktop_devtools.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dceab5ec4f38b92f6845009aa0d37524438af7005e11f67e481b569ef07aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/tools/pm/interactive_picker.rs:116-123 | cli/util/console.rs:456-464 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pm/interactive_picker.rs:116\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/interactive_picker.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fe6847cae1b0f56fb24ecb5d2d5f153e1098836ed638ed7e961ec7215a5ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): ext/fs/ops.rs:289-297 | ext/fs/ops.rs:353-361 | ext/fs/ops.rs:377-385 | ext/fs/ops.rs:421-429 | ext/fs/ops.rs:1068-1076 | ext/fs/ops.rs:1120-1128 \u2014 all 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:289\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060ext/fs/ops.rs:285\u0060 calls \u0060unwrap_or\u0060 and \u0060ext/fs/ops.rs:418\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"91aa322deb1c1db659947928d71837afddc4d07c587cdc2dcf6cffe1574343dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/web/console/error_fmt.rs:753-761 | ext/web/console/error_fmt.rs:774-782 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/console/error_fmt.rs:753\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/error_fmt.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"7606660d00af4b39c01b69377569ba223f7e3c6886cecbccf50d79c308861634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/node/ops/pipe_wrap.rs:364-372 | ext/node/ops/pipe_wrap.rs:437-445 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/pipe_wrap.rs:364\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/pipe_wrap.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c38ee4af31b969c0ae4da878ad1ac04dc12dc3e10715ac8e8968f387ac0a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/resolver/deno_json.rs:775-782 | libs/resolver/deno_json.rs:793-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":"libs/resolver/deno_json.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2f583c540357f92bddff96bd86bf69569df27eb4477f976358ce42bf541973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/lsp/language_server.rs:1656-1663 | cli/lsp/language_server.rs:4259-4266 \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":"cli/lsp/language_server.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf77bcf352b451819107264676da220cfed605fa8180d48a5d6d49bf2e24b9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/ops/conversion/from_v8/struct.rs:165-172 | libs/ops/conversion/to_v8/struct.rs:174-181 \u2014 \u0060libs/ops/conversion/from_v8/struct.rs\u0060 and \u0060libs/ops/conversion/to_v8/struct.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/conversion/from_v8/struct.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/conversion/from_v8/struct.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4318bfade9458b902d83796d8a45d86df342041a6a4889145775be6ef7e13d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/node_sqlite/database.rs:619-626 | ext/node_sqlite/database.rs:632-639 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_sqlite/database.rs:619\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/database.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf47fd95ca0d5775ce9c26e729abfd14c6c8d160606a533b716e021fd5b4fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/core/runtime/bindings.rs:865-872 | libs/core/runtime/bindings.rs:887-894 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/runtime/bindings.rs:865\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/core/runtime/bindings.rs:884\u0060 calls \u0060length\u0060 and \u0060libs/core/runtime/bindings.rs:862\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/bindings.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"18017e7084422237d38e432565d0199db313dbdf4fede542a49733e7d8c7abe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/fs/ops.rs:804-811 | ext/fs/ops.rs:860-867 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/fs/ops.rs:804\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67d2690aa48bcec6209e29944e133fe4cca042bc3bc404f059d2dbccf4eea7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/kv/sqlite.rs:84-91 | ext/node_sqlite/database.rs:101-108 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/kv/sqlite.rs:84\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/kv/sqlite.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"623cafffa676c622981a0997850ff539309d9669632233f7d32e57fae17b108f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/web/css_value.rs:1230-1237 | ext/web/css_value.rs:1239-1246 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/css_value.rs:1230\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/css_value.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"746648064c66554cadd87504de4a0e559e13bdc020476f2ee2a3053b973f1b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/web/console/error_fmt.rs:702-709 | ext/web/console/error_fmt.rs:712-719 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/console/error_fmt.rs:702\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/error_fmt.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c0dd584e1f6bc7af1bb12d024955ad736a07f7ce5c16dc4b12c2c953f8e18f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/fs/ops.rs:628-635 | ext/fs/ops.rs:671-678 \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":"ext/fs/ops.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f68863787e98b2e81b6252296acc91636efde8c60a4b8cd9f625c051a71a3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/tools/publish/graph.rs:109-116 | cli/tools/publish/graph.rs:120-127 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/publish/graph.rs:109\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/graph.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8c063552567fb2671caa6d25e36f99d004c0afe8fb31b983e9d0d003024b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/tools/desktop.rs:5106-5113 | cli/tools/desktop.rs:5122-5129 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:5106\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":5106}}}],"partialFingerprints":{"codehealthFindingId/v1":"37deecfd7fe998d4484072f805f8b6cafe35259dfebe108185bc2581ea4a0fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): ext/web/css_value.rs:1221-1228 | ext/web/css_value.rs:1230-1237 | ext/web/css_value.rs:1239-1246 | ext/web/css_value.rs:1342-1349 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/web/css_value.rs:1221\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/css_value.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a80893b433a668a4e879a3cecb5eed6e4ebbecc12693277ff60be9a3f57fe29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ext/crypto/subtle_decrypt.rs:536-543 | ext/crypto/subtle_encrypt.rs:591-598 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_decrypt.rs\u0060 and \u0060ext/crypto/subtle_encrypt.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 355 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/subtle_decrypt.rs:536\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a49d51bd9d8db5bb3796b8f1e4fdf7606ece1bcbd9d3e0b00547a2ecd2663b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/lsp/jsr.rs:423-430 | cli/lsp/npm.rs:85-92 \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":"cli/lsp/jsr.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5002f9cb8f972b6edc784e308f008314af3b7daf6ac4a16d6d9d2233f1a21faf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/tools/bundle/wasm.rs:105-110 | libs/core/modules/map/wasm.rs:293-300 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/bundle/wasm.rs:105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/wasm.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3add56de24dd4b87578ceb3fb6a69cd165e857a731df1a524ecbe4a47f61b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): ext/node_crypto/cipher.rs:1383-1389 | ext/node_crypto/cipher.rs:1392-1398 | ext/node_crypto/cipher.rs:1401-1407 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:1383\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b66fa0ce13b3db55c9126420e575377dd457eb951ee63676cf0046a6b50585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): ext/node_crypto/lib.rs:1284-1290 | ext/node_crypto/lib.rs:1292-1298 | ext/node_crypto/lib.rs:1300-1306 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/lib.rs:1284\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/lib.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95822b9e2b121489f7897f7d2b6b3c78fb0097651177b16bd49b6e367d2b33c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node_crypto/cipher.rs:918-924 | ext/node_crypto/cipher.rs:954-960 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:918\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"3651a91178aa686b8a2a68168f6f5e0856d9415097924b5c30e67b93fc87c672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/crypto/node_interop.rs:414-420 | ext/crypto/node_interop.rs:450-456 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/crypto/node_interop.rs:414\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1e63cf3cfd0b8b4cdf5c9f8e52f19311967f62377a7227fda6e0a4797f168e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/tools/check.rs:20-26 | cli/tools/fmt.rs:96-102 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/check.rs:20\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/check.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"781e2c9fd0739f05ddcc195fee08034046f8aa4c0dc116cb43a7996129dd2aee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): cli/lsp/completions.rs:598-604 | cli/lsp/completions.rs:648-654 | cli/lsp/completions.rs:759-765 | cli/lsp/completions.rs:807-813 | cli/lsp/completions.rs:886-892 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/lsp/completions.rs:598\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060cli/lsp/completions.rs:606\u0060 calls \u0060Some\u0060 and \u0060cli/lsp/completions.rs:894\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/completions.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9fca61f2c13af45da2600c2d5a4a6ef44788016ea58404bac7aa0e14dccfcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/tools/desktop.rs:3723-3729 | cli/tools/desktop.rs:4357-4363 \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":"cli/tools/desktop.rs"},"region":{"startLine":3723}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe1e49c2c25e199041ac58a0079e660f85cf5f9935aeb65d60274ef88b82e1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): ext/node/ops/fs.rs:573-579 | ext/node/ops/fs.rs:619-625 | ext/node/ops/fs.rs:654-660 | ext/node/ops/fs.rs:766-772 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/fs.rs:573\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d817225bb357dfceb7493eddb8f863d34d864a82c32856e2051fcbf0dbef2f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node_crypto/cipher.rs:1374-1380 | ext/node_crypto/cipher.rs:1410-1416 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:1374\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3330e7eb5bd0a0159bdd25af7241e1b36c0b080533da9c232eecc0839027f89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node/ops/v8.rs:540-546 | ext/node/ops/v8.rs:586-592 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/v8.rs:540\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/v8.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd42653efc2dfa0c123ae3dc9780c7eff168ab43ab3442345123c20c6b45cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ext/node/ops/os/cpus.rs:194-200 | ext/node/ops/os/cpus.rs:210-216 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/os/cpus.rs:194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/os/cpus.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0931a8ce61ced85a2e8395b605b428525924cd5828e5a37468d98dd906ecc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): ext/node_crypto/cipher.rs:927-933 | ext/node_crypto/cipher.rs:936-942 | ext/node_crypto/cipher.rs:945-951 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/cipher.rs:927\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/cipher.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"e795e59a91fc92b69cbae08926ec8efca21bb717119d5dc845e788ad88510e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/canvas/byow.rs:352-357 | ext/canvas/byow.rs:360-365 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/canvas/byow.rs:352\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/byow.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"82876cc2e9626f156673a2477e6d969cdd5aebd37008f6c1ad98054a212fbb48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): ext/node/ops/tls_wrap.rs:2940-2945 | ext/node/ops/tty_wrap.rs:186-190 | ext/node/ops/tty_wrap.rs:191-195 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":2940}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d484a49fc126810d0cd63094857b5a111a9ae5618c50b41676422ead554381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): ext/node_crypto/lib.rs:1276-1281 | ext/node_crypto/lib.rs:1284-1289 | ext/node_crypto/lib.rs:1292-1297 | ext/node_crypto/lib.rs:1300-1305 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node_crypto/lib.rs:1276\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_crypto/lib.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a61b797c8c6200a23935cc8cec213dae89c134ccde39605fe5e483256cdc518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/tools/pm/deps.rs:522-527 | cli/tools/pm/deps.rs:541-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/pm/deps.rs:522\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pm/deps.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"c716803aec6e6ecc9fc313a09d1bb80c03c0e55e9c9a91abf512487f4c236385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): ext/crypto/crypto_key.rs:183-188 | ext/crypto/crypto_key.rs:253-258 | ext/crypto/subtle_generate_key.rs:865-870 | ext/crypto/subtle_import_key.rs:1998-2003 | ext/crypto/subtle_key.rs:185-190 \u2014 before extracting anything, compare \u0060ext/crypto/subtle_generate_key.rs\u0060 and \u0060ext/crypto/subtle_import_key.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 118 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":"ext/crypto/crypto_key.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd53fc95171ddacde6a2c22f9aee6a1c9aa7d7d6f0a459ac41347a6006fbe97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): cli/tools/desktop_devtools.rs:1028-1033 | cli/tools/desktop_devtools.rs:1040-1045 | cli/tools/desktop_devtools.rs:1052-1057 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop_devtools.rs:1028\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop_devtools.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"77966edd95e8def9675273f1e6b25d277e2da8c246d47d704c88342be7bfb46f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/web/console/inspect.rs:2508-2513 | ext/web/console/inspect.rs:2514-2519 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"788c50e884c515a29691caad038d6b9e4fa97497bbfc6162f608db496068ad7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): cli/tools/desktop.rs:1697-1702 | cli/tools/desktop.rs:1828-1833 | cli/tools/desktop.rs:3306-3311 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:1697\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"907ebeb48f6fa30c5afba2096d370ddd163e521395fabf96a3aec836eb9d8e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): ext/node/ops/http2/stream.rs:425-429 | ext/node/ops/tls_wrap.rs:559-563 | ext/node/ops/tls_wrap.rs:592-597 | ext/node/ops/tls_wrap.rs:627-631 | ext/node/ops/tls_wrap.rs:859-863 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/node/ops/http2/stream.rs:425\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/stream.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"acebf2c2c8367404695b2b55a038c93e1a64ad4682fb244f0505030ff735330d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/net/ops.rs:756-761 | ext/net/ops.rs:784-789 \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":"ext/net/ops.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b0c63c567bac25abe1675fee483af96be2fd6cff818f9187d869b3c5275831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cli_parser/src/convert.rs:1585-1590 | libs/cli_parser/src/convert.rs:1629-1634 \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/cli_parser/src/convert.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"860f5ed61b7c9342defef656d60fd63417aedae281da2b85b345edb360347e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cli_parser/src/convert.rs:2605-2610 | libs/cli_parser/src/convert.rs:2636-2641 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":2605}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f5f8cfc223ac4a2405c78fac2be26501de5983b6a62562295e9f61411df635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/tools/desktop_devtools.rs:419-423 | cli/tools/desktop_devtools.rs:705-709 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop_devtools.rs:419\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop_devtools.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af7a0d8f6332d2bc374b24d64df3fa6628be7efb6d08b847f721585cf543330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): ext/crypto/subtle_import_key.rs:1528-1532 | ext/crypto/subtle_import_key.rs:1576-1580 | ext/crypto/subtle_import_key.rs:1624-1628 \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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b098002e4e065bd7c4a557d11cd88c174b49602be34c786fddeccfe1595c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): ext/crypto/subtle_import_key.rs:758-762 | ext/crypto/subtle_import_key.rs:768-772 | ext/crypto/subtle_import_key.rs:884-888 | ext/crypto/subtle_import_key.rs:894-898 | ext/crypto/subtle_import_key.rs:997-1001 | ext/crypto/subtle_import_key.rs:1007-1011 | ext/crypto/subtle_import_key.rs:1486-1490 \u2014 all 7 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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"7303fd3138e8c8d8350cbc1cbff526ac897e16ca545d1e816e59e2af7c901679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/lib.rs:620-624 | cli/lib.rs:649-653 \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":"cli/lib.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afe5f9bd3b6d343223cf98c4be071b34a27ed380b7c48f230c50225e5f596a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/rt_desktop/lib.rs:965-969 | ext/canvas/canvas.rs:279-283 \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":"cli/rt_desktop/lib.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5985118d100d96b0a257b4b36b12970eb37981f865aad4374a74760e7d9d3c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/rt_desktop/lib.rs:1962-1966 | cli/rt_desktop/lib.rs:1991-1995 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/rt_desktop/lib.rs:1962\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt_desktop/lib.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8929da360e779ee3824a2ec7d8beaf197a549b215b2c827a248d7d55159427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/tools/bump_version.rs:1131-1135 | ext/telemetry/console_exporter.rs:486-490 \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":"cli/tools/bump_version.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f23f8ab653b1f4ceb493e1b17402c3c7b629da056d72c17bc8a7c535c5268e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/tools/desktop.rs:3613-3618 | cli/tools/desktop.rs:4634-4639 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/tools/desktop.rs:3613\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/desktop.rs"},"region":{"startLine":3613}}}],"partialFingerprints":{"codehealthFindingId/v1":"5720e66c6d62d278f2db4bc68ace109481e1e52aba13067f4035edf0c67c07fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/crypto/lib.rs:920-925 | ext/crypto/lib.rs:944-949 \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":"ext/crypto/lib.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"075e239e988ba9c97e9b3c2f6d15433d5d19acfed87f20fe4b2dac4397f776bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/http/service.rs:522-527 | ext/http/service.rs:584-589 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/http/service.rs:522\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/service.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"1416ad2f8f9bb56d68fb987a764014bd31d6e215611273ff30a51dd6500999a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/napi/node_api.rs:236-240 | ext/napi/node_api.rs:396-400 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ext/napi/node_api.rs:236\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060env\u0060 to \u0060\u0026mut Env\u0060 in one and \u0060*mut Env\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/node_api.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce65cdf795500ea791686f3a2250565420f2e4469eea34f72df4d59eb4d9b8a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ext/napi/node_api.rs:404-409 | ext/napi/node_api.rs:416-421 \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":"ext/napi/node_api.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"032efed6c0c60c84485b53ee922859614165034ee9c9215aef0dee064b564da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ext/node/ops/stream_wrap.rs:1548-1552 | ext/node/ops/stream_wrap.rs:1610-1614 \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":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"146ae529a2a5151f83c10efed0ab9791200bcc305013536895f63ffb1533dcc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ext/node/ops/v8.rs:165-173 | ext/web/console/inspect.rs:2623-2631 \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":"ext/node/ops/v8.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f86af84cd0890bdd9b91eed56047f72ebd0ff69a1d0193c9a83780cd9fd3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/config/workspace/mod.rs:2500-2504 | libs/config/workspace/mod.rs:2742-2746 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/config/workspace/mod.rs:2500\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/config/workspace/mod.rs"},"region":{"startLine":2500}}}],"partialFingerprints":{"codehealthFindingId/v1":"515aca41566a3635451a08281a08c69a7e07cbb56d95e94907ad55178892da9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/core/uv_compat/pipe.rs:902-906 | libs/core/uv_compat/pipe.rs:953-957 \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/core/uv_compat/pipe.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bf9ec81e1f0fcdd1e82e58bce2f5fcf001f5725763ba35ef661951d012acd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): cli/tools/bench/mod.rs:473-488 | cli/tools/bench/mod.rs:570-587 \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":"cli/tools/bench/mod.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b16e969794a581a4f1754e37fc451a1bfca8f6d893e0b81eef8fbe71298d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): libs/ops/op2/test_cases/compiler_pass/sync.rs:4-54 | libs/ops/op2/test_cases/sync/smi.rs:4-37 \u2014 before extracting anything, compare \u0060libs/ops/op2/test_cases/compiler_pass/sync.rs\u0060 and \u0060libs/ops/op2/test_cases/sync/smi.rs\u0060 as WHOLE FILES: 86% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/ops/op2/test_cases/compiler_pass/sync.rs:4\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/ops/op2/test_cases/compiler_pass/sync.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3a37037fcda33ee8de7ef4e9db5e6f47b7fe2cc000d0206d66f10046156004"}},{"ruleId":"D5","level":"error","message":{"text":"Circular dependency: pkg-a \u2192 pkg-b \u2192 pkg-a"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_symlink_cyclic/packages/pkg-a/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00b874144f48d20a9b6d37f08aaf3bd6d629cacc814088adfb876b3ea371a5c"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project deno_cli_parser: deno_cli_parser has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d95c8ec5d4297c38fdd0eb8916103c2f1af9ae36ec69ab6aee86bf386360a041"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project deno_http: deno_http has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"509ef32b59d5fcd951f7daaf934786127856b441aece19f2a5f8b8eff69a2b1b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project deno_kv: deno_kv has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"796531c9c833dbabdf3f97d3389e5d44a82bc45ced927fd50a3ec5807329ff46"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project deno_napi: deno_napi has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eafd144b0c14eb9c56841e7187e9d7ed2d78c1dcb40909b98fcae4cd92bf203"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project deno_runtime: deno_runtime has instability 0.85 with 6 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"878861cc40db22ac539eaf40c164d61a722eacd72e29211065ced9cbd6d48e93"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project denort: denort has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"58f69a8cff75502c2aa8324e830bc41505ced0eaeedefc04f518efb45c412f25"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_crypto_provider: deno_crypto_provider: 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":"f8e6f0bfa799cfa97c18e507268cea8ad49262e5f6cf8dde6f5d63cd1936863e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_dotenv: deno_dotenv: 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":"4e6fe3b6e58eb1e5e4d024b240bbd8323cb609fbdb810e30b7edf2549b5b47e4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_http_h1: deno_http_h1: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3b0726c1be3fd1fde8d1663e3211578fdff9dd36aa0438d7213623b06b299be7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_npmrc: deno_npmrc: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2b6e32934b359ee283b56da23f08990c7af9097ac55294261d00f9f319c04f50"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_signals: deno_signals: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"99ad4d605e2dd2969f6431c332ffe0978c48a50a2b92b1cb443d35ab4f39ba9d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: node_shim: node_shim: 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":"9616a5fb6aaef887cbb81ca352fa5f3181b28d44a305c0fed6c9958e605b8e6f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_lockfile: deno_lockfile: abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9a825fad4bd004eccaee344d673e36fd5da3a4126b9664d7bd7f59477c150947"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_subprocess_windows: deno_subprocess_windows: abstractness 0.06, instability 0.00, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ebb9d7addf620363f45da5b2a75703b03130a0edb1d52e5009008ea3413d9a37"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_permissions: deno_permissions: abstractness 0.15, instability 0.00, distance 0.85 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"95a0b37dd568e2fb7aa1f11bf01dc45f1fca1b5ce9ac0f0d5a68a8e92db45437"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_features: deno_features: 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":"abc7e3ecbf9f85c0bb8278da3ba9a4afe02e3c318f6f77249e055b5bc27245ea"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_core: deno_core: abstractness 0.13, instability 0.08, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 36 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5a2b8b821bbd486c9d360a35a5aec12819623b69458dfa7cf95a5cb0a6c703be"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_tls: deno_tls: abstractness 0.10, instability 0.13, distance 0.78 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0b166aa2e323394b77de8a90201d78fce00cf4f56d0cdc56b10197a3a4a36bdb"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_package_json: deno_package_json: abstractness 0.14, instability 0.11, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5e7790d743d95605bac0892db578b8a26dbc017bb6f4966731735dfc2da5c60f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deno_npm: deno_npm: abstractness 0.05, instability 0.22, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4937da3e1f92771fe2c59635e3ba2e4907d5dc5bb2a0e25680401edb6de976cc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DOMMatrixReadOnly (LCOM4 15): DOMMatrixReadOnly\u0027s methods fall into 15 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"afda99f3554e0271185b11384dbea6036ae3729535f69825cf3eee3ec972d154"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Matrix4 (LCOM4 7): Matrix4\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/geometry.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf05ebe6e38df7ae6fb9a6d3b0e6218abfb001386b5d5cc9cb2bce286278646"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TlsStreamResource (LCOM4 6): TlsStreamResource\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops_tls.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"987913e06e07da7c80782c670ee2a6b845bcf0a61ae8e6a07a8d60e42d11c7d6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WefDesktopApi (LCOM4 5): WefDesktopApi\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt_desktop/lib.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ed5224fe9fa6c025b348a6163121b58b32fd842a3b5b4980c69ec3112435a7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WasiContext (LCOM4 5): WasiContext\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/wasi.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c5a1c9c672cb464741631afedd162a6c976cb9817efb66573194ac8b7192e3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Flags (LCOM4 5): Flags\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/flags.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"c977e7bcf5a6f29de87502d9ada9c4ad9d59bd43833d02260632bf6137d64b83"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JsError (LCOM4 5): JsError\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/error.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"78498b63bd0039174c90df61c1eb8fedcae97238402104f27d5302c18f45eb15"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CliNodeRequireLoader (LCOM4 4): CliNodeRequireLoader\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"0693c0e78ff2c3e8f8048832a1a628f4a774bf99933512913003ca06715c4646"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DocResolver (LCOM4 4): DocResolver\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/doc.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"77eae028836eb65accfef316a88be93d0b7005418d8ef32b2f76c1d9cbd60f2d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WatcherCommunicator (LCOM4 4): WatcherCommunicator\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/file_watcher.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cfc5b774b04b658444640d7486b825d7d818ef1e6197de86bf42d01d13f090"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Env (LCOM4 4): Env\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/napi/lib.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d361196215729eda25b3227ec9deeff83f3e4c79d63d194a10feaeb98c43c1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NamedPipe (LCOM4 4): NamedPipe\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/win_pipe.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a87467c36da834a15c085d6df3b55639062a4afbc2d9364cb15129705d8d12"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Session (LCOM4 4): Session\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http2/session.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"6704b951a8ea46c31be2368a4149b554e0809d484020616d3bce898dc9c1d993"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LoaderHookRegistry (LCOM4 4): LoaderHookRegistry\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/module_hooks.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9a97164e71c39e2078cf2605047ee7e17f7d1a6d50ca925eae48ab79f66713"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JsRuntime (LCOM4 4): JsRuntime\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/runtime/jsruntime.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"672dea39b466da4fed7e38ea5707d3449a9aee3ea66d082c83ba862e977f18b6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PackageSubpathFromDenoModuleResolveError (LCOM4 4): PackageSubpathFromDenoModuleResolveError\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/errors.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb85e752cd0b6a61baef44b86c84cf8073b9c85707d352d282f6a5c0e1a446c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WhichSysAdapter (LCOM4 4): WhichSysAdapter\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/permissions/which.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c74c244993e3b1e0c546c6f1f95206953ae5053cf12eaa4a4d9e94661c40e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/workflows/ci.ts: .github/workflows/ci.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in (anonymous) at line 607. 1 of those changes was a fix/bug commit, and the other 9 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- .github/workflows/ci.ts\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":".github/workflows/ci.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"053db5ed3f2354502484e18f46e6fb1484add9b00c65d6bccfd1d79b634a9f6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/lib.rs: cli/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in deno::run_subcommand at line 124. 1 of those changes was a fix/bug commit, and the other 3 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- cli/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":"cli/lib.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6160ed3a834b417481572e90fe977eb4b3bfc475ed9b84c04268738cadffaa75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ext/http/http_next.rs: ext/http/http_next.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in deno_http::http_next::serve_http11_raw at line 4532. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- ext/http/http_next.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":"ext/http/http_next.rs"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d9a33877943fbbf529d0ff87aa2670558bd1f5621b4b14ad66738b6f81b5d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/tools/desktop.rs: cli/tools/desktop.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in deno::tools::desktop::compile_desktop at line 176. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- cli/tools/desktop.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":"cli/tools/desktop.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"34940fbae7cb486f71033bc92626a4bdf76b5705d230807de51a0bfabb3e12f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ext/node/polyfills/_http_client.js: ext/node/polyfills/_http_client.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in _http_client.ClientRequest at line 505. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- ext/node/polyfills/_http_client.js\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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"182e04a8b1f52caef80101606460ba2ebfc0b8e83e81cdeb86e3bcc9ef63b0b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: runtime/js/99_main.js: runtime/js/99_main.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in 99_main.bootstrapMainRuntime at line 936. 2 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- runtime/js/99_main.js\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":"runtime/js/99_main.js"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6a970ea0af906c52e39274f852f435046f97e23d6220b41e9922b877991ed9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ext/node/ops/tls_wrap.rs: ext/node/ops/tls_wrap.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in deno_node::ops::tls_wrap::build_client_config at line 4895. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- ext/node/ops/tls_wrap.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":"ext/node/ops/tls_wrap.rs"},"region":{"startLine":4895}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b18119780fbd3c230c8ce26c1bcc8af60a68b85172da163cb364a1b6283e18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/cli_parser/src/parse.rs: libs/cli_parser/src/parse.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in deno_cli_parser::parse::parse_args at line 112. 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- libs/cli_parser/src/parse.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/cli_parser/src/parse.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca4ac73dd75dee3d18c9d38387390303b0288f493ed88e14f90407a3f6aeafe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/rt/run.rs: cli/rt/run.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in EmbeddedModuleLoader::load_default at line 469. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- cli/rt/run.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":"cli/rt/run.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d311763f056e085f0e7d48c00618dd53d697bf94a74cdf2a993c79535758bad3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/core/runtime/jsruntime.rs: libs/core/runtime/jsruntime.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in JsRuntime::new_inner at line 815. 2 of those changes were fix/bug commits, and the other 2 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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- libs/core/runtime/jsruntime.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/core/runtime/jsruntime.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"d829139972caf6995274d7977a3bb5bb5049b5fe7913dd5412baf45cc781db9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ext/fetch/lib.rs: ext/fetch/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in deno_fetch::create_http_client at line 1045. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- ext/fetch/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":"ext/fetch/lib.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bae2ea1ec47b7a726ff0fe55af5afb0dded8843a1149ca589de185c48619346"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ext/node/polyfills/https.ts: ext/node/polyfills/https.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in https.Agent.getName at line 255. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- ext/node/polyfills/https.ts\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":"ext/node/polyfills/https.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4711c45512dbd0f47346ed3ac4f4151f0629474930d5010acdb7def18bc9fa8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ext/web/13_message_port.js: ext/web/13_message_port.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MessagePort.postMessage at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- ext/web/13_message_port.js\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":"ext/web/13_message_port.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"593b97c241619a92f46c27fda9357f812b45365c294fa719614a2f2271db576b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/npm_cache/registry_info.rs: libs/npm_cache/registry_info.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RegistryInfoProviderInner::create_load_future at line 295. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- libs/npm_cache/registry_info.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/npm_cache/registry_info.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"88abf63ba648990b44b030cb96274fb884090ffb4417525256ffcaacbb6abd1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: ext/net/ops.rs: ext/net/ops.rs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is deno_net::ops::format_rdata at line 1335), AT OR 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(net): check permissions for multicast membership (#36529)\u201D; \u201Cfix(ext/node): improve node:dns error codes and lookupService/setLocalAddress compat (#36552)\u201D; \u201Cfix(ext/net): skip unsupported DNS records in ANY queries (#36650)\u201D; \u201Cfix(net): handle malformed DNS record text (#36374)\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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- ext/net/ops.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":"ext/net/ops.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"29aeb6126e70f73107f1888ac7437d857e543f0ac1cc75ff4451ac9714de0b5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: ext/napi/lib.rs: ext/napi/lib.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is deno_napi::op_napi_open at line 916), AT OR 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(ext/napi): surface OS error and path on addon load failure (#36630)\u201D; \u201Cfix(ext/napi): run JS-calling finalizers safely, NULL string result, and Float16Array (#36572)\u201D; \u201Cfix(ext/napi): don\u0027t invoke napi_wrap finalizer twice at teardown (#36556)\u201D; \u201Cfix(ext/napi): track pending finalizers by identity (#36551)\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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- ext/napi/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":"ext/napi/lib.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40241588a01e788eecb0a4817d22d8b57a8423b95fa0cf9444cc91f1fca1220"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: runtime/ops/desktop.rs: runtime/ops/desktop.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 10 (its worst body is DesktopValue::to_v8 at line 42), AT OR 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(desktop): transport binding args and results as DesktopValue so Uint8Array survives (#36573)\u201D; \u201Cfix(desktop): keep the macOS bundle signature valid unless an update is applied (#36574)\u201D; \u201Cfix(desktop): never block the JS thread on the error-report dialog (#36575)\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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- runtime/ops/desktop.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":"runtime/ops/desktop.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d305bf5f6d7591b2693f95b5baf7372a8911a23dda97b34bd16a5b7733968d4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: ext/node/lib.rs: ext/node/lib.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is deno_node::op_node_load_env_file at line 140), AT OR 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(ext/node): don\u0027t panic on prime sizes below 2 bits (#36400)\u201D; \u201Cfix(ext/node): improve node:dns error codes and lookupService/setLocalAddress compat (#36552)\u201D; \u201Cfix(os): serialize process environment updates (#36074)\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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- ext/node/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":"ext/node/lib.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ce97938c947ac03da845a7c433539c78e49dd73500d8ed6c7559f6a5a4d1f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: cli/registry.rs: cli/registry.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is deno::registry::parse_package_name at line 227), AT OR 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(publish): authenticate the package existence check so private packages work (#36656)\u201D; \u201Cfix(publish): reject invalid JSR package names (#36474)\u201D; \u201Cfix(cli): escape control characters in external metadata (#36198)\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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- cli/registry.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":"cli/registry.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3799bb2e6fdad49104b320c9a7940aea90fcfee8897d573e345680472587a844"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: cli/tools/bundle/mod.rs: cli/tools/bundle/mod.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is DenoPluginHandler::on_resolve at line 1584), AT OR 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(bundle): isolate esbuild downloads from workspace registries (#36467)\u201D; \u201Cfix(bundle): respect runtime file permissions (#36107)\u201D; \u201Cfix(cjs): use loader sources for recursive analysis (#36111)\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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 12:27:08 \u002B01:00\u0027 --until=\u00272026-10-26 12:27:08 \u002B01:00\u0027 --full-history --no-merges -- cli/tools/bundle/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":"cli/tools/bundle/mod.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f15b0d7b497e7077d2b1bbc64e7d2560c8dcb1c13eea46be1816801e47f00fb"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 28 significant file(s) lose their only recent owner: libs/config/glob/mod.rs, libs/cli_parser/src/tests.rs, libs/core/async_cell.rs, libs/core/modules/map/ext_script.rs, libs/core/modules/recursive_load.rs, cli/tsc/native.rs, ext/node_crypto/primes.rs, libs/core/modules/map/dynamic.rs (\u002B20 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"39b343fb44c65fde9522e846c1c6c7059aaeed2d72de0f612b33e150d924b05b"}},{"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: ext/node/ops/wasi.rs, ext/crypto/algorithm.rs, ext/crypto/subtle_wrap_key.rs, cli/lsp/test_code_actions.rs, ext/napi/pe.rs, libs/core/runtime/host_defined_options.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"857905dac72bb3e7a40aa1b7f8e83c8774d31351b5788c13add7f1dcf7b704d3"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: cli/lib/standalone/virtual_fs.rs, cli/util/draw_thread.rs, tools/release/npm/build.ts, libs/npm_installer/graph.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"07a325311abbb5f5d1c54049f622fb1347d610730e62845a4fbb173ae86daac0"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 3 significant file(s) lose their only recent owner: libs/dcore/src/inspector_server.rs, runtime/subprocess_windows/src/anon_pipe.rs, libs/core/io/buffer_strategy.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"32d3cc94d175b222e4f7bd86dcdf3383a348bd1d1c7129f715f3bcc2f58af591"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 5 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 (47 single-owned of 795 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 795 of the 1140 production source files in this repository met that bar). They are anonymized user #5 (2 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: libs/core/fast_string.rs, cli/tools/pack/npm_tarball.rs, libs/core/convert.rs, tools/lint_plugins/prefer_primordials.ts, cli/util/archive.rs, ext/http/compressible.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken): Support for deeply nested assignments \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":"tools/lint_plugins/prefer_primordials.ts"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"625f35e8dfe134d9d846ac5831ce97475751903ece84085d2d015d3580fa80ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucacsonato): use this when 1.7.1 is released. \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/wpt/wpt.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d47f730fb54e95fa305023b954be14f27bbbb35b658a8f26cafb628f88d0997"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): add a proper router 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/util/server/servers/jsr_registry.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bf545d0629721053599de2db69b802b0ef6e8bb71dbbfee07da7c5ddf56fd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): use monch to extract out the vars \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/util/lib/builders.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc62951117fb8ba2e2e6cbcc6e42fddc6b902e8e3da1069db853cab78630fd6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Remove config-related methods from builder. \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/util/lib/lsp.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"3add187304f55e2f9ae2afae13acc8f343d7b43ce11ffa931bded0a89869d446"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(fbaltor): remove this \u0027any\u0027 when @types/node fixes https://github.com/DefinitelyTyped/DefinitelyTyped/discussions/65831"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit_node/buffer_test.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1459042ab3a0525c0f50325d40aacac44332f8fe94ce202921933816b822543c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(fbaltor): remove this \u0027any\u0027 when @types/node fixes https://github.com/DefinitelyTyped/DefinitelyTyped/discussions/65831"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit_node/buffer_test.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce77c62a2e61c130b4b28aaf0dbffeed26199fcdc95989a361341b01c05bc60d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(uki00a): Once Node.js\u0027s \u0060parallel/test-child-process-spawn-error.js\u0060 works, this test case should be removed. \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_node/child_process_test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d776b042acc417258d2e85ab345de5db1f273f96fda759737d56827c5a42b70b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@bartlomieju) Assert an error message. \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_node/child_process_test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c329ef9dba45549223bf5f9c2615076aa2ca0fadeb1ecb19873c90c8f6615977"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(uki00a): Remove this case once Node\u0027s \u0060parallel/test-child-process-spawn-event.js\u0060 works. \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_node/child_process_test.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba06bfe88546a34b633bb2e3b72e4dad78fb1c0b014b6b6e61bcdd4b072ade51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(uki00a): Remove this case once Node\u0027s \u0060parallel/test-child-process-spawn-shell.js\u0060 works. \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_node/child_process_test.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"21eec240836815232d2340edb6af609f744628cb1f5cff37cd4eef17ac85397a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(uki00a): Remove this case once Node\u0027s \u0060parallel/test-child-process-spawn-shell.js\u0060 works. \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_node/child_process_test.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1960d0bd489c24e9eb589cbb97cd51da14adbb3421bc2334697a8aa9cb5dd494"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(uki00a): Remove this case once Node\u0027s \u0060parallel/test-child-process-spawn-shell.js\u0060 works. \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_node/child_process_test.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cfffd171b29326c07f23914e91f76bc421838a13cb67d48525cd4c995cda6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(uki00a): Remove this case once Node\u0027s \u0060parallel/test-child-process-spawn-shell.js\u0060 works. \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_node/child_process_test.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc462943f76b56aec8c4cbccd486eb743a2a3a7a7336377f6bae4d3fad85d5d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Delete this test case, and instead enable the compat case \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_node/fs_test.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"511d2cdef24972122d3351acdb26ed98f359abd53fa80bbb314f9f24b6bd375d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4070a5700a8247c193212c09c3c92741d3224b1f21ee25679185b2acb7d23c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f6bbe565cdc2b34d489264820a5aa96eddf46138e6b36bfce4b356bd25a03c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6d92eeb4285ef35f7e72051831e9fc34d7891c08494548b07625764ae058f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8284c20059f7109f9721878acbebf9c17da8066c6505f6e39599310d99e9909c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d2aff97f2766c86699a1eec89c84341744c43c31ef1e69ca00943d97eda357"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed611f1b541eca49f5497b852a7a2a2eca95f982ea8b8f06167f307a0cdf90f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad21acef57dc5be5c8c5e18dc04ee34be5217063487a70617a4285c0fc66b13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed24776e6f5c72d094a886508aec4c6d4c3f3d9fb854cb769557b87abc233039"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba4c3f9a834f10fc5b9ae02a9559f97740525ea67976c8a4b83f1dfd9d1f833"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76a08a963dc34f471c0ffdf5d69a07cc1beb5f2356df4e3b75d383ad81e4254"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7d70a0e9c1f65e6cbcafd63386709b34ce4b001c58fca6f17cb6ed73b61858"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9fb00760abdb6d15f179c4b57ce924fb71eead4b0628c2e2f1a7181f140f66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"a971537f104be17bcebbeb6f056536093d068b891d440248e9077cf1421cf5ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6557efed876b1f7eea7aaaae1431e252f5a1d1594b85eef5411bddb2e09b310"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48fd2d0505e6e71a053d03e6c2f492947175db9c12a0c4b5f68fd0d5e833552"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/fs_test.ts"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ee787c13d29c654aca41e142a7cb7c4b6aacd934cd88a89e1761a3ce8d6a32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/_fs/_fs_fstat_test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"969533c4b3f6a8aca74dbf5bfa87dd05112c1a1b31390e15b2edc55898f67369"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/_fs/_fs_fstat_test.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afa9432b28f162ee2907f2ccaad1322ae66397d2cf31773775ae9b5eedb0084"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/_fs/_fs_fstat_test.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4145d30924cf3c4aef6c70c4e1a78f7f1b8ff77d8e49cf8bac786c470e3a45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/_fs/_fs_fstat_test.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"847256dd5a6d2da492cec9c2a1ec614fae3dd8f5b2001e83c0784705d8a80a37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/_fs/_fs_writeFile_test.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"547e718cd54600adaccb24bb49f08d3c73490e432f79203e25a4ca3ed59c0577"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/_fs/_fs_writeFile_test.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bffb10264b4d8b6fa39805a17b3b0a37bd1d412b4a3a72f040ea57006050ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/_fs/_fs_writeFile_test.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c32a4becfd2723d74bb94f41a7ec41621d854de00e529b8a4151a63ecc00d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is broken in Deno 2, because \u0060file.rid\u0060 is undefined. \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_node/_fs/_fs_writeFile_test.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b752f50143db32745d38a9855b2d6b69ee31942b8a11522f69ad3f25d3663c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(littledivy): h2 over TLS is not yet implemented \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_node/http2_test.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be363d2dc5fed8d7ce784fd7a78e6f165337f869bf4ef185f8105dcf9763396"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(littledivy): h2 over TLS is not yet implemented \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_node/http2_test.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"858efcb8696bd5652f525127e9b1ed3094141776f45de455c52ddb466826347a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(littledivy): h2 over TLS is not yet implemented \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_node/http2_test.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ce4e62e48f5ccea044bb18ca5ca2c9fba95f2ffca9cf8d744fa493eae3ca34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(littledivy): h2 over TLS is not yet implemented \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_node/http2_test.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0944b30ce7943175d1dfa4d180b3c85e23ec3c096e184dbc2e1b5d5be57f2b3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(satyarohith): enable the test on windows. \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_node/http2_test.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2822278c1c201f1c42320f1d8b8c7d0338c5031d456f6cd66fb5c7ebf4f2ad9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(littledivy): fix timer leak in http2 server implementation \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_node/http2_test.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74f4687ea16c603093da8646ac84de58e1b801c950e2bcc4c1fb1f9819bdec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(denoland/deno#33317): test HTTP/1.1 fallback once that path works."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit_node/http2_test.ts"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b7f9cb77b99ba78bacc9217881891fea7b6f539048f38c2a9a142bc0d7df00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@marvinhagemeister): hyper doesn\u0027t support custom status text \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_node/http_test.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7ef400ae76ee8b8c777b1ec24ace96727bd120bedcd06a156922857b1a369f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@marvinhagemeister): hyper doesn\u0027t support custom \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_node/http_test.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8c355465c95e1b8e70cdb1144077c8d672543a105edd08b930131a02c66be8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Enable sanitizer. A \u0022zlib\u0022 resource is leaked in this test case. \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_node/http_test.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc9e33de8a118f56a317f9e958955f39d1cc8edabd1bc2204a529ca54dcae2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Enable this test \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_node/http_test.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"b136913ecd83d8177536ccbfd666176716ad0a9c98bfa59a42cd1b6c3b645c36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Enable this test \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_node/process_test.ts"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"602d2c1074c329f7d13f4a04d0f7aae3d6450211828e0b1ccd088b11402a57ab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(kt3k): This is necessary for preventing op leak on windows \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_node/http_test.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"103bf3d548f5ebd8f98bc2c8a875b6be1b1cf970e2144841a8477a8e222457a0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(kt3k): This is necessary for preventing op leak on windows \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_node/http_test.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"85835728d0b724bf2a23bf6a761b9019ad9f604f76036e8bce4610b1e8508c81"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(kt3k): This is necessary for preventing op leak on windows \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_node/http_test.ts"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bb01f120e2e082b392b9602b54a8a636e0c112730d58995225218af9f33971"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(kt3k): This is necessary for preventing op leak on windows \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_node/http_test.ts"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e425bfd80bf4e5e0461788ad03bcc911911d05d7d4dc98aec6f3a09631a5fb1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): This test never really worked \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_node/http_test.ts"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81f47c480ea6e930b963ac9b99af53bff91e644171bf2e65f158e4b77d27d43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): the raw headers should not be lowercased, they should be \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_node/http_test.ts"},"region":{"startLine":2471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9371f1bcea9df736279e2551a7642cddfbcda8d1f675ff88348da6f815cebde8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@bartlomieju): re-enable once server-side HTTP also uses llhttp \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_node/http_test.ts"},"region":{"startLine":2544}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd93d7ddb98e172278664cf0ee7cdf86e0de999dafac7ee900b184000a4ecee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): temporarily disabled during migration from resources to native handles \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_node/http_upgrade_create_connection_test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"541002e7702cd647b828df6c88d038b0e414955986af2144b78306997d99c426"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(PolarETech): Run this test even in non tty environment \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_node/process_test.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"872fb1a07f7b7f0cf90f42ca11f0d5bc0af9a6501367de62135f270b024c9fd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Enable this test case. \u0027readable\u0027 event handler in \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_node/process_test.ts"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed93d22f25f580755a7ffc0c1711057d2c9177129c2da297c29687d4aad38eca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // // TODO(PolarETech): Prepare a similar test that can be run on Windows \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_node/process_test.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"878426fff78386fc6d4adbfa716ce48776f8f46883d0782efc06ffb873b2fb88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): it would be better to use \u0060mainPort.on(\u0022message\u0022)\u0060, \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_node/worker_threads_test.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc14be8bd19717458a56716825e398f01504df55484150ad0f374c90a02f42bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): assertCallbackErrorUncaught exits for async operations on the thread pool. \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_node/crypto/crypto_pbkdf2_test.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"751d937a659346447a7a315adf46a5cf4396c4b145735e376398da9dac74fc15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucacasonato): our md4 implementation does not have an OID, so it can\u0027t sign/verify \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_node/crypto/crypto_sign_test.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e2ff7123e539e0b70ec5fe3e934e702e2e1c352f1bd22cadcd4888bccfcf4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucacasonato): our md4 implementation does not have an OID, so it can\u0027t sign/verify \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_node/crypto/crypto_sign_test.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c21928c9bbd3591c254633fe0418a916d9981b7cdf4c9d76c6b7de94b3a5ae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // @ts-ignore FIXME: types dont allow this \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_node/crypto/crypto_sign_test.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6444855826d1fcaffb2220ba5ccd890ee67327563897834bd963812f640d0c56"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // @ts-ignore FIXME: types dont allow this \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_node/crypto/crypto_sign_test.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2871b697eb0b8f7ed488fb06027be66e265848a46bf5259c03b14f1b504d4587"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is flaky on CI \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_node/_fs/_fs_watch_test.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed4bd9fdb7c2bb85a3cd7b2b89a024b5561c5e0a9ba5b4d9b2cd92bc7e25928"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Tango992): Delete the ts-expect-error when the @types/node definition has been defined. \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_node/_fs/_fs_write_test.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa168a7e69942a422a78935d4d6ad8d68576bd2a94ebb5c79890463a307d9e04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Tango992): Delete the ts-expect-error when the @types/node definition has been defined. \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_node/_fs/_fs_write_test.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a86a5211c53cce7ce66a182917c2bfb674d53b78da357c86937c23bed6be63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): would be better if we could apply this unstable \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/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"98424682afd197170c3bd596b16d8937a740f5bc289536c14ff29ef260811a6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucacasonato): fix the SNI in the certs so that this is not 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":"tests/unit/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9532c41e209bb300645792faa89f754bd2b533554b0253a92b8d9b647439d8e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): when a file\u0027s owner is actually being changed, \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/chown_test.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"118610d336e61cc2c833586fdde5f68c821ee2990195f7f2beeeeab44d1532b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): same as chownSyncSucceed \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/chown_test.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28103d134e984ebd91326057e588e7c9bb9fe06731c259f3509c82784232560"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bartlomieju): this test is very flaky on CI, fix it \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/command_test.ts"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb02bb25bbeddf9870d2160de4e4ccd97aa56952d0fd058030a482a42dff21b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) The unit test functions in this module are too coarse. They should \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/console_test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ba8302b7944d42b3b5aa3933e1e6412100077222aa4f5c67c9873f6eb309c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) These tests currently strip all the ANSI colors out. We don\u0027t have a \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/console_test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"624e7ec0db9a03379f7726d9a5dccb98844689169ca5e3a1cf045b2b1199ff37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@kitsonk) remove when we are no longer patching TypeScript to have \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/esnext_test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"008c23245b9eaf9aca549549d28226659df39b9188a19bf6b35908e11f6b52e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): reenable this test \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/fetch_test.ts"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb481a8cb78669518dfaedbcfc43bcd258a43c49e544163168360e4ce8321a99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): currently ignored as we do not thread callback exceptions through nonblocking pointers \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/ffi_test.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb5da3856b5b6ea7dea29e47ca174a69eabc2a4a51b056c4a767128b4d8b838"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): Check error kind when dispatch_minimal pipes errors properly \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/files_test.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a224e204a446f0febe9c5fceeae4fc8a2d3824c91cb44b7cc909adff8ebe7c59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): Check error kind when dispatch_minimal pipes errors properly \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/files_test.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfe68084bd16e61f01570bd1ff6093f5772b210e6053df58fda4bb0c2a3826e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): test different modes \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/files_test.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a8047773140a4aed1ca9e38bd4752e792690269347cc438fa139c7b7af1377"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): test different modes \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/files_test.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6cc4f7091defe9f3374ddd51ece7ac73f813f3f1b1ea298f6d19201d02f6df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) Add more tests to specify format. \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/fs_events_test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"862f0cc59eece38854f66fd4f49bf9807dbd78dc7baef56697c120a30c0a8323"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Add \u0060Navigator\u0060 to deno_lint globals. \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/globals_test.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0478b53751395e7f8094bb599dca716d18af42c60a0cf34cec153d912809e42d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) If we don\u0027t call httpConn.nextRequest() here we get \u0022error sending \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/http_test.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"008448fbe9a79a16d2b801a5e3bd442e8258bd6387a5657c76efd9e19746eb3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) If we don\u0027t call httpConn.nextRequest() here we get \u0022error sending \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/http_test.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"90744ba0dd1dc851b8d4f6b8606ac885d65eb3742dfe05ea38a67652e740afec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): handle chunk extension \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/http_test.ts"},"region":{"startLine":2898}}}],"partialFingerprints":{"codehealthFindingId/v1":"40647ebf92cef0261d3b3c73d481b3fae66b608c16cd9e803da3d75e07c89c18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): handle chunk extension \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/serve_test.ts"},"region":{"startLine":5435}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fdb32a5e12dddc26af89749d92d33576f7f11b202c0c3b6f8779f5885c0ddc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(igorzi): https://github.com/denoland/deno/issues/21437"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/kv_queue_undelivered_test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cbfdb17f8ec4e5e0583ad5d8a6fb16fe838dddc0fd9cf88fac8b98dd1ca990"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(igorzi): https://github.com/denoland/deno/issues/21437"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/kv_queue_undelivered_test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9726699930c55bd92d609245bc491b286e90c2e4e9b3e15b4aec31b69499f92c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@marvinhagemeister) Remove once we land \u0022official\u0022 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":"tests/unit/lint_plugin_test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"590e07e9bb17db321767346e92097b15a9d97627fb2ff438b96d3d202b512dc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucacasonato): support concurrent reads and writes on unixpacket sockets \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/net_test.ts"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"56af07384ae091fed3bc9fa6954cb722276b46a8c0f606c5e09419266b338bad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): assert that thrown error is of a specific type. \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/net_test.ts"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"205b237229da9064be4e5de9b049265fc83d24bbd0b1633191528538e7375b02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) Is Other really the error we should get here? What would Go do? \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/remove_test.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dea6aa980bc6c2d8542ea37f5e48e95d13fd62951e1485a33af9fd40514b58b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack to get a stream \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":"tests/unit/request_test.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"192286110fbb44f131cb1a8a9d5d810cf869953399fc67e164bcd868feac8f28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bartlomieju): \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/serve_test.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a90ab78ee8b2fc868214986b89e5d232ae27b2080686c1caf0d892850a40f5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bartlomieju): \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/serve_test.ts"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"332bf64cfaf78e6f375d72abfe486ffc814c4a0724c763d1e47f81c5be911031"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bartlomieju): \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/serve_test.ts"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"18168bebec97b521916e7fde845e57fa8d13c1d4964bcf2c4f2484026b1ae4ec"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \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/serve_test.ts"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18b657563592375c3bb39125cdc3288f4b71bd21b25a4a89283f28d1af1e5b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \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/serve_test.ts"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"5672c1c4373bea1b3a656c336dd092ec188b88c897b7843dd13b44b46cda2ecb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): curl on Windows CI stopped supporting --http2? \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/serve_test.ts"},"region":{"startLine":5538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7941c28589908638fa604e96ffc0cf9c96bce30af22bd45aaf51b9f3c17dbe9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This test should eventually use fetch, when we support trailers there. \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/serve_test.ts"},"region":{"startLine":5618}}}],"partialFingerprints":{"codehealthFindingId/v1":"2436d08ee9d04ab7ec4d8a48b760deff6cec6a86be9b2385330b2a73ab6b8bdc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): curl on CI stopped supporting --http2? \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/serve_test.ts"},"region":{"startLine":5657}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e35ec854eb213173cb7188e4a6b4bdca4cf0b28c96ede664447d9a9d5dd09b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is not valid, because Node.js timers are \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/timers_test.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0abe610384ff9132ed861a07b1816aebf1f58b08fa7e2067079778014eed7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is not valid, because Node.js timers are \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/timers_test.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5f0aca7b226fecb61190d12d1e9a2adeacd99185700fb86c084991694c85e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is not valid, because Node.js timers are \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/timers_test.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5596ba69a5831e36969bd53a0e40a4a75b773c7254b94ff4ab3b04f130c894a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is not valid, because Node.js timers are \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/timers_test.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04528cb49b18cfa3725c03d9c13f8d67a4dd00130633d416b7fa85b5112f194"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is not valid, because Node.js timers are \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/timers_test.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d609eb636956c0f352ece6473938ae6f2ec8e261ee634e4e1ce03458c00f43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is not valid, because Node.js timers are \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/timers_test.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8868c58b25b45f0b053fbd1846a95b5648091d2a56711946b93de46889e0c3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is not valid, because Node.js timers are \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/timers_test.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4be831252f209eeacd430a02bebb6705f6af589897ac91304868a2eec05ebd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is not valid, because Node.js timers are \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/timers_test.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e77af771aff7299b6073c8643194aeecf75bb06d8911198baeb61581805312"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test is not valid, because Node.js timers are \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/timers_test.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0c7e8e19bb019680933ccca45b318af46fa0db5d327e7d2cfe9535484f4303"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this might be 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/unit/tls_test.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9202906f04c24624d5cc8c30844745c3bc478258e288c94e038c649c072abc3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nayeemrmn): This is true according to \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/url_test.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2924115437081b7714adca774a65fed3dca79972727e8f73af2788cc24e7d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nayeemrmn): This is true according to \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/url_test.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc39f6f11ed23d9d5caaeff3fb95ad4944b2c5a649a13f1e58c8b611d930cda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This requires us to ignore bad certs \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/websocket_test.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f222477a47335fd32ea6ae777cd91f6b27726bf5b209ab64cfe6d56498c8af73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): add bases in the future as 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":"tests/specs/mod.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"1936d6e270da32852ca81b305bd8876353a916ab93f74c44273c5eef83fe9444"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: foo \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/specs/lint/with_report_config_override/with_config/a.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a144f45efe6fcf2c741eb2d73a59e71dd68b3bb63de0482fd833f1fec490d9a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: foo \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/specs/lint/with_report_config/with_config/a.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdf337bba3ca1192be29a323071031ef64cb12743c6e5d55de49f88c8d69e98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: foo \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/specs/lint/with_config_without_args/with_config/a.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"636ccd58cb4dabb0bea06f9d871fd781559159225a3770e3a1b0e854fd1bce87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: foo \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/specs/lint/with_config_and_flags/with_config/a.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f2a7e8da8d1eec6001bfb0e5fa2ea9c9ae8e3bfe459f4020e474794ddea78c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: foo \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/specs/lint/with_config/with_config/a.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc231463f6a9dd2ee6e4c2c7c982fa8bb9224f1a3618ec9c0125f86b839c3dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: foo \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/specs/lint/glob/with_config/a.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"143fab3ebebae27cbb029136875295e1b0ea8d9559d184cd7f6bf12188baee74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this file should be ignored \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/specs/lint/with_report_config_override/with_config/b.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f93567483e79851187355b66921a7428d0e54494b1ce818c1385fcce006bd1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this file should be ignored \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/specs/lint/with_report_config/with_config/b.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e5ca3a67ba4197ba5ba4cefbac4545954da43d17e9cfb40c0149a1aa24c4b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this file should be ignored \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/specs/lint/with_config_without_args/with_config/b.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c0aaf649ab4bdb59c31214740b1661ef881ce945cb8a752bce74cd0f7bddc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this file should be ignored \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/specs/lint/with_config_and_flags/with_config/b.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2cbc35f86aead547b2da13f2d26cee03bb6e28923d155ef2ca3662cfcf4203"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this file should be ignored \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/specs/lint/with_config/with_config/b.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afc50b0b59f6bc15844600b43970d1b20ef11b19b2a20cc1e4e72bf33c47b51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this file should be ignored \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/specs/lint/glob/with_config/b.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e16f4171d0e6bd7c9d5ebf1812eef24e5eb2198ca363b9e7a0455a8585e941"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(iuioiua): Use \u0060URLPatternList\u0060 once available (https://github.com/whatwg/urlpattern/pull/166)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/jsr/@std/http/1.0.0/mod.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cab5e86d5f8e178fc45dca42a058aa7ba5c7f816a29531aa0ce4ad3bc93a2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(2.0): reenable \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/integration/cache_tests.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3924b8babe9c5a4006ee42dfb388edbe8c61326e73c11e9a58274ccc122c98b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(2.0): this test should first run \u0060deno install\u0060? \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/integration/compile_tests.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6189908a04397d90e06197f7736fbd615d8af461661ecbf116096bb64233860"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): The exclusion to make this test pass doesn\u0027t seem to work on windows. \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/integration/coverage_tests.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf55213fa492f4acb10d2c6ed6ae903c212444d2415df40b4e272f3d3a384c86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(aapoalas): The order of logging in thread safe callbacks is \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/integration/ffi_tests.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd41e76c01404c3efd399ce7d12e30c5ea65cbe9e8e834f1176a5bd4300cce6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): The position returned by tsgo is wrong. Seems to be \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/integration/lsp_tests.rs"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d0401c5e3e1acb7be8bbd79543348b5c790fca230941b7d5b39d86ae20482b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Enable for tsgo when implemented upstream: \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/integration/lsp_tests.rs"},"region":{"startLine":4728}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced24ced260ecf8894dce4afeb8c089f2d19dff50263d666ec126c3124d34dbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Enable for tsgo when implemented upstream: \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/integration/lsp_tests.rs"},"region":{"startLine":10586}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a72d402e4f3863979ab8b0f1d6dabc155f9c0164dbb1809b7229dcabee74d0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Enable for tsgo when implemented upstream: \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/integration/lsp_tests.rs"},"region":{"startLine":18504}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2d34d9e6412db4796b3545529398709bd40a1a918a17b1d4815b8137e64b46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Enable for tsgo when implemented upstream: \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/integration/lsp_tests.rs"},"region":{"startLine":22228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3d9788fc27d296d41c7d890cc6e5091a34aaa84de388e2db5c6ecb33585382"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Enable for tsgo when implemented upstream: \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/integration/lsp_tests.rs"},"region":{"startLine":22274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c140ae002fd3fe9abab25ffcfb42b32a8af4699bd47b912a135750b005eacab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Enable for tsgo when implemented upstream: \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/integration/lsp_tests.rs"},"region":{"startLine":22320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c4a2d9855e2df4d1a900cafcd4d6c521443c294e65682dceb5c7a029326c72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Enable for tsgo when implemented upstream: \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/integration/lsp_tests.rs"},"region":{"startLine":22375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edc095320458ca908a60e054e224b6f6c9bfa73cf0d8b072f5fd3b8f8dc02c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): tsgo creates a redundant edit in this case. Report. \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/integration/lsp_tests.rs"},"region":{"startLine":8853}}}],"partialFingerprints":{"codehealthFindingId/v1":"2861642aa961723ee88520cbab2f3352c9f4a07434585b41bca2c8a9dc4ffee5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): \u0060deno install\u0060 should work here, it doesn\u0027t as of writing. \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/integration/lsp_tests.rs"},"region":{"startLine":13566}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c8fb2364bc6e14d02bf854f3f1a8642191e4ae2a6c209d4d5f64a4b2148d15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Unused var \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/integration/lsp_tests.rs"},"region":{"startLine":18957}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cefdfeb1e476e0d8612c2afd1bc1d2b24a81b24d032a1d007947f6f3a74eeed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Unused var \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/integration/lsp_tests.rs"},"region":{"startLine":18994}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b7dfe43c8c515c2938ef3d138622be4b06747c1b6b32ddd65b7f2ccaf3e009"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Unused var \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/integration/lsp_tests.rs"},"region":{"startLine":19042}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e40ac96a13e9826fab01d8f4d6db921c28c2edee1e44c9497bed41e396ec4fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Goto definition for local npm package imports should work \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/integration/lsp_tests.rs"},"region":{"startLine":20059}}}],"partialFingerprints":{"codehealthFindingId/v1":"354e819d7b730212f0a6e105f0554a399f063b13fc70ca6aac05e9d61049df8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): This URI here contains an unnecessary fragment, and \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/integration/lsp_tests.rs"},"region":{"startLine":22208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8d755ebf2bbcba85856b49e4fd7e09213163f815a6babcf020bbdf8485844a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(nayeemrmn): REPL unit tests don\u0027t support output capturing. \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/integration/repl_tests.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b8e539b161fc9c78d51b6c48eaaa93efd8c93b1bf4187cba7d5d954605003d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): it would be nice if the test server didn\u0027t produce \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/integration/run_tests.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6e739199218049cae87595abd2040b10d8a9faf0b685b5ceb4c4c8eb2ec20f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): investigate why --allow-read is required 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/integration/run_tests.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"34878360bd3ac954aa9147f7f2e22ca29799eacd29cd8b4cb17bedf2cff5d6a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): seems wrong that we don\u0027t auto-discover the config file to get the vendor directory for this \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/integration/run_tests.rs"},"region":{"startLine":3042}}}],"partialFingerprints":{"codehealthFindingId/v1":"d455d3a706b54758bff458782852ac2597a814cfbfd818d0dab86cf59d305f83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): waiting on fix in https://github.com/servo/rust-url/issues/505"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/run_tests.rs"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f083e649b5c88f66ddee636bad47fbf5eede7527e82f211f4786419e44328e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: flaky on macOS, it tends to not distribute requests evenly \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/integration/serve_tests.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d4958d8e29d95a4102ad1c28f87634f442e762a150739fa5146d25e19fd8d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(#18480): re-enable"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/test_tests.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc068a6598e61a63dae849e9cd44f9c15097204679f1f8f11f5f031df441a6ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this test became flaky on macOS runner; it is unclear \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/integration/watcher_tests.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc26e08e94c1e7c5fb5c2ddb4d46600e6de85d6ac057a2dd75a57049e2867c1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): temporarily disabled, because we can\u0027t upgrade \u0060tests/util/std\u0060 submodule \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/bench/main.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc9af571d59d0d832d0996dc9cde58842256f6635b9deb0f4d2ffad71a15f1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): Remove this, denoland/benchmark_data is deprecated. \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/bench/main.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d60e2d28d2c87c3f6ac471c32c180a59a044a47357f03a1f60aeb71409b650"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) The \u0022benchmark\u0022 benchmark should actually be called \u0022exec_time\u0022. \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/bench/main.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"096105e5e9ca388de0551fdc57bff09a4dbe5b88039b5ec75a52964d2580af24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove \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/bench/main.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed98c0465a847e3f51dd9684fb079acf8e305cd6c3de9d05e93a7a4d6827d21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove \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/bench/main.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd8a534164f2be0af75019acd36855fd004453701d3bfd16618840bac438704"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) remove! \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":"runtime/web_worker.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b389387006f034c07f489f2dc603127849bb70628b4ff8f46c3008d4750d26db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we don\u0027t want to test this w/classic workers because \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":"runtime/web_worker.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"437990dd5a7116a321035da02d0963129bce3f2be906374c376429e1651d35e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): check if order of actions is aligned to Worker spec \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":"runtime/web_worker.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adfc3d43882ecfd806b358894ffcb700fb0de36c2b80881e0c2c02e645eff6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): run following block using \u0022select!\u0022 \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":"runtime/web_worker.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc595eb34c048526ccc555d66d7299dde88a1223de79576ca5eb981987666d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): add \u0022type\u0022: \u0022classic\u0022, ie. ability to load \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":"runtime/web_worker.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad60f9d21dada554bcae2e93017ab520ccfffdd683301c936ef720fea8f99ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): temporary measurement until we start supporting more \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":"runtime/worker.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48e1e859759d4849d1b6fa2e21b0404379b637c0e755c8455959d99c379e059"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: io error probably \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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9197e0672ae7ee8bcc18ad888d5c4796a685532c35df9ee1eeca6dc6cf8ef7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is this correct? \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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb3b55678a9e53e554bd57af91854d4bddceb61c8cc470fa466100178295413"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs tests to ensure that the arguments are properly \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":"runtime/subprocess_windows/src/process.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b216703acc3c076639f40af7a66bfcf325f966843230755fc37ac96e080f95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): currently randomly selected exit code, it should \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":"runtime/permissions/broker.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb222b6ea6c6300e18e138eae330e9072155f569e6a64924a629c4ddd24f992"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(AaronO): generalize or upstream this optimization \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":"runtime/permissions/lib.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d09c7ea37351d6205950b0d8c7c35b7f0405e26c6724d7f7e524959c5aeaaa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Using the process ID exposes a race condition \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":"runtime/ops/runtime.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"381af564b07da5e29abcac5af05a6b96d876d295adc7568e6241a7201e70d381"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreubotella) Properly parse the MIME type \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":"runtime/ops/web_worker/sync_fetch.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"76839bd2f2aa1c51e87f503e233bc14abbef04a08b444267ebcbf149c7d3b964"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreubotella) It\u0027s not good to throw an exception related to blob \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":"runtime/ops/web_worker/sync_fetch.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aab10d53e75cc57a33229dd4034e5ffe30385055a6121be263b1ee81824789"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreubotella): make the below thread into a resource that can be \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":"runtime/ops/web_worker/sync_fetch.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c988193303f1890ed05a0d4bdfffd28ae104d3378b7b6ab96b225d5868244df1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreubotella) Properly run fetch\u0027s \u0022extract a MIME type\u0022. \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":"runtime/ops/web_worker/sync_fetch.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c65bee8e53c982dcbeab3a5d25ae81a3c0f46db415e5ae8c4e438a8aef7dff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreubotella) Check properly for a Javascript MIME type. \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":"runtime/ops/web_worker/sync_fetch.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e100dd9fb2547c2631c24fbb15690275823c1f00500889db970f680ba1d48025"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): is it 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":"runtime/features/data.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7e5bbfbae319fa3dddc8c659af1974da73c3d93d6e3aed9b4150f842273215"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: experiment with in from_v8/to_v8 \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/serde_v8/keys.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c29a25bee0d0032f7e514dd82b05a9efdaae9715e8b0140f4212fd0b577a1e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is unused \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/serde_v8/keys.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b622163b22c6ae720c37aedd110979f970266d0061a402d20d5344af0a462c12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: experiment with external strings \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/serde_v8/keys.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32fe22f6df693c26d660c796b5872088ef38decb965f88e9abff76d618d1022"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: evaluate if own KeyCache is better than v8\u0027s dedupe \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/serde_v8/keys.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f39c3d3ce76d7bb4de4077b18ff8bd867544b905896a5674a848963e19df33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider external strings later \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/serde_v8/keys.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5765547a06bd70e24e5ed48dadf72762fcf235493c79e85ddb609ce6a67519a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe add a Payload type that holds scope \u0026 v8::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":"libs/serde_v8/payload.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ba64ddd7f18edb32aff753adeaf016445e8bdb3b5c23377d556cbc1ce2dfe9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider allowing serializing to v8 Maps (e.g: via a magic type) \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/serde_v8/ser.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"9225be11a490ce9319b986b065125b16be82d64a2d6b2fe329c73e44999b66bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is not optimal, ideally we\u0027d get an array of [1,2,3] instead. \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/serde_v8/tests/de.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb1a9c46d320b53abf79d5cc4d7e54bcf1e4c6d683bf9af202b28b6df09633f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this is a temporary measure until we have swc erroring for this \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/resolver/emit.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"95451bd99cb28548bd1d325d8a35e170b1730ac7b0eaf3c2cd3b42f671f63d0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(https://github.com/rust-lang/rust/issues/109737): remove once_cell after get_or_try_init is stabilized"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/factory.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4c93dac4fc01d99d8f15fe1b90281df46bca663987b694679d4617b46bfda5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(https://github.com/rust-lang/rust/issues/109737): remove once_cell after get_or_try_init is stabilized"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/factory.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e47bf3302742ff48e35a947fac1bb56090a7fc27e3ae6c323bcdfbefe32a9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): should this be disabled for auto? \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/resolver/factory.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91c3f90401c53c8f673d7db0caf417940c5631effabed22324aed117f2ee040"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): do not log this in this crate... that should be \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/resolver/factory.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb2f307fc80367b9a6fddb7a8609c8369143e2a719405807a4f184199aa60fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@kitsonk) fix when deno_graph does not query cache for synthetic \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/resolver/file_fetcher.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dea9b20c0b4bd32194938ed0d49e644cd9e50f7dfc25bb5009cd551c2b307e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): it seems bad that we\u0027re converting this \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/resolver/lib.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"81581767467690febd729ce0a7194e2120bae14e41c759745ceba29d30ecf4dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): investigate if this canonicalization is always \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/resolver/npm/managed/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc94e8b2e58cdbb08de7a1b8e370ce5087c61245aed6e0a02bafb1bbf4070ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(#30074): we should remove passing the referrer in here and remove the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/loader/module_loader.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4644994606f67814c320245ac9b0a66dab94bd65346f9c0ec39e890a526f84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(https://github.com/rust-lang/rust/issues/129436): remove once stabilized"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/loader/npm.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c26e740649ed3eeff6c7aedf4fc6b8d48a59210f78d955f4643635f81edcce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(https://github.com/rust-lang/rust/issues/129436): remove once stabilized"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lib/util/text_encoding.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a069e1ba58e52a3f06e3851e47fa5112608406fd28dafae5c46f747397b73241"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@crowlKats): change to origin_data for 2.0 \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/resolver/cache/deno_dir.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0feb35e4dcb932658185bdb1aa400bf0771aead5b01b79d4aecd206d2c8c7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we should save this unwrapped result \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/ops/op2/dispatch_async.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf79c3f39289c8ba31d90a5f55379745494a172ed8670db90cc622e84360dbaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we should save this unwrapped result \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/ops/op2/dispatch_fast.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67aa088d3ba4d156a7ca30c274e1f9cd5d85c99f59717bbc8eff605ce7272c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): see note about index_in below \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/ops/op2/dispatch_fast.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a66600b10b80540e2080402a5604eb9d10f78e8f6d8481175c4b6998b1178d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): this could be a valid arg, but we need to update has_fast_api_callback_options below \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/ops/op2/dispatch_fast.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bf2d1f500060196da9761b37f4e5fbdf99f3735b9442c7f7b291f82db2dda1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): these fastcall indexes should not use the same index as the outparam \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/ops/op2/dispatch_fast.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7c1f6c51a52629ba159a3327eb1d187e7811abd55160928dfc07b06a93a044"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we should validate the alternatives. For now we just assume the caller knows what \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/ops/op2/dispatch_fast.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ed9fe433d5dbe4bc8cdcd817e7b0a79d2b1f247715b8293709effe529bf3a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we can enable these soon \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/ops/op2/dispatch_fast.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae422793b327f8b87b8ddf1266fef21cacbae6c98a42215eb136eabd911a1f4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): implement fast for any Any-typed buffer \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/ops/op2/dispatch_fast.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"147848b2b4c28640b66787bc5a297e4f83a9a261a0854562d9d04cc35be72f91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This should limit itself to clearing ours only \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/ops/op2/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a9d71f79b6ad985b31b36a1ea3104d38ca657bb4b89b66f85aa26fe6c8f76e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We need to carry the mut status through somehow \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/ops/op2/signature.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"6701b2ea03a879e47b219e672e03891b3258a6f89544f69a41e1d0b0c687c2ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dsherret): investigate \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/ops/op2/signature.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa37c9fee52a1ed246ae3fa0de2245a8e05eeadcdf154f25da9387b6cea2e641"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): Should we pretty-format this instead? \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/ops/op2/signature.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4d57e754bb58e5229cfd27137d9ef453e8e82e829257976a69e135084c809c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): this is a bit awkward, but we need to modify the type container 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":"libs/ops/op2/signature.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db877a1e208e373350439cd383d104810e7f5a059234824bb193d3c475221e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: needs investigation... should Arg be boxed? \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/ops/op2/signature_retval.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1662b9b975ec7f1cad6e71518b227971282b47c1028ac36f0003807dc90e4666"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): Option \u002B Marker doesn\u0027t work yet \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/ops/op2/test_cases/sync/buffers_out.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"14810e54e4e15c59c8d499c5f3464d88a40f656641e1782723ad7071747d6155"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): change the code below to create this \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/npm_installer/bin_entries.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"603b4d9f99bb33929ca9081a2a0a1aed70f932b481f9e7689d7569c35cd9a956"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this is not exactly correct because it should \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/npm_installer/local.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51e075917fba266cad6ce1837491d6c158ba732a0b25d05f43ccab4b750bcf2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): estimate capacity? \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/npm_installer/package_json.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c64e83163248714518ea7ca66c186c671988da1e68ec331ec2d62902cab01ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(#27198): make this private and only use RegistryInfoProvider in the rest of"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_cache/registry_info.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf8b417c1e7692923da1bb44c3bc7de7ad3d06e1e6a093fab1ff76729546df7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): support more auth methods besides token and basic auth \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/npm_cache/remote.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"20254ce5248242bd5063db2af9218361182df6e8c46b380aba6e0f4ff1317914"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): for perf we should use an arena/bump allocator for \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/npm/resolution/graph.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e13d60203d13af571233d7e0d8aff171317f4048dffaf2ea62daf4712d87cd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): do we need an additional hashmap to get this quickly? \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/npm/resolution/snapshot.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fd735157d73cf2756a2ad3f0ab69fa8a7698798a9a3081eac32baa96f5028a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this should use a reverse lookup table in the \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/npm/resolution/snapshot.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"f882e14fe9358c132625c8492b4b3929457a0d984ea14c014896180f87fa693e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this is not exactly correct because some ids \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/npm/resolution/snapshot.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbfe83d18b44c8c01b02f48e7e439f98f79d5798d786ab548cfe7eb9deeee74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: investigate \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/node_shim/lib.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"4414ad052a7d6704cac71bda4b2993383ad65c97f59631741adca3d2d3f1df00"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bartlomieju): check if these conditions are okay, probably \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/node_resolver/analyze.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b91670043c3237bba864fa7a22d7ce191249eaf41608aa254d6df34f24ee8ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): what is going on here? Isn\u0027t this a bunch of duplicate code? \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/node_resolver/analyze.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab6aef4d568c50e89b78be0840bc20f2340e4dd946254cbe93ea2726b723a1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): Node actually checks if a given export exists in \u0060exports\u0060 object, \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/node_resolver/analyze.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a1b395f0730d7391a214a1c61ee69c6f294dd89efc4fa2afdb4d9d493fc635"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): skipped \u0022policy\u0022 part as we don\u0027t plan to support it \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/node_resolver/resolution.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6127696995665e86f56f0e5246dae76d1d7934ea17af8744e48e7002f71d2d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this seems wrong \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/node_resolver/resolution.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d8cc4dd60ef7b156024a4fd576f34568d978fe03605a3885ae7ea7d93ad623"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): skipped checking errors for commonJS resolution and \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/node_resolver/resolution.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c18dd02a57347e958430311b0b6ae765028bc436d9399982a94b8273d7bc0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): skipped checking errors for commonJS resolution and \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/node_resolver/resolution.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"59864b3923562b59c10e004492716cba0b38dc9ee6d2331110b7b631b22c3c11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): currently not supported \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/node_resolver/resolution.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d7022a11a774ae5043ae1e1e37e4b08578b1b355894a3434aa784ec1403477"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): don\u0027t allocate a string here (maybe use an \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/node_resolver/resolution.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"5315fb6c31e915f81ae4af4cc97dca7f38f3c1f7ab82c72747460d25dca63bb7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): verify that keys are not numeric \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/node_resolver/resolution.rs"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baa43d978feedcf6a4df7214e1568abbc07b49e46b18441a4c6129453711071"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): \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/node_resolver/resolution.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a13b54e3bcbd034b8bbc9b232300a601cade9e33ce8d9e83809bfa5b9295abb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): \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":"ext/process/lib.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"865b33e07a7b61cb83f60858d7c34c218560b29d77fc8cf204024a67263b5fee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): \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":"ext/os/lib.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"17806b697457204d14c311c1a3ac4e0a23d40ee6f150a91adb303aef9c3400fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): \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":"ext/os/lib.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"77eec6ad1a4156d5bc737aa653a72aed4c31c55a41569c4bfabf708afacbde8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): \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":"cli/util/unix.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb30b5a9d032be5add03be88c1a8f2e8630a183f748431909cefa14a84ea7013"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): \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":"cli/tools/serve.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf4b5f785014ac9081a48a4027552b901e67b56405a75d2e8ea833b6e0534f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): \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":"cli/tools/serve.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b56d183035d048b103e9db8d1c24bf4583fc047f2ad8889834690409500c3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): \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":"cli/lsp/parent_process_checker.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e407ce03538365a025a04ee2c2b9760afadb328ba204b5387366ecefa82e5864"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): investigate exactly how node and typescript handles this \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/node_resolver/resolution.rs"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c755670b3e1775c956de365fc3c75f82b1e08060669bd711880f64c7b22c49c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): emitLegacyIndexDeprecation() \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/node_resolver/resolution.rs"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0455efa87e9b34e9a3c7fdc26980afdece98a9d717fcf993fd0608aeb57291c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): emitLegacyIndexDeprecation() \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/node_resolver/resolution.rs"},"region":{"startLine":2388}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6dc147c6de91e7c0711656234763863ff19aa05225bf5d1ae5ef995d84147b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): investigate exactly how typescript does this \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/node_resolver/resolution.rs"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d217cada487d92fd96061ccf761b250f8fc57d773b97bb1ad1d1af27c50918e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): patches is deprecated, remove in Deno 3.0 \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/lockfile/lib.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed39ae55b7e63e81611e39b81d1b724acbc5de884d3444afbbe80b630fad75f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): update process wide inspector server host \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/inspector_server/lib.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f224a5bdbe9604643ef1bd85843ef4564a33d11dba8d2e098fb926f7e1d013"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): make it configurable \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/dcore/src/main.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7e8ec51941fe64d41f4dead99a172d7dace2b7dadb8e6efe25e559cd6a61c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): add safety comments to unsafe blocks and remove this allow \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/core_testing/lib.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa5a230ceb1c375d41fe4b07e00880e9500b87cc0f83943ec6a18193f7798c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): add safety comments to unsafe blocks and remove this allow \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/core/lib.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"52238781df4ebbbc8a5652a1190f6471cb20ab55b9c68b6e5c6e13f18f7a14c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(littledivy): write this test using natives api when exposed \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/core_testing/unit/resource_test.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f124e7f85557198768c28c52963ed20cd55bf756c44c90e68180d82801ca8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is duplicated in \u0060core/examples/ts_modules_loader.rs\u0060. \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/core_testing/checkin/runner/ts_module_loader.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10dedb0c45cd7769f4ef8e4814db5be10040d767e2f7570be94dee8c5321fea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is duplicated in \u0060core/examples/ts_modules_loader.rs\u0060. \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/core_testing/checkin/runner/ts_module_loader.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a57a73a21c928520d40c3db5d649a4ca93e27daf84f9e15e4d020ce5ae8798"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is duplicated in \u0060core/examples/ts_modules_loader.rs\u0060. \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/core_testing/checkin/runner/ts_module_loader.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae575623b2d51e64dd17fc4ed3b7b216cfe6413a257bb321d19832220a78300"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cancel.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdd1ceec14e54e8c46908c93a0be00808d25ccba81da3ed22e77764f12851e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cancel.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"290a90afe2ae9801e8460a0119d02f86475b054692106ff2a2550a6708a52007"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cancel.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4d761a416411de66fe9b588b908230bba01c4989e31d0b436f415225397d40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cancel.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e757768e78bcc77b330c1f261220f6fd5557142ccbb586ce2abafbfbb146f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cancel.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07e85da173c3c2de0df58dc9fcd48aef1ee5c9ccef04f11f7e2df4ed38f1ee1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cancel.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a9e271fdb6d1bddf21067bef4ad006dfc39d4041c0eb0361f83b5a27efa502"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cancel.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"b661e5b0ec63b2d9d4d756f1eda0e55a46f6fb44a06e26b6325b66f750c7f4cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cancel.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00a13388a1e58c58998f6f671c15eb83d8d1bad1a8c8f8e35e3111a57ebe723"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cancel.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"176cab9461b5c04e7867ca02e002ded9f889fb84c411a0a1aed407619729dbc2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a85d1b827d01d090a208b38e9a269e24681937c8bb5dc147dd9e551471234f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"991288efff853f4c3c5825c206f225aae1408158bf0f2859322b9c9938afaf67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"889fcfdb8102e39c8f9ad9664dd6ec9fddcb7678a974d211711467c129727c3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce28ba28cd450501dae5eead54f032db9d7010a02246c542d9838a30ffe93ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a88788d6ae11290a2445141bb2fa1321aa4df7a62ead6c8cb691b598569128a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"0238d59e76341b3f9940bd44987b3846b0c710a29a5a8f336c200fd93e615f4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbf8f3ad430cf91525cc4a9b78b2d011fbeebcbf9348063ed83a9fe5f16225a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"627040e4c20b56009837d866203e416e750cb21eabb09ec6ac2966a6e093d9e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc4e996a29bc5e5ce057eaf36907459ff0fe11e39913c7754ab1bb739ef6f66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f7a5f2117005ad9e6a9359d31f3c10f39175475e8cbc8ae07933cf214b90a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/async_cell.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0ec8b0fd105244212e5b01c226706a14ce63f9f4d543e66fe0460a3bfffd0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): safety comment \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/core/io/resource.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"386247c584f497fc45e8187f1645d7a60575fa53822bb687b4c2a33b520b84c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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/core/convert.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c98a3b132032e5285f28c816760656f1144e73c8cdc2dd2450aa3907d2675a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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/core/convert.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"8846c712d0c6839233d927f3f19acb26dc3494c707f1aa66bc364251213d638d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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/core/convert.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58d1af1f0c340f1f37002df5b4502397ac36cf68e8cb6a73defd02eecb1fe04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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/core/convert.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcc013812cb9da4950b0e5d9132ea7b088c503f35a7d1bd3291cd9a5b5943a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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/core/convert.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"375dd33128e2252d18ec9e5095a01455882c6b021ae978789e0133a0d3f577a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) Deprecate AnyError and encourage deno_core::anyhow::Error instead. \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/core/error.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"731b27cbf8d148a1c5639bfc50c4132342416f9d53b77481150748a397260bbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): why does JsErrorClass not allow having references within this struct? \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/core/error.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe12bbfa76c13976abdae3a779fc4d42df2896973c6aac0c8627244485e7503a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we need consistency around when we insert \u0022in promise\u0022 and when we don\u0027t. For now, we \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/core/error.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08dc6e1d938b69fe2bb3f3c4d4e4507134c686fb9163290244a75724c90b0e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): \u0060deno_core_ext\u0060 ops should be returned as a separate \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/core/extension_set.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6abf962e4e63185f6bb0ee2be86c11ffb2451614c0ec57b6ef65e92c495deb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): these numbers were chosen arbitrarily. This is a very \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/core/extension_set.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ee45782ef538f36ccd1d3c1e8e7b86cdcc3c51effa44b3da3f4afdf521f39d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): Currently this fast fn won\u0027t throw like \u0060op_disabled_fn\u0060; \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/core/extensions.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfb8f02fb1659834fd466836f851dbfc94aab31e0518f67bc3198985fb4ddfe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): When we get a const deref, as_str can be const \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/core/fast_string.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e96a32d4d38e2b0fe3e66edef746c9a482f999ad1eace1975df23d62e06d42e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): this could be more efficient \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/core/fast_string.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59f491878303b8461d85eb79c3989a8c2759ccf84c996d6d136d8a55b37e697"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove this \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/core/inspector.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"855377ad3e0a4ebb3f98220e31cc1d26caa2f10e85a05302cda74db832e288fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove this \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/core/inspector.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecac5265142bc75e7f2775aaa120e3a2c0feb9de93e43d5d81982ebc5f496d6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove this \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":"ext/websocket/stream.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"509cc78914f0360f406a150cf1505c2c34e15a5e6162d79b96c52ebc5dfa4719"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove after crrev.com/c/7595271 \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/core/ops_builtin.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"f151745988130a2782db7d97af001e0e543c9160ada2551f8f0c9e6370cb6e14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove after crrev.com/c/7595271 \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/core/modules/map/evaluation.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b1fe4e294a68d2e4507567060b7488806f2fcd543df124860801cc5bcbf08e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: track ArrayBuffers, would require using a custom allocator to track \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/core/ops_builtin_v8.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"286b36eae2a15ff26e22d1336098e0d83519f19b94d5755ff2fa40595d2fde14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this condition should be configurable. It\u0027s a CLI assumption. \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/core/ops_builtin_v8.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb719fed7cfd9ccee29cdf4b7b659841aeae7c0e5c716d23b161cade80483e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): this would be better as a trait \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/core/ops_metrics.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40ee90b79ec3b5f1eac765178008082dc15f2b45837cc791b643354b89cf401"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): ideally we wouldn\u0027t box if we could use arena allocation and a max submission size \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/core/tasks.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c179da99154f1065e2ab6a80a627d46b9c749d058fc1ecea94b48dd3bf88d5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we may want to split the Send and !Send tasks \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/core/tasks.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ee2f7e8d1e20a2e905338a920cb70a8519022699ce17dc4a702bfe9e062db7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): can we skip the mutex 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":"libs/core/tasks.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8915a2c2dd20f1fac32b2eee2e2ceff12667eba19eaf4128aa00f6294630b761"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): can we split the waker into a send and !send one? \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/core/tasks.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"705acfed5e2427c99d98e8f9b054fbde5f4481a65064e3c7752ee6b7b24becaa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Keep this as a \u0060v8::Value\u0060 like an ECMAScript \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/core/webidl.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"288adf2aac262fba29654d10de43a700ec450ceb690b05b3731dbd2952701032"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: WebGPU API like \u0060GPUExtent3D\u0060, \u0060GPUOrigin3D\u0060 \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/core/webidl.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcb0258b7b9b3b2832eab75aa127448e6ccca68294a67b7c2545fd35f51b3b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once the toolchain is \u003E= 1.93, consider using \u0060[MaybeUninit\u003CT\u003E]\u0060 \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/core/webidl.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f525c72b0c48c4413b2c4630157481d490c39a2ee86b808e0efc0887bc3d126"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \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/core/webidl.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"289f14522d2f698ccc8545a49ab75e6a7c32f8a385a0a7ad2957fa1d0153389a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When we add pipe support, refactor the reactor types and \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/core/uv_compat/tty.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"359c0474485e59547b150c6345a20c937af5d99be00cfdf121398dfe8d029b12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle WINDOW_BUFFER_SIZE_EVENT for resize signaling \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/core/uv_compat/tty.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae3b916fc9f9ebd47a930bc7e74664f765426a9fc67ee0adcfcbc0c1395f505"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: libuv stops in-progress reads before changing mode and \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/core/uv_compat/tty.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"16333be43ad8f66dceca381442c2d495d0973a13e96a200a49a95d263b3f3b4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Track vterm state on Windows. \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/core/uv_compat/tty.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"af67158f1c1399d91ec5868c5a944fd05676a7182a8d345fe872947f0ec82c5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): these two calls will panic if there\u0027s any problem in the JS code \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/core/runtime/bindings.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8fa0f9978320cdfddd9a438d6fbfff48104c97144a2533095c97969ca876ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): This is polled in \u0060exception_to_err_result()\u0060 which is \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/core/runtime/exception_state.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f174491fc1b857f68e1a771345477cc37f35f701e5af1d8df0f0b0b1bfbe26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we can probably move this to Drop eventually \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/core/runtime/exception_state.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2953823b830570de49ee8b0cb3d3d667665bcfe2444c9afcfa9cde5150929eaa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): This check fails for some tests, will need to fix this \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/core/runtime/jsrealm.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"e476cdc5b15375b8b8b443329425e6e27acc45334014a60a7cc027590d49e1d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This check fails for some tests, will need to fix this \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/core/runtime/jsrealm.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"92904c7ae94869381cfe2b80aafed9026ca91c37151d8453ef10d00bced49297"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): reduce duplication between this and \u0060execute_script\u0060, and \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/core/runtime/jsrealm.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"14af5c9bce58972a55d18dc623adb6cbba95554b3d4df3e9f20af6bccb28a0bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): create a separate method to execute code synchronously \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/core/runtime/jsrealm.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d296b00bc93745f26c5ed01529b7509294b95dd7c22e6ee1b0e420ca815807"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): factor out \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/core/runtime/jsruntime.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"adee8eb71518e8ee70d68e45c99d780940fabaa685f23f7f4e22205a6b007931"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): why is this done in here? Maybe we can hoist it out? \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/core/runtime/jsruntime.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c1352ad9147112b8931c5d4be3811899f6608f23c6ad10fb398c93cd20fe04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is somewhat duplicated in \u0060bindings::initialize_context\u0060, \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/core/runtime/jsruntime.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"2141c8c85a22c025b09b83a2851f23969066169fa3a71a7646033d631b48445c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove, instead \u0060JsRuntimeForSnapshot::new\u0060 should return \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/core/runtime/jsruntime.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78dafcb30cee20f8ef60d2c67ed084c7bdd7a269c8925e1ba17182f312d2d26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): maybe this should be a method on the \u0060ModuleMap\u0060, \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/core/runtime/jsruntime.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0dc612b256ce930334d5cec0b2200f6eb91a7c73cae6bb663847ba4b6f896f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We need to ignore this error for things like the repl to behave as \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/core/runtime/jsruntime.rs"},"region":{"startLine":2376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d81ff61f0e2b45d4a76d894fd4dd70f12abde5e223cd2bc15815778713433e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This should deconstruct the realm into sidecar data rather than \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/core/runtime/jsruntime.rs"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f228c01a31c4c738ae518d3dd8eece2d6178a5129dcc91c2c9505e5d6d659f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We could be smarter here about not allocating \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/core/runtime/ops.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2abda2bd065561e3f5ba1675a12dce14b36febbcbcb27e31d8c0a6c784d32e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This is a dangerous op that we\u0027ll use to test resizable buffers in a later pass. \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/core/runtime/ops.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"0855e1b957825af8616d4eb703fa73db54ac0965c1197b34fd352583ae8efe87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We should be able to make these things much faster and without a scope \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/core/runtime/ops_rust_to_v8.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"52798814e9368f84c8d8ffea8e902d25816fa70491668a0e6f94dde278872fd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We should be able to make these things much faster and without a scope \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/core/runtime/ops_rust_to_v8.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"165dc5e7c5bed9da8de3d94409f83a34844acf3b31a78cb532623a7ff89c21b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): v8::Global needs From/Into \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/core/runtime/snapshot.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef0840ebed6ceecd2ed87813616bbccc6c244796de6aba16053b40eb86e71a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): Fast API ops when snapshot is not loaded. \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/core/runtime/tests/misc.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bbee8d20f4b2b0ca777a25c74c35c5e5ec316d13f579ecd76334cae623ce6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This is only fired in debug mode \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/core/runtime/tests/misc.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebb43de630f7a49bf5fdccc17abd6326b62069f9f61f5f987fe20d9b8e3327c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This code is also testing TypeErased above \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/core/runtime/op_driver/erased_future.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d4fb04bf42701c51463bc57da0328b2d28d1c50d0c7fea2151b49e39d756ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we should not be swapping this loader out \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/core/modules/map.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9941cad484312a7b8c82a559c54d36aaaa7029acecf39790bfb6dfd82b29c41b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): move recursive module loading into here so we can avoid making this pub \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/core/modules/map.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdce70e05403c14598bfb76f2de090bf7c58eb55bb7e5624e9da29cc693aca5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): I have a hunch that this is wrong - write a test \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/core/modules/map.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdf983e8f0ce7314fe9e74f2ea0821bc07f8c4b663ec23a5776ff033153ff6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): creating a global just to create a local from it \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/core/modules/map.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7347e22aa3b34f0291e4be5736925b2ae439e19c346ac17c8fe7307785f2e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove this method or rename it to \u0060new_js_module\u0060. \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/core/modules/map.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd152c69abdf7c120dce6853d799df0b9ebb66e81ecf16249025f92b5de0d70c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): add a more concrete variant - like \u0060ModuleError::CompileError\u0060? \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/core/modules/map.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d581ea73d83abd3e554c5fa2ce0da77ce4523ed0c149fd01c54bf891ea4a98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): don\u0027t store \u0060data:\u0060 URLs at all; re-read \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/core/modules/map.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc5c07926da1c8880f595832f548c4b7b8e53f8b32cf059f8670d6485716759"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): maybe move to a helper function? \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/core/modules/map.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"5795d2591fea8fde56564a364ce4364f368023c6377f7ba5a22a54026fce83ba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bartomieju): there are no stack frames if exception \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/core/modules/map.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b689a51a7ea7b0ab536e8244bb3e91efc5d59358069705611bf6e6acf71dd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): would be much better if the string was ensured to not contain \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/core/modules/map.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a6be8c448304e5acfe5f1a80a04d9e83cbf330eda8acc4fc1bf49a531f6cbd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: instantiate_module is called more than it should be, \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/core/modules/map.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b803cabc671f1349637a2cec99b0c0936dfec7a1ea623dfb43025e0110aa147"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): I have a strong opinion we should store all redirects \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/core/modules/mod.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddefa2ba6306569b93c31bb04a505290445d679d5a370639e15a532c3c7c6681"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is questionable. I think we should remove it. \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/core/modules/mod.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92f415340fa1d10d82717e421f2d9443ce2ee81525e671ecaaaacaff383820d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): add an assertion that checks for that assumption? \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/core/modules/module_map_data.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"975ae1d7218fbb11e4dbcb7612abd6e4bbfc64df8af8078a92742dedf4d08534"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): verify if we can store \u0060ModuleType\u0060 here instead \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/core/modules/module_map_data.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f534e45cbcfa156538e52d23c1ffa34b96476769f059a8327c4d3a8dde2e060d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): Don\u0027t clone \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/core/modules/module_map_data.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f651238e8e047885943ac21fd7cd32a26e9cb7c538b1fe900b4f2ffc27b5f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): this is better than giving the entire crate access to the internals. \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/core/modules/module_map_data.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee674e5d383ca51aed341c8392334157e60687f9035cca4ab2cc16fbb443f92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) Hopefully in the future we can remove current task \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/core/modules/tests.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b8c2baf85daf10b62dd9979ec5dffa1435e403b6a96ec9c4a62bc74b2e5d3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): These checks here are pretty broken and make a lot of assumptions \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/core/modules/tests.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcdb8ecf574803abdc1d59bcff8198512779f5299ba65756d17b75cfb97a0d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) Arguably the first time we poll only the following modules \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/core/modules/tests.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b77b34715e512774b481637cb114c098c74efcfdd55ba0647eb3fb817b898b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: Once the issue with the ModuleNamespaceEntryGetter is fixed, we can maintain a reference to the module \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/core/modules/tests.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bcf0e1c7bf4e6c3b50a74b84b42c749c3c0ccbc646da03feca3969753332dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We register this waker unconditionally because we occasionally need to re-run \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/core/modules/map/dynamic.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"457031ed839114cc51074d2b1ccadcd6a1c6af7b781bd0f63555228373724c55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060u64\u0060 instead? \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/core/io/resource_table.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5077170646b62c86d351e66b6dc627b9bf86252ef4a21e40fdbe32db7c1cf1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is duplicated in \u0060testing/checkin\u0060 \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/core/examples/ts_module_loader.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef174b85708cf64a512c236dd7fcea26e180f995795cda14a93da914f976303c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is duplicated in \u0060testing/checkin\u0060 \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/core/examples/ts_module_loader.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0385793f5e7116c727d3139e30b2d04934adf356836b144915bc58f83795a9be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is duplicated in \u0060testing/checkin\u0060 \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/core/examples/ts_module_loader.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e25bd145687154a13ea1865c3031948e4af522cc414a23a4a1567bdb6bcb22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): const when https://github.com/rust-lang/rust/issues/67521 is fixed"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/arena/raw_arena.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e894dd1e832b0dd61b932c8d65a68b4c47d545a0d4ecfb917bbdc15f0474cad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ry) HTTP headers are not unique key, value pairs. There may be more than \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/cache_dir/common.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c353f02c8e4059bde3534ad82c9d3af841d67bd7536a99cd784804ca0f36454"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): change to consume to avoid allocations \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/cache_dir/file_fetcher/mod.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd998f6890a4ce58fff8c56abbb21046bfd8b77fdb10d606b1d1e3734b1e70d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this seems very strange storing them comma separated \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/cache_dir/file_fetcher/mod.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"da105d94c40a0845cc817d68e8e4dc05c5b23186ca23129af22b475c6e40d1e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): these shouldn\u0027t unwrap \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/cache_dir/file_fetcher/mod.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c35a4778734af123b26dd080e8b3f96b729b04b74d178b7a1cd580151fd8b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we should be able to use a zero masking key over HTTPS \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":"ext/websocket/lib.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2562593a281b3811b352ae9a84000baaa73ba21e5e7db67aada82bf78c8c4545"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There should be a way to do following two lines cleaner... \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":"ext/websocket/stream.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c7c9a1356b84a258ba09e63c22f94ce5c1766d3dc2913b7d707b402ddf75f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There should be a way to do following two lines cleaner... \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":"ext/websocket/stream.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c6eea851ea39bd905156e3ad884459da0fc51587f3e3fa026f3cbebf9e0a23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): surface the h2 error? \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":"ext/websocket/stream.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b406f7838aa238a5a23434396347e0dab0c8c778ce5f22aa13d42289bc0d9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): surface the h2 error? \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":"ext/websocket/stream.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc67ab216f598f7744d3c3b8f3925263f61d029fac77edf2ce80075ca2b4099"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): this is possibly just too difficult, but we\u0027ll never call it \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":"ext/websocket/stream.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a01604487f6cf66b93133c4948e729ff36fd56c88d0e568adb754ca140b616"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@crowlKats): support max_bind_groups_plus_vertex_buffers \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":"ext/webgpu/adapter.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ca61aca91495a02b34ae2828432588c0f006abdcb4d48a6473870aee7769a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/gfx-rs/wgpu/issues/8748): InVertexStage limit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/adapter.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7faad07b724d6bb71bbcdaf08a3e973beda334596dec5e9f2d8190f28f379e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/gfx-rs/wgpu/issues/8748): InVertexStage limit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/adapter.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f200e26ebcf25d40c973d28893bf8ce56980e73c60b429c6ac7a6b24b9d4b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/gfx-rs/wgpu/issues/8748): InFragmentStage limit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/adapter.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f55c00200037abc997c27e48689146d0d03a1ee6fb5c51d992744e64875fd4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/gfx-rs/wgpu/issues/8748): InFragmentStage limit"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/adapter.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c95744e15a4aa7cf2377d1c6fcb111149f873c1d7bca7d6cc176eba6b62cbf5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/gfx-rs/wgpu/issues/8649): implement when wgpu has architecture detection"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/adapter.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"6019afe54e6c623c0de118989a5f5208c3cfa020d9d5ea3243017be80d006fdc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment repeated across 17 files: The identical TodoComment appears in 17 files (19 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 19 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// TODO(@crowlKats): no-op, needs wpgu to implement changing the label\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/bind_group.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16e550d607fe7f61995b477ffed2852f05ee04a4d777bb05f004aa92bc3b6fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@crowlkats): 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":"ext/webgpu/canvas.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7c72a983307ff366841c33c8673e2bede15ad77b8dde703616923c27e39097"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@crowlkats): 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":"ext/webgpu/canvas.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac54a29def5c7b575004d3a38e6daa26e9b845a32d55236a04a75ee1b61ac4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@crowlkats): 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":"ext/webgpu/canvas.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e7aa5c8780e6e7d0072ff533a491b9be3ca4a8dbfde6cbb8012d3d019ba279"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu): needs to support retrieving the label \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":"ext/webgpu/compute_pipeline.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd997b0677b6cf639e31b618cfacac738686f5d8395f8da0861d0626f48dd07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@crowlKats): consider adding an unreachable value that uses unreachable!() \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":"ext/webgpu/error.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf9d0c28fbd8c2ccb3e19cd781ddf87a28cf92d7f7eca570b62392d4df26971"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this variant should be ignored, register the lost callback instead. \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":"ext/webgpu/error.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30be034345e6328e92b55daf4d1dd24c99500c695a48bd89983537160bc1d1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(https://github.com/gfx-rs/wgpu/issues/6495): Destroy the query"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/query_set.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"edba4886b2f7011f7d2afc423276204f3465609281c8be0a64f0a6726b6fcd40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu): support nullable buffer \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":"ext/webgpu/render_bundle.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a963f5ab43455cb27597a687587ab7b5e02de0eb78747f73a05bebbabac0c5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu): support nullable buffer \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":"ext/webgpu/render_pass.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5e7f27dbd7b1b5df4ad3d66ac477e8ab4247578a03e973242b6e398cbf8503"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu): needs to add a way to retrieve the label \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":"ext/webgpu/render_pipeline.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3358305d23e4079fd31bdeb15c56f34081408f314f5c4ac7fddc56bf546f6727"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@crowlKats): weakref in texture for view \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":"ext/webgpu/texture.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae359dae57dd1468c51e167b25b6c641d3303ae11d53e8220dab0ef44bd04d7c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucacsonato): this should be a stream! \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":"ext/web/blob.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd925c73656aebec878465e7ceecba0a8f4304ddbf1929404e6dfac4b9f94b96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucacsonato): this should be a stream! \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":"ext/web/blob.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"69568c939bb1305f5c8e4c28fbbaf7d8b42164831abb7bf2226da1cb67d8e3db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken) Use f64::maximum instead https://github.com/rust-lang/rust/issues/91079"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/f64.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad2b1fd1ab57d2621a847cc6cb446fbb0e56fdfc000b256e865879ada971300"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken) Use f64::minimum instead https://github.com/rust-lang/rust/issues/91079"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/f64.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"805078f9d8769745ef79f2fe412c012a644f519bc8065d90710107038559be57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken): Error when deleting next line. proc-macro 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":"ext/web/geometry.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bd1b47654c0e40c889669619900b85d261fb76bf44060f22ffd4b96d4c4ad8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we can math this field instead of accounting for it \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":"ext/web/stream_resource.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad08205a2077263a96db7aa0e254f029c0e302cecf3cb5a242ba8019bd83bd06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): in release mode we should be able to make this an UnsafeCell \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":"ext/web/stream_resource.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd23bd6900fe6b7933e3ffc626ee7ac216d1c794ebd11bf4b7f939e870159a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): Move this to deno_core \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":"ext/web/stream_resource.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd29608c7c9e6b7a3be2fb83e9f52f7bde6792dd81debb4a0410ab34456b11a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We need Option\u003C\u0026T\u003E for cppgc -- this is a workaround \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":"ext/tls/tls_key.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e92cca7976d3d75227f02ee82adcde06671d9f3f9d527fb10f2fd1bd45e4880"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(piscisaureus): add more default attributes (e.g. script path). \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":"ext/telemetry/lib.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c064c2630d54984681bcf763bc35c705281a805cecebabe1dfd027ec6d307b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucacasonato): @opentelemetry/api defines it\u0027s own ROOT_CONTEXT \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":"ext/telemetry/telemetry.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8e97c04a94e64db86caac7e98537a7a2989e896ecffb90ee6b25c24007cb8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): the receiver path (\u0060IpcJsonStream::read_msg_inner\u0060) \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":"ext/process/ipc.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16a5820b3fda9c4bbe7571b9332a7578f19a0a79a65cacc6d557f645a70c960"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@AaronO): maybe find a more descriptive name or a convention for return structs \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":"ext/process/lib.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bdb21c00780585fde01eeac8ab6862287558178ee998e02dcf659b65f092ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this work with other resources, eg. sockets \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":"ext/process/lib.rs"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fc0fb899099226512aacf17d36927a40c3ba5f30711295d78872177f28baa2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): Probably not the most efficient way. \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":"ext/os/sys_info.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"687f9a00bc352599bc792ef57ff3867a16bd5c5aa50b6e81751c8a102a43e52d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): Put this in a once_cell. \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":"ext/os/sys_info.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e832873df90b074f19ea52175bfad993ed909160ddde3ae2ba46d6bcbcb04d09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): Put this in a once_cell \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":"ext/os/sys_info.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd23d16039946cd288929289f1f24a9c43675c0db2523ce1080710a8dd4b89d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): add more algorithms Aes192Cbc, etc. \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":"ext/node_crypto/cipher.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d20c12ad540a4fc076d2fa888fe17d8740b462d8300eea96d7764a3e9cb4cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): add more algorithms Aes192Cbc, Aes128GCM, etc. \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":"ext/node_crypto/cipher.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b90418eafa52307ffda796e95126f16309d827220184631eef85638f7fb92a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Option\u003C\u0026str\u003E not supproted in ops yet \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":"ext/node_crypto/keys.rs"},"region":{"startLine":3073}}}],"partialFingerprints":{"codehealthFindingId/v1":"25068e7f46cab2bdd2fe1a264db794cb4fd5e6f64682761e12882eacecdf1df1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Option\u003C\u0026str\u003E not supproted in ops yet \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":"ext/node_crypto/keys.rs"},"region":{"startLine":3074}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fee94a93cb2ab801156a8b31435c967dca8a1f5bff5d03e1f11f5c27174e190"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Option\u003C\u0026str\u003E not supproted in ops yet \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":"ext/node_crypto/keys.rs"},"region":{"startLine":3091}}}],"partialFingerprints":{"codehealthFindingId/v1":"036c12e03207d93e7dcf88e73939ce28d40628e71f32fb7d40ab2c47940a9e26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Option\u003C\u0026str\u003E not supproted in ops yet \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":"ext/node_crypto/keys.rs"},"region":{"startLine":3092}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc2aa5ff7fd0f5ad1ded57ed148e94a328007fea9f7ef0ff2e0b5f420195d66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): Support public key point encoding. \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":"ext/node_crypto/keys.rs"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1d32cbf5e1b506db577bbf559af971d58c82eb7ac16b7738dcf75d76d276e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): use rayon for CPU-bound tasks \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":"ext/node_crypto/lib.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c83e24348249c1e204463623cac563c06e95b36ec4aaf5b2575b98de6239f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): use rayon for CPU-bound tasks \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":"ext/node_crypto/lib.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"81367f3684b85325113c9e5ac6782b805dee276bdb54fa091870f17e75f51ac2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this with helper function, when it is added to asn1-rs \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":"ext/node_crypto/x509.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bae7785cdffd2ecf472fe8f4676dacab5541b718551ac30289449b2b09799a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): ideally this should not be 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":"ext/node/polyfills/_next_tick.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad21c5b689ea7f7a7a8505f1e9ec9ddcb9988fd88ab666049da999d60419e380"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): seems superfluous if we don\u0027t depend on \u0060arguments\u0060 \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":"ext/node/polyfills/_next_tick.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dde12696a50f1701700b834f8d6133414ec21f187fde1c4dd9f88354d0f737"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken): enable prefer-primordials for node polyfills \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":"ext/node/polyfills/cluster.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d23d75120b1f41a9bb1bfd84f2dfff316259614208c43379b068d96be9a8324"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken): enable prefer-primordials for node polyfills \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":"ext/node/polyfills/wasi.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c89f5928fae0cf3db8eead38a545014ab5bc5b2aa1c3ea7de0dfe616cbf9c5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken): enable prefer-primordials for node polyfills \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":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecdd734e3496ace3ec6574fff4d2fb38af38296eee56088fce1ef2e3acdabc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken): enable prefer-primordials for node polyfills \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":"ext/node/polyfills/internal/cluster/child.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8994c766dbc8cefd3b032479db5ff32291e62bbdca63d567ab19b33dc33719fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken): enable prefer-primordials for node polyfills \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":"ext/node/polyfills/internal/cluster/primary.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86ec9609741565091022a241dd3341c56cf5aa8cb95e16be2d78849138d7cbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken): enable prefer-primordials for node polyfills \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":"ext/node/polyfills/internal/cluster/round_robin_handle.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4259c05553a8f213a2b1794c7d835725b025e5ec0a819234194dd02c8bc300e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken): enable prefer-primordials for node polyfills \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":"ext/node/polyfills/internal/cluster/shared_handle.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3bbd2b4517f61e593aff2c9c665872382861f45e15f77ab2a27ba09c5ad35f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(petamoriken): enable prefer-primordials for node polyfills \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":"ext/node/polyfills/internal/cluster/worker.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56f1e2e57b8d845978ca1049317903432844b8c5b845ceeeb8a76c3c1415d05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmorten): here we deviate somewhat from the Node implementation which \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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d32bed9141ef863d8acc56431b91f076b0db2660f76a3122236672ccdc65b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmorten): here we deviate somewhat from the Node implementation which \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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"17eebce25c8dab387fffa4e75f115da5354f7380b7d85e128b2fd6919bf5e056"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo(@bartlomieju): close? \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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"3074cef936f0b805aa7581e36d7b446b2cadc1e77cebdc55cbdb0c3e87925452"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo(@bartlomieju): handle errors \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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"76da3d1ce3049a1122fb2a0def42267d66cc89719172c4b8315dad386e78d9a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nghttp2): re-evaluate when libnghttp2 is bumped or a per-stream \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cd4744cdb29f9abf9e481d49588c64efe4edc1f4136f180051d2b6764dfe3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jasnell): originSet is being added in preparation for ORIGIN frame \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":4109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8e1d46da62263db15caa5e95805e7f77c31acd1e2e39f27581f5819c7edf7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(danbev): is this a good default 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":5063}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0d96768cfd48f43010a8f4b416f204f17be9740c95aa3108ab5093d81a1cb4"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX it would be great if we could cancel the promise returned by \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":"ext/node/polyfills/net.ts"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5da313d9afe82bfb609502e15f5aa3f35fb3b5d2196e3be3b531bf840a8d83"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX it would be great if we could cancel the promise returned by \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":"ext/node/polyfills/net.ts"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3ed0468e56a1c221e588d3e771462b02e46841988d67cfa35f3ec2e8ebe81e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bartlomieju): this is wrong, we won\u0027t be using syscall to exit \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":"ext/node/polyfills/process.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3cf831c57276546338d18c63c54c722f8f1c98fef2aa5229022de1fbd597ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#26331): Ignores all signals except SIGBREAK, SIGINT, and SIGWINCH on windows."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/process.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3c7cdbca2a789c5dbbf40fb2d4176629ec180be05796c09c88358a47621b77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@satyarohith): support disabling source maps if 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":"ext/node/polyfills/process.ts"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"18afb3c754c8f2982ceac20e036751a64bb263f089c979df535c57a186fe3509"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Implement this when we added -e option to node compat mode \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":"ext/node/polyfills/process.ts"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e4c35a3c7e8ef8be1000986655c5a3892b3c8875d20e66988f905f7f2fa663"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): not sure if it\u0027s worth getting actual value during build process \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":"ext/node/polyfills/process.ts"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2457de49f86aea0f7c29aff80f94c3f9a64038ad603e9ecb4e6dfc755bacd28b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Get the value from --no-deprecation flag. \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":"ext/node/polyfills/process.ts"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7a9fd14edff383664935c7d7f060768e41e87d3afa9f80cdcccefcc96dff1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Tango992): Implement async op \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":"ext/node/polyfills/sqlite.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"707f025b9104c8c669da5c1787dc970e08a3a0416880a8805705f0fe046a2dc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // discovery / execution remains TODO and is gated behind separate work; the \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":"ext/node/polyfills/testing.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb500298f17a3471d811221a8685151c1ef77ddc1713c1c222e774a553e60c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bnoordhuis) Use locale-insensitive toLowerCase() \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":"ext/node/polyfills/tls.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2abc4dd1146594d75e7970b265496e8bcdd19bd4fc4a7b8e9e334fa1b966c32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): add support for punycode encodings \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":"ext/node/polyfills/url.ts"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e4a2430a4f579588ff8e565d93acf7b66046bed8966737f07d355efbefbe88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): This needs to be script\u0027s id \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":"ext/node/polyfills/util.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d385660b62577dd2f5f96b01af23d1ac8325a9ea7ac4e500f7bfdbfa8a3e62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieu): this doesn\u0027t match the Node.js behavior, it should be \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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf0b6b30d6b9277abb32b6173b2cf64b8cc2aefb0e1ca77b3d014be8deaa6d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is a really hacky way to provide \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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f53b33b29426a830348069ad797e3ce93af285833858a29667f736bb739d8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@marvinhagemeister): Recursively iterating over all message \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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"457d0ed052f3d0110c2a14cc0142d8f60d76c6a4bf2d5745632266507c6667b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): implement actual procedures \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":"ext/node/polyfills/internal_binding/async_wrap.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5a9ffdcf1c739523a3860b051f7cdeeb56151f8cf518d5ee0dac7bd4d4cee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmorten): use hints \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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fafcae856eb045d779f25d2c8a7c7504480197bbf982527b347b187ae8966c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmorten): map errors to appropriate error codes. \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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"0477b47a9a3a27e4ff271d06e0b33a4f00ca999c22fca1308b8eecca869df963"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@nathanwhit): use a proper async_id from async_hooks \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":"ext/node/polyfills/internal_binding/tls_wrap.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e594633c5121789aef3e5aee7563bdd681d7e17e85b4d8e33e5ba93dbf72632"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(addaleax): Merge this with owner_symbol and use it across all \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":"ext/node/polyfills/internal/async_hooks.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc5cfc866129f87be71813f46f0d41e8df32631b085be8bed318b2db35013a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Uncomment this \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":"ext/node/polyfills/internal/async_hooks.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e273264e56442d39d18a136c13399fb1bb85ef53e2b9eb93ece975a14c0de0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Uncomment the below \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":"ext/node/polyfills/internal/async_hooks.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c19af93255036c344fa9af3d447af48a4c33ccb3747fcc6fedc7452a1d1c318"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Uncomment the below \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":"ext/node/polyfills/internal/async_hooks.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd820596ec1beb31518ff0d8fb196aec107447dd9a92327ee00bbc0c412071e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): Uncomment the below \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":"ext/node/polyfills/internal/async_hooks.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"244e60f69b6655261bc9f67a3c0ea2b081ded6d57a850bb74f68811cf3bfd6cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(uki00a) Convert \u0060err\u0060 into nodejs\u0027s \u0060SystemError\u0060 class. \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6a710e12eb942e888ae47ae587e92b1d24aabd84694a5ee1fe427d34d3fc66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): maybe allow returning multiple messages in a single read? needs benchmarking. \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e98c8d64882122e0e74c7b7e04353e74d887026a0c8b8a56bed7e6825e5bcd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): if we want to support deno-node IPC interop, \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c05719164d7dced0c817a86daa15a63175716e74d3c0befac2c99d3977add60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): assign all error classes 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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":3307}}}],"partialFingerprints":{"codehealthFindingId/v1":"c821234119fce168e6c8ec679f5cead347755c6876ce182666cd4da53bdb92d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmorten): migrate punycode logic to \u0022icu\u0022 internal binding and/or \u0022url\u0022 \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":"ext/node/polyfills/internal/idna.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"60af33d0b5259de86b40c335aa10411f23adc6d0c206c08e9eb146185b6099a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Tango992): add Float16Array \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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7727e612e5ea3bb7c92f8c88ddc2c07bc109cfa6cfc006590560683d1bda3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(BridgeAR): Use internal method to only get index properties. The \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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb94a3ff3b57f171388d7179c359b86ded730eb11f3d4ad27f2cde71ec6b35f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): export actual primordials \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":"ext/node/polyfills/internal/test/binding.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d87bd6920daa998b06acdc3c224f14ac9ad8faf41c9966be816fb4d8c470f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): handle these cases \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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"9925657393f52aa71f9d8d3ad0915bf56adcdddccfcf253f2d14920c5585aa36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucacasonato): don\u0027t do this \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":"ext/node/polyfills/internal/crypto/hash.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe26aea5b7a0b4169f48e6e63a795daa4eac444fde7461b01d0f587a20157136"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): wire dgram._createSocketHandle once dgram supports it. \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":"ext/node/polyfills/internal/cluster/shared_handle.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"128661e83cde5c8e3ba74e3c07dfaf4461ec50075c6290f7f0798ee65cf260f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): better error message \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":"ext/node/ops/ipc.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ded28661b6e9d4ebb1011f1482391e1dd8f5181a2ec4015cbc71d18d3a55deb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): this should just be \u0060into()\u0060, but I forgot to impl it in rusty_v8. \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":"ext/node/ops/ipc.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bc5933637a2a4405d1154dcfdce957dc4fc659a1e20d34910c01d187c8e4ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this code is node compat mode specific and \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":"ext/node/ops/require.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29a0f5a1eb17408910372f63f41683ed0a652bed9906c4ec5df948cde4e3082"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): there\u0027s multiple borrows to NodeRequireLoaderRc 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":"ext/node/ops/require.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9126e29b53ed1679e2b4ef1cff58f66a506046287777920211a58e065c4ecd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: this should really not be a Box\u003Cuv_loop_t\u003E because of uniqueness guarantees. \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":"ext/node/ops/tty_wrap.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd9264441377da718ad168c4dd6a5f488b3fca7e7ba31f1a5aa52c9ee11d861"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): we should remove this and do all this work inside op_create_worker \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":"ext/node/ops/worker_threads.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacb0295598c96c797d1b922c7aa407e3352c571757dc75d9642869dec1ed340"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@littledivy): Use if let chain when it is stable. \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":"ext/node/ops/zlib/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9288893ba829d410828557c60e75903a644a586ddfc4e7592fa882126708e39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Option\u003C\u0026str\u003E not supported in ops yet \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":"ext/net/ops_unix.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dc29fe8696f10d21a1233ed0ff42d4daa528c448cc6ce619486b7b42f679ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Option\u003C\u0026str\u003E not supported in ops yet \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":"ext/net/ops_unix.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfd821df420c9ab28206faced80f10615478ba65a35583e63ce7da642abb58a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(https://github.com/denoland/deno/issues/22248): this re-implements the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/kv/remote.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee01670a7f15e7b54d8a3d435b3cea2c54bf204203960cb62cc371a1ef8413dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): more granular unsafe blocks \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":"ext/io/bi_pipe.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"382c9620325fd1225379670a2a961a24efd1f2f39e193c5d2c38d95b7499cb90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This should probably happen on the JS side on-demand \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":"ext/http/http_next.rs"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3defdb4e3ee315717083f8bcd373f2f136b89a244f2016f831e8a69d172c3931"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We should be using the same auto-close functionality rather than removing autoclose resources. \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":"ext/http/http_next.rs"},"region":{"startLine":3211}}}],"partialFingerprints":{"codehealthFindingId/v1":"437124e197b692247dd90d3909644d8f49b0014407d06da9026ce5f9d1a1f0b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): HTTP/2 websockets may yield an un-downgradable type \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":"ext/http/lib.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"070b373a8da95726644cb907ac41a93c8d862cc444cfe1c7d1ec1228d04b7aa7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): I don\u0027t like that we have to clone this, but it\u0027s one-time setup \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":"ext/http/request_properties.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c1ca6f033faa178aceba43556851a74535a8a503772f5345370967bd36bd46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): Most requests will use this path and we probably will want to optimize it in the future \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":"ext/http/request_properties.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"010e20e8ef19ec556a28caa53d0dae194f04a09a9add5e2c5f3711d12e0b3ac4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kt3k): We would like to pass \u0060error\u0060 as \u0060cause\u0060 when BadResource supports it. \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":"ext/http/00_serve.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"364944792a373c460c72cff3e0c413d348c268ff6fd3688a0cc16683d956b476"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(https://github.com/denoland/deno/issues/27107): do not clone here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"322816d4b16b843eace61819422f209d03ab429d09e2fc47dc67089c0dfea3ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(https://github.com/denoland/deno/issues/27107): do not clone here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/ops.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ff052d57c19b91ead6c24470966dfeff163e0506a56706c8159a93c52e6c2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement chown for Windows \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":"ext/fs/std_fs.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7fcf227c9bdbb089ff37fdf4c6bc6883bda653a30336b1cd34ab3034aedc73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement lchown for Windows \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":"ext/fs/std_fs.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7c427bb3a4b46c230a5116d4d357480fbdb4e2386a5b05c1c6a65ffe9dcb1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is racy. This should open fds, and then \u0060unlink\u0060 those. \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":"ext/fs/std_fs.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"be624ad1a785b0a36bcd9d320f3e1195c294297371fb88691291ecdf47ebe285"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@aapoalas): Start throwing errors into JS about invalid callback return values. \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":"ext/ffi/callback.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4d3a1d34cf967d3ec655ca44c03884d5df04466f7e76fd0a4d44ab418588e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): Create a RawPointer that can safely do pointer math. \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":"ext/ffi/repr.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c96d81a90043442de3c077e7755ef5bec23cfac8b001a27382860c7c81c708e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): it would be a lot easier if we just passed a v8::Global through here instead \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":"ext/fetch/lib.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40b83b2f2f743e1484315bfd27987fb8f690634d92d93870c02030822d1ca07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@satyarohith): remove the response body from disk if one exists \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":"ext/cache/sqlite.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3263b0bc51b0013205ce19f45a121e31723b2d629fc3d791eb37a185300209af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): in Rust 1.90 some structs started getting flagged as not used \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":"cli/cdp.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f967601a032a759e8929c9821d01cf6879b455da7944c8ede27534f673403d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): it would be more ideal if this enforced a \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":"cli/factory.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f02fd832dcf1543ce858d56c32ea1aec382435dc5e450afc398c7e469611f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove in Deno v2.5 and hard error then. \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":"cli/lib.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8387542592202f1cd99deed84d1be8470a18b2de259fab825449f98a81272f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(perf): since this is only done the first time the graph is \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":"cli/module_loader.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"05048da55183d7a7a0963df3e48b59c739e78761ef467981f8ba1cfb77bd19af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bartlomieju): this is a hacky way to provide compatibility with REPL \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":"cli/module_loader.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6aeb9ce911d6a2279c2064136b4d3770bf06b3e4ca7539e5d91f934552aa9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): why do we have a newline here? Document it. \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":"cli/module_loader.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbc40f824953dad3902d293fbaca761640d84e88f4952f67e6309cf825a3b2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this double Rc boxing is not ideal \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":"cli/module_loader.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"19391bdb1e8b57c8cc132077ea717e91f2c9611d834068057d7f21bec2129bad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this method is actually only to determine whether \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":"cli/module_loader.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee91d1a6ef4b426727d87bf3c0963c76e8846b4bf2abe5bd15104314c914d4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): use the preloaded module from the graph if available? \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":"cli/module_loader.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"af73a5f323aad8de170adddd45085c85af4191b319414aac84803f1fb7acb08c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle paths that contain \u0027,\u0027 \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":"cli/module_loader.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f2b53ffaee8aa5e1d4eb14e524d05016cd562d6216d470a56f6411b4c0eb58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(#27198): use RegistryInfoProvider instead"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/npm.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1191a0f15d2df204de1877013c8807b5e2cfe2a450d687fa190007d4381c2350"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this recreates the bin entries which could be redoing some work, but the ones \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":"cli/npm.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03ed777c0e9f121664f04db68de5c118e6ae2a64a0691000d60062c1d9b5b5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this might not be needed anymore \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":"cli/worker.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22e296ff6a0af195b78281752fa70ba6fdbf2e287fa137ce34d296acc301851"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): probably shouldn\u0027t include these files 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":"cli/worker.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce42e8e94c57250fda17f209b5ad9df16c9bd831b2d74a286426c219881939ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(caspervonb) generate an inline source map \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":"cli/util/extract.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05b07371e9f41adacb001f526b8a7a6464bfb85331445f1d79c38fe829b4427"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): should we fail on sending changed paths? \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":"cli/util/file_watcher.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"433a87838362dbff1fb28aa8b401797602a0c92ae44ee9540e9eaf963a23c988"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): should be possible without cloning \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":"cli/util/text_encoding.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9420b4c68b970696dfe18483d1607d374b7984187cd372eb1f0bd976f2a4ebbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@marvinhagemeister): We\u0027re trying to reconstruct the original \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":"cli/util/progress_bar/renderer.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"774bf68114c6b019057fe8bdfc090127ef934f76e8b49ff49a02440746dd76d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): use a short lived cache to prevent parsing \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":"cli/tsc/diagnostics.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1486328a66fa2b57cd706c2585c68ac85687011af2367951a36d9cbf4dab12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this mechanism is questionable. \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":"cli/tsc/js.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34869f1f1e3ec1335ed58aab8f97953223e0dfae4190002f93796751dff6c42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): we have similar struct in \u0060tsc.rs\u0060 - maybe at least change \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":"cli/tsc/js.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7cc5b7a93b2e400fe4efae095410bbcc690d7c5ad0a7b9378afec675161256"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): it looks like the remapped_specifiers and \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":"cli/tsc/js.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8f6341abfde1e25b3be96e317e818abff0b75775fc8d6928aaa05e322f42e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): remove once we don\u0027t need packuments for creating the snapshot from lockfile \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":"cli/tools/clean.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0d53f323dc471d2b72cde94dac6d6f273b357b1bd86bf900c0e19176cc2dae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): use strategy pattern instead of branching on dry_run \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":"cli/tools/clean.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e15839cf5884ac0274b29460126d68eca7747629382757f45df876f3dcb9fde"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): this probably shouldn\u0027t reach directly into this code \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":"cli/tools/clean.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab1dff713ebaa93639022cd43bc3cd9f18d62e11f609d1a7983da2a4dede67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add command to enable \u0060deno desktop --hmr\u0060 for Next.js \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":"cli/tools/framework.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd1015ac627d54d21746c5bf9e0187aeef8f3db56d0aff802bc346da1799cac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add command to enable \u0060deno desktop --hmr\u0060 for Astro \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":"cli/tools/framework.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0434d1c1cfb4521c637bbd5ce9ddb3f7ffd76589ee9752a9ee0947f32123c0c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add command to enable \u0060deno desktop --hmr\u0060 for Remix \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":"cli/tools/framework.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7d98ddaefa792df2693e44c07fee2b59a19350a1e799c5d3bd9148b7677a41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this whole huge if statement should be a separate function, preferably with unit tests \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":"cli/tools/task.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"af28c35c7ac492f6f800a8f6ab1bcc0ccd5ea604e895939187dcc75aebd3a588"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): prefer flags first? This whole logic could be cleaned 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":"cli/tools/upgrade.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaacd0e7326041246b07da87e158b8149ecf0ba9970b6961110a2791efc7f7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): print error if any other flags passed? \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":"cli/tools/upgrade.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3122436d48c7200287c53d3d996cd7cf408320166182d7a96e0c5d534b62e2fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): update to handle \u0060Lts\u0060 and \u0060Rc\u0060 channels \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":"cli/tools/upgrade.rs"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"a757df7588207db239b0a265d9c655ac1cdcf5941f39fedb39717ea59cbec9ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): this should be some sort of callback that we can implement for any subsystem \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":"cli/tools/test/mod.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b388e7b7814b87a1d0d4d07608904eb6497beb4547901196e70760de59954b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we should provide an API to poll the event loop until \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":"cli/tools/test/mod.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"add8d324c9090bdf1b343a36917306e07ceb33e5f92c1c7bc58bd9802e557c80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We shouldn\u0027t need to clone here -- we can reuse the descriptions everywhere \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":"cli/tools/test/mod.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"baac1699380afdb07f0baf308af563a61018f66497ad647a58376c4e7d204fce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): there\u0027s no need to collect twice as it\u0027s slow \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":"cli/tools/test/mod.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc9cd9d8306c77aad0bce8de0b45a68cff23111bc5918409391795f273930ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We could be much smarter about this if we had the concept of \u0022progress\u0022 in \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":"cli/tools/test/sanitizers.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8899e454f480888142b35042200f4bae45c3bb69b55abae7872df8d600ec4065"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This reporter does not handle stdout/stderr yet, and when we do, we may need to redirect \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":"cli/tools/test/reporters/junit.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a6ed51af0964349553266f9606d80fd2137a46137c31d69e1169368c6269a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(SyrupThinker) This only outputs one level of subtests, it could support multiple. \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":"cli/tools/test/reporters/tap.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b394b509a28fe7e4e4d004cd7160a5cad9a4796b32b237009121a571dae242dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): actually I think it will also fail if there\u0027s an import \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":"cli/tools/run/mod.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b762184a189cf75d0b7e23590daeb42f466c3662dc0b2838d47e7acf994446"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): actually I think it will also fail if there\u0027s an import \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":"cli/tools/run/mod.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0031011a4c8f4f89ef957edadab38fae6aeaae2028d3af3e80a1e86df055c9cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this function is not handling \u0060exit_code\u0060 set by the runtime \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":"cli/tools/run/mod.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f247e062e3484a2560ad86069040f5d808a42717370598240477eda278a74fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: duplicated in \u0060cli/tools/run/hmr.rs\u0060 \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":"cli/tools/repl/session.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e56c683984d8db9733e18bf9440f5f336d22a8dc09801afeb5c2d8422c8e75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(caspervonb) we should investigate using previews here but to keep things \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":"cli/tools/repl/session.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"f652e68be13df5c4be7e21e8a14a187307ea5ff8dca18ea73c6f60a77b5f392c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove these and use regexes from \u0060deno_graph\u0060 \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":"cli/tools/repl/session.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5922d80a51faf603e9fb161410339fcdd8192313f50c67b5e4bd462450e8548"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): move to lint rule \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":"cli/tools/publish/mod.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cbc1dd0ba020b326fc9c3311dc4aae9cf6fa70ab416d8154b6053ff5ac0ecd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): output something that looks better than this even not in debug \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":"cli/tools/publish/mod.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f558c48c2d14462864c3ebb8cb91346d755a1ea4ad21441222793521b8a6c5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dsherret): use sys_traits in the implementation so that this can \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":"cli/tools/publish/provenance.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"0534c3ff309a57acfeb91dd070d35c2dcabffaab46a653437803202bc8674496"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(#24612): consider warning or error when this is also a jsr package?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/unfurl.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"0611b086ce4e7e07c3f0018b03b8173e6b363c96aed2a513acb75a26b8a30ad2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(#24612): consider warning or error when this is an npm workspace"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/unfurl.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"571845c3c75d48a7120b89d72f2cee94f9d44e2d428ef194d29925fcb5ca73ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(#24612): warn when this is also a jsr package telling"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/unfurl.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b20327c6e354b125ac6098e4d49ab13bd81acfd65beb8a27beb73657e6db43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(#24612): warn when this is also a jsr package telling"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/publish/unfurl.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53ee7fe5a7a9d83011fc9d7db7076f2c752201c14613d6f873f9b0b25467959"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucacasonato): this requires integration in deno_graph first \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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fcefce4408ceaae1046f4dc287042b7e8d0c9a6132785714f79307a1a07dd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unfurl these to jsr \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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0118b32fdd6dbc658d0f1f832de909eebff45b91293a2a5d4e54a6c5ffa4143"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unfurl these to jsr \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":"cli/tools/publish/unfurl.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cacc1803c1bd4ead97f7ed9c2ea20177b77efa48bdabda6168205ed431111d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): don\u0027t pass the factory into this function. Instead use ctor deps \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":"cli/tools/pm/cache_deps.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"52102a0529cf718e123db07c901b68ebc94ca006fe2fc686c177a48fedf4d018"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): probably shouldn\u0027t be pub \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":"cli/tools/pm/deps.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c509c32e6665e080d6a68243ab0c79787d688fc61600472b8fcbc73bad310e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move most of this to ConfigUpdater \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":"cli/tools/pm/deps.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee3399f2ebaf1807d6b7499bad300e76f90d84189cdf7265f939277ca820f4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): ensure this unwrap is safe \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":"cli/tools/pm/deps.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"da195f8d681385942bce7804973e0dea40973eaa79c4e302fd72e38dfa23341e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(nathanwhit): handle tag \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":"cli/tools/pm/outdated/mod.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"567dedb52a33697ff7929c242bfb774d95e0415f05a39b91974ad85f3b088a94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove once we wire plugins through the CLI linter \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":"cli/tools/lint/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d5332f2d5129e414c9740a58c846d7acf761ce191afdcecea3c75763ffbabd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): for now we don\u0027t support incremental caching if plugins are being used. \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":"cli/tools/lint/mod.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f105b7c1ab652e9526c8d386ecf70432e546ccdbd4223c73c2d3a2bf660e17ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): print if rule enabled \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":"cli/tools/lint/mod.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff4d9f357fd76ab6efa6d5d02e72b7e2af752daaf147a1f65de8656f656e3e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is O(n) search, fix before landing \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":"cli/tools/lint/mod.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb8cee5e815f2070d15d955b3ad373a25b5dcb344ca6059877d7932d408649e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): do the same for tags, once https://github.com/denoland/deno/pull/27162 lands"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/lint/mod.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"a603f9d5ac9c0c4bd4eb4a51deb5c9e62b0e3042f638367f5808fd89f933187f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: write to structs \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":"cli/tools/lint/plugins.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"68568dce4ba32ac46feb04aeebbdcdca1330283d8ce8a4ee25eae19f89f3cc29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): add \u0022lint\u0022 execution mode \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":"cli/tools/lint/plugins.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4543ce7a70cf05db0f44674094f9a17500815ebdfef3d9e404cae097973ed344"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this a u8 \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":"cli/tools/lint/ast_buffer/buffer.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"39355c3a51108e7a9163133bd590cee7a4d3c11f13d373a90d2d25fdafa771b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could support multiple languages 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":"cli/tools/lint/ast_buffer/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c2c436427750df49891300d2d47e7884a106251d181f62803026782e0b3b4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@marvinhagemeister) not sure where this is coming from \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":"cli/tools/lint/ast_buffer/ts_estree.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1eec2f40e289c00bdf39182a7944e62160ab9048fd0e960703a1ce4107bad7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): add remaining fields as per \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":"cli/tools/jupyter/install.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf738d3bf2853188ae11f15f62cb52ab27740cfd48690e03645d3a0ea57b652a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: enable on Windows after fixing batch escaping \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":"cli/tools/installer/global.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c315f10d840fd1485cf2cca9fa9a32a00ecf45cf2ca915e49b85ce814f742823"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: see comment above this test \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":"cli/tools/installer/global.rs"},"region":{"startLine":2228}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad225e19d86f6c0b7acc42ce5a56ec39b6f3c5fc7701046d85d4a3b8354b040"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit) \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":"cli/tools/installer/local.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b9aff55c981b217cf698d03f8cfa70ea220e4b4a45e3eda9c0533785e514ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit) \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":"cli/tools/installer/local.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80f16f2062e920a12a94739b84a5b49a8eb0ec64105e728b3d8c92f2e2ee50f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju) \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":"cli/tools/installer/local.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"761f84dc7dab442b9be7a0945f541bfbf553fbbdaf3f01066756981707fe4bb7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju) \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":"cli/tools/installer/local.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8b87a64b954404ffc2d904b6359c484d8f1be6ebf78ff7e75836cc73aac01f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): not really correct \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":"cli/tools/bundle/html.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4594d2cc4243fa024b393e77204ee6402a99d718f7b0145b474e12f1332060"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): MASSIVE HACK \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":"cli/tools/bundle/mod.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b9b16cbae2681cb92d8e98eceb68ae88b6c4f4f9a3a5682fcdb736619ae45c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): remap the resolved path to be relative \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":"cli/tools/bundle/mod.rs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ddff2b119b256abdf8aa67f6569e007bd3fa92fa96c308b58be461f9a9f44c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): heavy duplication of code with \u0060cli/tools/test.rs\u0060 \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":"cli/tools/bench/mod.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d8219fceea7f0e2d055852c2ee08b0e6ec4a2f2ae6d62a6ecc0a7427ff325"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): transpile and analyze CJS in parallel \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":"cli/standalone/binary.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14d488cdaf17f740b24febc16a7a48df497411b7125a61ea05e0fe0be3d6bd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): analyze cjs in parallel \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":"cli/standalone/binary.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"2154b904d284e8bf4eb31912270af51d454e71f70216520dce61740a3a797656"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(https://github.com/denoland/deno_core/pull/943): store whether"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/binary.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49a1be658ffae599488358ca97969bd62c26a8b68db9b5b29a259ee2cfe20eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): how to avoid the clone 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":"cli/rt/code_cache.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc4b79c66d608bba691505b6693e12a4f37f93896b7d84712e40b9dce1a1c68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): should this always set it to the end of the file? \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":"cli/rt/file_system.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2c1727580ee37e32569104387d268a155d4c1f928444e4da83a7e05e9fab35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this should only be done, \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":"cli/ops/lint.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3556103dc39066d3f1abf0ab833f04e4917cc1aba70588cda2853f974b193595"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): allow plugins to actually specify custom url for docs \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":"cli/ops/lint.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"182056eb2f4e84aa1d72c5f805c0025551c9b150f8f82d5ad47bbf8ae1aa4805"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Do cancellation checks while collecting tests. \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":"cli/lsp/code_lens.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c08df021251da16a78962c9807857f3658ce383662973ed70f228ccf294b4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@kitsonk) clean up protocol when doing v2 of suggestions \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":"cli/lsp/completions.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"85086eb9d2d6f4c449a0fe8aaf4c8791c13eaa021a50ba5044dbe75acc4f1069"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): switch to RefCell once the lsp no longer requires Sync \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":"cli/lsp/config.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fc71dc878d5b5f1603a99a0563f27e5880bd5aa991cd98374847e9582f0de1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): instead of queuing up messages, it would be better to \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":"cli/lsp/diagnostics.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"580d5e36f5c6fa87aca17c07c0380a7319dbc413d874e0447f9387b99cfa3031"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): This is a crude way of detecting \u0060@ts-types\u0060 which has \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":"cli/lsp/diagnostics.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be1d6ba755f71cfdeac94789ebe6516a004fb22b3052f5b54ddbd5bcc2c4c14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Support linting notebooks cells. Will require \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":"cli/lsp/diagnostics.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a67e61abf9e98f60e2d39dfaa4d0d98a003ef61c2d0425990a4c4f9f67f5c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Support notebook scopes 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":"cli/lsp/documents.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab98af3e00e81db0bdf3d441899a7342290323cc5c8701f9ed53f951ded69e4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Support notebook scopes 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":"cli/lsp/ts_server.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f699d3b64822e029d1ccbe235f306eb76dea3d5aa2ca4222024283e7bb2b4743"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this is wrong because it doesn\u0027t consider CJS referrers \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":"cli/lsp/documents.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"d451031d9801fc6d2526f9961fb27f81e96dd954cb147ee36c6f3880db819f9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this is wrong because it doesn\u0027t consider CJS referrers \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":"cli/lsp/documents.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b787dab3eccef1fdaa808ab39c23371eb035d256f2860c9376717c98c01fe7c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this is wrong because it doesn\u0027t consider CJS referrers \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":"cli/lsp/resolver.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3740a52027eef731eb725d79f828fb146122888a8ec2654f61540686eb405f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this is wrong because it doesn\u0027t consider CJS referrers \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":"cli/lsp/resolver.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"232683bd54348e0bcd36c93d10f1e60c7a8a566b09dba669ca922510c34a8595"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this is wrong because it doesn\u0027t consider CJS referrers \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":"cli/lsp/resolver.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46d5df556fb6261e8c755f18c4343a87a80769507c2bee16ea8bcbadda5ac5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(nayeemrmn): This wouldn\u0027t be necessary if LSP allowed \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":"cli/lsp/language_server.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cc000714d486bbe570ae21a8c036f07494a5ef905fa94f14df0df43ce7fb9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): the npm_search_api should probably be specific \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":"cli/lsp/language_server.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"44496682c2a0b636b11a98762aefde8fe3ea93cc4e47520bd729e85e015e8a93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): This represents a circular dependency between \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":"cli/lsp/language_server.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8da56d34307cc42933d9c98fba55620d6f8a323f3b0d222640b9b157a71229b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): allow updating after startup, needs work to set thread local collector on tsc thread \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":"cli/lsp/language_server.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8aff1111629cda2463610f215fac0d5adeb2599a7b6a45e44da2152ff395ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): This is being replaced by \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":"cli/lsp/lsp_custom.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f766a31f094791e6596f461f1da311ebe24ff5b01b177e455e557680308732a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this is pretty terrible... we should improve this. It should \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":"cli/lsp/resolver.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc1f289b3019e7f55a311cc8dfa107bba26f00d92bf3f2498feec41637a1a62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): probably this method could be removed in the future \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":"cli/lsp/resolver.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"56121cc9c63e2b1111a35ebdaed63d1aa7a565638a84f87c6ced2265c3b995c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): this should be false for nodeModulesDir: true \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":"cli/lsp/resolver.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba55aab1503206663f3437190e2fd4e330d97ccca261f044f414c667a4334f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nathanwhit): use default guard here so we can change tracing after init \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":"cli/lsp/trace.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b15f3d820b1796bbe3da0f3c29a7c8763e6e35f410e0f2bd41ae016b842e4ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Keeps tabs on whether this is still necessary. \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":"cli/lsp/ts_server.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e1292112de1dc7069573ad84d4ebf44b34e233d2c246a492a8df62015dfed8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): why is the join_handle ignored here? Should we store it \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":"cli/lsp/tsc.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e7dac5048476d642ae2b546d16c4867418b61147302243bec08250336bedb4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Factor in out-of-band media type 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":"cli/lsp/tsc.rs"},"region":{"startLine":4895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d727418cf60361c8c936dbe912ff4d96a160d347c9e36a75676de3901df68954"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): we have similar struct in \u0060cli/tsc/mod.rs\u0060 - maybe at least change \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":"cli/lsp/tsc.rs"},"region":{"startLine":4975}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d2df8d0e23b3cd92a9a063c10a96d8c0b60765d404b5428fa2906370e5043a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Investigate why we use \u0060Index\u0060 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":"cli/lsp/tsc.rs"},"region":{"startLine":6215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03592c703f6d9573488e2a29dd9c4ac2a429c186e708e16738a866cf4bc49f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Remove whe \u0060Uri::normalize()\u0060 is fixed: \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":"cli/lsp/urls.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd44d300d13518b4690d0cad4a8380d6e41055197a9c7dffb1752ed192ed6341"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nayeemrmn): Change the version of this in deno_path_util to force \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":"cli/lsp/urls.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf00cc71e0901600c720b074391bff0e65542cdd6e75a60a2aff36f3d234cac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): Temporarily limit concurrency in windows testing to avoid named pipe issue: \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":"cli/lsp/testing/execution.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"878a43db5e701710d610983dd6e0fdf61a19200f0867dc0fb89b4ebbbe1ac205"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): we shouldn\u0027t need to clone here - we can re-use the descriptions \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":"cli/lsp/testing/execution.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c12c855216058b8186d8635d68e2b9e437e8cf92da81596fbee03caadce3fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@kitsonk) test output should include a location \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":"cli/lsp/testing/execution.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea96d46585a78208256ac63cd2530baf0cef47d805518c4a648bf4dff6452c14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove this clone \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":"cli/lib/args.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b9f46f43786f24598c26084dd387e272ad2a1df186f0e453b7ef6372cea356"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): remove in Deno 2.5 \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":"cli/lib/args.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d99d83e8a307e7e378057ec2b7fe067c36558aa17c1faa6394a3c0b537c7ad7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): remove this after Deno 242.0 is published and then \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":"cli/lib/build.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dcd4cb539fa9e4f8428491e872493ed44935ce8a3dab814976febcfd589988"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): ideally we could remove this const. \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":"cli/lib/version.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa3e737d0fe03040cb9404901803e7e3fd619637dca8fb5a1420699847f6f14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is temporary, to allow Homebrew to cut RC releases as well \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":"cli/lib/version.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d1799b61cf25843e64186e4d2aaf77d61a1c21774b97d022c75acdd97a42c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@satyarohith): storage quota management \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":"cli/lib/worker.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"4090bcbb37507f2acc2aa262f10e0e580e3a8479772d0bef34fb1c05d52670ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@satyarohith): storage quota management \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":"cli/lib/worker.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8f35612af509400e29c9e4ff4f539a7ad01995bf4e349aeb965bfa06f899f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is cruft, update FeatureChecker to spit out \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":"cli/lib/worker.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ca609dd245211b987168444a671e4db3b052cd46da95955e40b06114142677"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bartlomieju): this is cruft, update FeatureChecker to spit out \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":"cli/lib/worker.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f026b13ee21d686f6a1e6a7d0606872c27937f8c2bc2048c1a95d5f0517a55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): we should store this more efficiently in the binary \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":"cli/lib/standalone/virtual_fs.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0658351d4e28dc863dddb3bfa6d0f65da887f237131770f1444b658048fbeb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: probably don\u0027t error in this scenario \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":"cli/lib/standalone/virtual_fs.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b60f5ea3d0c62512c5ed17bed7893a432594da0453289e57bcd8bb149526ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): We can probably simplify our thread-safe implementation 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":"cli/cache/cache_db.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"974773ceef7170a33148149db47ee2bc35e3728a8486194fa76ac1d6b980805d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This behavior was inherited from before the refactoring but it probably makes sense to move it into the cache \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":"cli/cache/code_cache.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a604b514d0cbb477bcdf3c9c2589e289fc8d62ddab743cdb1f38ef960b96732"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This behavior was inherited from before the refactoring but it probably makes sense to move it into the cache \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":"cli/cache/fast_check.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af7cc729df6d9d4a1f2e622a0dd63c2ec296628d71e09acbccab0b321ac3f73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mmastrac): This behavior was inherited from before the refactoring but it probably makes sense to move it into the cache \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":"cli/cache/node.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3437596d704066c2d1d47adc9f57e404bb96a7efedf42480697dbdc92791faba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(dsherret): Why is this canonicalized? Document why. \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":"cli/args/flags.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"e892a887952bae529b98512a22928bb01cb62b301e55aaaccafc3b5fe7cb107f"}},{"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. ADRs are expected here because \u0060libs/node_shim/Cargo.toml\u0060 makes this repository a deployable product (line 13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/Cargo.toml"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"332fc219c51d740c892e5315774501e81f5d8b4cb5bc546b9cf35ee4b8205c93"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060openCONNECTTunnel\u0060 spells \u0060CONNECT\u0060 where 22 names in the project spell it \u0060Connect\u0060: 22 of 23 names in project repository spell the token \u0060Connect\u0060 (22 of 23; unit: names in project repository containing \u0060Connect\u0060). Peers: dgram.doConnect (ext/node/polyfills/dgram.ts:1570); http2.requestOnConnect (ext/node/polyfills/http2.ts:1217); http2.promisifyConnect (ext/node/polyfills/http2.ts:5417); ext.node.polyfills.internal_binding.pipe_wrap.PipeConnectWrap (ext/node/polyfills/internal_binding/pipe_wrap.ts:68); ext.node.polyfills.internal_binding.tcp_wrap.TCPConnectWrap (ext/node/polyfills/internal_binding/tcp_wrap.ts:52). Rename to \u0060openConnectTunnel\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/https.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8252a363265d516f7aa1d100e5dfea429ec75398299941e268aee858bb8bd2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if obj is a Uint8Array\u0022 repeats the code it sits on: 4 of its 4 words (check, obj, uint, array) are already in \u0060if (!(obj instanceof Uint8Array))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_jupyter.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6246fe471f20410187ddabe5ca7002a53baea0253bc1ea7540586776d95d87"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if obj is a Uint8Array\u0022 repeats the code it sits on: 4 of its 4 words (check, obj, uint, array) are already in \u0060if (!(obj instanceof Uint8Array))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_jupyter.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6737635c967c61c10ea4fd67165bb51376d1f15dced26dd62106d72e999bda09"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check for \u0022pem\u0022 format\u0022 repeats the code it sits on: 3 of its 3 words (check, pem, format) are already in \u0060if (keyFormat !== undefined \u0026\u0026 keyFormat !== \u0022pem\u0022)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/02_tls.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"433a24c24fde58d4f51402067eeb88c7e4a197441b28bfe43391ed5d37a661e6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Extract the rest of the command after the Deno path\u0022 repeats the code it sits on: 4 of its 5 words (rest, command, deno, path) are already in \u0060const rest = StringPrototypeTrimStart(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"344203f9fb8463745f3107b8939f3444791b250fd1524cc3ee09c3fda90d68ea"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Private key set externally, compute public key from it\u0022 repeats the code it sits on: 5 of its 6 words (private, key, set, compute, public) are already in \u0060const publicKey = op_node_dh_compute_secret(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36d22f8061ecc9d0eeece081dfd1093f0508df9d3763522ffe927d3e0353742"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get the primary\u0027s server handle, and listen on it.\u0022 repeats the code it sits on: 5 of its 5 words (get, primary, server, handle, listen) are already in \u0060cluster._getServer(server, serverQuery, listenOnPrimaryHandle);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/net.ts"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b1e87d285278369b1dacfd709749c20c540077611c46f33b827554bf7e9d9d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Normalize the tail path\u0022 repeats the code it sits on: 3 of its 3 words (normalize, tail, path) are already in \u0060resolvedTail = normalizeString(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"af80965b251ebceca77010cab2a5fc5270e9cc0cd67dea934fee8a320d4d7fd2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060t.afterEach()\u0060 hooks likewise run in the parent\u0027s context.\u0022 repeats the code it sits on: 4 of its 5 words (hooks, run, parent, context) are already in \u0060await runInTestContext(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/testing.ts"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b8e5475b74218985ae13fea448ecb6272066b0f3a0bcb8d1bad2fd62e7defe"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060ext:deno_http/02_websocket.ts\u0060.\u0022 repeats the code it sits on: 6 of its 6 words (ext, deno, http, 02, websocket, ts) are already in \u0060defineLazyInternal(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/90_deno_ns.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2236225b7c385a16b46cf75a1a8ce4f0c61164e7d74557b32567166841fc102e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060ext:deno_fetch/23_request.js\u0060.\u0022 repeats the code it sits on: 6 of its 6 words (ext, deno, fetch, 23, request, js) are already in \u0060defineLazyInternal(\u0022getCachedAbortSignal\u0022, \u0022ext:deno_fetch/23_request.js\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/90_deno_ns.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"028089a0af4cc060040f1b68c841f6a5418ad9a5bba80044762496a591e25294"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022append methods to a list of methods\u0022 repeats the code it sits on: 3 of its 3 words (append, methods, list) are already in \u0060function appendMethods(list, addition)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/bench/testdata/express-router.js"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"320f9d31d99fc3f7e7b952965f23d3e2b578e0d48cfeade73122097ad7a1bad2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022merge params with parent params\u0022 repeats the code it sits on: 3 of its 3 words (merge, params, parent) are already in \u0060function mergeParams(params, parent)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/bench/testdata/express-router.js"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c69ada4e393495a1e84387198e7c8b599b37cf01648ffa88d728ee7d7a7b13"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022send an OPTIONS response\u0022 repeats the code it sits on: 3 of its 3 words (send, options, response) are already in \u0060function sendOptionsResponse(res, options, next)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/bench/testdata/express-router.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73e4f196129bb8e225f59c240c597261616527023fe86e72e7db9cb3eb5342f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022This function calls the callback and logs \u0027STORED_FUNCTION called\u0027\u0022 repeats the code it sits on: 5 of its 6 words (function, calls, logs, stored, called) are already in \u0060dylib.symbols.call_stored_function_thread_safe_and_log();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ffi/testdata/event_loop_integration.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4787ad1eadda27eca808da58a4302249799f7fe54e345e6c4c3edab4fbbb27"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022sort the reports by date\u0022 repeats the code it sits on: 3 of its 3 words (sort, reports, date) are already in \u0060const reports = Object.entries(monthSummary.reports).sort(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/node_compat/add_day_summary_to_month_summary.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdeb64b197963c2acdff1c21e474c3a904f9c6c38dc78e928f247b3db0b2a89"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Fetch historical reports for flaky detection\u0022 repeats the code it sits on: 5 of its 5 words (fetch, historical, reports, flaky, detection) are already in \u0060console.log(\u0022Fetching historical reports for flaky detection...\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/node_compat/slack.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff65f2416123672f60fd5148da1ba6620fc652a93d724fd43b482f88da4a6562"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 2: Fork with --conditions=custom\u0022 repeats the code it sits on: 4 of its 4 words (test, fork, conditions, custom) are already in \u0060console.log(\u0022\\nTest 2: Fork with --conditions=custom\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/child_process_fork_conditions/main.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ac79dab920576adeedbe730c896a65333f13effa76edbc4e2797ee839dd1a4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 2: Fork with multiple Deno-style conditions\u0022 repeats the code it sits on: 6 of its 6 words (test, fork, multiple, deno, style, conditions) are already in \u0060console.log(\u0022\\nTest 2: Fork with multiple Deno-style conditions\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/child_process_fork_deno_args/main.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dd23324f1fcfbdf2305370dfa5112c19bea3aca3b42921e5554e05861eb10e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 7: Args with spaces are preserved\u0022 repeats the code it sits on: 4 of its 4 words (test, args, spaces, preserved) are already in \u0060console.log(\u0022Test 7: Args with spaces preserved\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/child_process_shell_escape/main.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"02db67ab23e354460d3221185e9fdd51b0ce023b9eb00b4a3291182566447d4e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 13: Backslash-quote breakout with pipe injection\u0022 repeats the code it sits on: 7 of its 7 words (test, 13, backslash, quote, breakout, pipe, injection) are already in \u0060console.log(\u0022Test 13: Backslash-quote breakout \u002B pipe injection in args\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/child_process_shell_escape/main.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bec032ffab70981879f4c88c7fe1c2f2e76c5471088b3865975c97d3c2be5f1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A test with only a name provided.\u0022 repeats the code it sits on: 4 of its 4 words (test, only, name, provided) are already in \u0060test(\u0022test with only a name provided\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/node_test_module/test.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89f1dc4588eca1c9a5fb67e3b114ab9349200d9f8f85e0e14b73b130db2385b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A test with only a name and options provided.\u0022 repeats the code it sits on: 4 of its 5 words (test, name, options, provided) are already in \u0060test(\u0022test with a name and options provided\u0022, { skip: true });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/node_test_module/test.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"935960911de12f1d70bb98c5c506e0d6224b0bb8f6a97b4ab91815f510333de1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A test whose skip message needs to be escaped.\u0022 repeats the code it sits on: 4 of its 5 words (test, skip, message, escaped) are already in \u0060test(\u0022escaped skip message\u0022, { skip: \u0022#skip\u0022 });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/node_test_module/test.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"53057e4f00a371c20e545fbd1cc2d0c859f7f11d3809184816496b63829b5b51"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A test whose todo message needs to be escaped.\u0022 repeats the code it sits on: 4 of its 5 words (test, todo, message, escaped) are already in \u0060test(\u0022escaped todo message\u0022, { todo: \u0022#todo\u0022 });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/node_test_module/test.js"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"facfede6daf07eeb60bbefdbfd6af5619c453561ed31a105840899a43d640ee5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 1: Basic numbered parameters (?1, ?2)\u0022 repeats the code it sits on: 4 of its 4 words (test, basic, numbered, parameters) are already in \u0060console.log(\u0022Test 1: Basic numbered parameters (?1, ?2)\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/sqlite_numbered_params/main.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"70aeb1eb36262cb395f4f07554ecb0783a801b23f16972c62e5ae9fdb74ad998"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 2: Parameter reuse (?1 appearing multiple times)\u0022 repeats the code it sits on: 6 of its 6 words (test, parameter, reuse, appearing, multiple, times) are already in \u0060console.log(\u0022\\nTest 2: Parameter reuse (?1 appearing multiple times)\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/sqlite_numbered_params/main.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"91350c9dd54ee4b0549e6428a6c198436addc02010b03884cf5ef35b63bb391b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 3: Parameters in different order (?2, ?1)\u0022 repeats the code it sits on: 4 of its 4 words (test, parameters, different, order) are already in \u0060console.log(\u0022\\nTest 3: Parameters in different order (?2, ?1)\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/sqlite_numbered_params/main.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd86fdf9dc3dfda1f731664151762cc8e10df419e5fad46894bf2825a9d107fb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create one pipe instance and wait for a client.\u0022 repeats the code it sits on: 4 of its 5 words (create, pipe, instance, wait) are already in \u0060const hPipe = k32.symbols.CreateNamedPipeW(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/run/permission_broker/broker.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4110d09ea5ab88f478b5ef4827d71a7f5c948f9e955a9ce52e9705dd465ce1ef"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022FormData: non-ASCII names and filenames\u0022 repeats the code it sits on: 5 of its 6 words (form, data, non, ascii, names) are already in \u0060Deno.test(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/body_test.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"df36b6e0b397a898e239c49f91ddb97b79b6de274e097a9ec0fec7a7553ef375"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 7 comments in this file only repeat the code they sit on (lines 1559, 1584, 1610, 1718, 2076, 2103, 2226), for example \u0022console.group test\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/console_test.ts"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c5408919bd65f3a72631c76c127f57cca22bb4704178e9a8b786fa2175020c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022AtomicOperation custom inspect tests\u0022 repeats the code it sits on: 5 of its 5 words (atomic, operation, custom, inspect, tests) are already in \u0060dbTest(\u0022AtomicOperation custom inspect - empty operation\u0022, (db) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/kv_test.ts"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"35639ed777b04e5ce2464583ca27bcd36e0e5eefaf0ccc0f71140e4c239bf9bc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Close the stream without reading anything\u0022 repeats the code it sits on: 4 of its 5 words (close, stream, without, reading) are already in \u0060Deno.test(async function readableStreamCloseWithoutRead()\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/streams_test.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"834ae42e18efea2e094962de9109b5ff0799e6efcf216782d2bf35a16a79c8c2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Close the stream without reading anything\u0022 repeats the code it sits on: 4 of its 5 words (close, stream, without, reading) are already in \u0060Deno.test(async function readableStreamCloseWithoutRead2()\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/streams_test.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a0c08b6f2b092aab7420585dd96920652f98cb525da94454ec4561e986e4f8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022EC key pair\u0022 repeats the code it sits on: 3 of its 3 words (ec, key, pair) are already in \u0060const ecKeyPair = await crypto.subtle.generateKey(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/structured_clone_test.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d70c56106b3443438798d32534e64ccb015e4f72e3f12361788905b2295054b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022For existing symmetric algorithms \u0022raw\u0022 is an alias of \u0022raw-secret\u0022.\u0022 repeats the code it sits on: 6 of its 6 words (existing, symmetric, algorithms, raw, alias, secret) are already in \u0060Deno.test(async function rawSecretAliasForExistingSymmetricAlgorithms()\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit/webcrypto_test.ts"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04856320b72b3c4496789285d5a1184b60a6eaae73e594bc246fd64ca4592df"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022-- Positioned read tests --\u0022 repeats the code it sits on: 3 of its 3 words (positioned, read, tests) are already in \u0060Deno.test(\u0022[node/fs] readSync with position reads at offset without moving cursor\u0022, () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit_node/_fs/_fs_raw_fd_test.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaaf9ca23c93f5d1d94a45e6f4320bdbedcf3674c401b4c7d8f051c90e7f7383"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022-- Positioned write tests --\u0022 repeats the code it sits on: 3 of its 3 words (positioned, write, tests) are already in \u0060Deno.test(\u0022[node/fs] writeSync with position writes at offset without moving cursor\u0022, () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit_node/_fs/_fs_raw_fd_test.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9270befb8aae2301a752b10cf61de1483a163ff812423e5fcc0903f687700597"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022-- Async open/read/close lifecycle --\u0022 repeats the code it sits on: 5 of its 5 words (async, open, read, close, lifecycle) are already in \u0060Deno.test(\u0022[node/fs] async open \u002B read \u002B close lifecycle\u0022, async () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit_node/_fs/_fs_raw_fd_test.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3741013be38bbaf5946b7e170b4f8567a425a12d1f5b91c8bbe511b0fff6e2bc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Verify Node.js-compatible result\u0022 repeats the code it sits on: 4 of its 5 words (node, js, compatible, result) are already in \u0060assertEquals(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit_node/crypto/crypto_hkdf_test.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c853ecec8451bce5f9d2ea86623ee738739570b2baf4b9e09f0748859f987e35"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Companion to the above test: verify sign(null, ...) also infers digest from RSA-PSS key params\u0022 repeats the code it sits on: 9 of its 11 words (test, sign, null, infers, digest, rsa, pss, key, params) are already in \u0060Deno.test(\u0022crypto.sign - RSA-PSS key with null algorithm infers digest from key params\u0022, () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit_node/crypto/crypto_sign_test.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d3df05c47b813679288633c347f1a28ed662713570a62421295854165b56f9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set noDeprecation to true\u0022 repeats the code it sits on: 4 of its 4 words (set, no, deprecation, true) are already in \u0060(process as any).noDeprecation = true;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit_node/process_test.ts"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7740f4637f9937b87e62769f6edecddfa7185c6b943d6df6799dc41f11d0612"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Connect with host=\u0022localhost\u0022 so socket._host is set\u0022 repeats the code it sits on: 5 of its 6 words (connect, host, localhost, socket, set) are already in \u0060const socket = net.connect({ host: \u0022localhost\u0022, port });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unit_node/tls_test.ts"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"110afe9d485adacc8e0719bc931640589b282d23d9ec78b7a2d0f330f98db243"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022WPT TEST EXPECTATIONS\u0022 repeats the code it sits on: 3 of its 3 words (wpt, test, expectations) are already in \u0060export const EXPECTATIONS_DIR = join(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wpt/runner/utils.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"70da8292047ea83daca92a0f3b8e0c2c8e0147122771cfa8768ce3295f578b34"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022fetch the upstream tags\u0022 repeats the code it sits on: 3 of its 3 words (fetch, upstream, tags) are already in \u0060await repo.gitFetchTags(\u0022upstream\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/release/01_bump_crate_versions.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a305f5bdb583557a4dc4da662150c051048b65efc4258f9f19db22393285b9a5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get all import declarations\u0022 repeats the code it sits on: 3 of its 3 words (get, import, declarations) are already in \u0060for (const importDecl of sourceFile.getImportDeclarations())\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/update_types_node.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb58e041738cec47a233516f92e70b6ad99ffff631d2a3d5e8ca870ecd5cf84"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 8 of 71 project(s) overshoot their size bounds, lowering Project Cohesion to 7.8/10. The most over is \u0060cli\u0060 (152570 LoC, 794 module-visible types across 29 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","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":"bf4a513685cdd70130c8b2d4099b6f79dfad71a6593b61671ca9701706c3fb14"},"properties":{"commitSha":"8e96961f0e0c91a6acf73a35e03dda826108e152"}},{"ruleId":"D28","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":"c486bdb1a5ef6a43046fda5519eeedbb259cd938013c24398212449db4e7c301"},"properties":{"commitSha":"26794c623cad7cfe22e2f583a5207c056804fa38"}},{"ruleId":"D28","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":"c08252bb4b3495a5ecad395ab5a5782bb13b9b604deb5db3f5762ec621ea2633"},"properties":{"commitSha":"7a0d9370e86e739461a628c822d7992ea450294f"}},{"ruleId":"D28","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":"052f928a5b8e05bea105f7c33526f73be05439237d753ad3ff4d2727e8a98473"},"properties":{"commitSha":"4a807f42252c79139b36a8a5d7f721474f795b4d"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"51719697dbd4dba78a95055b43c8681e2d477db9992259827e50ac7904fb5b51"},"properties":{"commitSha":"4a807f42252c79139b36a8a5d7f721474f795b4d"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"e596347615c65d6942742d45a3fd7af710a0f051a5e3b2dc44d7392fe3984f19"},"properties":{"commitSha":"26794c623cad7cfe22e2f583a5207c056804fa38"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"191c44c66f3c67f912637c616ff2da860dd714b489c7c87f4b1ce79170c57f21"},"properties":{"commitSha":"7a0d9370e86e739461a628c822d7992ea450294f"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"2ea1f6f556cd7163f27bad11e2a87caea49c7bf2b8cad36f909559db504e7486"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"efaa6a2545c02aed097d2f70c16e8199b0b967686ae89fac7bbf26e0eba07a04"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"d9c952b36c8e44a4af0aef779495d74d3799c01c6d375b8847c2ddfc869443fe"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"ac1c0fee5b4001445ee8f9025a5b7b52c8d1fc964b29bbc49a7d88af3ff20070"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"90b0094a045e32c8086b556cdf2f866bf1d44392e7433e775f04fcd8b2291f88"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"b251ec412976194d1fed690c8865be806d924a040dd79493e57716f9fc9efe4a"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"94580773c8f2a3339476ccac70b65cdd97c754e204259a197518a2d501f3b0bf"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"e67fc4d70fbba1bab7f567ac5662a28b8a4d496c60b1d8c61eb59af01a1a13eb"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"43c568fcbb1140abd242a052517929f0d50a67322b4092c1715b44ca9b4c6481"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"463b69cd8f8355b0a7ff41753cd1af42964221ab3c1a0f34823bbea0f962e757"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"e46845f77b91e592d3c8613fb82e881bc7c56f90cc7eea2e7aa56a1cf67b583c"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"859514ccbe48e6906db07213f429bd785928847ac8831049a75f3a3683c31bda"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"a80333f1ae3c3ca22aacb7ee6f64bc20d4169f564ce37d978b51204e53286976"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"1f1d87b11ca46b2631a47282f48aba9135e3ef8c4f2363961ba853738486edee"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"96735d4917e79791e6a3b3bddfe095cd045fc917c4cba6ebecea6dec641e405a"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"a978fb5961d747f7c43f1dccaf98b776e6e93fa696b3eece4ea42bba3c692733"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"fcb844aa49e1eab9b067206c767dd2792ce93d27026a03e73a7fc660f90211b6"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"15aa3d9a6802f5dd49315a9a577a149a68ff46b450967e1d81d58bb32a994c66"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"5e405ba81687fc3d1b08521f90920cf1b77726a52e91e8daeedeadff69432183"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"d72e4f8e2fc7eeada16b2de8bfc99a919fbc24ca3bc251da640c9e8fba351163"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"7849bac17d5c0ec994155a9203ff893fd33f01196fe058dcfa685100d3f76240"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"f6f09c2ecc8019413549d63f4ca0763a5ff000e796a247a4242df245bdf1393c"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"6385900c28ffe7ae0ff3fe07ff8e36f4cb5f4f8ea0f03bf3385e9396ad7ff7b0"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"489831fe5d468145eebad07bdbbd7ffd4e2399df3e1e0edf080bfb7bc1c28d8f"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"1a3f9caee294bf6a421fc2cef267dc547812975c37da2eb3456cea6bd51f19e7"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"97bdbc30a3d1b8decbda73119415bfb338d7831b2c4272ec17c84e6fa96fb8d0"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"0630ddb92e90686dbd4d2b51cccb0e075f874e96d45992f4908d4518287e2fd9"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"0c7ec0871dc534e9dc14ada1f81e4f0ea26b6e978b1974da35a69fa4546fbba6"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"7eec7566defbf4292c8bdfb248bb8b2702f5d78b267a79abacb04b31f22a08e5"},"taxa":[{"id":"CWE-1164","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"66f0fdb57a83463d2ea19d4b5e5f551e3591f3d45ecfb8d4226496db3eecf22a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"c521d9e8ab0b4e9b34d976411a3ef58a924a74f9450ff0d82fb566b4ecfa5228"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"3691e56732e94b2a9466f8ac2beac52cd715c24a4884333caa6ffdadbadc18fc"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"be3abd6bfef6abe928813fdb8dd69bba7eab30c7798bd65c31ea95d2ff480708"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"6b201cea06f330a3f60b0fb66d2971d5562eeb9fa9cf63fa39440d7f0487bcdb"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"3329a78da22cd49883d435e8bced398d6f7e92102a3f9bb2635b7fefe6031f02"},"taxa":[{"id":"CWE-1164","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"5d686c1fe60d7b8c2f1305d0b47712ecf1cf5c2a262f2c30a5240c95fe845191"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"78a049975647627d33cb6857a7d77e1249e92db53e9235e8048931cbcce52227"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"fe0e7d9b5091ed58d1d51a837cfefc80d66a5dab62c11977c838379e09abe4a4"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"34ac894b6ea7cb9c43bc17ab17f2e50161b7164af550bfc4412f5dd3a8623cf4"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"d72e407fb2fdcb65bf8da6abad2d246579c9c6e2d03c0cea809600e89b7ffa09"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"e336f3e2503ea34a038d82d655cf3dfdf5183ad17f99f8967f5d02cfcb1f9985"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"6237ec2f610fff4d24749d1b7dbfa6f2a2ee52b97f0944dd537541056c86d258"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"properties":{"dependency":{"package":"zip","version":"2.4.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"reachability":{"kind":"unknown"}}}},{"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":"84478e16a12858ab2ebd7037ad3bc3d1975f9cebe46b89975eb341aba1217962"},"properties":{"dependency":{"package":"hickory-proto","version":"0.25.2","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]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0118","RUSTSEC-2026-0119","RUSTSEC-2026-0120","RUSTSEC-2026-0487","RUSTSEC-2026-0489","RUSTSEC-2026-0490","RUSTSEC-2026-0491","RUSTSEC-2026-0504","RUSTSEC-2026-0505","RUSTSEC-2026-0506","RUSTSEC-2026-0509","RUSTSEC-2026-0511","RUSTSEC-2026-0512","RUSTSEC-2026-0519","RUSTSEC-2026-0520","RUSTSEC-2026-0530","RUSTSEC-2026-0531","RUSTSEC-2026-0532","RUSTSEC-2026-0539","RUSTSEC-2026-0540","RUSTSEC-2026-0541"],"reachability":{"kind":"unknown"}}}},{"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":"a9cf5519a382e031ac5e96c757bca8e7cc0a1299cceca22707fd93e59aa4c387"},"properties":{"dependency":{"package":"hickory-resolver","version":"0.25.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0514"],"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":"1a1e503af806e767f14c170c32073931de1d4295405a897beef69c919a99a60d"},"properties":{"dependency":{"package":"adler","version":"1.0.2","advisory":"RUSTSEC-2025-0056","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.98","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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","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":"ca383df8f93c1fcb449201c7c47b9fc487e55acf31a9bb60212d29fe36dde189"},"properties":{"dependency":{"package":"block-buffer","version":"0.12.0","advisory":"[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":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","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":"dd8a4b393a1921695634ce72231f31ac51d94d317ac7f96e6ef26d95fd5282cf"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.5.5","advisory":"RUSTSEC-2026-0387","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":"4ab42b10ba05a49b16a7d43c5d1777361202041cae1baaa2263ec77c2b8c9f7d"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.7.0-rc.28","advisory":"RUSTSEC-2026-0387","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":"109eb8c2be00952287a6643744da7dcc2c9a7a6618d7cac60ea6539c1687dfd6"},"properties":{"dependency":{"package":"ctutils","version":"0.4.0","advisory":"RUSTSEC-2026-0385","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":"f98a5252cf643899a128d2b6f6d04b7713273d44fa70b088ba81df0a39c759a9"},"properties":{"dependency":{"package":"faster-hex","version":"0.10.0","advisory":"RUSTSEC-2026-0306","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":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.38.1","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"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":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.20","advisory":"RUSTSEC-2026-0418","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":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.9.5","advisory":"RUSTSEC-2026-0186","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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","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":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.39.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"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":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.9","advisory":"RUSTSEC-2026-0538","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":"d44a25813d8a9e18eb42fa5350a972c298292d454155c6472f091bfb670363df"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"RUSTSEC-2026-0097","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":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","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":"b5524f25221308ec94b7206b58afaa59996104c20abaa242285d451f5344e44b"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.1.2","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":"29657cae34dd8cde614417a5e63194c90262d7543de5763d566a22c44f87c6e9"},"properties":{"dependency":{"package":"scc","version":"3.7.1","advisory":"RUSTSEC-2026-0205","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":"0897771ffd4e3ceb3419dde32bb5bb1ffcf0f4b413f8009f7ee61b96577e12ed"},"properties":{"dependency":{"package":"smartstring","version":"1.0.1","advisory":"RUSTSEC-2026-0249","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":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.47.1","advisory":"RUSTSEC-2026-0386","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":"be6c43577cdb5dfeef2505c69801cd466e5c9ab949ff6715e24274ea0ceaad39"},"properties":{"dependency":{"package":"unicycle","version":"0.10.2","advisory":"RUSTSEC-2026-0298","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":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.2","advisory":"RUSTSEC-2026-0391","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":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","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":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","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":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","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":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","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":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","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":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","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":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","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":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","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":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","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":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","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":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"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":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.15\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","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":"3adeb5ca433f8377e0513466abe226661632e2c7a65ab03d48b79033987746ab"}},{"ruleId":"D31","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":"3b1568673c97a5ce9b1ec5a08dba083d705b7ca92047378b6f33333438b27491"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"c790f76cf70ef3b7e11b2b2e046aa998549442297137ee1873617b41f8d8e165"}},{"ruleId":"D31","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":"a0253cdb433485d93f1259fe935cad7c5df0486a99bae72ae65dbbacb158f6f3"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"ext/crypto/subtle_import_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bec8a1c79b8ed406ce4a32ee75e4dd0a3e46981af02fc6d2df1d21894fb33c"}},{"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":"cli/lsp/ts_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c7354360c5c044cf5fe862b3c6066ad73f6ff633d66b33de17942163ea3275"}},{"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":"ext/crypto/subtle_crypto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3d2e925e1abfb0a9cae4498399a351cc36f02cd36360098ebf328edc0fa4f0"}},{"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":"ext/crypto/subtle_export_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22d4a424c6e02f703b1753bfbbb03d42f2ec5b9890982dc7b04036442fe5698"}},{"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":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46aff3c5517caa765e274bf214ff356e312a00e708fa78ce8c4afa20000a09c5"}},{"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":"cli/tools/fmt_editorconfig.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da3741edfdfad5f63cf160c870f3f7fc46fe8af8aa090c3d01bd952c3d6c765"}},{"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":"ext/crypto/digest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2e700abe841367d70fcc011d8d460a9e6bd26a2cec17ebe335e013b01fb81c"}},{"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":"ext/web/stream_resource.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1b8b8d91d5bb8a58a64751e7b6468c9509b2f407b43472fb0f9d37bb502b61"}},{"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":"ext/crypto/subtle_encrypt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b73ee377e0d580a93be0abc2f895460ef87e3b1fe31478cde2d2b220e86cc0f"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 28 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: ext/crypto/subtle_sign.rs, ext/crypto/node_interop.rs, ext/crypto/subtle_decrypt.rs, ext/crypto/make_key.rs, cli/lsp/lint.rs, ext/crypto/subtle_verify.rs, ext/io/pipe.rs, ext/telemetry/grpc_exporter.rs (and 20 more) (37 orphaned of 795 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 795 of the 1140 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":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_sign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17639408413178286c282e9341e241be4de503f39eb19c480dd18a3713161474"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/node_interop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dc3fecf82b73c706c1850fbf8e2d25601dbf512d1d30072d595f31a4df8013"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_decrypt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e665a68e6ecbf056672a48b699239004742f476c5012727a98e9999b6bf5b593"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/make_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"382af43abae3beda59609744223fa7b7ed3f87521498306cf990efafbb84fbf6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/lint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ef99b8050f398198e89297173d32f3fdc37a3eedf9f05e788f87a57e1bc6c3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/network_buffered_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bc641766c1cd5512d5f6a9879ac37833c82a4321e7b10e4c2a9b7a6fa1760d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce42b52a971f6bc7398acc5ad7a7f2118cb0db16166b9d69b97fce6785e05f88"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/pipe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c7bc3e80799ef489be3692abdf730d1ee5765f602a5f9dbc7a16845b1c7328"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/grpc_exporter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de46d28194cf9a2bbb1ae8ab6b81f1943e9d64da9ec0b563fac2211222f8167a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d339bc04b3c1556d8c4c169019f335cb5c05056272f850d0061d8ee7ba6c2e0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/constant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cfa50afe635e14ca5fc3d9c8c77e914a666dcae2a1994eb4897b9fecca04d2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_get_public_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"747ba309747aefa4d577e040ba7e1dc81b7bcccfa68bc73ac719b59d652a418e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/crypto_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40aa2c7b00ac7bc5a71ac6390202a9a0d05ee1ca9f025dc5c6018a1a08e2693f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/slhdsa.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7185bf53cbddec95b402c99a35d556328e9ec7404114d9f0264621a8a2618977"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bundle/wasm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c1a9833f87c1e92cb9294ecf7950ce5ce6a2b92a29034292deef763f148438"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/package_json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87267390416810c68e40046824b51698c17622e7d36049456b65c4427e5abf3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/win_pipe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4327f9e399093de83a58522b0b73ade8ba01ec56ec91436bf8e225bfea5ab8dc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_encapsulate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"087676e314d30069baec632bd7400b7d7e009d314822127f7b9da86dc700e1ab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/compiler_options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e77fb8009dfcf6d8797c1bf7672e659430ed4562e1fc4ae395683abbe830a6d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd0c5326b589772ee6423d49b54e405cb5c04246dda58a26bf36010fa5ba59e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/winpipe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5881307253568f795a7c23fa85f35ae6c1a5ec7dbba7a3e3e41528499ec087a8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_encapsulate_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a2cc21676f7eabe0e44952a5900eb823b415275702721963bd87898503d11e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/extensions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad4593dc6934427d0339016aeb9a0ac3194211631a70f533aadefb97b35f32f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/cache/code_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8824d040fb31ccd73cd70cacdc16695c2c0cd0d24cab567c837b843978bd66a0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/testing/lsp_custom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe5eb636bfc23b9e7d6b72f99bd2828811a769a5b2f75492b954341f141281c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/lsp_custom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b7f571e6557c01d381a5352e3a70fe11bc7b8368d46b47d1ba839bf3f69ced"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/build_bench.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c7eab04665c96eed9c20bb128742dab58864218bf63952caeb91ee812da4cf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_derive_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8deecf86458b56df2afc8e317c3d9e52c8a7dbc5f1aa847eac60446eae2096"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ci.ts \u2194 fuzzingclient.js: \u0060.github/workflows/ci.ts\u0060 (context .github) and \u0060ext/websocket/autobahn/fuzzingclient.js\u0060 (context ext) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 5 shared commits counted here, the most recent 3 are \u0060e945e5c7\u0060 ci: fix saving wpt cache (#32228) (at that commit the file was still \u0060.github/workflows/ci.generate.ts\u0060); \u00604af98fa8\u0060 build: remove --unstable flags from CI (#25548) (at that commit the file was still \u0060.github/workflows/ci.generate.ts\u0060); \u006089160e7c\u0060 chore(ext/websocket): readd autobahn|testsuite fuzzingclient (#18903) (at that commit the file was still \u0060.github/workflows/ci.generate.ts\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dda8d0d002f7fe008407ea1788e65e9a5de9d0da70ffe4110ecf80269378e82"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: flags.rs \u2194 permissions.rs: \u0060cli/args/flags.rs\u0060 (context cli) and \u0060runtime/ops/permissions.rs\u0060 (context runtime) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 5 shared commits counted here, the most recent 3 are \u006082eba477\u0060 feat: add \u0060--ignore-env=...\u0060 (#31187); \u0060c8f69205\u0060 refactor: bury descriptor parsing in PermissionsContainer (#25936); \u006074ac29ba\u0060 fix(permissions): handle ipv6 addresses correctly (#24397) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/args/flags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94485d1a3b533abf9ddbc35204dfc7bcd9347ad1f2796f9c5017286eb2abe97"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 mod.rs: \u0060ext/process/lib.rs\u0060 (context ext) and \u0060runtime/ops/mod.rs\u0060 (context runtime) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 5 shared commits counted here, the most recent 3 are \u00600050857f\u0060 refactor: add \u0027deno_process\u0027 crate (#27680); \u0060974e2f44\u0060 refactor: add \u0027deno_os\u0027 crate (#27655) (at that commit the file was still \u0060runtime/ops/process.rs\u0060); \u0060c464cd70\u0060 refactor: FeatureChecker integration in ext/ crates (#20797) (at that commit the file was still \u0060runtime/ops/process.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f094508f335e974024f57b203f3e10698e554267d076cdd3e6b008112f3008d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 worker.rs: \u0060ext/broadcast_channel/lib.rs\u0060 (context ext) and \u0060runtime/worker.rs\u0060 (context runtime) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 5 shared commits counted here, the most recent 3 are \u006025b9abcd\u0060 feat: use new feature checker (#29091); \u0060c464cd70\u0060 refactor: FeatureChecker integration in ext/ crates (#20797); \u0060a5568066\u0060 refactor: use deno_core::FeatureChecker for unstable checks (#20765) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/broadcast_channel/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b760ba39bdc7e834e26ad1f71cb7fb6267cbd0d5b296fdc0f343cef3a7c11689"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 web_worker.rs: \u0060ext/broadcast_channel/lib.rs\u0060 (context ext) and \u0060runtime/web_worker.rs\u0060 (context runtime) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 5 shared commits counted here, the most recent 3 are \u006025b9abcd\u0060 feat: use new feature checker (#29091); \u0060c464cd70\u0060 refactor: FeatureChecker integration in ext/ crates (#20797); \u0060a5568066\u0060 refactor: use deno_core::FeatureChecker for unstable checks (#20765) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/broadcast_channel/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fb97878314f30d72a96e5d09ff5dddfdf1a3018bddc9e27c6395bea27215e0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: global.rs \u2194 local.rs: \u0060libs/resolver/npm/managed/global.rs\u0060 and \u0060libs/resolver/npm/managed/local.rs\u0060 change together 87% of the time (34 of the 39 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 34 shared commits counted here, the most recent 3 are \u00609ab5c0ce\u0060 fix(npm): resolve bundled npm deps in packages properly when not usin\u2026; \u0060c27d8f04\u0060 fix: make \u0027@types\u0027 package resolution more consistent (#31512); \u0060f146dbe1\u0060 feat(npm): support \u0060bundleDependencies\u0060 in npm dependencies (#30521) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/resolver/npm/managed/global.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fe54cf6705471227e325ed3b818b1c60796f04e6b588843c3a178ef9090699"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: 99_main.js \u2194 worker_bootstrap.rs: \u0060runtime/js/99_main.js\u0060 and \u0060runtime/worker_bootstrap.rs\u0060 change together 73% of the time (33 of the 45 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 33 shared commits counted here, the most recent 3 are \u006052962aae\u0060 refactor(runtime): allow disabling the OffscreenCanvas global via env\u2026; \u00600ad03b50\u0060 fix(ext/node): implement node:cluster fork/Worker and worker-side det\u2026; \u0060fd352537\u0060 feat: add \u0060DENO_AUTO_SERVE\u0060 env var (#29852) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/99_main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ca56bfa222b6b5b5a770d6ce830bfcb5be03092aa271379b36b40394a48adf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: fs.ts \u2194 promises.ts: \u0060ext/node/polyfills/fs.ts\u0060 and \u0060ext/node/polyfills/internal/fs/promises.ts\u0060 change together 73% of the time (11 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060d9f981f9\u0060 perf(ext/node): convert more polyfills to lazy-loaded JS (#33913); \u006098e65bc8\u0060 fix(ext/node): implement fs.mkdtempDisposableSync / fsPromises.mkdtem\u2026; \u00604da9f0b3\u0060 refactor(ext/node): consolidate node:fs (part 9) (#32659) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddfff51a759b3b8fd6239362704788e3579f056fcbc6eccaedb65d99a536867"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: lib.rs \u2192 _next_tick.ts, promises.ts, tty.js, mod.ts: \u0060ext/node/lib.rs\u0060 changes together with 4 other files \u2014 \u0060ext/node/polyfills/_next_tick.ts\u0060, \u0060ext/node/polyfills/internal/fs/promises.ts\u0060, \u0060ext/node/polyfills/internal/tty.js\u0060, \u0060ext/node/polyfills/internal_binding/mod.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 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 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d90f03e361214ec87fdd4fb1e9b5e2cb212b369fabbdd6a6d65a15c85de3113"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: map.rs \u2194 tests.rs: \u0060libs/core/modules/map.rs\u0060 and \u0060libs/core/modules/tests.rs\u0060 change together 72% of the time (13 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060985d2187\u0060 fix(core): don\u0027t resolve internal module imports with the user\u0027s impo\u2026; \u0060fb78add1\u0060 fix(core): allow dynamic imports during cached module evaluation (#36\u2026; \u0060ca368e28\u0060 fix(core): restrict extension loaders to internal modules (#36013) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea592d5e61bc599317715664eb328123d760e6ee5aef980aadfce556df2d588"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: fs.ts \u2194 promises.ts: \u0060ext/node/polyfills/fs.ts\u0060 and \u0060ext/node/polyfills/fs/promises.ts\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006005e01fff\u0060 perf(ext/node): convert child_process, fs, http, http2, https, inspec\u2026; \u006098e65bc8\u0060 fix(ext/node): implement fs.mkdtempDisposableSync / fsPromises.mkdtem\u2026; \u00604e6470ab\u0060 fix(ext/node): remove fs.promises.fstat, not a public Node.js API (#3\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b543bfc9a65102585f119106556dbe97d05affa1ad40a66358ef45cce2013dd9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 lib.rs: \u0060ext/broadcast_channel/lib.rs\u0060 and \u0060ext/net/lib.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006025b9abcd\u0060 feat: use new feature checker (#29091); \u0060aaf2bf4b\u0060 chore: upgrade deno_core (#25674); \u0060c464cd70\u0060 refactor: FeatureChecker integration in ext/ crates (#20797) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/broadcast_channel/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"879800766b27b90114b63728a8776959a03485538554963d2a436386cd7cc6c1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: 40_tty.js \u2194 tty.rs: \u0060runtime/js/40_tty.js\u0060 and \u0060runtime/ops/tty.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00609df917c0\u0060 chore: upgrade deno_core (#22725); \u0060c1fac11d\u0060 feat(fs): \u0060Deno.FsFile.{isTerminal,setRaw}()\u0060 (#22234); \u00604eedac36\u0060 feat: \u0060Deno.{stdin,stdout,stderr}.isTerminal()\u0060, deprecate \u0060Deno.isat\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/40_tty.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddf06d7dec90684d2627eb1993c2d3ab6df8fd60443443e51a80ddc13ec918b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: worker.rs \u2192 js.rs, snapshot.rs, snapshot_info.rs: \u0060runtime/worker.rs\u0060 changes together with 3 other files \u2014 \u0060runtime/js.rs\u0060, \u0060runtime/snapshot.rs\u0060, \u0060runtime/snapshot_info.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":"runtime/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a73c8b43c4579d9d9cd89dd27ae4f36a2355fbb8736883dfc311cdb493ba745"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: buffer.mjs \u2194 _utils.ts: \u0060ext/node/polyfills/internal/buffer.mjs\u0060 and \u0060ext/node/polyfills/internal_binding/_utils.ts\u0060 change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006032e63812\u0060 perf(ext/node): Buffer hex paths via native Uint8Array toHex/setFromH\u2026; \u0060ca568b1c\u0060 perf(ext/web): apply the base64url op design to standard base64 (#36422); \u0060e0523a56\u0060 perf(ext/web): implement base64url encode/decode as simdutf ops (#36398) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44db86baf381e194e15ca0da3351c4dd59e011fb8454a3f8239262fb3854a4ad"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ipc.rs \u2194 child_process.ts: \u0060ext/node/ops/ipc.rs\u0060 and \u0060ext/node/polyfills/internal/child_process.ts\u0060 change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00609d69a647\u0060 fix(ext/node): support sending net.Socket and net.Server handles to c\u2026; \u006051f7f573\u0060 Revert \u0022fix(ext/node): make IPC writes synchronous to match Node.js b\u2026; \u0060eeda7328\u0060 fix(ext/node): make IPC writes synchronous to match Node.js behavior \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/ipc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc50eff8e250d348015d2a8eb0df4ec664c9014bfc60521874a8fc82e310b603"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: js.rs \u2194 web_worker.rs: \u0060runtime/js.rs\u0060 and \u0060runtime/web_worker.rs\u0060 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060d4893eb5\u0060 refactor: remove snapshotting from deno_runtime (#21794); \u0060c1c8eb3d\u0060 build: allow disabling snapshots for dev (#20048); \u0060914b08fc\u0060 build: add \u0022include_js_files_for_snapshotting\u0022 Cargo feature (#17826) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dc757beb90bc4697dcfe7e566c0eba7b83508505a1bd0abe58c3d694570cff"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: export_key.rs \u2194 import_key.rs: \u0060ext/crypto/export_key.rs\u0060 and \u0060ext/crypto/import_key.rs\u0060 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060bfdca5bc\u0060 feat(ext/crypto): import and export p521 keys (#25789); \u00605202f546\u0060 chore(ext/crypto): upgrade ec crates; \u006002cc37e0\u0060 chore: upgrade rsa to 0.9 (#21016) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/export_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0046b0428f0916565d4ca11944d55dd597bd3a9abf12b96ce737c3d2d2c1ef4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: module_info.rs \u2194 doc.rs: \u0060cli/cache/module_info.rs\u0060 and \u0060cli/tools/doc.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00607a1e949c\u0060 refactor: extract \u0060DenoDir\u0060, \u0060Emitter\u0060, \u0060EmitCache\u0060 and \u0060ParsedSource\u2026; \u0060b42d5906\u0060 refactor: upgrade to deno_graph 0.95 (#29575); \u0060cb23193f\u0060 refactor: allow deno_permissions to compile to wasm32-unknown-unknown\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/cache/module_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da5f5693eb05c2c6c945f1c2ea4a66875e7862d50cddc9951fe2ca15237de9e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: flags.rs \u2194 args.rs: \u0060cli/args/flags.rs\u0060 and \u0060cli/lib/args.rs\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00601e4b28cf\u0060 chore: remove the dead forked typescript-go integration (#35935); \u0060e8c6f4ac\u0060 feat: stabilize bare node built-in resolution (#33316); \u006099ae41f6\u0060 feat: stabilize --allow-net subdomain wildcards (#29902) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/args/flags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61bd31b8780716d088df1a36d6bf7cfa0b263a997961173733bf02d7bd1f10a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: main.rs \u2194 binary.rs: \u0060cli/rt/main.rs\u0060 and \u0060cli/standalone/binary.rs\u0060 change together 55% of the time (12 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00605f8be055\u0060 refactor(unstable): otel configuration (#27333) (at that commit the file was still \u0060cli/mainrt.rs\u0060); \u0060ce778a94\u0060 Revert \u0022perf(upgrade): cache downloaded binaries in DENO_DIR\u0022 (#26799) (at that commit the file was still \u0060cli/mainrt.rs\u0060); \u006001de3317\u0060 perf(upgrade): cache downloaded binaries in DENO_DIR (#26108) (at that commit the file was still \u0060cli/mainrt.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/rt/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57174d4d64456231627c75e368e9edbfa1478fa76d003ddf16c08e79356d508d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: diagnostics.rs \u2194 server.rs: \u0060cli/lsp/diagnostics.rs\u0060 and \u0060cli/lsp/testing/server.rs\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006097d16353\u0060 fix(lsp): panic on url_to_uri() (#25238); \u00607446b016\u0060 perf(lsp): don\u0027t keep remote module ast\u0027s in memory (#23230); \u0060fe90ba65\u0060 refactor(lsp): log names (#21413) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddcb3f24428d904bc231e40e16c32f2ebbabf446ae6d083a7ca7fb1f34f66d8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 bindings.rs: \u0060libs/core/lib.rs\u0060 and \u0060libs/core/runtime/bindings.rs\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060a748c295\u0060 perf(core): split OpCtx into shared OpCommonCtx \u002B borrowed op declara\u2026; \u00609eeca7be\u0060 fix(ext/node): avoid panic when vm.SourceTextModule uses import.meta \u2026; \u0060eb2298ae\u0060 fix(runtime): show import location for unsupported import attributes \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e82be249466fb2554778ed7acc697811c399fdc3e6e5a286f17847f4c1e43d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: sig.ts \u2194 sign.rs: \u0060ext/node/polyfills/internal/crypto/sig.ts\u0060 and \u0060ext/node_crypto/sign.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060d7b5c73f\u0060 fix(ext/node): enable test-crypto.js node compat test (#33822); \u00608ec2df30\u0060 fix(ext/node): enable test-crypto-sign-verify node compat test (#33810); \u0060f79eedcf\u0060 fix(ext/node): improve sign/verify crypto compat with Node.js (#33083) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7928d4f83dc4c5a8f3f7cb4aa71f33b39db96b13b414c5e378e86a1eabf03632"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: http.rs \u2194 http.ts: \u0060ext/node/ops/http.rs\u0060 and \u0060ext/node/polyfills/http.ts\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00600905fd9d\u0060 feat(node/http): enable keepAlive connection reuse for HTTP Agent (#3\u2026; \u00605f139910\u0060 fix(ext/node): support http over unix sockets (#29182); \u00601cecc0a8\u0060 fix(ext/node): support proxy http request (#27871) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80fa1d7672e8802eab691c26541d43c7e3ca3da6c8188da753c6bcfde95f419"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: module_loader.rs \u2194 node.rs: \u0060cli/module_loader.rs\u0060 and \u0060cli/node.rs\u0060 change together 50% of the time (12 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060c1751d7e\u0060 refactor: extract PreparedModuleLoader from CLI (#29977); \u00607a1e949c\u0060 refactor: extract \u0060DenoDir\u0060, \u0060Emitter\u0060, \u0060EmitCache\u0060 and \u0060ParsedSource\u2026; \u0060b42d5906\u0060 refactor: upgrade to deno_graph 0.95 (#29575) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/module_loader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a87537a1c4db4df22bf467d52cd67b96b44a175359564409c99f15eb6f7e81"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: _next_tick.ts \u2194 process.ts: \u0060ext/node/polyfills/_next_tick.ts\u0060 and \u0060ext/node/polyfills/process.ts\u0060 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006092ed54bb\u0060 Reland refactor(core): move nextTick/immediate queues into core, repl\u2026; \u00609f02e001\u0060 Revert \u0022refactor(core): move nextTick/immediate queues into core, rep\u2026; \u006091e84aef\u0060 refactor(core): move nextTick/immediate queues into core, replace ops\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_next_tick.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d877d8d4210fa5f33f372061601950811610c8360918159b167b20ca89ded16"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: module_info.rs \u2194 module_loader.rs: \u0060cli/cache/module_info.rs\u0060 and \u0060cli/module_loader.rs\u0060 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00607a1e949c\u0060 refactor: extract \u0060DenoDir\u0060, \u0060Emitter\u0060, \u0060EmitCache\u0060 and \u0060ParsedSource\u2026; \u0060b42d5906\u0060 refactor: upgrade to deno_graph 0.95 (#29575); \u0060ed2fac89\u0060 refactor: handle deno_media_type having \u0060Html\u0060 and \u0060Sql\u0060 variants (#2\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/cache/module_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"864fbbfb96f294c0698b0f09cf808b51da46bd08c2a95cc8a5530ab51486916b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: graph_container.rs \u2194 graph_util.rs: \u0060cli/graph_container.rs\u0060 and \u0060cli/graph_util.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00603a101425\u0060 fix(bundle): respect runtime file permissions (#36107); \u0060b23cb76e\u0060 fix(resolver): scope sloppy import hints to prepared modules (#36221); \u006022b7401b\u0060 fix: support loading \u0060npm:\u0060 and \u0060jsr:\u0060 specifiers in required ES modu\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/graph_container.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba8736bf842be57ab24feaa26b48d0b93b5d0f3a6255f9c17738721ba6425bc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: 98_global_scope_shared.js \u2194 98_global_scope_window.js: \u0060runtime/js/98_global_scope_shared.js\u0060 and \u0060runtime/js/98_global_scope_window.js\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060741f4df6\u0060 feat(ext/web): web locks api (#31166); \u0060a317222e\u0060 perf(ext): convert ext/kv and ext/webgpu JS sources to lazy-loaded sc\u2026; \u0060c8b2af8e\u0060 refactor: use web utils and lazy load utils from core (#22289) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/98_global_scope_shared.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e548f95f9f427d0ba933d3d398daf4112a0e652e3f7d06cff8b35f14bb335c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: 90_deno_ns.js \u2194 mod.rs: \u0060runtime/js/90_deno_ns.js\u0060 and \u0060runtime/ops/mod.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00600050857f\u0060 refactor: add \u0027deno_process\u0027 crate (#27680); \u0060974e2f44\u0060 refactor: add \u0027deno_os\u0027 crate (#27655); \u0060fe368b72\u0060 refactor: Add \u0022deno_fs\u0022 extension crate (#18040) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/90_deno_ns.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12b79d356114a3b5c940da3df22d5f5d10f4941cedb0b7823eed346d9e04d3c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: child_process.ts \u2194 pipe_wrap.ts: \u0060ext/node/polyfills/internal/child_process.ts\u0060 and \u0060ext/node/polyfills/internal_binding/pipe_wrap.ts\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060daeaf3c4\u0060 feat: native uv_pipe_t implementation with NativePipe and FdTable (#3\u2026; \u006062dfdab0\u0060 refactor(ext/process): bypass resource table for Node child_process s\u2026; \u00604e6eb1e1\u0060 fix(ext/node): create net.Socket from file descriptors (#33150) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4e75d68f73376a50dba65750297d25194de4ec2253fe84fa8c125205220be7"}},{"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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"649066011bda94fbf4ed3994b95de601598ac84be22f5b97266a3b0507e6a9ef"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"9d8e9a1873e3d12cdb4d5405889e70829ac08bbf3925fabaff6fc960a57369e5"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"2f4f3c5c12bc5bcaf8fe4c20c5aaef8465c257b30fe813b535f16ab7bf0c766a"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"fce536362c35278fcdd669c32b66bb8edeebd2881aca2b6e5ddad8c167b8501a"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"26011c581c44c7b9c7ed3bc54ab194865778a60994f983f9b8bc0e6f1d636e25"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0c5b979904e2ad9a4fdfaaa4a2b2f2f92f6afff435ba83bc9080bd39058d730b"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6760f21d9e0d5bb208ebe15b61b9fafc9ff4a73b1d097ae5d70d979f682f0dfb"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"28a9326f99b9303f81fef0ee81720b672e6753d0c88dbc04f3c8fb3058da5553"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"c97cd1e2c36656aefb5d9c3f20a314c06ae0a0396c1107ce4183c53f8eedf5ea"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"2a40e90cbb604fd33270a43291b6e601a6412d72ceccca1bc3416cda46144e87"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"50cc9c71ab4656a23101b65ba31e62aa9bda1ebe0bbefdffeaee8c8667e09446"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.95: rust-toolchain.toml declares Rust 1.95 as this project\u0027s toolchain file, and Rust 1.95, superseded by 1.96 on 2026-05-28 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-05-28 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust-toolchain.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde701f9c40b0b8cb202babf3f8d8da48dda44162595030f1b0a8f7d57710684"}},{"ruleId":"AX3","level":"error","message":{"text":"Project dependency cycle: The projects pkg-a \u2192 pkg-b \u2192 pkg-a form a reference cycle. Cyclic dependencies prevent independent build/test/deploy, blur ownership, and tend to grow into a big ball of mud. Break the cycle by extracting the shared types into a separate project both can reference."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_symlink_cyclic/packages/pkg-a/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce27265772c974f9fe7c479c4ad277de29aa31f7164e26ff1dd82475f3407f23"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: SerializeDeserialize.get_shared_array_buffer_id: \u0060SerializeDeserialize.get_shared_array_buffer_id\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d93654ff57ae0559d463d252e1a32fe00d181cf55ee360facd4e3e11a4030e"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: SerializeDeserialize.get_wasm_module_transfer_id: \u0060SerializeDeserialize.get_wasm_module_transfer_id\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin_v8.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60f60ee58db7f01c0501d4cf173799118d26b2194f2b7375fc168dfb39b41cf"}},{"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":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060deno_cache\u0060 is marked as implementation by its own namespace, folder or name: \u0060CacheImpl\u0060 (ext/cache/lib.rs:176, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cache/lib.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c8e6c7d9aca872fe0eff9e0f351b6a57363db05ac0ef998a994c6c5810babb"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060deno_cron.handler_impl\u0060 is marked as implementation by its own namespace, folder or name: \u0060CronHandlerImpl\u0060 (ext/cron/handler_impl.rs:12, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cron/handler_impl.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9c4c7bb874ba3021a415f1d445f909edc3eb42e3e4dd3150f6c15ab6d63838"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 28/33 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060ext/fetch\u0060, \u0060libs/dcore\u0060, \u0060libs/node_shim\u0060, \u0060libs/ops/compile_test_runner\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060tests/bench/testdata/npm/hono/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/bench/testdata/npm/hono/package.json"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adbbc134a29a55a8434b57b0cae39dc8e134231bd8c675130797b65dcd1a65c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060#cache.statSync\u0060 in \u0060#iterateSubpatterns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b14f5ecb9fe184615d45c16329fc6eb7f70f4b29e0033c12ec55d5244c06084"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060#cache.statSync\u0060 in \u0060#iterateSubpatterns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9654994659c674bf32a8ed2b72f3829b583f195766edde55bf9c78923e990d"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 391 typed \u00B7 500 plain JS \u2014 the untyped files are cli/js/40_jupyter.js, cli/js/40_lint.js, cli/js/40_lint_selector.js, cli/js/40_test.js, cli/js/40_test_common.js, cli/js/40_test_snapshot.js (\u002B494 more). 0 production file(s) opt out entirely with @ts-nocheck \u00B7 15 @ts-ignore suppression(s)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 14 sibling directories (48 clone groups): 48 duplicated blocks under ext/ have copies in at least two of the sibling directories cache, fetch, fs, http, image, io (\u002B8 more sibling(s) not listed) \u2014 17 of them are reported below, and 31 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 48 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 48 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 48 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9636988370957a3a3182945b4a0e5d2d06de64feda8fc46d0565428e6663201"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 3 sibling directories (13 clone groups): 13 duplicated blocks under the repository root have copies in at least two of the sibling directories ext, libs, runtime \u2014 5 of them are reported below, and 8 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 13 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 13 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 13 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b654e38da6bdfa434ae0855a47c1b79eeb1b0ae5ce5ac16f3220a7079fe5b55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 8 sibling directories (10 clone groups): 10 duplicated blocks under ext/node/polyfills/internal/ have copies in at least two of the sibling directories console, crypto, dns, fs, http2, readline (\u002B2 more sibling(s) not listed) \u2014 1 of them are reported below, and 9 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 10 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 10 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 10 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/console/constructor.mjs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f1184d47dc30a6b6d1059402efebbfc465a07ec2d9a8210a01f86848f53787"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 8 sibling directories (9 clone groups): 9 duplicated blocks under ext/node/polyfills/ have copies in at least two of the sibling directories _fs, _process, fs, inspector, internal, internal_binding (\u002B2 more sibling(s) not listed) \u2014 5 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/types.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bb6158168f002d6702411175820a8560e5f543fbc3bdc9763243ab468d77a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (216 matched lines \u00D7 2 locations): ext/node/polyfills/path/_posix.ts:183 \u00B7 ext/node/polyfills/path/_win32.ts:655 \u2014 the two spans are one implementation copied and then locally edited \u2014 1307 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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccedf89b58200ddb87c6020fb11b9a8149297fa8cbea22c14d6edfff9d11a555"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (191 matched lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/cipher.ts:182 \u00B7 ext/node/polyfills/internal/crypto/cipher.ts:493 \u2014 the two spans are one implementation copied and then locally edited \u2014 1065 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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a911ed6d34729d4fbd8472414345334ebe8bcc83771ff257cc10901e9ca81aab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (135 matched lines \u00D7 2 locations): tools/startup_order/generate_linux_function_orderfile.ts:402 \u00B7 tools/startup_order/generate_macos_function_orderfile.ts:282 \u2014 the two spans are one implementation copied and then locally edited \u2014 808 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":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"671cb6147ebc16d29677b521694832e07e3c81ece8fd1a220bd18c31f190a1ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (107 lines \u00D7 2 locations): ext/node/polyfills/internal/errors.ts:3361 \u00B7 ext/node/polyfills/internal/errors.ts:3684 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":3361}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7171fcfb94546b801a4d27ff3ccf208c65561781bdd564eeacbb71f12a00d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (106 matched lines \u00D7 2 locations): ext/web/12_location.js:22 \u00B7 ext/web/12_location.js:228 \u2014 the two spans are one implementation copied and then locally edited \u2014 393 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":"ext/web/12_location.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6374d21bdc81ebb4cd92b518b35c297a1ffdafb6b75f3dada9c38082e6dcd7e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (93 matched lines \u00D7 2 locations): ext/node/polyfills/worker_threads.ts:636 \u00B7 runtime/js/11_workers.js:222 \u2014 the two spans are one implementation copied and then locally edited \u2014 491 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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74d6d8d8fb0c45674ccb61d33e12375e0e4bf4cb5bbb6ac7c4701c816a20012"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (92 matched lines \u00D7 2 locations): ext/node/polyfills/internal/streams/readable.js:257 \u00B7 ext/node/polyfills/internal/streams/writable.js:251 \u2014 the two spans are one implementation copied and then locally edited \u2014 551 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"63afe57d12475c01dfb4663c235c3eb35ed47fd552781020e050dc278be77894"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (86 matched lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/sig.ts:350 \u00B7 ext/node/polyfills/internal/crypto/sig.ts:470 \u2014 the two spans are one implementation copied and then locally edited \u2014 464 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":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5161967187c52bf0e386caefc01b2d254909a502103502cea9b766a8b70eba88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (86 lines \u00D7 2 locations): tools/startup_order/generate_linux_function_orderfile.ts:154 \u00B7 tools/startup_order/generate_macos_function_orderfile.ts:126 \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":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"254370ec8497b5c6f0c0afc383df14b45403faab812959016f0b1311934c1ae5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (77 lines \u00D7 2 locations): ext/node/polyfills/internal/errors.ts:3475 \u00B7 ext/node/polyfills/internal/errors.ts:3796 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":3475}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8d6025071d54259ba6c4ef62769f688c7bef510b7a8a98fa6c6e8073708653"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (76 matched lines \u00D7 2 locations): ext/node/polyfills/internal/webstreams/adapters.js:129 \u00B7 ext/node/polyfills/internal/webstreams/adapters.js:272 \u2014 the two spans are one implementation copied and then locally edited \u2014 346 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":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e241c00cba75e087530869358a386cbab0c39d45295743498853e3627588ad1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (75 matched lines \u00D7 2 locations): ext/node/polyfills/internal/streams/readable.js:136 \u00B7 ext/node/polyfills/internal/streams/writable.js:146 \u2014 the two spans are one implementation copied and then locally edited \u2014 453 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab00fb23dba8f711e181d337f0f087597c2b0bec2526213f684d868381af43e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (72 matched lines \u00D7 2 locations): ext/fetch/26_fetch.js:194 \u00B7 ext/node/polyfills/_http_client.js:146 \u2014 the two spans are one implementation copied and then locally edited \u2014 435 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":"ext/fetch/26_fetch.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f94a0e07355ab8a5d46c364daf958d55969eb4dd4f6a9af71cd01cc8b91b009"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (70 matched lines \u00D7 2 locations): ext/node/polyfills/internal/streams/compose.js:94 \u00B7 ext/node/polyfills/internal/streams/duplexify.js:290 \u2014 the two spans are one implementation copied and then locally edited \u2014 318 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":"ext/node/polyfills/internal/streams/compose.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df9818a27200483aeaf78490048d73a069b582907a699326070eda19c9aff07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (67 lines \u00D7 2 locations): ext/node/polyfills/crypto.ts:495 \u00B7 ext/node/polyfills/crypto_esm.ts:6 \u2014 the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/crypto.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ca49b011ee3948ca6ff9c56212c3c0279da55a9f8125f9c683063224003773"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (67 matched lines \u00D7 2 locations): ext/node/polyfills/timers.ts:53 \u00B7 ext/node/polyfills/timers.ts:160 \u2014 the two spans are one implementation copied and then locally edited \u2014 358 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":"ext/node/polyfills/timers.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1697bf38d8f5b4f0e1bcadb000c6a2dec18ac7edd61a3dbc703ef049da55b4f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_constants.ts:9 \u00B7 ext/node/polyfills/_fs/_fs_constants.ts:69 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_constants.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"331a65c28f47eb7d25f66e6643885cdf76125d567227afa6e396b93cf3cfefc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2 locations): ext/node/polyfills/internal_binding/udp_wrap.ts:169 \u00B7 ext/node/polyfills/internal_binding/udp_wrap.ts:300 \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":"ext/node/polyfills/internal_binding/udp_wrap.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c874070b9def33b04a4f415133576fc0ff6c510d5dc27e801fbd109acd3158"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (55 matched lines \u00D7 2 locations): ext/fetch/20_headers.js:549 \u00B7 ext/fetch/21_formdata.js:188 \u2014 the two spans are one implementation copied and then locally edited \u2014 323 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":"ext/fetch/20_headers.js"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c80cc820bc6f7341c8c4ed8ab8b462cfd0de15750435c1810a7f44f4980bcd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:1060 \u00B7 ext/node/polyfills/internal/buffer.mjs:1125 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d755e11a7f157bd7160fc034561498acb012f3fe69872bf0437a826d004b542"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (52 matched lines \u00D7 2 locations): runtime/js/98_global_scope_window.js:9 \u00B7 runtime/js/98_global_scope_worker.js:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 221 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":"runtime/js/98_global_scope_window.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9fb22ce0e01f04971a33462078d2621361228b68d73598244aa79dde5754dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2 locations): ext/telemetry/telemetry.ts:948 \u00B7 ext/telemetry/telemetry.ts:1005 \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":"ext/telemetry/telemetry.ts"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfb3574d26e096caa613b61cd007706c5f6b944aa0eafb58ad1ce8faead969a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): ext/node/polyfills/_http_agent.js:78 \u00B7 ext/node/polyfills/net.ts:337 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"04266b58d947cfc63f7c28fe3fe8bfb88e6e4e2e1f22792f34d58b271437fdad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2 locations): ext/web/14_compression.js:59 \u00B7 ext/web/14_compression.js:121 \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":"ext/web/14_compression.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c96a30de25a08a613d7b3947372edf5f4ec3353cc7aebdeea1a3c10c2be9eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2 locations): tools/lint.js:100 \u00B7 tools/lint.js:179 \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":"tools/lint.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebea3b0dadcab06903df6f63e7fbb6dfe5148320764222801d58ac6357f9aeae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): ext/node/polyfills/dns.ts:1061 \u00B7 ext/node/polyfills/dns.ts:1114 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0b386434fc2cc9e1eb990b6591d3f9c50738b6bec2879726bada94afccec2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): runtime/js/98_global_scope_window.js:165 \u00B7 runtime/js/98_global_scope_worker.js:147 \u2014 the 2 copies are spread across 2 files, 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":"runtime/js/98_global_scope_window.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6f69b6097d0a7add077e8ff1717960bfd90eb1cfadc69179f9eb424e131083"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2 locations): ext/node/polyfills/internal/constants.ts:58 \u00B7 ext/node/polyfills/internal/constants.ts:107 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/constants.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9688d209e8ce94451d84f95c906e6f101af466155d396bd130e9c0486049c1fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): ext/web/06_streams.js:5904 \u00B7 ext/web/06_streams.js:5961 \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":"ext/web/06_streams.js"},"region":{"startLine":5904}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ef717c16d37a61ad7384fd5ee3538f1b94c828e5c2243a226021e34f156656"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): ext/web/06_streams.js:1654 \u00B7 ext/web/06_streams.js:2144 \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":"ext/web/06_streams.js"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"e773f8a4886e630822001afd17b847c1ff4b90f21780ee055049c3a585546803"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/keygen.ts:221 \u00B7 ext/node/polyfills/internal/crypto/keys.ts:535 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfce47a72060403beef53665c1cdedefb7128259e728b45a27cac4c3c9815811"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): ext/node/polyfills/internal/errors.ts:3612 \u00B7 ext/node/polyfills/internal/errors.ts:3926 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":3612}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd1f72b252f17457e1fc4ff270266cf34a0f84e9acf63815ea5e40c5bc0bb97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_glob.ts:701 \u00B7 ext/node/polyfills/_fs/_fs_glob.ts:973 \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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"0655bf454da3d840961329b8610f94432a0def58b75ca7f021bf43da310d1427"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): ext/node/polyfills/internal/util/types.ts:136 \u00B7 ext/node/polyfills/util/types.ts:6 \u2014 the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/types.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0a9d377e9d80452535ff709c6c34144e25dcb00d7ec8f7fe34f86566c1a368"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_glob.ts:758 \u00B7 ext/node/polyfills/_fs/_fs_glob.ts:1034 \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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9177cfb837d1f075fc25aaae13cbf9a9a1fbbcf6c25ee59eaaa54b6c60a39dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): ext/node/polyfills/inspector.js:59 \u00B7 ext/node/polyfills/inspector_network_bridge.js:19 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/inspector.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbf663fcedbadc2acfd5a6ed3246e78577416db6c9307d694a95cc73ccff8e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): ext/web/08_text_encoding.js:422 \u00B7 ext/web/08_text_encoding.js:525 \u2014 the two spans are one implementation copied and then locally edited \u2014 141 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":"ext/web/08_text_encoding.js"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"214e3bdd905f89e2d83809ebe0ab210171021ad5031c51a6d7a3553050bcca1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): ext/node/polyfills/internal/constants.ts:15 \u00B7 ext/node/polyfills/path/_constants.ts:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/constants.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e719c8318f0122485f371ce9f28d3a871b152a038cd47c20cb8aabaf6f21c23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/random.ts:86 \u00B7 ext/node/polyfills/internal/crypto/random.ts:142 \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":"ext/node/polyfills/internal/crypto/random.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9989213cc86b1fae7d35d3cfe31516ccae79cb9e784ba1bbd9a233aa544147c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_read.ts:116 \u00B7 ext/node/polyfills/_fs/_fs_read.ts:217 \u2014 the two spans are one implementation copied and then locally edited \u2014 146 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":"ext/node/polyfills/_fs/_fs_read.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"18422c5ce9bf79838715cd4183c7e35e3b9673909438e721ac08eae826c3f8e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): ext/node/polyfills/dns.ts:223 \u00B7 ext/node/polyfills/internal/dns/promises.ts:194 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"123d6dd08042c221a2af206823ce65e0eaa9b810701333f5948174918bf0fabb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): tools/startup_order/generate_linux_function_orderfile.ts:358 \u00B7 tools/startup_order/generate_macos_function_orderfile.ts:241 \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":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1489248d88dda32b7ce6f134109bb02e72074805484e63b965705b6d3afd418f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): ext/node/polyfills/internal/readline/interface.mjs:62 \u00B7 ext/node/polyfills/internal/readline/symbols.mjs:41 \u2014 the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8fd3a7bae2720f9f8ee6008b3d67faec22a832e64da2c4f0de2ef72179dc61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): runtime/js/98_global_scope_window.js:127 \u00B7 runtime/js/98_global_scope_worker.js:109 \u2014 the 2 copies are spread across 2 files, 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":"runtime/js/98_global_scope_window.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"850247a7649b91cece781bee9560a1feda2696214e083c2555dda55734cc6183"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): ext/node/polyfills/_http_outgoing.ts:1490 \u00B7 ext/node/polyfills/_http_outgoing.ts:1583 \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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bf57c6347d866fdf34aaacf590b9a9ec977ce7e47e69559834a4d00b3872b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): ext/node/polyfills/internal/readline/callbacks.mjs:31 \u00B7 ext/node/polyfills/internal/readline/promises.mjs:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 169 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":"ext/node/polyfills/internal/readline/callbacks.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabb97d72809b05ddfdf39ecb71a2db21015ee42ff0f62ff96a063b2d708b14d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): ext/node/polyfills/internal_binding/pipe_wrap.ts:119 \u00B7 ext/node/polyfills/internal_binding/tcp_wrap.ts:86 \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":"ext/node/polyfills/internal_binding/pipe_wrap.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"558d40dd910457f1d90d706f8212e6ebdb20c6638a52ef15d30f11191c6aff87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): ext/webidl/00_webidl.js:213 \u00B7 ext/webidl/00_webidl.js:272 \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":"ext/webidl/00_webidl.js"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af554998f4ef2c283e10f00a7aaa3062553a9338531d3d58c8b4cb48147ebc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): tools/check_deno_core_changes.js:21 \u00B7 tools/check_docs_only_changes.js:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 217 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":"tools/check_deno_core_changes.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"922bd0fcc3d46ca52ab3a5ed5b91c50ed9f5d6bb135baf7d09af2748f749c40b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_glob.ts:626 \u00B7 ext/node/polyfills/_fs/_fs_glob.ts:888 \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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"183184eb2b3c52052650e636f133d18eef876dc1145b4011628de010fc2b77e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): ext/node/polyfills/vm.js:298 \u00B7 ext/node/polyfills/vm.js:351 \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":"ext/node/polyfills/vm.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79e64414bc3f91ee6f89997194b788f9736195ec293de15435df77f3bbe64ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): ext/node/polyfills/_http_server.js:1578 \u00B7 ext/node/polyfills/https.ts:157 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ca8f4e8fc852674b1dff6595e9a6e4ae374ff018b14322fcd8f1d4f69755dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:3978 \u00B7 ext/node/polyfills/fs.ts:4047 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ddfaa92a923c8c4ec03f47e12ecf1f1468f14d270f563b2535002d7917c392"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:202 \u00B7 ext/node/polyfills/internal/http2/util.ts:1054 \u2014 the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9460104afda8bc62dc1cc0791c6aeadc6ccbb6e53b471e895be12d1f079482a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): ext/node/polyfills/path/_win32.ts:155 \u00B7 ext/node/polyfills/path/_win32.ts:290 \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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"104df2506087709352a65b815de0897175e064d1b1595aba209e53aead5994f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): ext/node/polyfills/child_process.ts:467 \u00B7 ext/node/polyfills/child_process.ts:811 \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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"03269fc560d11c82f678a254c8a5c44f28d4d8e62f722a14c9b0374703a1f661"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): ext/node/polyfills/internal/console/constructor.mjs:764 \u00B7 ext/node/polyfills/internal/util/debuglog.ts:155 \u2014 the two spans are one implementation copied and then locally edited \u2014 175 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":"ext/node/polyfills/internal/console/constructor.mjs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc2b1aaa398788ac5e65ea1c60883c2420cb8180fa5827702c2e3b152d73fa4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): ext/web/06_streams.js:4311 \u00B7 ext/web/06_streams.js:4343 \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":"ext/web/06_streams.js"},"region":{"startLine":4311}}}],"partialFingerprints":{"codehealthFindingId/v1":"985fd6f42d60f06ccee069182f147c27b51d05ae75dbbf7d7a46655d1f1c8f44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): ext/fetch/21_formdata.js:89 \u00B7 ext/fetch/21_formdata.js:208 \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":"ext/fetch/21_formdata.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8386c023a21ff677bfffeedfcbecb21179f0a3443b5eb1a5e5e8d76b640d4806"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): ext/node/polyfills/dns.ts:601 \u00B7 ext/node/polyfills/dns.ts:637 \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":"ext/node/polyfills/dns.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8e90db33127eaf90419d9fb467d9cb0f7809ec235c2b3d6c0cfa1270c8ddf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (28 matched lines \u00D7 2 locations): ext/node/polyfills/internal/cluster/child.ts:13 \u00B7 ext/node/polyfills/internal/cluster/primary.ts:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 144 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":"ext/node/polyfills/internal/cluster/child.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec671912d07911ef4ac9618dd5ba93c91fa830b1629d9489e8ee0fd8e662d50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): ext/node/polyfills/internal/util/inspect.mjs:119 \u00B7 ext/web/01_console.js:176 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7608e4e3ce5f22f853bec67dfe58cb9229a90b603ecdac934245f3d6636db8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): ext/web/06_streams.js:6441 \u00B7 ext/web/06_streams.js:6628 \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":"ext/web/06_streams.js"},"region":{"startLine":6441}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6aeadd893c13dc4c0196b68daa544b03f7646697a3d6f52d4f224bc91f699f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): runtime/js/11_workers.js:332 \u00B7 runtime/js/99_main.js:253 \u2014 the 2 copies are spread across 2 files, 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":"runtime/js/11_workers.js"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e40bcd555d13eb4d2a350ddb302ff766a1eec0e707d0d73828b6c93a8a95c63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): ext/node/polyfills/assert.ts:561 \u00B7 ext/node/polyfills/assert.ts:623 \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":"ext/node/polyfills/assert.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"51226a6be5509d16a51c50a19649f786852b1a14567372f9e54251480b7b4c25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/keys.ts:877 \u00B7 ext/node/polyfills/internal/crypto/keys.ts:965 \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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"37738dddf2be335b43d976f237d6c6f129d9816d0c78e30faa756dde837cadc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): ext/node/polyfills/internal/util/comparisons.ts:756 \u00B7 ext/node/polyfills/internal/util/comparisons.ts:976 \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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9f472205c4ada045d80c43ad90b4adc2b2d9ba129f185d399e2ad66bd5ce9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): ext/io/12_io.js:188 \u00B7 ext/io/12_io.js:223 \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":"ext/io/12_io.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec24f5a6d52921abda145f7ec8c037866817024bb3c6ba17e130af848abbf3f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): ext/node/polyfills/zlib.js:1090 \u00B7 ext/node/polyfills/zlib.js:1159 \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":"ext/node/polyfills/zlib.js"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f8acb7f27f77ab49167374a6c0220038a78b87e1c1b4277a2cf984780fbfb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 4 locations): ext/web/12_location.js:38 \u00B7 ext/web/12_location.js:64 \u00B7 ext/web/12_location.js:97 \u00B7 ext/web/12_location.js:123 \u2014 all 4 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/12_location.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"991931d186653ea9cbbc138ffa69b4c7f920380e740eda36df65e800f7830fcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (26 matched lines \u00D7 2 locations): tools/startup_order/generate_linux_function_orderfile.ts:49 \u00B7 tools/startup_order/generate_macos_function_orderfile.ts:40 \u2014 the two spans are one implementation copied and then locally edited \u2014 172 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":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3345c843d9c7f2ec40b0cfb2b4252aebf953eb9104d807868497282bf7ec9b73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): ext/fs/30_fs.js:824 \u00B7 ext/fs/30_fs.js:854 \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":"ext/fs/30_fs.js"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b405c757ad9134cb2fd60051b5cf55ded7bdf79f73940823232cc76e6c487d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): ext/http/00_serve.ts:1457 \u00B7 ext/http/00_serve.ts:1510 \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":"ext/http/00_serve.ts"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd786a1c434bcaeb7f29c331a7f09c55331ad92f36e0d788df6cc7f78795ecf8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (25 matched lines \u00D7 2 locations): ext/kv/01_db.ts:294 \u00B7 ext/kv/01_db.ts:564 \u2014 the two spans are one implementation copied and then locally edited \u2014 123 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":"ext/kv/01_db.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf831fe8e595c9423d662d6daa48f4b5898b707193c8c5579b9b0cae2c003e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:1965 \u00B7 ext/node/polyfills/internal/buffer.mjs:1998 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acba6d4403e7b0c97c611044bf166c85149c15c2c1036bef212d670959945ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): ext/node/polyfills/internal/util/parse_args/parse_args.js:211 \u00B7 ext/node/polyfills/internal/util/parse_args/parse_args.js:282 \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":"ext/node/polyfills/internal/util/parse_args/parse_args.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"debd97af88f34c2b6e5e55c1323257e5c7df784dee2d174624c706e0bead9c17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): ext/net/03_quic.js:399 \u00B7 ext/net/03_quic.js:431 \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":"ext/net/03_quic.js"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d40619c79286f2eeceb1805bd99d9feefb39f0d79890ea6193fb16656d8b414"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_readdir.ts:181 \u00B7 ext/node/polyfills/_fs/_fs_readdir.ts: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":"ext/node/polyfills/_fs/_fs_readdir.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b7c08a542c490d667b2338a714665d67920ab4f8f7aeaef63c8d91038e44a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): ext/node/polyfills/child_process.ts:725 \u00B7 ext/node/polyfills/child_process.ts:756 \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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f4a3782663c60844fa2ac418d43c6f09349269d7272f58ee30973abb327cfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/fast-utf8-stream.js:724 \u00B7 ext/node/polyfills/internal/streams/fast-utf8-stream.js:758 \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":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd48087c5f48c834da175be50c4cdbee5042787b2617fbcf454eb064116e4d2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4 locations): ext/node/polyfills/path/_posix.ts:370 \u00B7 ext/node/polyfills/path/_posix.ts:450 \u00B7 ext/node/polyfills/path/_win32.ts:986 \u00B7 ext/node/polyfills/path/_win32.ts:1136 \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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbcd6556e2a5c832e6abd5ac1ee4de1bede7f1f066d605562d60b671fe14e0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): ext/web/06_streams.js:6893 \u00B7 ext/web/06_streams.js:7057 \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":"ext/web/06_streams.js"},"region":{"startLine":6893}}}],"partialFingerprints":{"codehealthFindingId/v1":"0040cac48de18b9e5c13833f135312b3c3e636f61835a4bb5ff14045adcf0531"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ext/fetch/23_request.js:160 \u00B7 ext/fetch/23_request.js: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":"ext/fetch/23_request.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb021e7a8e94d89868cb6f67b79ded5fd75694c9d0d464022159d9fed6f8c4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ext/node/polyfills/dgram.ts:297 \u00B7 ext/node/polyfills/dgram.ts:683 \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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c722e27331a828bf812c78713d13534311006cfe28e7f4c752f3c394072bec28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 4 locations): ext/node/polyfills/internal/buffer.mjs:1511 \u00B7 ext/node/polyfills/internal/buffer.mjs:1540 \u00B7 ext/node/polyfills/internal/buffer.mjs:1649 \u00B7 ext/node/polyfills/internal/buffer.mjs:1675 \u2014 all 4 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef31a4c64b03aa763176cebeed340a69a929ef739dbba5ebc15b66e7d424541"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/sig.ts:307 \u00B7 ext/node/polyfills/internal/crypto/sig.ts:514 \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":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca094a22397f16dbcda0b839182519a6572770bba651924ecfb4432fbb9bdb94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ext/node/polyfills/perf_hooks.js:362 \u00B7 ext/node/polyfills/perf_hooks.js:388 \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":"ext/node/polyfills/perf_hooks.js"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5fddb614b8a960440a842d92af6423470bf999180e9df6f5e1b86ae8f41c30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ext/node/polyfills/testing.ts:1060 \u00B7 ext/node/polyfills/testing.ts:1086 \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":"ext/node/polyfills/testing.ts"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"10702ee961f5ed0153cc55d56e35bdd14f0101505986cd8e896c5e85b4adc13a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ext/web/00_url.js:872 \u00B7 ext/web/00_url.js:901 \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":"ext/web/00_url.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffe134cd7a588207630630dbb81b1e2dc2af23b06223a0e92a2a0c8cb8aaba1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ext/web/01_dom_exception.js:16 \u00B7 ext/web/01_urlpattern.js:21 \u2014 the 2 copies are spread across 2 files, 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":"ext/web/01_dom_exception.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f124e48dbe239393110e2d7589876a26b4c96d2c67a0a95cf2d2c96b12b1b918"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ext/web/02_event.js:253 \u00B7 ext/web/02_event.js:284 \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":"ext/web/02_event.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"81de134c25dcb71cc0f768ea98cd2812e0f7666a3d54ee1b91ea903a5bb5fcab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ext/web/06_streams.js:4621 \u00B7 ext/web/06_streams.js:4753 \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":"ext/web/06_streams.js"},"region":{"startLine":4621}}}],"partialFingerprints":{"codehealthFindingId/v1":"63937d3caa31529f4f0679ba475468a91b604c2be210b70a0ea16928eaa15b90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ext/web/06_streams.js:6373 \u00B7 ext/web/06_streams.js:6521 \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":"ext/web/06_streams.js"},"region":{"startLine":6373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf878d3cb2e245310cd4a0230499a0364782d992fed22d99db8b40ff17cf3e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): libs/core_testing/unit/type_test.ts:17 \u00B7 libs/core_testing/unit/type_test.ts:142 \u2014 the two spans are one implementation copied and then locally edited \u2014 242 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":"libs/core_testing/unit/type_test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa8322883247f0203623c7f0a29c6f71043d608ea876aa8cd1d9b326863de15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): cli/tsc/98_lsp.js:69 \u00B7 cli/tsc/98_lsp.js:137 \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":"cli/tsc/98_lsp.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3b9e93895f937fd1e80938a2395e5e0c4bd946e74dc26b049e9a28bb379fed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:2321 \u00B7 ext/node/polyfills/internal/buffer.mjs:3028 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"965cf18a91818916215710e047c9d2fbaffe4da2d2428fbf3fc1574e5f47eb41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/sig.ts:137 \u00B7 ext/node/polyfills/internal/crypto/sig.ts:252 \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":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3ba21dd440a16753cd5bcbe772747da9685fb4549a06c7f08e4b3ea15d6fe4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): ext/node/polyfills/internal/webstreams/adapters.js:92 \u00B7 ext/node/polyfills/internal/webstreams/adapters.js:408 \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":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"390d2bb4dbe113d07e26a0571fff9e725d9c4beffd30e6d87f4ca9efb3080033"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): ext/web/03_abort_signal.js:342 \u00B7 ext/web/13_message_port.js:88 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 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":"ext/web/03_abort_signal.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51b8308b5c29645b87f6f5414fdb7fe96b77b923f798e182b7b2bee7c3bda4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): ext/web/webtransport.js:371 \u00B7 ext/web/webtransport.js:437 \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":"ext/web/webtransport.js"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb24a6976d63c1b575846f3b8cad3db70879df6cf0518ced1af200ab70703fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): tools/startup_order/generate_linux_function_orderfile.ts:243 \u00B7 tools/startup_order/generate_macos_function_orderfile.ts:218 \u2014 the 2 copies are spread across 2 files, 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":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7575c177ead7e32cd3af505ad8a26af512ed6b948c512bc8d54621372dfc4417"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): ext/fetch/20_headers.js:12 \u00B7 ext/web/06_streams.js:83 \u2014 the 2 copies are spread across 2 files, 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":"ext/fetch/20_headers.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb32c8cc1b2db542b0b22c2108ac71029330d7ed2f9cb5553293c92ddb8e5548"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/keys.ts:613 \u00B7 ext/node/polyfills/internal/crypto/keys.ts:646 \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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"004f732373c83cbaf0d1214b0e2e82540c390e905793f9f0ecc6e36138a7f722"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): ext/node/polyfills/internal/fs/streams.mjs:263 \u00B7 ext/node/polyfills/internal/fs/streams.mjs:473 \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":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c2de8f3f38990895f061cbc0c4a36519847307b4ecffcac7fd8ed722e64bd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): ext/websocket/02_websocketstream.js:232 \u00B7 ext/websocket/02_websocketstream.js:340 \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":"ext/websocket/02_websocketstream.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2507fab6ba0cb44c73b06a19ffa1ed4541d0c7def8da38405319269f858d7151"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): ext/net/01_net.js:349 \u00B7 runtime/js/40_fs_events.js:54 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 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":"ext/net/01_net.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"981437cddbb3d3ee3241055d269778500f37e2cfa1cb41d393ba044c477c664d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/node/polyfills/dns.ts:385 \u00B7 ext/node/polyfills/internal/dns/promises.ts:239 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"282ed30ed4994639614cf4aa01f2694df1d9be74b51b12aeca4ec9f930509a66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/node/polyfills/domain.ts:138 \u00B7 ext/node/polyfills/domain.ts:183 \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":"ext/node/polyfills/domain.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97fce27a70256080ef51c0fd64bbb5b342a90e84c38fae71ca6d48cb513baf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:2733 \u00B7 ext/node/polyfills/internal/buffer.mjs:2757 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf60d76514e3c2c5f646b72270ac95c6471709c1408fa225a01a325f9e62a1e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/node/polyfills/internal/child_process.ts:518 \u00B7 ext/node/polyfills/internal/child_process.ts:542 \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0e38f5afe1e372b561daa72fc55f1bee8a4d8dcdef41d8318a972856a14564"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/node/polyfills/internal/cluster/linkedlist.ts:20 \u00B7 libs/core/02_timers.js:38 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/linkedlist.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb76f495234a8af7d08c2775c2bd76bbf5045e60588ff4b5d38bc2f609d0bf6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/keys.ts:757 \u00B7 ext/node/polyfills/internal/crypto/keys.ts:777 \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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89cebbb9a32d446221ec2f25d1734e129dba0efc9b990968062231bf75bdec2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/node/polyfills/internal/http2/compat.js:668 \u00B7 ext/node/polyfills/internal/http2/compat.js:694 \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":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"de89efe5fd671ac0a5b2e0e63f8d4af43b833d14977592e718268135cf5cac74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/node/polyfills/stream.ts:87 \u00B7 ext/node/polyfills/stream.ts:107 \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":"ext/node/polyfills/stream.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe6b58836a76d1deaba73fdf4ef4dc6b7a9c156324e0fc50dae90e4c34a1067"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/node/polyfills/vm.js:120 \u00B7 ext/node/polyfills/vm.js:486 \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":"ext/node/polyfills/vm.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"050b07482e6626e5f4a2df79680c4d64758586b14af45ad7cb5589f915cdeeb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/web/02_timers.js:46 \u00B7 ext/web/02_timers.js:79 \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":"ext/web/02_timers.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"690a3ddcbded4df078741f8b43c6fb842d652ea30bf29aa9434e303b2774daca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ext/web/06_streams.js:4375 \u00B7 ext/web/06_streams.js:4469 \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":"ext/web/06_streams.js"},"region":{"startLine":4375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5df334d85d408c614f364ef961e3cf2f9fee1724fa40d4821a8451bad18b83e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): ext/fetch/23_request.js:12 \u00B7 ext/web/00_url.js:29 \u00B7 ext/web/10_filereader.js:24 \u2014 the 3 copies are spread across 3 files, 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":"ext/fetch/23_request.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea6f2636b031691ca86546808103fd15161ce9ade2e4bcba4e8c7bc1074dba0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 8 locations): ext/node/polyfills/assert.ts:511 \u00B7 ext/node/polyfills/assert.ts:533 \u00B7 ext/node/polyfills/assert.ts:554 \u00B7 ext/node/polyfills/assert.ts:575 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 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":"ext/node/polyfills/assert.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8479d211599c11ae92ac59da0cc329e0f0aca1a277eaed07c9e3e5b680b87c70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:3285 \u00B7 ext/node/polyfills/http2.ts:3377 \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3285}}}],"partialFingerprints":{"codehealthFindingId/v1":"879ff6f73b76d415c16c4c6b15bfd6b787026fb987aec25edbfa7aab7bd12d00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:3265 \u00B7 ext/node/polyfills/internal/buffer.mjs:3287 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":3265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e020c7a2a54d6f41c9c3d3dc81f380cf268c663693624de616e7825c87874780"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/duplex.js:118 \u00B7 ext/node/polyfills/internal/streams/writable.js:487 \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":"ext/node/polyfills/internal/streams/duplex.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cab4bd84c032dbb06162d472d68b777d42776aaea7aa667743d1388c561a36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/operators.js:398 \u00B7 ext/node/polyfills/internal/streams/operators.js:422 \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":"ext/node/polyfills/internal/streams/operators.js"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a74605c522c1103a34877657382534d5ee168492736280952752187d79c18a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): ext/node/polyfills/testing.ts:2146 \u00B7 ext/node/polyfills/testing.ts:2169 \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":"ext/node/polyfills/testing.ts"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4043d4eff93e323ea1d13f636da422a4bbc25cc091b87124d4091d428fb4468"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): ext/node/polyfills/wasi.ts:703 \u00B7 ext/node/polyfills/wasi.ts:797 \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":"ext/node/polyfills/wasi.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cfe9b1fe7cf3d2e54aeec24b04ee1707dd4156f2f8919a889cc47deb6f0659"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 5 locations): ext/webgpu/01_webgpu.js:363 \u00B7 ext/webgpu/01_webgpu.js:497 \u00B7 ext/webgpu/01_webgpu.js:574 \u00B7 ext/webgpu/01_webgpu.js:793 \u00B7 \u002B1 more site(s) not listed \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":"ext/webgpu/01_webgpu.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"534c79e6aa5913b663cb2a7663b91994e0072791ea853811e0dc7e594bd036f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 9 locations): ext/webgpu/01_webgpu.js:512 \u00B7 ext/webgpu/01_webgpu.js:532 \u00B7 ext/webgpu/01_webgpu.js:552 \u00B7 ext/webgpu/01_webgpu.js:669 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"ext/webgpu/01_webgpu.js"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"484e1c71f03dd1a6af032f8b6f43b8f0a401b04ecd1c3e70dc27acaa40e5b55a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): ext/net/01_net.js:448 \u00B7 ext/net/01_net.js:476 \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":"ext/net/01_net.js"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9c3104d125bbdb17e6f3ff6b09b6cc2939496ec22885ed73f1f19810649940"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): ext/node/polyfills/internal/crypto/cipher.ts:819 \u00B7 ext/node/polyfills/internal/crypto/cipher.ts:839 \u00B7 ext/node/polyfills/internal/crypto/cipher.ts:860 \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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7bc00edb02cd8c113fa9558a14797fad73e3490e66f121943945678f800518"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): ext/node/polyfills/internal/http2/util.ts:285 \u00B7 ext/node/polyfills/internal/http2/util.ts:303 \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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2713aeb38d7e10f08ce208a613f6227c02d6a1d368629982aeeba3d4b844f490"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): ext/node/polyfills/path/_win32.ts:792 \u00B7 ext/node/polyfills/path/_win32.ts:1056 \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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"60813dd542f35433b73f1d7e2e5b84a2a08ac93afda5ffc09e61235959d9e5bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): ext/node/polyfills/zlib.js:728 \u00B7 ext/node/polyfills/zlib.js:753 \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":"ext/node/polyfills/zlib.js"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae34ad64862bd255fd92ed4aec048e57b50802e652c501548af1e20cc277f63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): ext/process/40_process.js:555 \u00B7 ext/process/40_process.js:707 \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":"ext/process/40_process.js"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40b25c3c48d732a747f01dea75d3855e68418786a12df9fe9e91c1f6eb7a974"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): ext/web/06_streams.js:8269 \u00B7 ext/web/06_streams.js:8319 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":8269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f34522b3ee8a321450e6ef998f76aceb0d3dc808e54dfff95111bbcf32e6e3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): ext/webidl/00_webidl.js:1563 \u00B7 ext/webidl/00_webidl.js:1581 \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":"ext/webidl/00_webidl.js"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8576d7dcb4a33458a07d08d4b34254d77a1775b15911494379b6c486c45a9407"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): runtime/js/99_main.js:481 \u00B7 runtime/js/99_main.js:499 \u00B7 runtime/js/99_main.js:517 \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":"runtime/js/99_main.js"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27268b41cc4fc812d956cfc0d0652af51ff4f01a5c781396b2bbd491de3e605"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): cli/js/jupyter_kernel.js:856 \u00B7 cli/js/jupyter_kernel.js:1009 \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":"cli/js/jupyter_kernel.js"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87c1983080f4697046dd9ffbfed70cf54ad3b5c508007428e1156a906cdbe6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ext/fetch/20_headers.js:662 \u00B7 ext/web/00_url.js:1229 \u2014 the 2 copies are spread across 2 files, 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":"ext/fetch/20_headers.js"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c27ddcca7fb2021109e7cd91062fcc43b6a40dc04ab1fefff11ecd768928ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ext/node/polyfills/_http_outgoing.ts:1555 \u00B7 ext/node/polyfills/_http_outgoing.ts:1639 \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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"77951a11e72b0c75a7159e4b212fbbe24fe1409efd662cb9b7f657eedada006a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:796 \u00B7 ext/node/polyfills/http2.ts:833 \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2f66813e28865f94f84c9548e340b6181c6f9e40b96981c0a9a5782ac2885a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:3013 \u00B7 ext/node/polyfills/internal/validators.mjs:205 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"7034ec671febf4028400312a843f55de7111762484923f80e3fb674d7f036a9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/random.ts:278 \u00B7 ext/node/polyfills/internal/crypto/random.ts:296 \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":"ext/node/polyfills/internal/crypto/random.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e825a111b1f5be78cf3bc4044345eae419411c4d8cfee9abd1156cd18c1754f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ext/node/polyfills/internal/fs/utils.mjs:726 \u00B7 ext/node/polyfills/internal/fs/utils.mjs: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":"ext/node/polyfills/internal/fs/utils.mjs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee474ae9deb1c9960d59141cabaa5ac48f547a374402630b0a21fe00e9f07ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ext/node/polyfills/worker_threads.ts:1358 \u00B7 ext/node/polyfills/worker_threads.ts:2319 \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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5141d135d02dfc3e327b55157d3996e0d3aa51d84d3e2becadbc06546560935"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5 locations): ext/web/01_broadcast_channel.js:205 \u00B7 ext/web/03_abort_signal.js:319 \u00B7 ext/web/08_text_encoding.js:262 \u00B7 ext/web/09_file.js:606 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, 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":"ext/web/01_broadcast_channel.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a49e149be90bc8644fce0b97ca07f25ae6730f62997a604bcaf156a94edf5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ext/web/06_streams.js:5848 \u00B7 ext/web/06_streams.js:6421 \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":"ext/web/06_streams.js"},"region":{"startLine":5848}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a856539c518faf7d6c4277f47a11a94ff9181a84bd596f1a0d887ff3307f201"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ext/web/06_streams.js:7882 \u00B7 ext/web/06_streams.js:7909 \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":"ext/web/06_streams.js"},"region":{"startLine":7882}}}],"partialFingerprints":{"codehealthFindingId/v1":"892c444e6a356ce463edd6e01e5dc3518472b83943b53f196ea68a4ce04af99e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ext/web/15_performance.js:301 \u00B7 ext/web/15_performance.js:360 \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":"ext/web/15_performance.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aadd5aeec14f3c79fed5af141f828b7b5dae03b0246795b887af09c97a458d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): ext/web/17_geometry.js:26 \u00B7 ext/web/17_geometry.js:54 \u00B7 ext/web/17_geometry.js:101 \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":"ext/web/17_geometry.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e115a34379808803c228bb67096896f9371490c6cabcada8a998330c7f8be87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): libs/core_testing/unit/stats_test.ts:120 \u00B7 libs/core_testing/unit/stats_test.ts:138 \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/core_testing/unit/stats_test.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b03c25ee0f2b90f6a303b11cf994c604b263061566869a33a22057cbb705172"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): runtime/js/10_permissions.js:204 \u00B7 runtime/js/10_permissions.js:225 \u00B7 runtime/js/10_permissions.js:246 \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":"runtime/js/10_permissions.js"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49250e2072389436468aebdd35b8565251dbbf7444533555eaa5fee6f034180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/http/00_serve.ts:752 \u00B7 ext/http/00_serve.ts:936 \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":"ext/http/00_serve.ts"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fc0b464c806b719faaf2ae16c80b5489ab171f2472fa80b2214c543edb70b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): ext/node/polyfills/_readline.mjs:170 \u00B7 ext/node/polyfills/readline/promises.ts:91 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 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":"ext/node/polyfills/_readline.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6eefd9fe09f2701ce264c137f0b4b8848be75bc915f8242d2766c79694bd46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:1488 \u00B7 ext/node/polyfills/fs.ts:3104 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcfb044f3a4f99a309b2afd24034a6e8ae82aba67ea30472924edf9cf0ab512"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:2795 \u00B7 ext/node/polyfills/fs.ts:2878 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":2795}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9fab548b7f5a8d06fcbf2ce101ea53c547594265ff751f66f1017b3d8b814d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:5198 \u00B7 ext/node/polyfills/http2.ts:5245 \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":5198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb6e2c594624f10efe59fa9c70c66459d20829ed90063709b738dc6bde5a4c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): ext/node/polyfills/internal/async_hooks.ts:451 \u00B7 ext/node/polyfills/internal/async_hooks.ts:488 \u2014 the two spans are one implementation copied and then locally edited \u2014 125 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":"ext/node/polyfills/internal/async_hooks.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edc8717fc09e68ce12e3279aaab3c8bbb5e791af3a555c2c56edf250a56ef71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/node/polyfills/internal/child_process.ts:858 \u00B7 ext/node/polyfills/internal/child_process.ts:874 \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ede69bdd2fa6d4623504703f59c1f126f659ca27506c4f4b897ab920640821"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/hkdf.ts:139 \u00B7 ext/node/polyfills/internal/crypto/hkdf.ts:168 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"ext/node/polyfills/internal/crypto/hkdf.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"748ea77c7462fa3014adb671fc031d8edca1ef06c46f475a2bd39d6789b70acc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): ext/node/polyfills/internal/dns/promises.ts:492 \u00B7 ext/node/polyfills/internal/dns/promises.ts:510 \u00B7 ext/node/polyfills/internal/dns/promises.ts:528 \u00B7 ext/node/polyfills/internal/dns/promises.ts:546 \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":"ext/node/polyfills/internal/dns/promises.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"912730df82458622a15411bbf2dc0fb7d25732219aac7f7f522484828cf34d1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/writable.js:301 \u00B7 ext/node/polyfills/internal/streams/writable.js:321 \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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff785380f738fbf4a005d6ea22d34245a2d740375bec78cd54ecad98f9a731f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/writable.js:1145 \u00B7 ext/node/polyfills/internal/streams/writable.js:1168 \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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"049c62934b245d02280c6b074a4b02109a45002a7db624befe948c481d0cfd96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): ext/node/polyfills/internal/tty.js:298 \u00B7 ext/node/polyfills/tty_esm.ts:25 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 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":"ext/node/polyfills/internal/tty.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"148e1b853a7c60dda792c7df05b7389b3cbbad478b15676715d5a79078008936"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/node/polyfills/process.ts:285 \u00B7 ext/node/polyfills/process.ts:318 \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":"ext/node/polyfills/process.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f68c9d64ddbe9ae0e56702baa65c11f72d6dec6721510c024b5c1807e28b2be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/web/05_base64.js:24 \u00B7 ext/web/05_base64.js:45 \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":"ext/web/05_base64.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa89a7df4c3b96df8412664cbdd387cb045ff9f610818c9f02c24340ba1c21e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/web/06_streams.js:2588 \u00B7 ext/web/06_streams.js:2798 \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":"ext/web/06_streams.js"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd0bc99ef8dcce6436577686f110d3f7cc6617fe2371c1d0cc52e7cb8684920"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/web/06_streams.js:4925 \u00B7 ext/web/06_streams.js:5013 \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":"ext/web/06_streams.js"},"region":{"startLine":4925}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4509c6e2ea56ba852b4d181ed80c64ef3b5f2d85740c078def87c78dd05201d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/webgpu/01_webgpu.js:665 \u00B7 ext/webgpu/01_webgpu.js:727 \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":"ext/webgpu/01_webgpu.js"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c2f2a60ab32fc98b26f540471c69507a0b26a5487d892dfbba761de704d491"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ext/webidl/00_webidl.js:615 \u00B7 ext/webidl/00_webidl.js:640 \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":"ext/webidl/00_webidl.js"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"86af27e10ba4799f67cc9a986be09a1544808e9c81111e0e2c3243d0e1033bb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): libs/core/01_core.js:337 \u00B7 libs/core/01_core.js:479 \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/core/01_core.js"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2300c97404ff5689e5d83fcb7c343cab1f8fa5bd1fea94c67e541472ff6b7a0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): libs/core_testing/unit/immediate_test.ts:115 \u00B7 libs/core_testing/unit/timer_test.ts:81 \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":"libs/core_testing/unit/immediate_test.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba94953ee53f57355acfec4090b05a4ed9efc751a88d2c122f2510d34041deb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): tools/util.js:39 \u00B7 tools/util.js:137 \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":"tools/util.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49038f7fcd9ca12d3ec5641de322154c531d5983981fa016c449ea61feb424e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): cli/js/jupyter_kernel.js:173 \u00B7 cli/js/jupyter_kernel.js:214 \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":"cli/js/jupyter_kernel.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa6762de74ac420ef0deea7a1020238d7da5af6c5060749858a2fef7fef72be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): ext/node/polyfills/_brotli.js:43 \u00B7 ext/node/polyfills/internal/child_process.ts:1899 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"ext/node/polyfills/_brotli.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7005e646cdcc2ff560fe3a82edb04d1b7d4a7ffed0b19ffdc92586813309821"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/_http_client.js:87 \u00B7 ext/node/polyfills/internal/crypto/diffiehellman.ts:44 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"caac01097f9403a09500c2f90bc4dfdad8c5a6ef180c4cdb47b0014e441cf07b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:1514 \u00B7 ext/node/polyfills/fs.ts:1561 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a965ac89e5dd44a749a5b8f4992945c70a254f94b6e1f91497dce880731249"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:1541 \u00B7 ext/node/polyfills/fs.ts:1636 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ac0b10a57ce8baf6b4420eef401001774df12af82bae51d2b7e672c0984268"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:1595 \u00B7 ext/node/polyfills/http2.ts:1620 \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee1173ba59828fd37f0661044f4595df1aa67814131ab6cfe860edcb55bf876"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/internal/blocklist.mjs:124 \u00B7 ext/node/polyfills/internal/blocklist.mjs:158 \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":"ext/node/polyfills/internal/blocklist.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"679c5ecc1d6670ee5b201334b81c8581afba4b6e27bd82031a95194bca6d0c55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:1818 \u00B7 ext/node/polyfills/internal/buffer.mjs:1843 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ee6eeb5633c1baa87bfa14280bfead216969ff7e9cce4dd7012d776a9bc4fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:3084 \u00B7 ext/node/polyfills/internal/buffer.mjs:3243 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc98931728d0074afd830d52ece5dc7bbb9952208bf0a50b0566a212850c9717"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/keygen.ts:156 \u00B7 ext/node/polyfills/internal/crypto/keygen.ts:189 \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":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"086f046d20d91a5c6d585efb287a9fca739917eec385c41a09d2042964fde65f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): ext/node/polyfills/internal/dns/promises.ts:432 \u00B7 ext/node/polyfills/internal/dns/promises.ts:451 \u00B7 ext/node/polyfills/internal/dns/promises.ts:608 \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":"ext/node/polyfills/internal/dns/promises.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"3413fc62f418eb2574ed43a15126d95ec7203cc447d26fc2bd2cd287e6c69c8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/internal/fixed_queue.ts:108 \u00B7 libs/core/00_infra.js:510 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fixed_queue.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c559b509eabbe30ff8c2041d67cb1406ee54e03a5c47156b1696e1e15e6daee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/from.js:116 \u00B7 ext/node/polyfills/internal/streams/from.js:170 \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":"ext/node/polyfills/internal/streams/from.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90629f6abfe6c3e65c595928402443841d31b61d75c71197754f5488e50eb95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/operators.js:83 \u00B7 ext/node/polyfills/internal/streams/operators.js:306 \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":"ext/node/polyfills/internal/streams/operators.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2fad681884c5275614f0974f9e3353977b563c9b5b2d56312703ec73895204"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/internal/util/comparisons.ts:332 \u00B7 ext/node/polyfills/internal/util/comparisons.ts:381 \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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de5f16aeb8818808b1424e62a2600ef3cd3480137693a51427dc84f9fb53246"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/path/_win32.ts:622 \u00B7 ext/node/polyfills/path/_win32.ts:640 \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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8c448cfcb952b2f1ec37261d6f6dd42b8a47ea1e204bfbd6a5cd7f5f0fc3f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/node/polyfills/worker_threads.ts:2137 \u00B7 ext/node/polyfills/worker_threads.ts:2178 \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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":2137}}}],"partialFingerprints":{"codehealthFindingId/v1":"00abfe2f28f5906afba1d3488581c526b25f7f7f494a95b7429543ce17691d30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/web/01_dom_exception.js:278 \u00B7 ext/web/01_dom_exception.js:293 \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":"ext/web/01_dom_exception.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1cc54bed008bc895ac4532995e5f82e95ee818936f14abf5bb3e67117e1393"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ext/web/09_file.js:751 \u00B7 ext/web/09_file.js:793 \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":"ext/web/09_file.js"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e01117778c8d2a6d95fdcf46afb79c0eb5314841c8cb77faa585169ba402067"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 17 locations): ext/webgpu/01_webgpu.js:203 \u00B7 ext/webgpu/01_webgpu.js:307 \u00B7 ext/webgpu/01_webgpu.js:351 \u00B7 ext/webgpu/01_webgpu.js:370 \u00B7 \u002B13 more site(s) not listed \u2014 all 17 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":"ext/webgpu/01_webgpu.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5dd775ee4a06fa1530ba0f23316f35f1f19e3909040401db389c287a5829ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): ext/webgpu/01_webgpu.js:82 \u00B7 ext/websocket/02_websocketstream.js:502 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"ext/webgpu/01_webgpu.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc160a8e714fc98d6f14c070216a3ceb5594a821fdd52c9a20743ca3712e711e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 10 locations): libs/core/00_infra.js:223 \u00B7 libs/core/00_infra.js:243 \u00B7 libs/core/00_infra.js:263 \u00B7 libs/core/00_infra.js:283 \u00B7 \u002B6 more site(s) not listed \u2014 all 10 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":"libs/core/00_infra.js"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"501aa32b7dcb9d5520274ce65feaab9fb60a123ecb2b1f18b0d320d6b020dd64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): libs/core/00_primordials.js:123 \u00B7 libs/core/00_primordials.js:150 \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/core/00_primordials.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8a46a703717a1323132425d0dc9ea137b5c168d7501c3fe0cc157f61046673"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): cli/js/40_jupyter.js:281 \u00B7 cli/js/40_jupyter.js:393 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"cli/js/40_jupyter.js"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf7b1d84a5f2bee92bf8003894fb03fbfffbbbfe75da29ec3ce376042c8e5b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/io/12_io.js:100 \u00B7 ext/node/polyfills/fs.ts:702 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/12_io.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd9cd58270501860b08636f9425f9b73c754e661c08b4c4d5b0debbc29ff7d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/net/01_net.js:241 \u00B7 ext/net/01_net.js:263 \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":"ext/net/01_net.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0616d791207320b009cf1bce5d4ca9980ac93988c77aa3627777ad4b96cf12ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/net/01_net.js:376 \u00B7 ext/net/01_net.js:553 \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":"ext/net/01_net.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c3fc72fe791842abb1f442c712620cf276ee4aba7b2912c89789df6b58033f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/01_require.js:594 \u00B7 ext/node/polyfills/01_require.js:656 \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":"ext/node/polyfills/01_require.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78c2909096608568f796084b22e5812ae10cbb8eab08809e2a3c97febab8aed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): ext/node/polyfills/_readline.mjs:499 \u00B7 ext/node/polyfills/internal/readline/interface.mjs:1292 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"ext/node/polyfills/_readline.mjs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f360fb3c946157dedd373787c0cac2a1ced5d27aa17ef8b7ee9311de4993388"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): ext/node/polyfills/dgram.ts:234 \u00B7 ext/node/polyfills/net.ts:2501 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7580bd9151d92b8a7de3bfc68cd269624dc346d58ee6d5996508221f28d1037"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:1990 \u00B7 ext/node/polyfills/fs.ts:2044 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad987b13b76f7edacf8ff579e6689506f08f013bda46d236702903b44a8d47ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:3317 \u00B7 ext/node/polyfills/http2.ts:3404 \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3317}}}],"partialFingerprints":{"codehealthFindingId/v1":"5640d6a35b6e587d58095e97c6d87e81d91b3a72d60fc3923f4ff03365180031"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/internal/child_process.ts:565 \u00B7 ext/node/polyfills/internal/child_process.ts:580 \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"936892d7a11c0b342434af310dab9c7a7cf347fde01bfb8f6861dc3fd03c2afd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/keygen.ts:336 \u00B7 ext/node/polyfills/internal/crypto/keys.ts:441 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd6cea4ce46c552b09accde0d97e52b39ae1297c581ecde4f92f24d3e6deac4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/keys.ts:797 \u00B7 ext/node/polyfills/internal/crypto/keys.ts:811 \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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"0984151704f9f729ea2a218787a0efa37f5470d78328e38fe545912d9cbd83c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/internal/event_target.mjs:126 \u00B7 ext/node/polyfills/internal/event_target.mjs:794 \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":"ext/node/polyfills/internal/event_target.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aa829cbc34e15955db64a3abd67a6ce70fbb505319c456c24faa07824f29e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/internal/fs/streams.mjs:213 \u00B7 ext/node/polyfills/internal/fs/streams.mjs:402 \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":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeec32c9636148bda3e3802db18d8237ac7ecf96772033915556630ccf36944"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/internal/fs/streams.mjs:501 \u00B7 ext/node/polyfills/internal/fs/streams.mjs:535 \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":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"607bed8dbd20a431daac3f226a9c9c12a4f9fce6b9245b8f20e9a28001c19922"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/internal/util/comparisons.ts:738 \u00B7 ext/node/polyfills/internal/util/comparisons.ts:951 \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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f1f656e1755fc001b1575db9fb948644414306deb7a6071efbf8e26d00b29b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/internal/webstreams/adapters.js:252 \u00B7 ext/node/polyfills/internal/webstreams/adapters.js:388 \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":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"431cf516949b9814399681cccffa6fa38d8e3ae3c239d36f86494e0e949b5899"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/internal_binding/cares_wrap.ts:568 \u00B7 ext/node/polyfills/internal_binding/cares_wrap.ts:592 \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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3af05392978c068f1f65fd3a62e39f182c843dea55bf0e9b06bd4e9b864c01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/testing.ts:2828 \u00B7 ext/node/polyfills/testing.ts:2848 \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":"ext/node/polyfills/testing.ts"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6d0da3eb4cdecf1bc2679cf5e3c1f1fc5d5ff1ff52736e017fb1660ea04a90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/node/polyfills/worker_threads.ts:864 \u00B7 ext/node/polyfills/worker_threads.ts:878 \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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c891cf53c26d91622605656e45d2524d277f241d885a794a40a0d9d8cf2c83f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/web/00_url.js:1011 \u00B7 ext/web/00_url.js: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":"ext/web/00_url.js"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d045aad5b67a85379bce074a75b30a02ba15161d0d73880e77d8f5dfed83f37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/web/06_streams.js:4164 \u00B7 ext/web/06_streams.js:4183 \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":"ext/web/06_streams.js"},"region":{"startLine":4164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c69dc871d1843a1c6d07b3ae27e91160ab1013c26c3aab8407234576d7998c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/web/06_streams.js:4277 \u00B7 ext/web/06_streams.js:4443 \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":"ext/web/06_streams.js"},"region":{"startLine":4277}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fbe84f810eec2a000d0913eec29ed99a061252781742f23b77c769d68ff458"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/web/06_streams.js:6202 \u00B7 ext/web/06_streams.js:6242 \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":"ext/web/06_streams.js"},"region":{"startLine":6202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6690c22eaeae825c358c91f28d816ad69862ef4914940a4ea35d81a05ad3d01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ext/web/webtransport.js:344 \u00B7 ext/web/webtransport.js:413 \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":"ext/web/webtransport.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"875d1e73f1e7c3ac1cbef1f09b92dc7dc0732f34bf0039991222e8d6e85a7f5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): runtime/js/99_main.js:936 \u00B7 runtime/js/99_main.js:1208 \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":"runtime/js/99_main.js"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef78942c33a2e60eb2b7daaa4baac49dcc4a2da28b9977bd6897e2f1ef83887"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): tools/release/promote_to_release.ts:110 \u00B7 tools/release/promote_to_release.ts:186 \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":"tools/release/promote_to_release.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae70eb6973b3751861c659ac5b23dac7dbbe56a0c7e8e46709c304577a07e2a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): cli/js/40_lint_selector.js:979 \u00B7 cli/js/40_lint_selector.js:1012 \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":"cli/js/40_lint_selector.js"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a288e0864a9c281cd49e29825859f8ddc425546df1eb5ace62bc8413ecb355"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/fetch/26_fetch.js:791 \u00B7 ext/fetch/26_fetch.js:806 \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":"ext/fetch/26_fetch.js"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a2d5816a14e913324fa09cff22b5b42a72b49b91c45b134d1197ff3f31993e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/http/01_http.js:310 \u00B7 ext/http/01_http.js:335 \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":"ext/http/01_http.js"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7ed4c7c76faf83ba091fee76ada207961446bff075872363215b594a825a32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): ext/node/polyfills/01_require.js:547 \u00B7 ext/node/polyfills/01_require.js:623 \u00B7 ext/node/polyfills/01_require.js:710 \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":"ext/node/polyfills/01_require.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac43689d7e74e4a3c6b90393fe53b09b7686665ffe2626ff9dc4c1192c0652c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): ext/node/polyfills/_http_incoming.js:118 \u00B7 ext/node/polyfills/_http_incoming.js:138 \u00B7 ext/node/polyfills/_http_incoming.js:158 \u00B7 ext/node/polyfills/_http_incoming.js:178 \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":"ext/node/polyfills/_http_incoming.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c499f01a9454b255cbeb45327f00165200814d9f010615eb2305788bc9d611ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:1834 \u00B7 ext/node/polyfills/internal/buffer.mjs:1859 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e3995acd3c2841867a2ce9dbd7e165d38b64a38a17b1843f11e7fd7b4c70cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/pbkdf2.ts:156 \u00B7 ext/node/polyfills/internal/crypto/pbkdf2.ts:183 \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":"ext/node/polyfills/internal/crypto/pbkdf2.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d327e15146ec0a668985898dd1e948b03573ebef5fb95167e45c7276e0d898"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/node/polyfills/internal/errors.ts:577 \u00B7 ext/node/polyfills/internal/errors.ts:591 \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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"7548ccc0c29afa7e76a6f923baa6d2b080b065702abaeb6086a8572be889a380"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/node/polyfills/internal/fs/streams.mjs:365 \u00B7 ext/node/polyfills/internal/fs/streams.mjs:556 \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":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e11f0196818997e2ab8de0dd3be4e253575a837ec2d5bf59c3eeae99c3af24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/node/polyfills/internal/fs/utils.mjs:300 \u00B7 ext/node/polyfills/internal/fs/utils.mjs:336 \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":"ext/node/polyfills/internal/fs/utils.mjs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc562ff2ccce59a8a32b57ff7a8b19d5f62b2461ba6eeda130f1ce00b06ce61e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): ext/node/polyfills/internal/http2/util.ts:253 \u00B7 ext/node/polyfills/internal/http2/util.ts:268 \u00B7 ext/node/polyfills/internal/http2/util.ts:486 \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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"274186ab82016b9c1f0f18fcc8de360da4cbfc28cef0bf4b309d102ac7636a5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/fast-utf8-stream.js:631 \u00B7 ext/node/polyfills/internal/streams/fast-utf8-stream.js:672 \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":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe036dbeb3d7136ec236bcf7393237d7402aba3a6a2606e7c73fab6f7c2da73d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/node/polyfills/internal_binding/udp_wrap.ts:519 \u00B7 ext/node/polyfills/internal_binding/udp_wrap.ts:538 \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":"ext/node/polyfills/internal_binding/udp_wrap.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23fa17aa8742c108d8af303c7b16fc3df781c3be9c461e80475ebafa080cb49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/node/polyfills/repl.ts:478 \u00B7 ext/node/polyfills/repl.ts:510 \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":"ext/node/polyfills/repl.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04c599391277434b46daa39f65c4ed96fcb9519861aa9fe078f543e87c487cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/telemetry/telemetry.ts:1080 \u00B7 ext/telemetry/telemetry.ts:1096 \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":"ext/telemetry/telemetry.ts"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d58dc220c72ce7df18fc43fddbd71bd46697cafd7e94b15c0e65e711f72b8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/web/06_streams.js:1974 \u00B7 ext/web/06_streams.js:2282 \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":"ext/web/06_streams.js"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d54aded11258e0f591849622b2b8f710b03d525b2b47d40ac2a3f15aa2a570f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/web/06_streams.js:6571 \u00B7 ext/web/06_streams.js:6855 \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":"ext/web/06_streams.js"},"region":{"startLine":6571}}}],"partialFingerprints":{"codehealthFindingId/v1":"732cfd1b8f142486db2818d9f5c03d3d2ae0a4ff28b39c0a717128862c03a80f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ext/web/15_performance.js:773 \u00B7 ext/web/15_performance.js:790 \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":"ext/web/15_performance.js"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"c208cc8763cd2a7a6c9309956c657976e9c5f0441873a3b90be307ddeb875b88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): cli/js/40_lint.js:287 \u00B7 cli/js/40_lint.js:308 \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":"cli/js/40_lint.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"faddaa5f3fbd02e59957d6ccec8a60fbfb95c32109e76eda1c9fbbc25ec6320b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): cli/js/40_lint_selector.js:527 \u00B7 cli/js/40_lint_selector.js:559 \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":"cli/js/40_lint_selector.js"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83b96526e0c3bd19423483df6e0fb915f6ae01189624132a48f5c3ef665b03b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): cli/js/jupyter_kernel.js:889 \u00B7 cli/js/jupyter_kernel.js:1032 \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":"cli/js/jupyter_kernel.js"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fd18a885de0745a0b14bc3ad2b82e39117c44772b4264dce3b9605f61382b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/fetch/23_request.js:31 \u00B7 ext/fetch/23_response.js:18 \u2014 the 2 copies are spread across 2 files, 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":"ext/fetch/23_request.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba719097c41ec1173ed4c54e9d2f3de4555ddc9d3c8b30c2ae158e5384c1d6f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): ext/fs/30_fs.js:708 \u00B7 ext/io/12_io.js:203 \u00B7 ext/io/12_io.js:238 \u2014 the 3 copies are spread across 2 files, 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":"ext/fs/30_fs.js"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a4f50d21346ab3b1d186deae2c481fb11b80a5903875249e4b8e45b7aeaaf1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/http/01_http.js:384 \u00B7 ext/http/02_websocket.ts:128 \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":"ext/http/01_http.js"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e15291542c36e974da3403fc37c46001098e1e53a31a1697cd89113d646025a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/01_require.js:751 \u00B7 ext/node/polyfills/01_require.js:851 \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":"ext/node/polyfills/01_require.js"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"af93cbde5fbd70afa5f2ab2f8b545af7961e02caf86db52fbec2e45ab6c851af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/_brotli.js:85 \u00B7 ext/node/polyfills/_brotli.js:118 \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":"ext/node/polyfills/_brotli.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd0308a7c8e7ef1dd67fc96cf89fc0775511f4030e196d4e4cdd491838f6525"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): ext/node/polyfills/_events.mjs:544 \u00B7 ext/node/polyfills/internal/event_target.mjs:520 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc23b3dde39551585c647a6e710a49243b8eff9e78f06cb4f94fa6867ee9892"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_copy.ts:30 \u00B7 ext/node/polyfills/_fs/_fs_copy.ts:77 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 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":"ext/node/polyfills/_fs/_fs_copy.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"113835c7c47144f6fed44ee83011909abbd2e1397717f6ac7faf2ae2ff51150e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_fstat.ts:56 \u00B7 ext/node/polyfills/_fs/_fs_lstat.ts:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"ext/node/polyfills/_fs/_fs_fstat.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e4e48d6e4a037e4a2fd379656bfa2f99baee3d994732f6c585d2ed5d0777fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): ext/node/polyfills/_fs/_fs_lutimes.ts:28 \u00B7 ext/node/polyfills/fs.ts:1488 \u00B7 ext/node/polyfills/fs.ts:3104 \u2014 the 3 copies are spread across 2 files, 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":"ext/node/polyfills/_fs/_fs_lutimes.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38230f0aaedcfcd2a98fb88bde359f72b46a34551f33e9392bf714aac612472"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:1448 \u00B7 ext/node/polyfills/fs.ts:3052 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb59ae5a860537072d620915d6239199546c8d920d95cb660062253c98216234"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:2633 \u00B7 ext/node/polyfills/fs.ts:2679 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbdfa41b5e88b7fa7fdb471537e3f7b1e1e47da9e0ef45da84217e490f863dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:2990 \u00B7 ext/node/polyfills/fs.ts:3015 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":2990}}}],"partialFingerprints":{"codehealthFindingId/v1":"6050c172463c46f9a5a9bf92c4ec36f80c3ae8e0b811eb0fbd56b98d5c2290c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:5169 \u00B7 ext/node/polyfills/http2.ts:5230 \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":5169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0668475ac2ba1f44e8e91cb50825ff8c16a14d924bd64205c82ff989e22fe459"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:1609 \u00B7 ext/node/polyfills/internal/buffer.mjs:1627 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1535497e792d93446edc691e1e5ed5b42d1ff3b06f37cc9932e5eb58356ff98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:2513 \u00B7 ext/node/polyfills/internal/buffer.mjs:2575 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5d2fd05d1561d38d70fcb2cd71039ca84a1d359e53697d680c964d67d3c986"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/internal/child_process.ts:2584 \u00B7 ext/node/polyfills/internal/child_process.ts:2655 \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"958dad6e97c4456ddf02014f04a1af9a8087abda3ac93d6c9a555a8797e8076d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): ext/node/polyfills/internal/cluster/round_robin_handle.ts:119 \u00B7 ext/node/polyfills/internal/cluster/shared_handle.ts:70 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"ext/node/polyfills/internal/cluster/round_robin_handle.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a259804ebe8c2745b6a75d2f399e20b9e815a59558113e657535dcae93ef824a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/diffiehellman.ts:322 \u00B7 ext/node/polyfills/internal/crypto/diffiehellman.ts:340 \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":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c100c9e255ec1de09458c93f44094119965a54cb21660e054dcddacac10ea9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/internal/errors.ts:226 \u00B7 ext/node/polyfills/internal/errors.ts:355 \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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd80cf643e0b0408932f2b2869936d34349cba50c3d56a1fd0a42aa186fa1d25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): ext/node/polyfills/internal/event_target.mjs:163 \u00B7 ext/node/polyfills/internal/event_target.mjs:183 \u00B7 ext/node/polyfills/internal/event_target.mjs:203 \u00B7 ext/node/polyfills/internal/event_target.mjs:256 \u2014 all 4 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":"ext/node/polyfills/internal/event_target.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf36b847deb2edc7f4878191c1b4b30b3f2465923249887de13339c4fcdd174"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/internal/readline/interface.mjs:924 \u00B7 ext/node/polyfills/internal/readline/interface.mjs:937 \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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cd4b6783ccd87a522489620bb0646612820a818cf8067eae5db41b2f093166"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/readable.js:537 \u00B7 ext/node/polyfills/internal/streams/readable.js: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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba34c05283408c91efc3735e5ccea7d366c7bc2eeffbbb2e5284e5c56886278"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): ext/node/polyfills/internal_binding/cares_wrap.ts:707 \u00B7 ext/node/polyfills/internal_binding/cares_wrap.ts:725 \u00B7 ext/node/polyfills/internal_binding/cares_wrap.ts:865 \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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58a9723cb73a673b13d02cc4da083b1551b7699fcd679383a03a198ab794aa8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/node/polyfills/testing.ts:3490 \u00B7 ext/node/polyfills/testing.ts:3553 \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":"ext/node/polyfills/testing.ts"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf12c76872974557c94331019f25367abda4ff1b207c61b1d9a72be42955500d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): ext/node/polyfills/v8.ts:714 \u00B7 ext/node/polyfills/v8.ts:726 \u00B7 ext/node/polyfills/v8.ts:738 \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":"ext/node/polyfills/v8.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c8a17be2bb3980a692008ced823100eb0ac0053729442716db7d9711c22211"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): ext/node/update_node_stream.ts:180 \u00B7 ext/node/update_node_stream.ts:243 \u2014 the two spans are one implementation copied and then locally edited \u2014 92 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":"ext/node/update_node_stream.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"285fdf07f9162f70e2843b1fab6a1e8b4edf381a0094a1e2231b33d787330914"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): ext/process/40_process.js:832 \u00B7 ext/process/40_process.js:845 \u00B7 ext/process/40_process.js:858 \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":"ext/process/40_process.js"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e415c9bfd0df787ab34c2668e3d65a6ed4848e15a2a2eea2fd8928f1ad326e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): ext/web/06_streams.js:6149 \u00B7 ext/web/06_streams.js:6462 \u00B7 ext/web/06_streams.js:6649 \u00B7 ext/web/06_streams.js:7595 \u2014 all 4 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":"ext/web/06_streams.js"},"region":{"startLine":6149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4b77162243f8b76c609f9b9083fa20ff0ff898d134563af8be84e1ebf8d839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/web/06_streams.js:7420 \u00B7 ext/web/06_streams.js:7542 \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":"ext/web/06_streams.js"},"region":{"startLine":7420}}}],"partialFingerprints":{"codehealthFindingId/v1":"854580e9f28dce284ec93b5349acd19398b00b270154f32aede920a9d614538d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/web/06_streams.js:7979 \u00B7 ext/web/06_streams.js:7992 \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":"ext/web/06_streams.js"},"region":{"startLine":7979}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1126baf821f5fbedccec59516cfaae0d5aef78f6911b44ce57ddba199a55416"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/web/17_geometry.js:16 \u00B7 ext/web/18_css_stylesheet.js:10 \u2014 the 2 copies are spread across 2 files, 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":"ext/web/17_geometry.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caad050de717a930b1ba7fb77ef1d4ee14f5331df7c9eb737b6dec8400b376f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): ext/web/webtransport.js:796 \u00B7 ext/web/webtransport.js:814 \u00B7 ext/web/webtransport.js:832 \u00B7 ext/web/webtransport.js:850 \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":"ext/web/webtransport.js"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af6797be33869f1172e788309dcd96aa83d61e1220d526c3662195732ad664d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/web/webtransport.js:832 \u00B7 ext/web/webtransport.js:850 \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":"ext/web/webtransport.js"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"af86095211beb16329d0be832b20e26b76492358ff09b1ef32e10c0e638538d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ext/webgpu/01_webgpu.js:231 \u00B7 ext/webgpu/01_webgpu.js:246 \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":"ext/webgpu/01_webgpu.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50ae24244bd13c127d007d28e924998d0f90c36e28b625a89daf22fdbd5c681"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): cli/js/40_lint.js:1156 \u00B7 cli/js/40_lint.js:1170 \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":"cli/js/40_lint.js"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f55d05277521b541c6a64b177828d0c95b1965ba2c6462eb052abc414cdf041"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): cli/js/40_lint_selector.js:942 \u00B7 cli/js/40_lint_selector.js:999 \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":"cli/js/40_lint_selector.js"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f2d9e55e14e7c676678e9d4536b2fcac20437996aa60f8defc3229f9fbf1a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): cli/js/40_test.js:320 \u00B7 cli/js/40_test.js:342 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"cli/js/40_test.js"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d0e3d97b56fb9dedcb21ae36e4ac35fe2c6dbc03223e4eabe9dc01768b2cac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): ext/cache/01_cache.js:75 \u00B7 ext/cache/01_cache.js:123 \u00B7 ext/cache/01_cache.js:208 \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":"ext/cache/01_cache.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a70caab863fc604c5ed8889b47302a07fe5cd6c8030734b38739c9f0ad90c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/fetch/20_headers.js:158 \u00B7 ext/fetch/20_headers.js:195 \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":"ext/fetch/20_headers.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62ed6d3560456c960225ec0a117687719c6850e130b08af2ec08b146de69c56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): ext/io/12_io.js:145 \u00B7 ext/io/12_io.js:199 \u00B7 ext/io/12_io.js:234 \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":"ext/io/12_io.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6900def21b3e805637680e313b8553df1d2cf3449bdf7db64512ceeaf6b9e95f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): ext/net/01_net.js:223 \u00B7 ext/net/02_tls.js:37 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"ext/net/01_net.js"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d69f9ae57243f89247d48abe56e06a80e5e354dbbc74330ef9d2243dfc7395"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/_tls_common.ts:350 \u00B7 ext/node/polyfills/tls.ts:240 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca63deafa520a7d82680c3e91dabca5e5d04d1b6814a56927886de83bebc3c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/dgram.ts:1164 \u00B7 ext/node/polyfills/dgram.ts:1207 \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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a871ad7b308ac90c4919d136f37d20f486dab6c8c96712066616f2bcfa6f1707"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8 locations): ext/node/polyfills/dns.ts:687 \u00B7 ext/node/polyfills/dns.ts:704 \u00B7 ext/node/polyfills/dns.ts:722 \u00B7 ext/node/polyfills/dns.ts:760 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 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":"ext/node/polyfills/dns.ts"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"6843753b2e52d7b3da653f1dee32bba2e80096f4bca962acea7ce7de842e9903"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/inspector.js:287 \u00B7 ext/node/polyfills/inspector_network_bridge.js:60 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/inspector.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb889b7349c68020a5aba6938c0e5596be785fd2ea6aafed4d426d142c0d559"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): ext/node/polyfills/inspector/promises_esm.js:2 \u00B7 ext/node/polyfills/inspector_esm.js:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"ext/node/polyfills/inspector/promises_esm.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a8b42044d5d1dcca745c94237ed48dfea07be391197988fceb4b9ae447ef9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): ext/node/polyfills/internal/buffer.mjs:2424 \u00B7 ext/node/polyfills/internal/buffer.mjs:2439 \u00B7 ext/node/polyfills/internal/buffer.mjs:2670 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca67c771602930ebb433dc10b0b5c53f403755f1fca63fa64240f25d38b7327"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:2545 \u00B7 ext/node/polyfills/internal/buffer.mjs:2599 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ec08595e6e2d988edc8acc4b0240e3371737905a588c40dda7080f8579cc2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:2626 \u00B7 ext/node/polyfills/internal/buffer.mjs:2642 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7fa5d110ba13132985c707b8a98378acccce7cedcb9de0649fd56345a1613d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:3193 \u00B7 ext/node/polyfills/internal/validators.mjs:95 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55131afc2dc303d40832d03f50b43a0dfe12f1680ba3c469fbced760206c132"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/child_process.ts:401 \u00B7 ext/node/polyfills/internal/child_process.ts:1944 \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f444600b5c614607b742972571f901c017b54cbd7c5bfdaa4c7c9f7dcfb0380"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): ext/node/polyfills/internal/crypto/_randomBytes.ts:115 \u00B7 ext/node/polyfills/internal/crypto/pbkdf2.ts:157 \u00B7 ext/node/polyfills/internal/crypto/pbkdf2.ts:184 \u2014 the 3 copies are spread across 2 files, 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":"ext/node/polyfills/internal/crypto/_randomBytes.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4137a843d3697c09adce7192392a50e71410c5f7b66301e66d052abfca004de1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/diffiehellman.ts:361 \u00B7 ext/node/polyfills/internal/crypto/diffiehellman.ts:374 \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":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0892a47f2f944dcc1e0f757fc16228441b8ada87f7b5367be8eb5cf1be763658"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/diffiehellman.ts:1547 \u00B7 ext/node/polyfills/internal/crypto/diffiehellman.ts:1572 \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":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"653e0c096a53f153a70c288a853e60608941d95ea59a09204032c105dffe0df8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/keygen.ts:298 \u00B7 ext/node/polyfills/internal/crypto/keygen.ts:314 \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":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a92d01e37dd7e10b2ccf4561efb85855c752f660219f5e732e525202573fc0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/keys.ts:346 \u00B7 ext/node/polyfills/internal/crypto/keys.ts:367 \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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"d634d7ac9f7771f57c3fdb0341c62deba6bdd1809ce15468553b25a4eb1f28e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/errors.ts:883 \u00B7 ext/node/polyfills/internal/errors.ts:3340 \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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"762baff8dc4561cedd4e478463e690043baa88e3e23225dc758036a895e12ae0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/http2/compat.js:413 \u00B7 ext/node/polyfills/internal/http2/compat.js:550 \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":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bf15f29b3ff4aca6bc7acd2b5bd04d81ca55f165946b80e8dad5ddc074ab3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/readline/interface.mjs:984 \u00B7 ext/node/polyfills/internal/readline/interface.mjs:1006 \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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"90784e2dddc1cb67bd683cc6265596a80c1cbdd60aed79d95d08c6f055b869c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): ext/node/polyfills/internal/streams/duplex.js:105 \u00B7 ext/node/polyfills/internal/streams/duplexify.js:58 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"ext/node/polyfills/internal/streams/duplex.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"71edb8a5fe6a03000f8970c043e520ec9b78fec810a0f268a240ce51ffb900bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/fast-utf8-stream.js:603 \u00B7 ext/node/polyfills/internal/streams/fast-utf8-stream.js:644 \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":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"343734ca06f244c70f8aec19f5344a4713149fa6b2d36ce11b4f5bea985f7597"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/utils.js:152 \u00B7 ext/node/polyfills/internal/streams/utils.js:174 \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":"ext/node/polyfills/internal/streams/utils.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"12aaf542741d8079a9941ed7d5d457514e4f521115f28d59dd447986fcf511a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): ext/node/polyfills/zlib.js:1002 \u00B7 ext/node/polyfills/zlib.js:1020 \u00B7 ext/node/polyfills/zlib.js:1039 \u00B7 ext/node/polyfills/zlib.js:1130 \u2014 all 4 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":"ext/node/polyfills/zlib.js"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff7103b778800f0b219749d5cfc71b4952ee5c17f19d0ade8946cf1e7a0d1de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/node/polyfills/zlib.js:1205 \u00B7 ext/node/polyfills/zlib.js:1219 \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":"ext/node/polyfills/zlib.js"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66cbb87b2955eee81acc576af70f9d2aac04e6c2bad334922d216325e8cd05d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/telemetry/telemetry.ts:845 \u00B7 ext/telemetry/telemetry.ts:859 \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":"ext/telemetry/telemetry.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8305370a8f16aaab39c156da9e0933b93b9ce6aa97cede54b40d9f21b80684f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/telemetry/telemetry.ts:894 \u00B7 ext/telemetry/telemetry.ts:908 \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":"ext/telemetry/telemetry.ts"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6ab5aac90a8b8065e9d0679de4fc2dcecdad113b73ba0f60746b8d2f2479d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/web/06_streams.js:1210 \u00B7 ext/web/06_streams.js:1489 \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":"ext/web/06_streams.js"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8413b2d5282fe5d100ffae3e3aaa0ef57ee87e3920c8308d1435cb1358a2706"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/web/06_streams.js:3851 \u00B7 ext/web/06_streams.js:4204 \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":"ext/web/06_streams.js"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ee2c134cc04ca5254540cf27379d218ffbe7f78f7f60e108fc964a877c4e80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ext/web/06_streams.js:7769 \u00B7 ext/web/06_streams.js:7832 \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":"ext/web/06_streams.js"},"region":{"startLine":7769}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bd3a4643cce9a62f2da8197d7a78fd1b28409982c60c2cb8ab54cf18eff329"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/fetch/20_headers.js:463 \u00B7 ext/fetch/20_headers.js:594 \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":"ext/fetch/20_headers.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7a5aae8939b8b95ea9f4a6bba9bc6281aab1fc0881318ef31770435ed2845c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/fetch/22_body.js:635 \u00B7 ext/websocket/01_websocket.js:129 \u2014 the 2 copies are spread across 2 files, 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":"ext/fetch/22_body.js"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb94772dfbfa2e4c98c9442cbfd1c7a300ecd68a9c745ccda8ea61c03476833"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/http/02_websocket.ts:130 \u00B7 ext/http/02_websocket.ts:213 \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":"ext/http/02_websocket.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdfd2118f0b0b1bc7f2ec4db60f061559c80c8c73ed91184396f46df2be7743"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/_events.mjs:932 \u00B7 ext/node/polyfills/_events.mjs:1045 \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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb53a72f2b39a208f2c692ab5d5872b8fa8d1903e0e08c82750e2de1ebbba15c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_glob.ts:683 \u00B7 ext/node/polyfills/_fs/_fs_glob.ts:955 \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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c822694d21c6435552e545413a6e2029fbadc489670d00fbc1c7a227ff8e3cfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_lstat.ts:38 \u00B7 ext/node/polyfills/_fs/_fs_lstat.ts:68 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"ext/node/polyfills/_fs/_fs_lstat.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ce4f9e2f1041b41a054ef3f90722c4d853ee30225228907ba13fed65fdb11d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/_http_client.js:673 \u00B7 ext/node/polyfills/_http_server.js:1444 \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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99b2ee416f0a62da505e3f9815915620d0b827a94b1e123c29cff0b801f735f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/_http_server.js:442 \u00B7 ext/node/polyfills/_http_server.js:482 \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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b835ec7595b75f35b51b055f54f5fbc48947e4a4a34067a35197647d97cefc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/_http_server.js:1465 \u00B7 ext/node/polyfills/_http_server.js:1492 \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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"4656a5b1338e196eac6501610f2508aa73f41898c8c4d85068fbdfe910ca4f76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:2446 \u00B7 ext/node/polyfills/fs.ts:2508 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"708f8165f76ac11a15c179d9fe1976cb7df11c5bd305031a2631528d6f5e6284"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:312 \u00B7 ext/node/polyfills/http2.ts:353 \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c19b760febd47298d9597472fce4b2121508cededf25b3d4f408153485a53d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:2926 \u00B7 ext/node/polyfills/http2.ts:2997 \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":2926}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc02a4d888259856d6c7042bc34b69ae61bb5099b1e7a2eda9d41f2a9a0612d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:3196 \u00B7 ext/node/polyfills/http2.ts:3275 \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccd8debd67a4c172ae76148c6ccb1d00d091063dc98bc4e0b24812198f281f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:694 \u00B7 ext/node/polyfills/internal/buffer.mjs:706 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4411dc349b4f90e929ee88daa7dcaac4745a90af9c4dea9c85af2a05b567a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/child_process.ts:2207 \u00B7 ext/node/polyfills/internal/child_process.ts:2224 \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"849c9c318c332e90db2173d39a844956e96ef8c7b6365b48ca8cb62eaf346e06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/child_process.ts:2304 \u00B7 ext/node/polyfills/internal/child_process.ts:2345 \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b95d188bd06a5c75d67a1c57599dac8a344524a2d593a80837e0fe877c9960c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/child_process.ts:2481 \u00B7 ext/node/polyfills/internal/child_process.ts:2491 \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c4c25a40a819774a0cfb064dc5f9d4eb0061df814a745c539c94dafb7fb7b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/_randomFill.mjs:93 \u00B7 ext/node/polyfills/internal/crypto/_randomFill.mjs:138 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 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":"ext/node/polyfills/internal/crypto/_randomFill.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"909edd9807c58cdfe4e092dace9d1dd3ca860e2019a7fbda0f47d6af6c2c47f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/sig.ts:168 \u00B7 ext/node/polyfills/internal/crypto/sig.ts:296 \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":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"350fd634282d6f6f26a1c7e3dd0906e1d30353c554005f96b72aa180a7ebbd8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/crypto/x509.ts:163 \u00B7 ext/node/polyfills/internal/crypto/x509.ts:174 \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":"ext/node/polyfills/internal/crypto/x509.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"921bbb9fcc03df82e15b0bece175f8f467ee5b4ef7935f182f5524b15af832f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/errors.ts:769 \u00B7 ext/node/polyfills/internal/errors.ts:800 \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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e80e83c2064470af456c678d8f4d36507a97c2155fbd820aa60adb2e5bd8f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/errors.ts:845 \u00B7 ext/node/polyfills/internal/errors.ts:857 \u2014 all 2 copies are in the same file, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcd7e3f1d518337dcc870ba0c61fedef10633ccb41c525fac889de163bdf034"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): ext/node/polyfills/internal/http/address_override.js:162 \u00B7 ext/node/polyfills/internal/http/address_override.js:191 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"ext/node/polyfills/internal/http/address_override.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ee02d13bdbc6c07caf29f7ea9a4de888d7779af51d0032ccf126cae8f9b8c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/mime.ts:353 \u00B7 ext/node/polyfills/internal/mime.ts:366 \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":"ext/node/polyfills/internal/mime.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"546f86e8e241ff8863726fb6e8b8cb7fd996b4b519a8048ce25836fa977ac340"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/end-of-stream.js:291 \u00B7 ext/node/polyfills/internal/streams/end-of-stream.js:324 \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":"ext/node/polyfills/internal/streams/end-of-stream.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"881ab8e7459ee5dcd66deb5e9a4a78d974e2d20ed769b39d3b157a10b7ad81bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/tty.js:352 \u00B7 ext/node/polyfills/internal/tty.js:372 \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":"ext/node/polyfills/internal/tty.js"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"94aeca037b337ea94939a9d913b353fdb51305710a89899bde2120326e1fead1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/internal/util/inspect.mjs:520 \u00B7 ext/node/polyfills/internal/util/inspect.mjs:542 \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":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c179518eff92a68eae4675880ccd8451670df4fa16de9d89e710b29a433d1bc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): ext/node/polyfills/internal_binding/cares_wrap.ts:635 \u00B7 ext/node/polyfills/internal_binding/cares_wrap.ts:669 \u00B7 ext/node/polyfills/internal_binding/cares_wrap.ts:694 \u00B7 ext/node/polyfills/internal_binding/cares_wrap.ts:783 \u2014 all 4 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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a075b61708b4a6ccd7b612fed6c728fc368f23a2ad88695ceed50cfc746da55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/net.ts:1775 \u00B7 ext/node/polyfills/net.ts:1789 \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":"ext/node/polyfills/net.ts"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb8d595a84867d1c761cec0312eeae42a84c11cc66a05af801744d90681992f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/vm.js:677 \u00B7 ext/node/polyfills/vm.js:808 \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":"ext/node/polyfills/vm.js"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"255bf3e87148302da4ea56e7b5553152e9751cb03e618dd68f09586f0a23bc32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/node/polyfills/worker_threads.ts:178 \u00B7 ext/node/polyfills/worker_threads.ts:190 \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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ab5f50608aa6ea0de4a77fa54fe97f859f2cf0750e0cf921298d6ad26dad3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/web/00_url.js:746 \u00B7 ext/web/00_url.js:770 \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":"ext/web/00_url.js"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"8069580e083ae73794b2132da3c91ab2aedaf1996b4f954db23aa1dca9b1b265"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/web/06_streams.js:900 \u00B7 ext/web/06_streams.js:8342 \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":"ext/web/06_streams.js"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2a040b0e72696e79a3989c2baf54b992fd061831ce507cf1b74dc15d786d08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/web/09_file.js:312 \u00B7 ext/websocket/01_websocket.js:682 \u2014 the 2 copies are spread across 2 files, 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":"ext/web/09_file.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad048046dda1ffae03bed020cdade366854f582047911aa8eb22b770a5cfe86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/web/15_performance.js:672 \u00B7 ext/web/15_performance.js:699 \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":"ext/web/15_performance.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccface574ec0a030c8712b7280f7d76eb00f8c68b6d17b72ab51f0e7cf4537b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ext/web/16_image_data.js:15 \u00B7 ext/web/17_geometry.js:82 \u2014 the 2 copies are spread across 2 files, 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":"ext/web/16_image_data.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b367dd392f05e1b777ede60dc7a503f5a69b48ba5265c57cb7d06ab3e3d260f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): libs/core/00_primordials.js:96 \u00B7 libs/core/00_primordials.js:118 \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":"libs/core/00_primordials.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf5bb2bebad36d7d1de4d705b9bf5e65e86b5cfd0e8b2b797a19c7a3bc0ba4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): libs/core_testing/checkin/runtime/__init.js:45 \u00B7 libs/core_testing/checkin/runtime/__init.js:62 \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":"libs/core_testing/checkin/runtime/__init.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff2c318d8e5f32aaeb27557baa51ea3b190c560a0cd52f5939c532a5ba97356"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): runtime/cpu_profiler/flamegraph.js:137 \u00B7 runtime/cpu_profiler/flamegraph.js:172 \u2014 the two spans are one implementation copied and then locally edited \u2014 105 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":"runtime/cpu_profiler/flamegraph.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c7c43475b29d02025a3ca82841859126bf14ceb9c6c4c0045580a61613a97c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): tools/ecosystem_compat_tests.ts:31 \u00B7 tools/ecosystem_compat_tests.ts:42 \u00B7 tools/ecosystem_compat_tests.ts:53 \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":"tools/ecosystem_compat_tests.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4afff0f7e9a03a7b15c65486dc42a7948a55b5336ac45fd730a01cb81b0cdb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): cli/js/40_lint_selector.js:1067 \u00B7 cli/js/40_lint_selector.js:1084 \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":"cli/js/40_lint_selector.js"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c54e8b65d7d1b188c3faa9150fcb6ebd3c175f73c74af0c1595777cf80a85e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): ext/fetch/27_eventsource.js:199 \u00B7 ext/web/15_performance.js:706 \u00B7 ext/websocket/02_websocketstream.js:107 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/27_eventsource.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad23dc55b864a7df6ad5517be90fe674fa83746861bb69d447d752d9a9507d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/01_require.js:630 \u00B7 ext/node/polyfills/01_require.js:717 \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":"ext/node/polyfills/01_require.js"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f87cdc3096cfab908670e4f1f3ee9bc1b5b6451fdf8d0d9dd438e9d29cf9d59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_glob.ts:542 \u00B7 ext/node/polyfills/_fs/_fs_glob.ts:551 \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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ab4c905dc4a15f5abf1d4ce33e14a6536dcd3dae353a833eac1388a49c8bf1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_glob.ts:560 \u00B7 ext/node/polyfills/_fs/_fs_glob.ts:855 \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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b5181660e662c8dd4c0034dbc7946e535ddc7dcf0c72ca1f240d47806728f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_glob.ts:817 \u00B7 ext/node/polyfills/_fs/_fs_glob.ts:1105 \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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf548b74c31ece9262172e42b9758902725c5d9c1283e1628fd3e488979fa0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/_http_client.js:948 \u00B7 ext/telemetry/util.ts:18 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_client.js"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b720866c0d29d41ed26d6e67fa52ec3dcc81f8076077a07cebbb04cbbee2c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): ext/node/polyfills/_http_client.js:921 \u00B7 ext/node/polyfills/http2.ts:4714 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"243238ea55aa861bfa68a884fd81b22ff41ace76bf290a3eeb00fbc67e90f0ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/_http_server.js:1339 \u00B7 ext/node/polyfills/_tls_wrap.js:1382 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5576b4d28623fa0e3278cf6b2df7b8ebf7c120fdf9869c898424c426da93ebd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/dns.ts:466 \u00B7 ext/node/polyfills/internal/dns/promises.ts:371 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/dns.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ec5d3e198d7a90eba3c1498f55cde61ffa7ea80cd0e5f7a838449b9f55b9a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:1198 \u00B7 ext/node/polyfills/fs.ts:1243 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3df4d46d1a1b4b1c840ad294b1498bacd794a8076c676614b5376e83ee8ea0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:2960 \u00B7 ext/node/polyfills/fs.ts:3007 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"588b8e1cf75b5224915880eb28373c140a438beccb70366a84ba6c25f5099c65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/https.ts:263 \u00B7 ext/node/polyfills/https.ts:293 \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":"ext/node/polyfills/https.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9a0fa9573c898432f382b39471f94f9a03b8f349e7ad64a25e867163383fb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/https.ts:289 \u00B7 ext/node/polyfills/https.ts:306 \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":"ext/node/polyfills/https.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5cb1c8a29f86e8f73f2352ce90b3d08cf706f1b7cf1717644c64db84ed7668"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/internal/async_hooks.ts:147 \u00B7 ext/node/polyfills/internal/async_hooks.ts:166 \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":"ext/node/polyfills/internal/async_hooks.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b653f448b556dd78c11d975c1ebfc86d61cc6119e83de8265660d14a8c41a148"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 16 locations): ext/node/polyfills/internal/buffer.mjs:2372 \u00B7 ext/node/polyfills/internal/buffer.mjs:2387 \u00B7 ext/node/polyfills/internal/buffer.mjs:2402 \u00B7 ext/node/polyfills/internal/buffer.mjs:2413 \u00B7 \u002B12 more site(s) not listed \u2014 all 16 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee17a1a5282642505acdffeba8b926afaaa6618a6413955d4486f6d92ee8888"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): ext/node/polyfills/internal/errors.ts:452 \u00B7 ext/node/polyfills/internal/errors.ts:462 \u00B7 ext/node/polyfills/internal/errors.ts:472 \u00B7 ext/node/polyfills/internal/errors.ts:482 \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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24e4fe6d1a9c2e665a2478434277c3e6edc0d202f9e53f2f3fdba4464a7a5d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/internal/errors.ts:464 \u00B7 ext/node/polyfills/internal/errors.ts:474 \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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa0e3a10ab8d86ac0d778bfe9a0b6b1bce8f41a1b131e15874bdacd5510f311"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/internal/errors.ts:782 \u00B7 ext/node/polyfills/internal/errors.ts:799 \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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"347b0bf85aae146e048b3be3a5eaea7609bac71fdb02cf1a43e440586583bf9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/fast-utf8-stream.js:804 \u00B7 ext/node/polyfills/internal/streams/fast-utf8-stream.js:838 \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":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"4049724198f38a78ce358259e952dff3bf0716854caee4f58a35cdbc6770fa7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/readable.js:440 \u00B7 ext/node/polyfills/internal/streams/readable.js:503 \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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e43451e4e010c9bf79be684dfb1debb700ca03d2ad4226709ee16db78777b08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/internal/util.mjs:212 \u00B7 ext/node/polyfills/util.ts:240 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"28da65e99eaa0fabcf4ff4aebd52a88a9221f8821ad2da53aec447e18504f3d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/internal_binding/cares_wrap.ts:173 \u00B7 ext/node/polyfills/internal_binding/cares_wrap.ts:183 \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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"079e2888cbfc3292fb0c97cd96b176ea670a9290d321fe8b9df467d53ed8e4bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/internal_binding/udp_wrap.ts:361 \u00B7 ext/node/polyfills/internal_binding/udp_wrap.ts:378 \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":"ext/node/polyfills/internal_binding/udp_wrap.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4bd711bfb98e5d7a4fcae3ec9e141dbc0f3cfd6b272997257d077015d67a91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/process.ts:831 \u00B7 ext/node/polyfills/process.ts:880 \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":"ext/node/polyfills/process.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"c043b62293fac323e24cc5158166d8f48f71e6d02c1bb53be081b7a55e8e5e98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/node/polyfills/testing.ts:2103 \u00B7 ext/node/polyfills/testing.ts:2130 \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":"ext/node/polyfills/testing.ts"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aed0e88320f30d501df3fdf4a3b01aa0ae2593e355ed3d5fe85d4772ba4f865"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): ext/node/polyfills/url.ts:1572 \u00B7 ext/node/polyfills/url.ts:1581 \u00B7 ext/node/polyfills/url.ts:1590 \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":"ext/node/polyfills/url.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d675397970d8b27881602e8e73e804a568eb6a031b81daef63271aca03eec3f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): ext/web/00_infra.js:152 \u00B7 ext/web/09_file.js:100 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"ext/web/00_infra.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ceb4244c1f938d816862592d71435b67416dc2992fbdf42241f81dcab3e4ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/web/01_urlpattern.js:328 \u00B7 ext/web/01_urlpattern.js:365 \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":"ext/web/01_urlpattern.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c8834395a8dbf1d9a541252200be783c2376b4bb2941bd31d3e45ebf22f296"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/web/09_file.js:219 \u00B7 ext/web/09_file.js:707 \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":"ext/web/09_file.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ce2561e8a3af4229f32fd853edb1303a8cd68affcac9068e325d40d9b1daf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ext/web/09_file.js:517 \u00B7 ext/websocket/01_websocket.js:133 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/09_file.js"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a75a960501ca0316ce418f53ff93628b260573ce7eacdf398f0818d1737608b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): ext/web/15_performance.js:281 \u00B7 ext/web/15_performance.js:707 \u00B7 ext/websocket/02_websocketstream.js:108 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/15_performance.js"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6278d7cdfba70dca866aefd101fd32776e88dc22907175660dbbd39350fac1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): libs/core/00_infra.js:371 \u00B7 libs/core/00_infra.js:391 \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/core/00_infra.js"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc5d3f451316f9fac5ec9693ce23af08325b3587634a6c101096750865d6cd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): libs/core/01_core.js:713 \u00B7 libs/core_testing/checkin/runtime/callsite.ts:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\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":"libs/core/01_core.js"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8829feed83b908b8dcf1926682617fba3aa85ddc79c3edb57950eabdc3f00f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): libs/core_testing/unit/task_test.ts:14 \u00B7 libs/core_testing/unit/task_test.ts:24 \u00B7 libs/core_testing/unit/task_test.ts:34 \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":"libs/core_testing/unit/task_test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"14826d48931c77618ab7775f632801725b378b9b519f9542ec48e18f9d1f2994"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): tools/util.js:95 \u00B7 tools/util.js:107 \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":"tools/util.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0145382a6f2a0baa4eb64385c87e4b51369bbb9ef3455d68356293917a1c1cf1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/fetch/21_formdata.js:158 \u00B7 ext/fetch/21_formdata.js:197 \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":"ext/fetch/21_formdata.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5fb07430b2a79ff8f2bbffc39cd1062eb043bad477c08e6356dbfcdedb1912"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_glob.ts:666 \u00B7 ext/node/polyfills/_fs/_fs_glob.ts:934 \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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07e28af9e9e34ee18a15c5c9c8ece8815ab2c4a1e06916b73235d046731e991"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_glob.ts:1114 \u00B7 ext/node/polyfills/_fs/_fs_glob.ts:1127 \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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d372c9b10e7ba1a47395deac3e17cbd01bbfff24f6d6be85195744a959391e2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/_http_agent.js:366 \u00B7 ext/node/polyfills/_http_agent.js:439 \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":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeed2807d56108689380e3c78bc78f5be78f30f848c6005aeb275c8bd529df93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/_tls_common.ts:135 \u00B7 ext/node/polyfills/_tls_common.ts:144 \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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb0380be5ceaa2467f4ed365ddb8cc575efc93e158e6f3b9513833c9a39fe3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/diagnostics_channel.js:348 \u00B7 ext/node/polyfills/diagnostics_channel.js:373 \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":"ext/node/polyfills/diagnostics_channel.js"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"179ff661f388b1c2294290e7cca35019ab9dd956734c75aab9a68cad762628ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:1403 \u00B7 ext/node/polyfills/fs.ts:1436 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97c571f1bedea6e562bb24fdcdc99f907f81658e0151a8e979ac9d2b3cf08ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/http2.ts:1169 \u00B7 ext/node/polyfills/http2.ts:1198 \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"203be1242588ceefb270387b40a31f494b1a603718d8f2851d8c49892ec17718"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): ext/node/polyfills/internal/buffer.mjs:1582 \u00B7 ext/node/polyfills/internal/buffer.mjs:1595 \u00B7 ext/node/polyfills/internal/buffer.mjs:1735 \u00B7 ext/node/polyfills/internal/buffer.mjs:1749 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ea9aa13e3d574d08c3b13748e46ac2d0c62049f4f0b74da7c650ae6c73f9f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:1666 \u00B7 ext/node/polyfills/internal/buffer.mjs:1692 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29fcd81f4c67c977eb771330ec1ec19d367b95ec9935cd69d13c2c6b09b9fe1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:1711 \u00B7 ext/node/polyfills/internal/buffer.mjs:1723 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd3e3629f7e0ef52efdf53e2b68b8ea775d4b47e2a626a13c1742717144d75e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:1760 \u00B7 ext/node/polyfills/internal/buffer.mjs:1777 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"a783891764921b2f59e359e120b08307fd0fcfd48a6d20931e3e83fb657d5eaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:1904 \u00B7 ext/node/polyfills/internal/buffer.mjs:1912 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4266c78c21be08690eadfbbad296d1fb257b8671d131176c32efa1b6b561cb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:1925 \u00B7 ext/node/polyfills/internal/buffer.mjs:1933 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e69e0f8a67c1af2d3e608ede747d1fa7165ae0363e70daba69b62d88ac9c2fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:2454 \u00B7 ext/node/polyfills/internal/buffer.mjs:2465 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c0b56fbdea490fb1a6e27b3bdcc612f34d9706b76d513ac9be455f2ac6d3a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): ext/node/polyfills/internal/buffer.mjs:2606 \u00B7 ext/node/polyfills/internal/buffer.mjs:2633 \u00B7 ext/node/polyfills/internal/buffer.mjs:2649 \u00B7 ext/node/polyfills/internal/buffer.mjs:2661 \u2014 all 4 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2606}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ab7fbb123cfc1d8f002ba08dfb480a71bb187ccf2848c5814637962e1dbb46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): ext/node/polyfills/internal/buffer.mjs:3139 \u00B7 ext/node/polyfills/internal/buffer.mjs:3155 \u00B7 ext/node/polyfills/internal/buffer.mjs:3170 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":3139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51c1f263b67c290bce5d11e0c9f5ecc00ee564a4f9da5758b8017e6cc7d0ec0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:3211 \u00B7 ext/node/polyfills/internal/buffer.mjs:3229 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":3211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f023c3d9ac2093d7348455a05059be36e7bd08d2cf36596b7ba170b4f05f673"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/child_process.ts:591 \u00B7 ext/node/polyfills/internal/child_process.ts:797 \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb124ff796a7da8e8cd6c3a1cb0ac381a4c8a5c02da3a63cad3b4ff711a37d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/child_process.ts:2439 \u00B7 ext/node/polyfills/internal/child_process.ts:2458 \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"323b254851fcd3e90f5fa718eaf48dd0df8adc6319c3cf020efc2b08e4a5e37d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/fs/streams.mjs:239 \u00B7 ext/node/polyfills/internal/fs/streams.mjs:457 \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":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f035f10d75fbafa05682c105a8a4879f1c7fe2d68801c99b3cbe0a7d7cbbc3eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/priority_queue.ts:107 \u00B7 libs/core/02_timers.js:142 \u2014 the 2 copies are spread across 2 files, 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":"ext/node/polyfills/internal/priority_queue.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e6dc73cb7fe57038e77b00bd81c508e23d1f08078d2740e78e62510abdca40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): ext/node/polyfills/internal/streams/readable.js:122 \u00B7 ext/node/polyfills/internal/streams/readable.js:131 \u00B7 ext/node/polyfills/internal/streams/utils.js:31 \u00B7 ext/node/polyfills/internal/streams/writable.js:129 \u00B7 \u002B2 more site(s) not listed \u2014 the 4 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"83014131faafd14f84c88cc3f7aa5bb81c1efeca01b107ae17dde383f2c01fb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/utils.js:181 \u00B7 ext/node/polyfills/internal/streams/utils.js:190 \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":"ext/node/polyfills/internal/streams/utils.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9d7d1e2f8576febd5c6b876922bdeb07d4f164ac81984787087b7e9b74b32a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/util/comparisons.ts:397 \u00B7 ext/node/polyfills/internal/util/comparisons.ts:405 \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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e04ca37c61b97c71bd928a7c0948fe26f27facc0c4163febd2beb3e6748d56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/util/comparisons.ts:810 \u00B7 ext/node/polyfills/internal/util/comparisons.ts:1036 \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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1ee3232949fb2a7e94d0ec052099eb875d3042857e75764a97fc118a294cad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/validators.mjs:100 \u00B7 ext/node/polyfills/internal/validators.mjs:146 \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":"ext/node/polyfills/internal/validators.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d37127fbf0d65a095693c8cbbf0779ffa21aa227d49644baa81c462325c54fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/validators.mjs:135 \u00B7 ext/node/polyfills/internal/validators.mjs:159 \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":"ext/node/polyfills/internal/validators.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7041e8e8a1dae5aec0df891a841e68c1c3004e1ab4eb8c9976bdeea7e4a6adb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/internal/webstreams/adapters.js:578 \u00B7 ext/node/polyfills/internal/webstreams/adapters.js:657 \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":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece23d223d8b94543f646a9b855f0443bb54d399af5aee32366f2baeece23e6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9 locations): ext/node/polyfills/internal_binding/cares_wrap.ts:619 \u00B7 ext/node/polyfills/internal_binding/cares_wrap.ts:640 \u00B7 ext/node/polyfills/internal_binding/cares_wrap.ts:653 \u00B7 ext/node/polyfills/internal_binding/cares_wrap.ts:674 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2d8247e67e05840d6b44edb51e2bb7890d39af3634c8b4d345b8fc2418d59b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/perf_hooks.js:567 \u00B7 ext/node/polyfills/perf_hooks.js:575 \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":"ext/node/polyfills/perf_hooks.js"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f0aa1432251477bc3c6eb834b47d9b3be067c52b88bbeb80d3664f0f694d2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): ext/node/polyfills/process.ts:803 \u00B7 ext/node/polyfills/process.ts:834 \u00B7 ext/node/polyfills/process.ts:883 \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":"ext/node/polyfills/process.ts"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3deeaa7d69b7912c62fbb4989b76244074da870a75477b4b353cd76ccf6d9ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/testing.ts:2084 \u00B7 ext/node/polyfills/testing.ts:2122 \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":"ext/node/polyfills/testing.ts"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d6b5f66d7635d1f883fae7b49611aee926e2243556aabd58d65ed3382b6296"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/url.ts:1373 \u00B7 ext/node/polyfills/url.ts:1435 \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":"ext/node/polyfills/url.ts"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88cddf027703a309e4c7f8e2c995a10cdfe465635d09a8346908bc9e6922968"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/polyfills/worker_threads.ts:314 \u00B7 ext/node/polyfills/worker_threads.ts:347 \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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac815ee97cfaab605bd2cd05942cc784b648c4b45b3b1ad6a7a369f3ae1439a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/node/update_node_stream.ts:279 \u00B7 ext/node/update_node_stream.ts:338 \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":"ext/node/update_node_stream.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09c1d84a315133ddb59afaabe2b60214972fffde750c14be0d1f1e5624ab4ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/web/00_url.js:248 \u00B7 ext/web/00_url.js:353 \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":"ext/web/00_url.js"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfe56c72ef11ef19e7ca127b746c00d4e960b65bd7478c71eb7266374fab642"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/web/02_event.js:1029 \u00B7 ext/web/02_event.js:1087 \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":"ext/web/02_event.js"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"7978ad5c3648d86c2b29091b40250126f3bce9d4a2a6c61972a2e01acfa6513c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/web/02_event.js:1302 \u00B7 ext/web/02_event.js:1315 \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":"ext/web/02_event.js"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"7123eb964798b40e7b8694b0bdf0e9ba507b447b4a9b520902d21ec5d0f3b597"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/web/06_streams.js:1461 \u00B7 ext/web/10_filereader.js:174 \u2014 the 2 copies are spread across 2 files, 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":"ext/web/06_streams.js"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bcd0dcbefaa464e061f754a8e4fcdc5c49b8e083fdb852e51606e7176a4729"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/web/06_streams.js:6744 \u00B7 ext/websocket/01_websocket.js:639 \u2014 the 2 copies are spread across 2 files, 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":"ext/web/06_streams.js"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"105529f5bfd1e368c7f43bcb18b73235273f96cd23ba6cdc768d3cf911665dda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/web/15_performance.js:441 \u00B7 ext/web/15_performance.js:689 \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":"ext/web/15_performance.js"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9eeeaac859bbd6dc56c527651e37d648e5e94039e573e170d45b00b070766d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ext/webgpu/01_webgpu.js:104 \u00B7 ext/webgpu/01_webgpu.js: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":"ext/webgpu/01_webgpu.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"36408eb22b450e439913ccb9208e5e72f131fe8675b1b821740030c7ef016b3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): libs/core/00_primordials.js:548 \u00B7 libs/core/00_primordials.js:576 \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":"libs/core/00_primordials.js"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b6366e0befc99f4254772524231e4a612da4e4e378943d7182d2f80d7bcb5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): libs/core_testing/integration/error_get_file_name/error_get_file_name.ts:4 \u00B7 libs/core_testing/integration/error_get_file_name_to_string/error_get_file_name_to_string.ts:4 \u00B7 libs/core_testing/integration/error_get_script_name_or_source_url/error_get_script_name_or_source_url.ts:4 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_get_file_name/error_get_file_name.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"16444be44f6641ca20ece3ac1926ac344c902d2a603b375cdff4251fe751e118"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): libs/core_testing/integration/worker_terminate/worker_terminate.ts:3 \u00B7 libs/core_testing/integration/worker_terminate_op/worker_terminate_op.ts:4 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/worker_terminate/worker_terminate.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c1ee1452812e2cd19d0af04be1a6d13615d0d6c77ad239e061dd10ec3cbe87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): runtime/cpu_profiler/flamegraph.js:198 \u00B7 runtime/cpu_profiler/flamegraph.js:215 \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":"runtime/cpu_profiler/flamegraph.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72ee29a2a8617534af7ffc680eb1cd7db3b0e8ea0e9960341883a642f8cb013"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): runtime/js/99_main.js:1095 \u00B7 runtime/js/99_main.js:1268 \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":"runtime/js/99_main.js"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"30eeb2cb102b012bceea7036086375126ebad37cc2d6320c535c530b905c41e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/cache/01_cache.js:57 \u00B7 ext/cache/01_cache.js:65 \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":"ext/cache/01_cache.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a334d3dd0f47375c177ed444722d87e67223b9c724476caaa1f4f4fe98d124a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/fetch/23_request.js:736 \u00B7 ext/web/09_file.js:509 \u2014 the 2 copies are spread across 2 files, 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":"ext/fetch/23_request.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ea1d191e95e9e22a62bce91c661c4b9b725aad03f731b92f7cd36f6bfefd3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/kv/01_db.ts:620 \u00B7 ext/kv/01_db.ts:673 \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":"ext/kv/01_db.ts"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8894c0ec3785be653a1a94c45af56fcfd662bd83a3107b4904661d4dfbf4042"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/node/polyfills/01_require.js:617 \u00B7 ext/node/polyfills/01_require.js:703 \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":"ext/node/polyfills/01_require.js"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bb5419ae662b9e2c1ad86df646bbf542d59cd968983c967f1795eb2398ddbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): ext/node/polyfills/_http_outgoing.ts:955 \u00B7 ext/node/polyfills/_http_server.js:533 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08d8e2dab99fd0af7a656751acf7669a2998a1a4120581139a586ce970ce710"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10 locations): ext/node/polyfills/_tls_wrap_esm.js:3 \u00B7 ext/node/polyfills/child_process_esm.ts:3 \u00B7 ext/node/polyfills/cluster_esm.ts:3 \u00B7 ext/node/polyfills/fs/promises_esm.ts:3 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 10 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_wrap_esm.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"22214557a8b3ca64b1c460e7c67c7708ff5cfe02593e8cabd6ce2ec5aca084db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/node/polyfills/_utils.ts:151 \u00B7 ext/node/polyfills/_utils.ts:163 \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":"ext/node/polyfills/_utils.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2e9fc073e444cb300a5940c077be9015580a3815ef8e8d7ceb02797c702f2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/node/polyfills/diagnostics_channel.js:376 \u00B7 ext/node/polyfills/diagnostics_channel.js:427 \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":"ext/node/polyfills/diagnostics_channel.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a9af6e938400c459c802e2fbb930ff3a44c84862655e88bc0888169a743a8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:1177 \u00B7 ext/node/polyfills/fs.ts:1227 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63ab6619360b431710d2469ebe5c3cf4fcfec3692e5573ff99f3541c3998a2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/node/polyfills/internal/buffer.mjs:2586 \u00B7 ext/node/polyfills/internal/buffer.mjs:2598 \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4e3f1514ff7a82ce51c198ac56bc5cbc9731fd010764a489479f02390811c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): ext/node/polyfills/internal/crypto/diffiehellman.ts:1452 \u00B7 ext/node/polyfills/internal/crypto/diffiehellman.ts:1548 \u00B7 ext/node/polyfills/internal/crypto/diffiehellman.ts:1573 \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":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d5ccea25c1fa2eb0f32b1ec582dca34596afa1b54aee9b82b02235780da51f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/node/polyfills/internal/fs/stat_utils.ts:26 \u00B7 ext/node/polyfills/internal/fs/stat_utils.ts:59 \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":"ext/node/polyfills/internal/fs/stat_utils.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4923ba9ecd66f1308dc946ac13722d16615fe06f54800fb8d328cd5c79aa0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/node/polyfills/internal/fs/streams.mjs:121 \u00B7 ext/node/polyfills/internal/fs/streams.mjs:129 \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":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24cb015117bb24dfe37f0b80e2e4074d775cb987d92b602c8be2ea8f526cbb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/node/polyfills/internal/streams/utils.js:140 \u00B7 ext/node/polyfills/internal/streams/utils.js:150 \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":"ext/node/polyfills/internal/streams/utils.js"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5913d381c395e87edceece2f23d01828091bab5e3bd5fc475ea8a4884af8d4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/telemetry/telemetry.ts:817 \u00B7 ext/telemetry/telemetry.ts:831 \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":"ext/telemetry/telemetry.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"2172a24fe7f11e5f89c786f1971bde1121adeb78f72851a14a1a10d004793c1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): ext/telemetry/telemetry.ts:831 \u00B7 ext/telemetry/telemetry.ts:845 \u00B7 ext/telemetry/telemetry.ts:859 \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":"ext/telemetry/telemetry.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40562d2d7b517026f3863e292cdf848f721a536a2dc64e1964f1bfec9015842"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/telemetry/telemetry.ts:874 \u00B7 ext/telemetry/telemetry.ts:905 \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":"ext/telemetry/telemetry.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0a58c566961e5d537cde31bc428ee0c4129803afa32f289ce1da0fe501b03a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/web/00_url.js:294 \u00B7 ext/web/00_url.js:314 \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":"ext/web/00_url.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1260f247e34a8b46bc081d1a43335657b56ebded724fc0d1092e9151baf02de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/web/03_abort_signal.js:254 \u00B7 ext/web/03_abort_signal.js:280 \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":"ext/web/03_abort_signal.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a01b1df69b2b451737ef1e515a9c8b40894c9e999f7e79123e2c67eea16150a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/web/06_streams.js:5615 \u00B7 ext/web/06_streams.js:5638 \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":"ext/web/06_streams.js"},"region":{"startLine":5615}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a089a05489a8f4655709359b3d165b5166a7d710c0b52547bd9b552b3331d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): ext/web/13_message_port.js:761 \u00B7 ext/web/13_message_port.js:785 \u00B7 ext/web/13_message_port.js:802 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/13_message_port.js"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"7819e99f5646ef7c7e7cf875410da3113a43fbf015e53f7657b6390fbb967c4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ext/websocket/01_websocket.js:659 \u00B7 ext/websocket/01_websocket.js:889 \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":"ext/websocket/01_websocket.js"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"2461a581dff25cd34c4139476cf8c77d7059e60b7818075a6050365930c2388d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): libs/core_testing/integration/source_phase_imports/source_phase_imports.js:2 \u00B7 libs/core_testing/integration/source_phase_imports_dynamic/source_phase_imports_dynamic.js:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"libs/core_testing/integration/source_phase_imports/source_phase_imports.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c15efd10a109b44b6b2b43e0d8f177f38b60ab1890a6de7aa907be06e969df9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): libs/core_testing/unit/stats_test.ts:97 \u00B7 libs/core_testing/unit/stats_test.ts:125 \u00B7 libs/core_testing/unit/stats_test.ts:143 \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":"libs/core_testing/unit/stats_test.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe3df87f750aab1dccd7fe76393d38f8becadc88ed019b983554ba39d8a195e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): ext/fetch/21_formdata.js:134 \u00B7 ext/fetch/21_formdata.js:157 \u00B7 ext/fetch/21_formdata.js:196 \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":"ext/fetch/21_formdata.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a39c76f53a1a101f7a5af8d03f99dbd4371205fbd20d6f1657b2109da573c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ext/fetch/21_formdata.js:181 \u00B7 ext/web/00_url.js:305 \u2014 the 2 copies are spread across 2 files, 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":"ext/fetch/21_formdata.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfd49daa83e38c1e846e8855979803a3fa4662d1a06d2296e281c548cc62efe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): ext/node/polyfills/_fs/_fs_glob.ts:200 \u00B7 ext/node/polyfills/internal/validators.mjs:338 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6cd9671ff195a8d8bb8247bdec39032be697bf54d3b891d0413a992da43771"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ext/node/polyfills/_tls_wrap.js:1607 \u00B7 ext/node/polyfills/_tls_wrap.js:1613 \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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08d8620d9d52ddd91f032f4e5ef02b6d8089f0de9490a02c650dca6c28dbbd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ext/node/polyfills/fs.ts:1271 \u00B7 ext/node/polyfills/fs.ts:1293 \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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74af238f2f4899a152f53f9fd9a500dc88d4762de34bc16cb85327a633d828f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ext/node/polyfills/internal/util/parse_args/utils.js:129 \u00B7 ext/node/polyfills/internal/util/parse_args/utils.js:150 \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":"ext/node/polyfills/internal/util/parse_args/utils.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db1e800c2258d8e0710592f340666e01e5ca089b36e8c4736a328b3266d4525"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ext/node/polyfills/perf_hooks.js:582 \u00B7 ext/node/polyfills/perf_hooks.js:589 \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":"ext/node/polyfills/perf_hooks.js"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92b2146bae6963fc849545f886072fc52007d188146c442ec3cf7786c674479"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ext/node/polyfills/testing.ts:3218 \u00B7 ext/node/polyfills/testing.ts:3231 \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":"ext/node/polyfills/testing.ts"},"region":{"startLine":3218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcef727907781237f4e15b35d65046998d7e50968c00494e62d8801d232e4e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): ext/web/00_url.js:269 \u00B7 ext/web/00_url.js:301 \u00B7 ext/web/00_url.js:321 \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":"ext/web/00_url.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffec8375cd830b032c851d800973be3cb1c97dced0fc3865eb0f570f3181b975"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7 locations): ext/web/00_url.js:733 \u00B7 ext/web/00_url.js:754 \u00B7 ext/web/00_url.js:778 \u00B7 ext/web/01_urlpattern.js:327 \u00B7 \u002B3 more site(s) not listed \u2014 the 3 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":"ext/web/00_url.js"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ac3b68bad50dd7d5bcd85c11a5260c16d2da7fbb4ada96bad4ba2261b93667"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): libs/core_testing/unit/stats_test.ts:30 \u00B7 libs/core_testing/unit/stats_test.ts:48 \u00B7 libs/core_testing/unit/stats_test.ts:67 \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":"libs/core_testing/unit/stats_test.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c969588544b15ea3afe4547d25fdc95f6b51463d421eae0550d0c5d4a606e698"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): cli/js/40_lint.js:1462 \u00B7 cli/js/40_lint.js:1471 \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":"cli/js/40_lint.js"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfbc79f58db87479731c57bd65e18c6c69c614a54530d6e979285a9c9647192"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): cli/js/40_lint.js:1545 \u00B7 cli/js/40_lint.js:1555 \u00B7 cli/js/40_lint.js:1568 \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":"cli/js/40_lint.js"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d39cd9596f36892dd120a6f927bab6a707d5588420b99f69c9cf4cdf8a3098"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): ext/node/polyfills/dns.ts:457 \u00B7 ext/node/polyfills/dns.ts:462 \u00B7 ext/node/polyfills/internal/dns/promises.ts:362 \u00B7 ext/node/polyfills/internal/dns/promises.ts:367 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a8f865e337ea4ecc9b51bbedbe98d6d91bff0e421f19bab43997247cceed70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ext/web/13_message_port.js:847 \u00B7 ext/web/13_message_port.js:859 \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":"ext/web/13_message_port.js"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"d601a3a5a9beb0e0e5db90a483264e82a6b0e922bf6d3dbe2496ae483bb6d9de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): libs/core_testing/unit/resource_test.ts:28 \u00B7 libs/core_testing/unit/resource_test.ts:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"libs/core_testing/unit/resource_test.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f41b4757f27dd7b2a99d1a6eec71dec4cb4ba89461c32c159d694a07f323b90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveObject (cyclomatic 117, cognitive 168): resolveObject has cyclomatic complexity 117 and cognitive complexity 168; 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":"ext/node/polyfills/url.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab92bdecc9b36998a2bdef16b211b9e33753f7571ba9befa2641d435584a9a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitKeys (cyclomatic 112, cognitive 77): emitKeys has cyclomatic complexity 112 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/readline/utils.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"534b615c42d331d2601deb85c67a06a054d600e3f2feb87c1bef5b0c8f2c6bb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #iterateSubpatterns (cyclomatic 106, cognitive 283): #iterateSubpatterns has cyclomatic complexity 106 and cognitive complexity 283; 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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c6f927806577344ce42c81d4623fd489bb52ea0d57559db5b34d411e5305c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function urlParse (cyclomatic 106, cognitive 141): urlParse has cyclomatic complexity 106 and cognitive complexity 141; 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":"ext/node/polyfills/url.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d70b46930974f70adaf81c65377092df1c48345680b70d1bce392276447b83e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectComparisonStart (cyclomatic 91, cognitive 109): objectComparisonStart has cyclomatic complexity 91 and cognitive complexity 109; 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad36c73722eb7beff6cd94d58f0dc788d0848d508b4958a0b4d34002725b163"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchKnownFields (cyclomatic 90, cognitive 113): matchKnownFields has cyclomatic complexity 90 and cognitive complexity 113; 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":"ext/node/polyfills/_http_incoming.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"161281c844b0c4e8ee78d07a512b40a75319f1194153bd68a6b0f3fb954eb08e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ClientRequest (cyclomatic 86, cognitive 125): ClientRequest has cyclomatic complexity 86 and cognitive complexity 125; 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5566b122168e87da99fc7cbbe5f2a922b7c312010d4d09516300090fde4635"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #addSubpatterns (cyclomatic 82, cognitive 151): #addSubpatterns has cyclomatic complexity 82 and cognitive complexity 151; 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":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36b1ea65ee6276b354c380bde1e61669a88b1bc4cb962a3503a5659332ffe60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 71, cognitive 61): (computed) has cyclomatic complexity 71 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6d5803d010245387bc235eee4772012c7b01e1592b5e2107f8e4c2325dc3fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 61, cognitive 111): constructor has cyclomatic complexity 61 and cognitive complexity 111; 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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43132ad81409e0dc7c482cd5f686153f0ede3b1fefd286325f388d1f87ddd10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createJob (cyclomatic 60, cognitive 102): createJob has cyclomatic complexity 60 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23c1bff97615fbba655fef7625e76afef1aab4357472cc75bf7c38113318cdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _load (cyclomatic 59, cognitive 104): _load has cyclomatic complexity 59 and cognitive complexity 104; 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff7b3e3ab5776a0d3de887d9b63bde09813a84386505e59339f6355a7959f44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mainFetch (cyclomatic 59, cognitive 90): mainFetch has cyclomatic complexity 59 and cognitive complexity 90; 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":"ext/fetch/26_fetch.js"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccb10a2fd95540894332f18b426fbb4fe8a5cfa0dcfdcf20f6ee96d9583e891"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #spawnInternal (cyclomatic 59, cognitive 90): #spawnInternal has cyclomatic complexity 59 and cognitive complexity 90; 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"224c4554111570f9d86d6532f3ca06edf94c0be2baf7b361f3370e4183487c6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resolveFilename (cyclomatic 52, cognitive 87): _resolveFilename has cyclomatic complexity 52 and cognitive complexity 87; 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"203970bfafba458da98ca2612568456a57d11ca8a6d7e929bec4d775ab79a1ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize (cyclomatic 48, cognitive 92): normalize has cyclomatic complexity 48 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea6842257e3e10761ed34ab2d49739c6cd790e6c0b5051d30a566ed030d793e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pipelineImpl (cyclomatic 48, cognitive 90): pipelineImpl has cyclomatic complexity 48 and cognitive complexity 90; 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":"ext/node/polyfills/internal/streams/pipeline.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"501e2b054cb50aeeb470c6eb99abf792fb6e0323341c5ad8e57c3618a12f679f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 47, cognitive 108): resolve has cyclomatic complexity 47 and cognitive complexity 108; 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"695b339837e8842cdf38709eda878b8d8dd96bb01bfef11e13fce29180ccd676"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parserOnIncoming (cyclomatic 47, cognitive 71): parserOnIncoming has cyclomatic complexity 47 and cognitive complexity 71; 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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0872109d15e09916dcd5477e3a2d81591ebbadea538dc45c10e6fe835ebba8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 47, cognitive 59): constructor has cyclomatic complexity 47 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/fetch/23_request.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"059e27001e2ee8b178f550ec84d9bc47be0f32b9301539326d3b0fa05eb05ccc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 44, cognitive 55): visit has cyclomatic complexity 44 and cognitive complexity 55; 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":"tools/lint_plugins/prefer_primordials.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6103a7fbe05d84ba1c3191a788db00cbcd08dadd5e45591c1e5822e037aff35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSelector (cyclomatic 43, cognitive 97): parseSelector has cyclomatic complexity 43 and cognitive complexity 97; 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":"cli/js/40_lint_selector.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c3e2a2cfad4ff9dd2c5a0e9101b08daa02007a621ad631926559b3b2a7b5b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function slowCases (cyclomatic 43, cognitive 55): slowCases has cyclomatic complexity 43 and cognitive complexity 55; 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":"ext/node/polyfills/internal/normalize_encoding.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7d7f9808e270847deb571ccf06a7851c7eac5fd91bbf487ce7c034fdf128e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eos (cyclomatic 43, cognitive 46): eos has cyclomatic complexity 43 and cognitive complexity 46; 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":"ext/node/polyfills/internal/streams/end-of-stream.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ead3f94b95f5aa468ab2627a4d62562ef04d3d404ee45406414a7daa6d1fa5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relative (cyclomatic 42, cognitive 67): relative has cyclomatic complexity 42 and cognitive complexity 67; 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"0078ada4357c7c4e52a60caa6e52c3f6c266b92b755ca360585f2e6942ce874b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 41, cognitive 124): parse has cyclomatic complexity 41 and cognitive complexity 124; 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":"ext/node/polyfills/querystring.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ac662d0bad7f962568e0c8b237e9e516e3ce7b8dde6bfdb70d51389841f207"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 41, cognitive 104): parse has cyclomatic complexity 41 and cognitive complexity 104; 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c007974958192469871c50398773b729e3e39b2fc6dea1a37e7474d7db5b85d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function request (cyclomatic 41, cognitive 72): request has cyclomatic complexity 41 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":4684}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f13c80dffe5962d080642ab19baff4659c5c8a384612bdbb716e37c5064b07c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fork (cyclomatic 41, cognitive 59): fork has cyclomatic complexity 41 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d86eb61371cb1ebcf1396ce56c13575848af985d446d3b19e4582055d97d95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isFullWidthCodePoint (cyclomatic 41, cognitive 37): isFullWidthCodePoint has cyclomatic complexity 41 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d560c4f7b3ae9314cb1767040e9addd46be41b27fd14752776ec9daf80f9c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onSessionHeaders (cyclomatic 40, cognitive 92): onSessionHeaders has cyclomatic complexity 40 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"601c2d469d528f2e67b4781502aa12cf1ca54f1c00e8bfd2a16028eb7465134b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function respondWith (cyclomatic 40, cognitive 87): respondWith has cyclomatic complexity 40 and cognitive complexity 87; 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":"ext/http/01_http.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"929c968bfc75fe0f76ec757f245aff376ca6fb2a8e096ffc16aad45cff6aaeef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function format (cyclomatic 40, cognitive 50): format has cyclomatic complexity 40 and cognitive complexity 50; 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":"ext/node/polyfills/url.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d6bf957d0e09130345edeeea9537dfb83f10fe9152b83d8d34dee090cd1941"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getColorDepth (cyclomatic 40, cognitive 49): getColorDepth has cyclomatic complexity 40 and cognitive complexity 49; 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":"ext/node/polyfills/internal/tty.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"deeb42158bf0ae2358aaeb7e73e32c17f98fc7b7cd89e492ca2e4e931efc76eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryDirectEnd (cyclomatic 40, cognitive 21): tryDirectEnd has cyclomatic complexity 40 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09ef2de669fd941ce874acc40304d41a6ab3d6ffddc335c7684831cba8a7f45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 38, cognitive 79): constructor has cyclomatic complexity 38 and cognitive complexity 79; 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":"ext/node/polyfills/internal/assert/assertion_error.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0603e5a0d22d33676bb6e36ec29a38217da1ed16303df950898171ccaf76d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _storeHeader (cyclomatic 38, cognitive 64): _storeHeader has cyclomatic complexity 38 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b650d0376d3b148465d147bc8441c5d5af430a42c5c58286a0766b7f2928b03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 38, cognitive 58): constructor has cyclomatic complexity 38 and cognitive complexity 58; 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":"ext/websocket/01_websocket.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcae1cd70c1effeb9f6d3116dc3a0c5cb81fc07a2f5e204b1b5e9a10bba0aca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyOneShot (cyclomatic 37, cognitive 52): verifyOneShot has cyclomatic complexity 37 and cognitive complexity 52; 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":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a06af14f4aad93c7796fa48e8bd26969da7e3732c2d4204a5c342422894f148"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSimpleSpecialHostCanonical (cyclomatic 37, cognitive 44): isSimpleSpecialHostCanonical has cyclomatic complexity 37 and cognitive complexity 44; 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":"ext/web/00_url.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"439b97af8eee075587865cd5d4f33bdf076988d4508be57ae69f7aaf5bf30f3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryDirectEmptyEnd (cyclomatic 37, cognitive 18): tryDirectEmptyEnd has cyclomatic complexity 37 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c00ef01771855757063cca16c585f0e5e49322132df936da497e0de3568910d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSimpleSpecialUrl (cyclomatic 36, cognitive 47): parseSimpleSpecialUrl has cyclomatic complexity 36 and cognitive complexity 47; 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":"ext/web/00_url.js"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"188bfe551b9319a79c7d5e5b7349d66687fe37bcad5de4f5c895273194987537"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listen (cyclomatic 36, cognitive 44): listen has cyclomatic complexity 36 and cognitive complexity 44; 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":"ext/node/polyfills/net.ts"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b917d0521f690c12437e46f2970144485bc8c9971b7e2bce868a4bbb6de719a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serverRequestInner (cyclomatic 35, cognitive 65): serverRequestInner has cyclomatic complexity 35 and cognitive complexity 65; 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":"cli/tsc/98_lsp.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae436348e3e39fda5af277942f479f3fb74603f6f9c2f479d4eee6a11e205bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSettingsBuffer (cyclomatic 35, cognitive 65): updateSettingsBuffer has cyclomatic complexity 35 and cognitive complexity 65; 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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"d406c29e3cd93dbd59571188cab44422b3e285c220dfe32ba26840db04652389"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 34, cognitive 60): dispatch has cyclomatic complexity 34 and cognitive complexity 60; 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":"ext/web/02_event.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96515e71e18d0a30a42021c4c5ee8fd2ae03eb5fcc1a2ff69533b61d4fb4fa3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSpawnArguments (cyclomatic 34, cognitive 53): normalizeSpawnArguments has cyclomatic complexity 34 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfd6e757bdeceacc1aabfb9ca4aef0c30551096ff313240414dba45b9484d99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawnSync (cyclomatic 34, cognitive 36): spawnSync has cyclomatic complexity 34 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"993e5564678efd7888d43f47cd754407d6d79e3da45abaf2366bfded8f95ea67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fill (cyclomatic 33, cognitive 48): fill has cyclomatic complexity 33 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db965ffa417d32d397bd149cfd750ecddcffd15f647d055f29a06a0b8771839"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 32, cognitive 52): constructor has cyclomatic complexity 32 and cognitive complexity 52; 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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ded0077ac97aa355b8d1f0b4f66bfdcef33a4d17f039ebd68406f427184bc1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 32, cognitive 44): read has cyclomatic complexity 32 and cognitive complexity 44; 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e13f55e347a6fdbc95907464bfb8b1bc03661ade29cda410408b94c02373998"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decode (cyclomatic 31, cognitive 81): decode has cyclomatic complexity 31 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/string_decoder.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"511c603cd3f563635c8688c647092c6a3f8846a2f52a9fbfa4ca825437a5839e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatWithOptionsInternal (cyclomatic 31, cognitive 65): formatWithOptionsInternal has cyclomatic complexity 31 and cognitive complexity 65; 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":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fcf74038ab7264e6a24e4c16a25e2b445b3301f6de0bb5f5205a926897b369"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function signOneShot (cyclomatic 31, cognitive 47): signOneShot has cyclomatic complexity 31 and cognitive complexity 47; 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":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a306275c39d2290835d9728559c8517dfe291ba648cdf0525831d96ee6f3d30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkIsComplete (cyclomatic 30, cognitive 59): checkIsComplete has cyclomatic complexity 30 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"cli/js/jupyter_kernel.js"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bc305fd0189061fca126132d91829cafa6e686013e9b09bfb76ca0ef541590"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resOnFinish (cyclomatic 30, cognitive 47): resOnFinish has cyclomatic complexity 30 and cognitive complexity 47; 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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2870fa5cd63aab5958673cf6e4c0b1a885e1d0172bedadae1f76f1416aff944"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testInner (cyclomatic 29, cognitive 46): testInner has cyclomatic complexity 29 and cognitive complexity 46; 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":"cli/js/40_test.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2da08ea07fe7891458749a4068ed424571b83c82040b19f92889c47c3370a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compose (cyclomatic 29, cognitive 34): compose has cyclomatic complexity 29 and cognitive complexity 34; 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":"ext/node/polyfills/internal/streams/compose.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bd84a8a5fb91593fee51463c2088031f0c1c71854da04fde18f2bfaca6cc40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function table (cyclomatic 28, cognitive 45): table has cyclomatic complexity 28 and cognitive complexity 45; 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":"ext/node/polyfills/internal/console/constructor.mjs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"875c17323fdc3faf0bfc3dfc7733fd656a3a827724719409e04a3097a23a3472"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCommand (cyclomatic 28, cognitive 44): buildCommand has cyclomatic complexity 28 and cognitive complexity 44; 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"c283a08cc2c5350871fd5a637d88e36f0d2df34ed8ed187332ec6d1de9f4d783"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function next (cyclomatic 28, cognitive 23): next has cyclomatic complexity 28 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"cli/js/40_lint_selector.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31779769dab955a67ffcbdad94e9a41572b7db1e713634f6460fb2c4014a8cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dirname (cyclomatic 27, cognitive 88): dirname has cyclomatic complexity 27 and cognitive complexity 88; 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21e50198c40241dc29fcbd539531a281ddca53c4a6df1b012dd6cbe811de096"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objEquiv (cyclomatic 27, cognitive 53): objEquiv has cyclomatic complexity 27 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e154556cbc394e342ec6c64c4e2fef2c8242cbcf2653ce52a7419aa564cb96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #loop (cyclomatic 27, cognitive 43): #loop has cyclomatic complexity 27 and cognitive complexity 43; 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":"ext/fetch/27_eventsource.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaba95a77c231b37850349d86bfc62dd6f621b705bf4453b76a39e5f62f2b5e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _createServerHandle (cyclomatic 27, cognitive 37): _createServerHandle has cyclomatic complexity 27 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":"ext/node/polyfills/net.ts"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d40b19a2017f5d5d32d371aa52992bb97b6038a694cad772cebade0edc3434d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decode (cyclomatic 27, cognitive 30): decode has cyclomatic complexity 27 and cognitive complexity 30; 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":"ext/web/08_text_encoding.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f20e18c033ec67ccc0415b8ab651f0d5a98d7ea5276601f05b726e3e155270"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expectedException (cyclomatic 26, cognitive 58): expectedException has cyclomatic complexity 26 and cognitive complexity 58; 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":"ext/node/polyfills/assert.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bca68b7bc58d7641136625a146484765c8de065ac2759a2071ad187f1048f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function end (cyclomatic 26, cognitive 36): end has cyclomatic complexity 26 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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1d432ded7474c2510c39634bb00c38f6e662ca25f1f3be4b1aef141317d2eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractBody (cyclomatic 26, cognitive 35): extractBody has cyclomatic complexity 26 and cognitive complexity 35; 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":"ext/fetch/22_body.js"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af472bc329cbfa2787c071a0051c327dea98551200cc213d425880de6bdea12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Socket (cyclomatic 26, cognitive 35): Socket has cyclomatic complexity 26 and cognitive complexity 35; 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":"ext/node/polyfills/net.ts"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf080b390b04e2708eea50962e5c4eb005c9dccec4a91b42673311387bc477b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _handleError (cyclomatic 25, cognitive 60): _handleError has cyclomatic complexity 25 and cognitive complexity 60; 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b4881bf9cba3034177e017c9cffdb97973355b2253b1c408a4904e97754340"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function basename (cyclomatic 25, cognitive 59): basename has cyclomatic complexity 25 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"04079239c36af196312e58081e4be1769f589dcf0b0a7bed5e46f186418aeac7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modifySourceFiles (cyclomatic 25, cognitive 54): modifySourceFiles has cyclomatic complexity 25 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"tools/update_types_node.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f53fb934349592046dee0a9d0685889eeb9b377e8707479afbe025e5464a5f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 25, cognitive 50): constructor has cyclomatic complexity 25 and cognitive complexity 50; 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":"ext/web/00_url.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a1203ea61a39ed456d58f70e94e19c9206ec3817d808a23876a1cb53f9b475"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function write_ (cyclomatic 25, cognitive 35): write_ has cyclomatic complexity 25 and cognitive complexity 35; 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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ea96f98dbf891034e8378819c80b7f770ae97ed678ee4f557edd6bc4b435e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 25, cognitive 33): constructor has cyclomatic complexity 25 and cognitive complexity 33; 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":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f501d7e2e3f214ced0a0156d5255889b14d915ff9d3c0c49178b77d26f060488"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 32): (anonymous) has cyclomatic complexity 25 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":"ext/kv/01_db.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7744e5de259f394e37845265d18761091cf9b8eab541f6d89fe84ea46d797817"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 25, cognitive 26): constructor has cyclomatic complexity 25 and cognitive complexity 26; 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26167ca01d595acae75903bb0c88bd567839b78ecd553d63cd6cc83c6d8392f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postMessage (cyclomatic 24, cognitive 50): postMessage has cyclomatic complexity 24 and cognitive complexity 50; 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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2477015e8cd374eeaa7758b4e96290b9832232d593efe41c2e5887c7bbfaf5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleExecute (cyclomatic 24, cognitive 41): handleExecute has cyclomatic complexity 24 and cognitive complexity 41; 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":"cli/js/jupyter_kernel.js"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5e67e2e56ae2dbf266df05d171df1282be0aef95cb10da69fd23dd45a66e49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 24, cognitive 35): parse has cyclomatic complexity 24 and cognitive complexity 35; 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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ff2ea4a2e4215927b960eba96ac11414be5a27e229a65a396d3420dce11f47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 26): (anonymous) has cyclomatic complexity 24 and cognitive complexity 26; 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":"ext/image/01_image.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eeb0cbbe17e85b13649205f1efb98fa40eead8ed1b8ad6facd7f45928293383"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parserOnIncomingClient (cyclomatic 24, cognitive 23): parserOnIncomingClient has cyclomatic complexity 24 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ed4f22ca46cb848481b2a5364c787b5839ddb3bb5afbd9c0d3b77d06a2eaeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 23, cognitive 68): walk has cyclomatic complexity 23 and cognitive complexity 68; 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/wpt/wpt.ts"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b595c2ca06cf0da3fa7be970d3276dd1eb2cee2e6115aef517187fe8cac3ed7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __initWorkerThreads (cyclomatic 23, cognitive 61): __initWorkerThreads has cyclomatic complexity 23 and cognitive complexity 61; 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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"6871223e16e3488d6cc9ac430adb80094c268c7438e38ec29f87e0988ec8fa92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyCheck (cyclomatic 23, cognitive 46): keyCheck has cyclomatic complexity 23 and cognitive complexity 46; 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"0554e521eb4c784be7da81e790ad2276e34fbd9669c6499a256dce02dceb2cea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _findPath (cyclomatic 23, cognitive 42): _findPath has cyclomatic complexity 23 and cognitive complexity 42; 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21d4cd04132fbfe21ff869c142a778255df479ddb8aca5833a29e979bda23d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function InterfaceConstructor (cyclomatic 23, cognitive 34): InterfaceConstructor has cyclomatic complexity 23 and cognitive complexity 34; 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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d42158fd8b3986365ca8d2b85a0b470571656436d7eea66fb2d3b073ba4bf2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 23, cognitive 34): parseArgs has cyclomatic complexity 23 and cognitive complexity 34; 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":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dce07bd73746b05e52e621755d1073dccf77194b8cce3c0510be2a82601cef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copy (cyclomatic 23, cognitive 33): copy has cyclomatic complexity 23 and cognitive complexity 33; 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b40c2edf68d2eaea7d32637b52bc7388162a8bcc657d2a995fe87e2950e86c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function request (cyclomatic 23, cognitive 33): request has cyclomatic complexity 23 and cognitive complexity 33; 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":"ext/web/locks.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"13305dc102b1bbb090552cfca434342c55fcbd0dbf544bfb97d4666082fdae3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Identifier (cyclomatic 23, cognitive 33): Identifier has cyclomatic complexity 23 and cognitive complexity 33; 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":"tools/lint_plugins/prefer_primordials.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fa04b1eed9ed44da97b0c411773995538a2b97806d149e0962d246c49305b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateKeyStrength (cyclomatic 23, cognitive 28): validateKeyStrength has cyclomatic complexity 23 and cognitive complexity 28; 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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dda88b4feffb6c5b639031416f64eac7ac67db9156aa6f0d99b7590e2cb28e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _destroy (cyclomatic 23, cognitive 28): _destroy has cyclomatic complexity 23 and cognitive complexity 28; 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":2532}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3979708c1d04a1462950989b6f38b582ec5ae43a99639a3411f1642bd50676"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measure (cyclomatic 23, cognitive 26): measure has cyclomatic complexity 23 and cognitive complexity 26; 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":"ext/web/15_performance.js"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"240de36c92c5ffdae0df8a745ff6feede49ec4581c7117472c77146821853700"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _lookupAndConnect (cyclomatic 23, cognitive 22): _lookupAndConnect has cyclomatic complexity 23 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/net.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"539a91fbb42c421bb899f054f5b30f3c3bb2fb3236408f26f650e3514926dc9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showPreview (cyclomatic 23, cognitive 22): showPreview has cyclomatic complexity 23 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eab4b18da1eeaa9d4cb5a3809fe1f2dfa308e8fcd4d638219045229dc92abc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function basename (cyclomatic 22, cognitive 53): basename has cyclomatic complexity 22 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2c3fe87239cd8c43d2fc98d2129051732f974a36f1556d3ff9c8b7a40a56d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeString (cyclomatic 22, cognitive 51): normalizeString has cyclomatic complexity 22 and cognitive complexity 51; 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/registry/jsr/@std/path/0.220.1/_common/normalize_string.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6797f53f3798c7f966ad4712c64330f5b725a8e1c84c3f7ef0a4cc283aab3ce3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function join (cyclomatic 22, cognitive 46): join has cyclomatic complexity 22 and cognitive complexity 46; 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe4eb0fb1fa22e8829b6e2e8a53b56d55c9d2e6d0c5f36f6afc334f79fe23b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 22, cognitive 41): (computed) has cyclomatic complexity 22 and cognitive complexity 41; 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":"ext/kv/01_db.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c217678aa69e54a604daab4c1617f6900f20cead00a10047c957e697a0e91b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookup (cyclomatic 22, cognitive 38): lookup has cyclomatic complexity 22 and cognitive complexity 38; 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":"ext/node/polyfills/dns.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b2b375e30ea4c912dca2ac9cc1b062a21758aec5429c35f3371845b62f3be4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createInvalidArgType (cyclomatic 22, cognitive 38): createInvalidArgType has cyclomatic complexity 22 and cognitive complexity 38; 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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb02afba95fd9c33afbb1bbc85a39d835496548c8db353fe0e877ae9c358c8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapped (cyclomatic 22, cognitive 29): mapped has cyclomatic complexity 22 and cognitive complexity 29; 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":"ext/http/00_serve.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc18e540af0db56dce6c4173d674a95d1e6fd5ec4b0a435747db48abf5e16907"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitLookup (cyclomatic 22, cognitive 29): emitLookup has cyclomatic complexity 22 and cognitive complexity 29; 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":"ext/node/polyfills/net.ts"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9ad5c387904d2cd0f42e507aac247183ffeb19d73512df75c9c0aeae864fa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportFinal (cyclomatic 22, cognitive 29): reportFinal has cyclomatic complexity 22 and cognitive complexity 29; 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/wpt/wpt.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"837c2b8b752ea358a0c6ac0b64be2e1a6809724e8b80dd6611403f195fa27430"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformDenoShellCommand (cyclomatic 22, cognitive 28): transformDenoShellCommand has cyclomatic complexity 22 and cognitive complexity 28; 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"243af5bc9d76ffa45a3368b88783921a1198d425fd5de7140e88643895d0c040"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function duplexify (cyclomatic 22, cognitive 28): duplexify has cyclomatic complexity 22 and cognitive complexity 28; 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":"ext/node/polyfills/internal/streams/duplexify.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"250fb46bcfd6d16c9f5d6a5d01c50e40011f1258423414334653266caf341ffa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function httpRedirectFetch (cyclomatic 22, cognitive 26): httpRedirectFetch has cyclomatic complexity 22 and cognitive complexity 26; 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":"ext/fetch/26_fetch.js"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f76f5e664e355c844235160dd89fdfd5e86c4b10a7f57a2600c4373c26866eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 22, cognitive 24): constructor has cyclomatic complexity 22 and cognitive complexity 24; 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":"ext/node/polyfills/wasi.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e34b27a8ef46cbf7a204587855e62f55c2273597163a3287176e01fce73928"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getName (cyclomatic 22, cognitive 21): getName has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/https.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67643b463f900dbbba37df8d2ce7296c90b982523d6e942f0c30bb212bb072d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromList (cyclomatic 21, cognitive 44): fromList has cyclomatic complexity 21 and cognitive complexity 44; 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a22235796d42258279577533263227ab3d9da9283189b44cf0f52930a01e58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onwrite (cyclomatic 21, cognitive 41): onwrite has cyclomatic complexity 21 and cognitive complexity 41; 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"3161c6b30aa25ce95ba19b74d258d75ce97d61f927b92d2e1e0a5f390f024535"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeHead (cyclomatic 21, cognitive 39): writeHead has cyclomatic complexity 21 and cognitive complexity 39; 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":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8df4a5cee29aa028e081f778d099730887d987b3b602517d901b190f15ea214"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _dump (cyclomatic 21, cognitive 32): _dump has cyclomatic complexity 21 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":"cli/js/40_lint.js"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1abfe3c2b9b49ccd62291a09c868fa29e367aa7dcc2c6cdc0d5884880917ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 21, cognitive 31): send has cyclomatic complexity 21 and cognitive complexity 31; 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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ec05584799d96b09e82f187b1d6cd216c6a4a2fcae2d89fa5d13ab96427ac0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toCryptoKey (cyclomatic 21, cognitive 30): toCryptoKey has cyclomatic complexity 21 and cognitive complexity 30; 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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea5bfb1966dfd5ddafb5de8c96bf14660ac7f4befe2762ea73fb9f427338ca9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getIpcHandleInfo (cyclomatic 21, cognitive 29): getIpcHandleInfo has cyclomatic complexity 21 and cognitive complexity 29; 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e3eee07ab9e608fc854d11746d8ab997aa17a057bfb67231bbec760650249c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareRequestHeadersArray (cyclomatic 21, cognitive 29): prepareRequestHeadersArray has cyclomatic complexity 21 and cognitive complexity 29; 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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ac1af44d0fdb96abd358559fe5167b9c4be75bf226d1de264b8986454b3b3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #handle (cyclomatic 21, cognitive 28): #handle has cyclomatic complexity 21 and cognitive complexity 28; 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":"ext/fetch/27_eventsource.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c07ead46b8c00c4ea1aefa75edabdbe6aba51074ee8fe07eb4b17ef38860669"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getValidStdio (cyclomatic 21, cognitive 28): getValidStdio has cyclomatic complexity 21 and cognitive complexity 28; 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e28871210555ac9ba55bc0c627dff94a695ee4e1b4569ba15250a9b972e76da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearPreview (cyclomatic 21, cognitive 27): clearPreview has cyclomatic complexity 21 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad309e5c6e1dbccd4b1476a2356001264f192b02309f282a3008ef07883c43f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readableByteStreamControllerPullInto (cyclomatic 21, cognitive 13): readableByteStreamControllerPullInto has cyclomatic complexity 21 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/web/06_streams.js"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b07d03296b5fe46ac2222963e86a8a90503b6ea4e1566a8d96210369af6702"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTypeSizeAndAlignment (cyclomatic 21, cognitive 9): getTypeSizeAndAlignment has cyclomatic complexity 21 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/ffi/00_ffi.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e173980d47109e2fdd41ba13030fa3d8c4d9ce73f8d9a4620ccd01b724700d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeString (cyclomatic 20, cognitive 49): normalizeString has cyclomatic complexity 20 and cognitive complexity 49; 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":"ext/node/polyfills/path/_util.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"078b6c4c3fef697fd9b1e7563590b2cade54d43d9e31eb68e82684fbeec957a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _doComplete (cyclomatic 20, cognitive 38): _doComplete has cyclomatic complexity 20 and cognitive complexity 38; 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f7e5756b6470cdda86b4a62bc65a85f985448e4162ccb01e3ce4c6cfb40d1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generate (cyclomatic 20, cognitive 38): generate has cyclomatic complexity 20 and cognitive complexity 38; 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":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb6326a5c37e1c76a5fa1c55b81fcae87667381a8c04e030f94da313e6c4b0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postMessage (cyclomatic 20, cognitive 34): postMessage has cyclomatic complexity 20 and cognitive complexity 34; 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":"ext/web/13_message_port.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe871cd6a3132853bd1498b4f33adbbc9c98901b4a5cdddf4b1466a410c915b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execFile (cyclomatic 20, cognitive 27): execFile has cyclomatic complexity 20 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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"31369a511842eb3b29c2db7a0868cf6e4002fb652c8f68c28156a822dd827cdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function styleText (cyclomatic 20, cognitive 26): styleText has cyclomatic complexity 20 and cognitive complexity 26; 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":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"3709670390c8ffab2994448d6ff2381b03b9bc6f451a7cbc0518bf710e07fde8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 20, cognitive 26): constructor has cyclomatic complexity 20 and cognitive complexity 26; 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":"ext/web/02_event.js"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a521d58214cf11101c0d613356c4c61ebb6363a23114e1175597791678fec994"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doSendFileFD (cyclomatic 20, cognitive 25): doSendFileFD has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/http2.ts"},"region":{"startLine":2959}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3785a3e7744ae1f300203d8414c5a0a298950473983f845117aa5ecb3b074f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getEncodingOps (cyclomatic 20, cognitive 24): getEncodingOps has cyclomatic complexity 20 and cognitive complexity 24; 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5eb7be2feab37d9c44bd797cc4c345f13a84508e7be6aa8e64c9fd214924223"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 20, cognitive 24): send has cyclomatic complexity 20 and cognitive complexity 24; 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c1ba407b3ff978648ea373800133bd56684e876a1bdee01111782385efb132"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getAttrPathValue (cyclomatic 20, cognitive 20): getAttrPathValue has cyclomatic complexity 20 and cognitive complexity 20; 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":"cli/js/40_lint.js"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ca9a7a0afd4e3a07845b07ca8dba2d2ee3c5c9600f0bc90103f14d950f7f58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indexOfBuffer (cyclomatic 20, cognitive 20): indexOfBuffer has cyclomatic complexity 20 and cognitive complexity 20; 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":"ext/node/polyfills/internal_binding/buffer.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"94009ac07f64315a03bc31e1847d730bc9dc6cc764dcd98b9005047afaa44984"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFileInfo (cyclomatic 20, cognitive 16): parseFileInfo has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/fs/30_fs.js"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9985308386b836bc753e88d2df51cd05eddcee5d7b7fabf3d3a4b7e674a02a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _ttyWrite (cyclomatic 20, cognitive 15): _ttyWrite has cyclomatic complexity 20 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bd43ba8c6d8e2fad0167debc6884dd7fcdad7a1408eb18f383dfa73565d7d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onStreamRead (cyclomatic 19, cognitive 40): onStreamRead has cyclomatic complexity 19 and cognitive complexity 40; 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":"ext/node/polyfills/internal/stream_base_commons.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f782e218f83106d6908611899841796321de2f72f8e1999a5d637c7855609768"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeHead (cyclomatic 19, cognitive 38): writeHead has cyclomatic complexity 19 and cognitive complexity 38; 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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee27db608ffdbf7f8abd082010d9fe2954ad5520ce64997ae7418afd620320b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #release (cyclomatic 19, cognitive 37): #release has cyclomatic complexity 19 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":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"605fd73314b972615ebcef431284c95f652f38cc0ef390fe4733519bfd3b5bdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNoProxy (cyclomatic 19, cognitive 33): parseNoProxy has cyclomatic complexity 19 and cognitive complexity 33; 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":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c15d6f9e500121f48d09ce78c5e7a6e1bed923bb2d7fe0da093032b90a31d93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldBypassProxy (cyclomatic 19, cognitive 30): shouldBypassProxy has cyclomatic complexity 19 and cognitive complexity 30; 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":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"234cf4a33736322a92ec90f7ebde1a06ddbead4ed2a832c2cfd16f7f11b771f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTapEntry (cyclomatic 19, cognitive 28): runTapEntry has cyclomatic complexity 19 and cognitive complexity 28; 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ec8c24253ca3955e0ea544b36306f3e5c3a2bc111ae709a5776517e7e5eb06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newExpectation (cyclomatic 19, cognitive 28): newExpectation has cyclomatic complexity 19 and cognitive complexity 28; 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/wpt/wpt.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d6690044a2c64781a0995375565027b3d557a54f967ab4d0d0f9966fd7e904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upgradeWebSocket (cyclomatic 19, cognitive 24): upgradeWebSocket has cyclomatic complexity 19 and cognitive complexity 24; 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":"ext/http/02_websocket.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec61a5f6f49fae9cf830752913e397fba47faa47d22b2a89c92676cc242a8b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathToFileURL (cyclomatic 19, cognitive 24): pathToFileURL has cyclomatic complexity 19 and cognitive complexity 24; 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":"ext/node/polyfills/url.ts"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c27938f8b9f17e5205735cef69c74c1cffa9f232d0c17247b259ec2e06789d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addRequest (cyclomatic 19, cognitive 23): addRequest has cyclomatic complexity 19 and cognitive complexity 23; 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":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"d137f48be315b18f78a5530f399dfada357e3c82a59f6f1ee43015d3308bc20e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function innerDeepEqual (cyclomatic 19, cognitive 23): innerDeepEqual has cyclomatic complexity 19 and cognitive complexity 23; 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e312a0fe064376f036114bedd782a0ecbf13571e468eb48586153452744ff522"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insideVarDeclLhsOrMemberExprOrPropOrTypeRef (cyclomatic 19, cognitive 23): insideVarDeclLhsOrMemberExprOrPropOrTypeRef has cyclomatic complexity 19 and cognitive complexity 23; 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":"tools/lint_plugins/prefer_primordials.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b80897b7652138cb5c623614c621d5658cb009ef6b09fb4e271527742cf9cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseProxyUrl (cyclomatic 19, cognitive 21): parseProxyUrl has cyclomatic complexity 19 and cognitive complexity 21; 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":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2243bfab11aa6a2489fd54e221971266683fa14bd10334bde888949b711c8430"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _wrapHandle (cyclomatic 19, cognitive 21): _wrapHandle has cyclomatic complexity 19 and cognitive complexity 21; 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7963ab2dfa00d18bbd75a7f3820611562a31b559634eece43f4a33f6f55467"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finish (cyclomatic 19, cognitive 16): finish has cyclomatic complexity 19 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c74291ad163cdc11d2c10a67c1bc57f820e4123f9562afdd07b2fcd49276da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onConnectSecure (cyclomatic 19, cognitive 14): onConnectSecure has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f0dd04293070478b773b6d807872d1d65ea016d14d0e13380883b394f1d03b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function get (cyclomatic 19, cognitive 11): get has cyclomatic complexity 19 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef58031721061d203e4028f7a04195e715e8fbfa2000deadfb21c8cbf0979d17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 9): (anonymous) has cyclomatic complexity 19 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32356668e65625c228c1114f3ef4b3902dc5bf5be6100d8aec41fcec654bf02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function argsToTokens (cyclomatic 18, cognitive 39): argsToTokens has cyclomatic complexity 18 and cognitive complexity 39; 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":"ext/node/polyfills/internal/util/parse_args/parse_args.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f494d08825e3fa116d69c0483d20392a0e4c740c542c4f789709be8b206eab6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bootstrapMainRuntime (cyclomatic 18, cognitive 38): bootstrapMainRuntime has cyclomatic complexity 18 and cognitive complexity 38; 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":"runtime/js/99_main.js"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"d569209ae95f46f35dd8c1632f8bf5103f7d3a098c521bbcbc75ba96068ba154"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 18, cognitive 31): load has cyclomatic complexity 18 and cognitive complexity 31; 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67ffc768eeb2d79ac01bd8dad8afa5131692684e7adb026e85f2cab1ce691d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function innerInvokeEventListeners (cyclomatic 18, cognitive 29): innerInvokeEventListeners has cyclomatic complexity 18 and cognitive complexity 29; 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":"ext/web/02_event.js"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea8c1c3df02dfefd6f7d34d226342d9b2d303955adcf05b28812f64e6a5e5aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listOnTimeout (cyclomatic 18, cognitive 29): listOnTimeout has cyclomatic complexity 18 and cognitive complexity 29; 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":"libs/core/02_timers.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad4c65ac50f0fec807bda70db290fb86aba1f2c4d346101166ee7cb6d85744a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emit (cyclomatic 18, cognitive 28): emit has cyclomatic complexity 18 and cognitive complexity 28; 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14f1aef154df94017bf2dbb3b85c018ad7de0d280e04b522727b342f07c8a60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 18, cognitive 28): (computed) has cyclomatic complexity 18 and cognitive complexity 28; 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":"ext/node/polyfills/internal/event_target.mjs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"677d98ce7be0e5b3b1927cffacda81f2434f2d02a699fda0f086bcc553590666"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relative (cyclomatic 18, cognitive 28): relative has cyclomatic complexity 18 and cognitive complexity 28; 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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8b000c0b00ca068f4eb8844ce8696b183057cce5c3645c73b2c425bf19236d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fastSyncResponseOrStream (cyclomatic 18, cognitive 26): fastSyncResponseOrStream has cyclomatic complexity 18 and cognitive complexity 26; 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":"ext/http/00_serve.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a853917698dfe57c322ec7f329e25a58f548cc841aa525238892818e6dd3471"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseKeyEncoding (cyclomatic 18, cognitive 26): parseKeyEncoding has cyclomatic complexity 18 and cognitive complexity 26; 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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8008d6ef443e6ba6b116e9f898be45a74886559573ca2efa5e667290dcada1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _afterConnectImpl (cyclomatic 18, cognitive 26): _afterConnectImpl has cyclomatic complexity 18 and cognitive complexity 26; 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":"ext/node/polyfills/net.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6b7d9fcc0b92be340b0cebaecda890cd4c0959a9387aaf583f3fe10d2d6304"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createHttpClient (cyclomatic 18, cognitive 25): createHttpClient has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/fetch/22_http_client.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96bc6c1e39eff27461f374c308f34067c47e6a2169fb79c053f5e29440f67b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createConnection (cyclomatic 18, cognitive 25): createConnection has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/https.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65818df8cc8548d569da80839db3f96e043cc1059e9999d2a9cdd22318467b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function storeHTTPOptions (cyclomatic 18, cognitive 24): storeHTTPOptions has cyclomatic complexity 18 and cognitive complexity 24; 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":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0295a4a186daa9b2434e88866ea73bc2fa399168f08cef2802c33de2a9a8ddde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 24): (anonymous) has cyclomatic complexity 18 and cognitive complexity 24; 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":"ext/node/polyfills/internal/priority_queue.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f62a84f5e9de3403f33a683195192119b762f30342ceb0f3a140a269d99711"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mockModule (cyclomatic 18, cognitive 23): mockModule has cyclomatic complexity 18 and cognitive complexity 23; 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":3347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66ff9d09a5acbd52d64d32148a821654a32fe34f4d2fc202f53e1a7b5cd6ee5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function watch (cyclomatic 18, cognitive 22): watch has cyclomatic complexity 18 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":"ext/node/polyfills/fs.ts"},"region":{"startLine":3474}}}],"partialFingerprints":{"codehealthFindingId/v1":"491f20eb683677becd73ed93ac8cb4a1c134a14115c88b00a3f6a356144c157a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishOrReturnNative (cyclomatic 18, cognitive 21): finishOrReturnNative has cyclomatic complexity 18 and cognitive complexity 21; 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":"ext/http/00_serve.ts"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"39135ed5e15a2024b003d01396542496743b9168b8050c3289a54be5a837090f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connect (cyclomatic 18, cognitive 21): connect has cyclomatic complexity 18 and cognitive complexity 21; 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":5345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e9d4dff4d6691fd6383f35577294e4393028954e5ac8255e02b4e236cd746e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extname (cyclomatic 18, cognitive 21): extname has cyclomatic complexity 18 and cognitive complexity 21; 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e3bc11eca4275db831d0e09d8e1638592fc05183f93ab178fa4391859e5f1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _init (cyclomatic 18, cognitive 19): _init has cyclomatic complexity 18 and cognitive complexity 19; 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"183f6abb53b6332a9991a1b26e29a819c82f63eb5ff18fc824b033a238879941"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripTypeScriptTypes (cyclomatic 18, cognitive 18): stripTypeScriptTypes has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/01_require.js"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c0cbe3adaccee62d5e6816c0ebc135461a159bf980ea7b12a404b847317c85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 18): (anonymous) has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f36aa7c3e3c2108a1e6008cd8237642eb4512c924ef033ac15b9b6922d956e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 18): (anonymous) has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/update_node_stream.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"93661266e8155bb921e1d197dcc7c42a2f05c98115f0dc5f4be19549b33a1fab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connect (cyclomatic 18, cognitive 16): connect has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cadb488f1e099377cf232c3eb50695ed4a46bd8ccd63148209d3af914961c41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function respondWithFD (cyclomatic 18, cognitive 15): respondWithFD has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76c9dc5f3784d194197e2161f7a29ef311e2e9fc1a8dec34df4c17115fd63f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findFirstNonFlagArg (cyclomatic 18, cognitive 11): findFirstNonFlagArg has cyclomatic complexity 18 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fc64809aa603c402e2c01de4153e7f97b8e5d30dba916c87f3e79358373834"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structuredClone (cyclomatic 18, cognitive 9): structuredClone has cyclomatic complexity 18 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/web/02_structured_clone.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7abb39755058df1a9d798d16faa59b1827e2b29c05c194b6d1274ec5650508"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 17, cognitive 37): parse has cyclomatic complexity 17 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":"ext/fetch/21_formdata.js"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f3a2a0645714831c8a1bbb35c2c28219b7073e9052c0e95dd5a795a63680a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 17, cognitive 33): check has cyclomatic complexity 17 and cognitive complexity 33; 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":"ext/node/polyfills/internal/crypto/scrypt.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c388b9d79c78fc0bbf6eaab329ad9b32955d281af3d643c46650ddba7abea3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createIpcHandle (cyclomatic 17, cognitive 30): createIpcHandle has cyclomatic complexity 17 and cognitive complexity 30; 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"994dd1eccff72920bfd4e81192e9b9efa3485f35d58292b0cc3e805e84651b92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composedPath (cyclomatic 17, cognitive 29): composedPath has cyclomatic complexity 17 and cognitive complexity 29; 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":"ext/web/02_event.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b1d72a0bf9d0fecce032bcd6939c4df3ee26c122ca783cabe1d78732e281ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapObjectEquiv (cyclomatic 17, cognitive 27): mapObjectEquiv has cyclomatic complexity 17 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dc4de48e5b7876f247e733bcab5fe32dc31e3bc884de0835f797f019907438"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _write (cyclomatic 17, cognitive 25): _write has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfe51ae2c0077e1afb148cdbfa3a56d06589553ab171f6f8cbf7d826c90caf4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _destroy (cyclomatic 17, cognitive 25): _destroy has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/net.ts"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b1b10fc2a3b51f241c555813ff0ff564441e074a0cc1e082e672bcffc48c39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareKey (cyclomatic 17, cognitive 24): prepareKey has cyclomatic complexity 17 and cognitive complexity 24; 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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"251fdd4f6a7a6ee3fad76a1e5c17fa5c305f00dcce7ac0d86f361d1f6f477c0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 17, cognitive 24): observe has cyclomatic complexity 17 and cognitive complexity 24; 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":"ext/web/15_performance.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"604e991078d88f417becf496f780e7f458cc3e2a8662891656b3883f3e7de40c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function errorOrDestroy (cyclomatic 17, cognitive 22): errorOrDestroy has cyclomatic complexity 17 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":"ext/node/polyfills/internal/streams/destroy.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d0eb70e50e768efdc9b6f7307a7bf536b4d78609c25d1f23f5ca14f3bcf8eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function altsvc (cyclomatic 17, cognitive 21): altsvc has cyclomatic complexity 17 and cognitive complexity 21; 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":4575}}}],"partialFingerprints":{"codehealthFindingId/v1":"401f6966568badf72c1b3549e0f9fb634ee32ccfbe65aab37dfd78048ddb1b16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Server (cyclomatic 17, cognitive 20): Server has cyclomatic complexity 17 and cognitive complexity 20; 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17bcd6ec87c87e8f81a3d4e2c6f6697dd50ee996f70a7a67808345953cd43e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WriteStream (cyclomatic 17, cognitive 20): WriteStream has cyclomatic complexity 17 and cognitive complexity 20; 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":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"808f7c5757d19c254c8cdc7142899d3d3247256a8fdb7cc0e2788f9f374b8e5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onWarning (cyclomatic 17, cognitive 19): onWarning has cyclomatic complexity 17 and cognitive complexity 19; 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":"ext/node/polyfills/internal/process/warning.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"02821e55bdeb599d08386928dfeb81aa15286adf8e304622db94cf9b97714e81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exithandler (cyclomatic 17, cognitive 18): exithandler has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a20cd5026ef18bccc31af93d6ccd86929210b82c7a33af4b69e1dcd293358bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 18): (anonymous) has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08f33a41aff427f7c04a727f3913bf4ded1e58f78a285d735e8b0bcbd388ef6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postMessageToThread (cyclomatic 17, cognitive 18): postMessageToThread has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd8e8d1eb1fe7c91bdd442ba39e1d533ddd94b20ecaf6b91099f0d4eb294838"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cache (cyclomatic 17, cognitive 17): cache has cyclomatic complexity 17 and cognitive complexity 17; 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":"runtime/js/10_permissions.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"12646cde4ad115fcfb6047cbb39bf3a323232c3722f21091813a1b7a13174632"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WritableState (cyclomatic 17, cognitive 16): WritableState has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab8a630a0785d6185d12079f4394a5d9105de348f6e32c7ef4dc2886855f709"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readableStreamPipeTo (cyclomatic 17, cognitive 16): readableStreamPipeTo has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/web/06_streams.js"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8770871a00981c33c6f929985a88820ca1525d3d042c61e80e0ccb324d65daa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeStream (cyclomatic 17, cognitive 15): closeStream has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"d605489da618487ee23ca17dcb291fb950670a09a18fa82d4638978053bbe0f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchAttrValue (cyclomatic 17, cognitive 13): matchAttrValue has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"cli/js/40_lint_selector.js"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"225a508784db8b444dd44044357f1566440236171428c7ae1cdf9627a89959a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #resolve (cyclomatic 16, cognitive 35): #resolve has cyclomatic complexity 16 and cognitive complexity 35; 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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fb270266c0dcd9c533ff9024198d98eeb28b19680f1220854a081799594300"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLoop (cyclomatic 16, cognitive 30): readLoop has cyclomatic complexity 16 and cognitive complexity 30; 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ef0f92c3179788e7d64f8adfb11c345c41f4b02d2c84ac5d724008d1b9b8a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #parse (cyclomatic 16, cognitive 30): #parse has cyclomatic complexity 16 and cognitive complexity 30; 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":"ext/node/polyfills/internal/mime.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ed3abd02e7f9f25df0cc899f68bd26ed04210aba1ac8c7972283709cc57a8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMappings (cyclomatic 16, cognitive 29): parseMappings has cyclomatic complexity 16 and cognitive complexity 29; 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cd36054d1efe8deda75a8b23776993972aee1b4a6b198e29ebeb3f3f89abb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _setupListenHandle (cyclomatic 16, cognitive 29): _setupListenHandle has cyclomatic complexity 16 and cognitive complexity 29; 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":"ext/node/polyfills/net.ts"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00f2343e7b50f3de623d4221af4ad57557d518370ec7ecb79f5c823476f4225"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 16, cognitive 29): (computed) has cyclomatic complexity 16 and cognitive complexity 29; 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":"ext/websocket/01_websocket.js"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2647b255815d0b62b1f4ac3d6f90ee3c18a4e98628e038c06bb1e14ccc1aa7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flushTestSnapshots (cyclomatic 16, cognitive 27): flushTestSnapshots has cyclomatic complexity 16 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":"cli/js/40_test_snapshot.js"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83d3e17842040631ce58e5234f7bbc6984c26ad166b379d16824d92ae844fbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeListener (cyclomatic 16, cognitive 27): removeListener has cyclomatic complexity 16 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01c5a86b6e3082b5eaaa72c02daf4a1a08bc9a3aab9a5f8c30251e746348eb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getProtocolRange (cyclomatic 16, cognitive 26): getProtocolRange has cyclomatic complexity 16 and cognitive complexity 26; 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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2b148d8cac7973081d7da5066b15562c25b4b06494f0860e6cfd503b925d44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 26): (anonymous) has cyclomatic complexity 16 and cognitive complexity 26; 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":"runtime/js/99_main.js"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83d97cdadaff9aa56ab959eeaa836873be5b2188d76e46c28639b518e8a639f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kill (cyclomatic 16, cognitive 25): kill has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ee89b4f6ba9378d95cd9b8d2522ad27cc9388554c52295847be8021562ec28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMimeType (cyclomatic 16, cognitive 24): parseMimeType has cyclomatic complexity 16 and cognitive complexity 24; 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":"ext/web/01_mimesniff.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58311211c4b9e5a4570c5d76e93ac7a9765524a127127e4a304d15e553f017e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatWhatwg (cyclomatic 16, cognitive 23): formatWhatwg has cyclomatic complexity 16 and cognitive complexity 23; 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":"ext/node/polyfills/url.ts"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6be2ffcab6d6a0cb945c69a80c433feeaa87350251d987245ea422d28b43b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 16, cognitive 23): search has cyclomatic complexity 16 and cognitive complexity 23; 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":"runtime/cpu_profiler/flamegraph.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0088a6d914e175e9ad18dbfd608f9c1edb5443d81c910dc62c89f4d2fdd99f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRandomPrimeJob (cyclomatic 16, cognitive 22): validateRandomPrimeJob has cyclomatic complexity 16 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":"ext/node/polyfills/internal/crypto/random.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fa1f26c8f0691faa3466f57e10622a226946b598dd7c887cadd778497ff1b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFromRawValue (cyclomatic 16, cognitive 21): getFromRawValue has cyclomatic complexity 16 and cognitive complexity 21; 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":"cli/js/40_lint_selector.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2e5208f7fce5a51796400027c3423b73e5e788f09354725b1df1afa1ca1572"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bind (cyclomatic 16, cognitive 20): bind has cyclomatic complexity 16 and cognitive complexity 20; 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":"ext/node/polyfills/dgram.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be8492831683e48236447cc120cdb60df9596c793e589483394bb0d163d8465"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enable (cyclomatic 16, cognitive 20): enable has cyclomatic complexity 16 and cognitive complexity 20; 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":2644}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e431411878ed0dd280a8347e610ca069638688b9cf8155adcf9fb7e1f63e50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bidirectionalIndexOf (cyclomatic 16, cognitive 19): bidirectionalIndexOf has cyclomatic complexity 16 and cognitive complexity 19; 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1d870633ab3d10c2f915fb7dd02e7a7ad92e28599943f9bae10caf3a021524"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serveInner (cyclomatic 16, cognitive 17): serveInner has cyclomatic complexity 16 and cognitive complexity 17; 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":"ext/http/00_serve.ts"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fcc877f3ff66c9a4effdb90906d8caedaf73228b03d0a1f480bd6fc4c8d9e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeSession (cyclomatic 16, cognitive 17): closeSession has cyclomatic complexity 16 and cognitive complexity 17; 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3819}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbf54d0c90cc5259d34ecd4dd9b1d540233b5ce6c266d94cd47863d20722666"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeStdioOption (cyclomatic 16, cognitive 17): normalizeStdioOption has cyclomatic complexity 16 and cognitive complexity 17; 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe342e521f29dcaedb2983e2bfc85953595e4a4fc3c9fc2165e6070a7bcf630c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 17): constructor has cyclomatic complexity 16 and cognitive complexity 17; 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":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faec4f245f7e58a9526f6eed7b1721df4c682654feb3d638fb53851465a5353"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRecoverableError (cyclomatic 16, cognitive 17): isRecoverableError has cyclomatic complexity 16 and cognitive complexity 17; 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddacea822f2349b0f6a77f72ebe57a99fd171c0e1ca9199e582a9b1549df7ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Hash (cyclomatic 16, cognitive 16): Hash has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/node/polyfills/internal/crypto/hash.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6233212cf1f3e9cffc64fba30fee0c675ba134a3eba444c248e2fa40589263"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pushStream (cyclomatic 16, cognitive 15): pushStream has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff6d164c07324c850d6e29d1f702a2b4c8fad2b3bba270421e604f3c33cff5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hexSlice (cyclomatic 16, cognitive 14): hexSlice has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fafe4c48744a43a9658e62897eb232bb9d6dec59946989c366459a7eebf239d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Decipheriv (cyclomatic 16, cognitive 14): Decipheriv has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"da805e5ecebc30422614b00f1da95beb531c43913ee958d15a6b537b36f447b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writevGeneric (cyclomatic 16, cognitive 12): writevGeneric has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/stream_base_commons.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb3bfccd7c782e0873bdfc9e36ce5cfa35376cce43f9162d4ee941e10b0a465"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultEval (cyclomatic 15, cognitive 33): defaultEval has cyclomatic complexity 15 and cognitive complexity 33; 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"765bbe010778fe520729e9f15d2fd45df5cb65212cea83186c7b8444f65cbdf2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapEquiv (cyclomatic 15, cognitive 32): mapEquiv has cyclomatic complexity 15 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"076c9d0cae0a5c1dabc55be26e00d5c4445fff022c11567566efe2db73de02b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createContext (cyclomatic 15, cognitive 28): createContext has cyclomatic complexity 15 and cognitive complexity 28; 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1f181f40443e875a6630db626d7d35bcef729162bb6525ba7e6d1b6bfae130"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 27): (anonymous) has cyclomatic complexity 15 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":"tests/wpt/wpt.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfff714fd79a8da4a49a982615681bf703099c0d6e0189e726f9636c71c36169"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 15, cognitive 25): inspect has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"faefe3041fe4ad12c777be0eef8a92d177e54f1c14ab53c4022e54793a075883"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 25): (anonymous) has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e371ff049f0889d9ed1e8b2c932819990baea7a96ba2dfe437b9761116e0f40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exec (cyclomatic 15, cognitive 25): exec has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/web/01_urlpattern.js"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"01abf776fdb2dbf33aa2e8ee39d93f02be6cc18f78ddd223636d0a08dc2a4f91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 25): (anonymous) has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/web/10_filereader.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6173211f0a4363d6d827ef37e6912a8303db914cd776d5f47c4d9483107625a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _addHeaderLine (cyclomatic 15, cognitive 23): _addHeaderLine has cyclomatic complexity 15 and cognitive complexity 23; 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":"ext/node/polyfills/_http_incoming.js"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c923b2efc587953bcbef7113b6db084c4f8d9add8e586321f95af64dea8077d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatToCronSchedule (cyclomatic 15, cognitive 22): formatToCronSchedule has cyclomatic complexity 15 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":"ext/cron/01_cron.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d938d2ff6333a951ab47074f7bac30026dbcd327bed88d6ebee3bd38379194a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #parseMap (cyclomatic 15, cognitive 22): #parseMap has cyclomatic complexity 15 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"174d549c32a20cdbd75851093ce9977fbe8ed95f80a3c96b7414b384ca2bfa6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 15, cognitive 22): read has cyclomatic complexity 15 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":"ext/node/polyfills/_fs/_fs_read.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaef8897be75aceabe072375304c3cc010d3cb1bc4ff1c8442576ed968c08bb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeKeyPem (cyclomatic 15, cognitive 22): normalizeKeyPem has cyclomatic complexity 15 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":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73da61838136b1f9e66474a0c8cef450abba0b272203036f60faaf5e96aa380"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) has cyclomatic complexity 15 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"991930751694d05eccf6ead42c75d8026d1b76b25a56aabc1fbf390d15f1b349"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getKeyObjectHandleFromJwk (cyclomatic 15, cognitive 22): getKeyObjectHandleFromJwk has cyclomatic complexity 15 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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"81123efce2c37f78d0281c409d6dbed07bb6e871e6c1215ea4d1b0ca805dd130"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _internalConnect (cyclomatic 15, cognitive 22): _internalConnect has cyclomatic complexity 15 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":"ext/node/polyfills/net.ts"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e32ace0e329f3faa792805704bd7ffc41c66cfc97df590608d75133c800d3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getModuleLiteralImportKind (cyclomatic 15, cognitive 21): getModuleLiteralImportKind has cyclomatic complexity 15 and cognitive complexity 21; 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":"cli/tsc/97_ts_host.js"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d770139fd2ed6de6c9d7fba4d5013db5a7cf49c61b1c7bb51cd904182c97b04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expectsError (cyclomatic 15, cognitive 21): expectsError has cyclomatic complexity 15 and cognitive complexity 21; 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":"ext/node/polyfills/assert.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"476ea1500f97198c07ab3613e5f9cf9bbcb978079956a788abe58778e1360aa3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hash (cyclomatic 15, cognitive 21): hash has cyclomatic complexity 15 and cognitive complexity 21; 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":"ext/node/polyfills/crypto.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67d82f5e4956fa4a5fa08c6a198ee3379be5e7456df23332464ae1605c7da26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 15, cognitive 21): read has cyclomatic complexity 15 and cognitive complexity 21; 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":"ext/node/polyfills/internal/fs/handle.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe36b8d2faf4e2f2f04ed916acba2aac036e75e9a292a89cbfbd096dc231344"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeMainTraceFile (cyclomatic 15, cognitive 21): writeMainTraceFile has cyclomatic complexity 15 and cognitive complexity 21; 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":"ext/node/polyfills/trace_events.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a4065fa83d885f0d02cfead20bbce23cadce4a3b233d137fabf82b62760957"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processHeader (cyclomatic 15, cognitive 20): processHeader has cyclomatic complexity 15 and cognitive complexity 20; 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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"d845bd1cbc155fdf39b730ea80259a8a46d0d3b5d976af9ea5345e0fd55b1cb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _ttyWriteDumb (cyclomatic 15, cognitive 19): _ttyWriteDumb has cyclomatic complexity 15 and cognitive complexity 19; 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":"ext/node/polyfills/_readline.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a171f9e72e7c50d19f2cf64a769a1cb5085d61d548b57772a7c1839d1b1faa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReadStream (cyclomatic 15, cognitive 18): ReadStream has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"814d80abbad829c7688ada4a61a2688978eb47d6da1fa1431f75e7f5ce93dcd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extname (cyclomatic 15, cognitive 18): extname has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b76751692ca1da464c021ead679066e6ab35377b58c8308da420be77bed5840"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertSnapshot (cyclomatic 15, cognitive 17): assertSnapshot has cyclomatic complexity 15 and cognitive complexity 17; 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":"cli/js/40_test_snapshot.js"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"168275c18b78009de7836261cbe24f705edb0a8d73b971a5ffe4bf588b49e404"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitWarning (cyclomatic 15, cognitive 17): emitWarning has cyclomatic complexity 15 and cognitive complexity 17; 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":"ext/node/polyfills/process.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb21084870d5703cb1f39c42d8d94427fa8c783402b77f36e6fb099a3516706"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lintNodePolyfillDenoApis (cyclomatic 15, cognitive 17): lintNodePolyfillDenoApis has cyclomatic complexity 15 and cognitive complexity 17; 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":"tools/lint.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39aa7ebdd813d2340abef95fe14989ad376b489949d15b4e24f76c30482541b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serve (cyclomatic 15, cognitive 16): serve has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/http/00_serve.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0c67f54c5198c6df1bc64303ae421c0e6d8f1c4e40144dbb694c76b41b0957"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 15, cognitive 15): check has cyclomatic complexity 15 and cognitive complexity 15; 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b22e3a3a92c7f1ddb054eea2aa8c296b9183ea93992b13c873c591d0f667107"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateOptionsBuffer (cyclomatic 15, cognitive 15): updateOptionsBuffer has cyclomatic complexity 15 and cognitive complexity 15; 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":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa19c9abdc35a8e9a6b96d4d1ddc5e9b0c311e31c5a84c793280b78d3b06025f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 and cognitive complexity 15; 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":"ext/webidl/00_webidl.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0808fb73b54ef2c144615ad5169112a47c003b566d9c0f9df34bdadc6bc6f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryGetSingleContentTypeHeader (cyclomatic 15, cognitive 14): tryGetSingleContentTypeHeader has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/fetch/23_response.js"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da658ff510d047c46976446febc1397f25dc59e4fddc4af7652bc503e63fa4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeFileSync (cyclomatic 15, cognitive 14): writeFileSync has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/fs.ts"},"region":{"startLine":2865}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd3e8ac8adffa44afa3b119200083bc5871656322f38234d8e4bbde407a5cfc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isZeroWidthCodePoint (cyclomatic 15, cognitive 14): isZeroWidthCodePoint has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"951b13d7fd5397903ac591fa291b8aef9ab96c6b6d490d440351c5a5b290fc73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arrayBufferViewIndexToType (cyclomatic 15, cognitive 14): arrayBufferViewIndexToType has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/v8.ts"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcfbee0db4ce88cd2c29664e60257a39eeca17f3e19fb5edd03f8cc27614d43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function on (cyclomatic 15, cognitive 13): on has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"c000e87c81824152a045a1bea9d76c081dca28aba7461ba843e98ec7e956fa93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function respondWithFile (cyclomatic 15, cognitive 12): respondWithFile has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3369}}}],"partialFingerprints":{"codehealthFindingId/v1":"637958206cd3b17ff99564962ba0c44e28f8a85f88b2d7c0920baeade1219e15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeEventListener (cyclomatic 14, cognitive 44): removeEventListener has cyclomatic complexity 14 and cognitive complexity 44; 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":"ext/web/03_abort_signal.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7f3bfb34071544bcc283ad8f182ad8a5b34ca2dd9139a0b6b15ca5899ce347"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPluginsForFile (cyclomatic 14, cognitive 42): runPluginsForFile has cyclomatic complexity 14 and cognitive complexity 42; 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":"cli/js/40_lint.js"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e82bfeb9a667279e82f6ec51beb0d4a61467c4f113efa7e68febca2d1866d1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function partialObjectMapEquiv (cyclomatic 14, cognitive 34): partialObjectMapEquiv has cyclomatic complexity 14 and cognitive complexity 34; 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f529d70166eaa947bde8a0574502ee20d29f6e8fd73ce2963f2a14f13912530"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generate (cyclomatic 14, cognitive 32): generate has cyclomatic complexity 14 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":"tools/startup_order/generate_macos_function_orderfile.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"435b227e39c16495a0613ae5f714407702a078d34f97c7a13f96080017f8d7bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aliasWebStreamGlobals (cyclomatic 14, cognitive 30): aliasWebStreamGlobals has cyclomatic complexity 14 and cognitive complexity 30; 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":"tools/update_types_node.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"be907038dcd868f8c179ac812e3275bc6928d21468c75a31034da54e392af7f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setObjectEquiv (cyclomatic 14, cognitive 27): setObjectEquiv has cyclomatic complexity 14 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be024ce00f175c479fbc709575fcba82142f1bbaca31ed8bc6a209193154949"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printMyersDiff (cyclomatic 14, cognitive 26): printMyersDiff has cyclomatic complexity 14 and cognitive complexity 26; 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":"ext/node/polyfills/internal/assert/myers_diff.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75c23c0eaaa309006e1b96d11e55552bccf2b36c27e63ebf46aec32c033be79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bootstrapWorkerRuntime (cyclomatic 14, cognitive 26): bootstrapWorkerRuntime has cyclomatic complexity 14 and cognitive complexity 26; 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":"runtime/js/99_main.js"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d16866a09ff757e268630e1624a4f4cff66d379e12400c6f23a18bce101c565"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkServerIdentity (cyclomatic 14, cognitive 25): checkServerIdentity has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e49d4a692085d67566c87be444fe24990a5a244055d6bdad3a2e3421991613d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createWorkerProcess (cyclomatic 14, cognitive 24): createWorkerProcess has cyclomatic complexity 14 and cognitive complexity 24; 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":"ext/node/polyfills/internal/cluster/primary.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c45466f49ef89527b31a0da8e2ca16a3b0b654875309c89447bbed690786a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initializeAResponse (cyclomatic 14, cognitive 23): initializeAResponse has cyclomatic complexity 14 and cognitive complexity 23; 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":"ext/fetch/23_response.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e9b34be495fd2b29c30bcd3ed0cfe3774eda844d862d2711a4ea39465e800b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDiffLines (cyclomatic 14, cognitive 22): buildDiffLines has cyclomatic complexity 14 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":"cli/js/40_test_snapshot.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c6e47bae74ebe4ad1029cf3b5b32128b983c25367ef4c896f7ebc6397dce5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearBuffer (cyclomatic 14, cognitive 22): clearBuffer has cyclomatic complexity 14 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3ffd98b85f72f12d0cf10f5d1b57f9f9c0b4c9197792933bee895520e3ff8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fillHeaderList (cyclomatic 14, cognitive 21): fillHeaderList has cyclomatic complexity 14 and cognitive complexity 21; 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":"ext/fetch/20_headers.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f93dc56ccf1854d1a70b46aabb2fa9c081454dd7434a0ee566cc35eab742d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fileSnapshot (cyclomatic 14, cognitive 21): fileSnapshot has cyclomatic complexity 14 and cognitive complexity 21; 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7b5964a7d689b50e7b15f0f38a43e428fa63abd593fa431a8f8685dd8c1d5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processChunkSync (cyclomatic 14, cognitive 21): processChunkSync has cyclomatic complexity 14 and cognitive complexity 21; 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":"ext/node/polyfills/zlib.js"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02f889ff2f0f27722878495a7139308a0ac915e74e86e60716c5ed48959d68b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Zlib (cyclomatic 14, cognitive 21): Zlib has cyclomatic complexity 14 and cognitive complexity 21; 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":"ext/node/polyfills/zlib.js"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"03aec655798a1c4ace40d2e6bfc110058e1734fa155fa7b80540dd16cb59e566"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onLine (cyclomatic 14, cognitive 20): onLine has cyclomatic complexity 14 and cognitive complexity 20; 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"142c8472f44a719bf33a1cb850954e7d3fc2161fc39f8d6d7c5556cb7914bc4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 14, cognitive 20): parseArgs has cyclomatic complexity 14 and cognitive complexity 20; 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":"tools/startup_order/generate_macos_function_orderfile.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2c493ef1dfcd44d33bdc93f9a72a7fd2c15e9f363bb0ab08b9ec9cbcc54797"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emit (cyclomatic 14, cognitive 19): emit has cyclomatic complexity 14 and cognitive complexity 19; 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":"ext/node/polyfills/domain.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba310cbe0e1b476aac62afc6259d381ccecce67f14258fa978f34e11871f6cb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 14, cognitive 19): execute has cyclomatic complexity 14 and cognitive complexity 19; 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":"ext/node/polyfills/internal_binding/http_parser.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2e4e5584174fb691ff998af1d1f61d4c0396566f0c2ac05f2eb1b08a4ff12d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _internalConnectMultiple (cyclomatic 14, cognitive 19): _internalConnectMultiple has cyclomatic complexity 14 and cognitive complexity 19; 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":"ext/node/polyfills/net.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9be1c29c59c18195d8d52b44492e5c02362d727ccf9894e6217e36fcb1ca38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createDictionaryConverter (cyclomatic 14, cognitive 19): createDictionaryConverter has cyclomatic complexity 14 and cognitive complexity 19; 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":"ext/webidl/00_webidl.js"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2e48115dec98488a9a02fd1cb3e05191bcc96bf2fa219758fbb6c4b2cdcdf4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function socketCloseListener (cyclomatic 14, cognitive 18): socketCloseListener has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"194b7eefb09de08de9cf4b66943a3f5cac7b50c43758178ad52d9500a715fb0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queryServer (cyclomatic 14, cognitive 18): queryServer has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/cluster/primary.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8881175acb665da730647df96cbddf212c301ccdc4612952b8c9b0209cd64e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #flushSyncUtf8 (cyclomatic 14, cognitive 18): #flushSyncUtf8 has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec213a1a954b66304a91866b85ee65f2b7d30607d3c54f2c493112668bdd352"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connect (cyclomatic 14, cognitive 18): connect has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/net.ts"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"9674e6b27cc81aea7b1711d3b6ae0b154e116c15c2178a27f4b0c2ae72e67ec9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fastSerialize (cyclomatic 14, cognitive 18): fastSerialize has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/web/13_message_port.js"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be4ae2dda6b1f30ccd1480816cc96068fd32e5303a797bf310f0c276b591abe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encodeLockName (cyclomatic 14, cognitive 18): encodeLockName has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/web/locks.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f67afadb1590e1ff6714c07bcaa050b08f2c707d5a680acc6560f6952ceaa7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function final (cyclomatic 14, cognitive 17): final has cyclomatic complexity 14 and cognitive complexity 17; 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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9ac3566400c553244aa90ae4f7830c5f100421154a1ce06d1d277be26c412c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function end (cyclomatic 14, cognitive 17): end has cyclomatic complexity 14 and cognitive complexity 17; 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":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc66373b3f93acc3c9f47925a90efd7a3a785845ec11ed65529f3f2e08c4b18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 14, cognitive 17): (computed) has cyclomatic complexity 14 and cognitive complexity 17; 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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff5a270333fdb206fdb88269ab1051c586aaddfe9706da402bc9f55845ac18f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeSteps (cyclomatic 14, cognitive 17): closeSteps has cyclomatic complexity 14 and cognitive complexity 17; 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":"ext/web/06_streams.js"},"region":{"startLine":4108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c27ed49ce8ec68744c2e90bf8d87c742158a2c5027003766817151cb4bc4346"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structuredClone (cyclomatic 14, cognitive 17): structuredClone has cyclomatic complexity 14 and cognitive complexity 17; 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":"ext/web/13_message_port.js"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce73bd5005bbc0f4ea4ab56d82095e7e99a2f572f52d0a517fc865b22b079fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sign (cyclomatic 14, cognitive 16): sign has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"96759a5903d2ce24cbe23e1205a3affce3b555589ec61feb8394fbbcf7f65c52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function end (cyclomatic 14, cognitive 16): end has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff89a23c87faf18c84d254a951a3d9ed246ef7240a88fc25487f5aaa2f78a87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mockFn (cyclomatic 14, cognitive 16): mockFn has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908f7c45b0dd07c878494f79e463380952858d074caa583e87406f474e8a051"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setIntervalAsync (cyclomatic 14, cognitive 16): setIntervalAsync has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/node/polyfills/timers.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8975561fb361660405caccfe65bdd5e19907fb9c8542c1a856a51fbfc0dee22a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportVariation (cyclomatic 14, cognitive 16): reportVariation has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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/wpt/wpt.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d16d97b4c3ea836ce6fee11bf066c4a6effa3869d3a034e1a1f092061500892"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleShellMessage (cyclomatic 14, cognitive 15): handleShellMessage has cyclomatic complexity 14 and cognitive complexity 15; 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":"cli/js/jupyter_kernel.js"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69a9f042ef4061af68c7c62078b61d183f50deecd4836e591f77d67eff5fa4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initStdin (cyclomatic 14, cognitive 15): initStdin has cyclomatic complexity 14 and cognitive complexity 15; 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":"ext/node/polyfills/_process/streams.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77decff883d1f5f7a64d14ec1660bd1b51d4815d2c3731a572f21d2b12716e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compare (cyclomatic 14, cognitive 15): compare has cyclomatic complexity 14 and cognitive complexity 15; 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"68528cf2467c266623d35aaffb169661c6a40bd55ec612df67f88d80b6130689"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseKeyType (cyclomatic 14, cognitive 15): parseKeyType has cyclomatic complexity 14 and cognitive complexity 15; 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":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a548937248877df8b83506c312f45595eb1bce2019703453161046a17dff99b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseKeyType (cyclomatic 14, cognitive 15): parseKeyType has cyclomatic complexity 14 and cognitive complexity 15; 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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f84e4de5c2d6ef2687b79cd96720372cfc34b8c900401fc47569d2a07583bf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readableAddChunkPushByteMode (cyclomatic 14, cognitive 15): readableAddChunkPushByteMode has cyclomatic complexity 14 and cognitive complexity 15; 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"548632dc72bee6516621c0467f6ff197ebedbadd3e445d52e462f8c021702b3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Agent (cyclomatic 14, cognitive 14): Agent has cyclomatic complexity 14 and cognitive complexity 14; 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":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"504b0dc459cf58c72078af813c1bf3cddbc81545670b31b4a42f351376212e37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Console (cyclomatic 14, cognitive 14): Console has cyclomatic complexity 14 and cognitive complexity 14; 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":"ext/node/polyfills/internal/console/constructor.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53881cfe70799304648075ad22e814a6aee4903da8ddae2e66ff1bc181adfe2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitNodeOptions (cyclomatic 14, cognitive 14): splitNodeOptions has cyclomatic complexity 14 and cognitive complexity 14; 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":"ext/node/polyfills/internal_binding/node_options.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed97a3136fc2372037b5d9182e39c975a7d2039a1e7739036ff9c8e40c0ed097"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function end (cyclomatic 14, cognitive 13): end has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ed59e6e7c43e4eb57b91530ac4b7b039b391afb278a57958ad068eb6b1035c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Cipheriv (cyclomatic 14, cognitive 13): Cipheriv has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c5cdbc68fb13f1223959437c069e506650394b99efba7a9736b12d887fabfc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReadableState (cyclomatic 14, cognitive 13): ReadableState has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfde2d1d077c7fcd912a898d21de94cace2439b6638a738e3c4c15ad241e2f67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arrayBufferViewTypeToIndex (cyclomatic 14, cognitive 13): arrayBufferViewTypeToIndex has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/v8.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"771b0cf320c315d81b9aba2bdb8841dcb652debfeb0395d3499d342ea6b39027"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MemberExpression (cyclomatic 14, cognitive 11): MemberExpression has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"tools/lint_plugins/prefer_primordials.ts"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e92ca686f7e93f0525d506ebdfe81907e99e1a5337a9145d813451fc288c24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadFunctionStarts (cyclomatic 14, cognitive 11): loadFunctionStarts has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1199884733b3140ece7e0fed3c60c69674e0f566b3f17074dadc6283cece46d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stringify (cyclomatic 13, cognitive 32): stringify 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":"ext/node/polyfills/querystring.js"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7098cd4213f2942eb0005e80b2732d634caab258d071c8f77f866065b1f0d27e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pull (cyclomatic 13, cognitive 26): pull has cyclomatic complexity 13 and cognitive complexity 26; 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":"ext/kv/01_db.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"727413e04ea238baa4f95cb0fe5d7810947028652ec7c76119e1524db71e007d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTapTop (cyclomatic 13, cognitive 23): runTapTop has cyclomatic complexity 13 and cognitive complexity 23; 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"94855a2704d6868f502c7557418782e77672ff9a22cefdf517733899eb03ea87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeSocket (cyclomatic 13, cognitive 22): removeSocket has cyclomatic complexity 13 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":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b65da15932bdcd0efc780fa50ce005d959ebe9281ca220a28bc6ea3bdbd0b1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Duplex (cyclomatic 13, cognitive 22): Duplex has cyclomatic complexity 13 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":"ext/node/polyfills/internal/streams/duplex.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"312de9b4e7c1d1cf872739f8aefed445bebb57c4c801b12682e7772f9a20c907"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function slice (cyclomatic 13, cognitive 22): slice has cyclomatic complexity 13 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":"ext/web/09_file.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1a84918b0c5f0d4b60b0ff87e75e0868709a99be2058a5e0dbf3024a706f99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encodeStr (cyclomatic 13, cognitive 21): encodeStr has cyclomatic complexity 13 and cognitive complexity 21; 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":"ext/node/polyfills/internal/querystring.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b2f206ad32d70f8d396c28aa4a5fda5baa58debf22364c48d76b4535095c7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fastPipeTo (cyclomatic 13, cognitive 20): fastPipeTo has cyclomatic complexity 13 and cognitive complexity 20; 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":"ext/web/06_streams.js"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e783343694dd546e421d9b01ee0ddefba0c0cefb9134ff0c7562e6121355c990"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serializeJsMessageData (cyclomatic 13, cognitive 20): serializeJsMessageData has cyclomatic complexity 13 and cognitive complexity 20; 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":"ext/web/13_message_port.js"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa945c38578a58cc86a89b933a1b373bb69bb572cdd0aea8335ad82c41afda8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 20): (anonymous) has cyclomatic complexity 13 and cognitive complexity 20; 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":"ext/webidl/00_webidl.js"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"098f17149c97dc08d4c2e0c73798e0496125c0a1f5c17ebdec18ede50b70e384"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) has cyclomatic complexity 13 and cognitive complexity 19; 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e608131d0e8f89c101c05dee002316954268e204f2b3a759de143dcf1c8db8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 13, cognitive 19): walk has cyclomatic complexity 13 and cognitive complexity 19; 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/wpt/wpt.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"8701fc32eb1e1e193d06a1f9639453dd9ac8817a59ac7ac3938b23bedfc8724e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function put (cyclomatic 13, cognitive 18): put has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/cache/01_cache.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2842a5be04a4755fadd1047d0cb2dd20ce7634e4cf2dac94393f5e09541d0b8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function byteLength (cyclomatic 13, cognitive 18): byteLength has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f3526aa343b62874672d8b6877c8d9c42be2139cc82d78f1dc20bdfbd19f54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function write (cyclomatic 13, cognitive 17): write has cyclomatic complexity 13 and cognitive complexity 17; 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":"ext/node/polyfills/fs.ts"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f8d98590a499659e74e93f87c8bb3fb230bbf33d8971549fc0661f62ed9837"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _from (cyclomatic 13, cognitive 17): _from has cyclomatic complexity 13 and cognitive complexity 17; 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe77a10995fb41898f97e9fe1995d04560fe5a51cfdeecb460b07a18e5138a77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareAsymmetricKey (cyclomatic 13, cognitive 17): prepareAsymmetricKey has cyclomatic complexity 13 and cognitive complexity 17; 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":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb37d27820a376b22ab00cb35549ad05184c46260a320287a593e928e77e8c12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #flushBufferSync (cyclomatic 13, cognitive 17): #flushBufferSync has cyclomatic complexity 13 and cognitive complexity 17; 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":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9cb9820f927e114a182cd9b4ae98044c50fcbd6ddd129d61b0721acea7e4e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function get (cyclomatic 13, cognitive 15): get has cyclomatic complexity 13 and cognitive complexity 15; 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":"ext/fetch/20_headers.js"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"53476c83ac972340e5c62b8e4a500a6bcfe65a7e714e44aa26fd687b6edb737a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePort (cyclomatic 13, cognitive 15): validatePort has cyclomatic complexity 13 and cognitive complexity 15; 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":"ext/net/01_net.js"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8be295f0d601e6fb2a9b5856b1286c4e5f025c99c99185282888b9a601afa3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connect (cyclomatic 13, cognitive 15): connect has cyclomatic complexity 13 and cognitive complexity 15; 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":"ext/net/01_net.js"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b08d3803d660dff54528d305be339477ce56c877bbe49ff5ee48e27a6e37aa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSync (cyclomatic 13, cognitive 15): readSync has cyclomatic complexity 13 and cognitive complexity 15; 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":"ext/node/polyfills/_fs/_fs_read.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c85c2a3f65ee774755f0eff7c1a5e1142c8e1ac3a1c51dcbe78d10f08edd466"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateNumber (cyclomatic 13, cognitive 15): validateNumber has cyclomatic complexity 13 and cognitive complexity 15; 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c359ab01ad6235b756674700092e357e454e6bb688ea0ca1ec043397f86fd13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function final (cyclomatic 13, cognitive 15): final has cyclomatic complexity 13 and cognitive complexity 15; 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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b79529e91c5e3a2e47368af556efd6a5b170534321311390ce2ad6df1ecf4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; 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":"ext/node/polyfills/internal/validators.mjs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62f5ddb84abc9b5bed539290df41396f1a026a67f8e60fd26146c21e86a5b7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ZlibBase (cyclomatic 13, cognitive 15): ZlibBase has cyclomatic complexity 13 and cognitive complexity 15; 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":"ext/node/polyfills/zlib.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac96a339bc849fc0cd0799893a4b6cafdb50d73fccb83008b762c52eb292de9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setupHandle (cyclomatic 13, cognitive 14): setupHandle has cyclomatic complexity 13 and cognitive complexity 14; 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34ea577bbfe327b4c3ee6bea18c1a7dcc9480b0a43176945ea7adddf35b0a42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getCipherInfo (cyclomatic 13, cognitive 14): getCipherInfo has cyclomatic complexity 13 and cognitive complexity 14; 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":"ext/node/polyfills/internal/crypto/util.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"60256f41bc16871d13bd19107038c21c81410e975847183e1b2958d842ee5eeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldColorize (cyclomatic 13, cognitive 14): shouldColorize has cyclomatic complexity 13 and cognitive complexity 14; 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":"ext/node/polyfills/internal/util/colorize.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcbd90a15bda5ae55a95cfda4d7d8aee884c0b76976433cf430d51fb6e4dd4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mockMethodImpl (cyclomatic 13, cognitive 14): mockMethodImpl has cyclomatic complexity 13 and cognitive complexity 14; 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33483a67290393e6f9d5d6f8ebab53eea0a011e285ab521ef45faa82ade24a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addEventListener (cyclomatic 13, cognitive 14): addEventListener has cyclomatic complexity 13 and cognitive complexity 14; 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":"ext/web/02_event.js"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"5530b56bc95fc1a323bcd51f21acb203e668ad7983a2315e50ef78598eb17d91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 13, cognitive 14): run has cyclomatic complexity 13 and cognitive complexity 14; 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/wpt/wpt.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb9a24a0b8e5df6d90f6c39470d5b754efbb4312a168383e834f753ddc8a7e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterMapDiagnostic (cyclomatic 13, cognitive 13): filterMapDiagnostic has cyclomatic complexity 13 and cognitive complexity 13; 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":"cli/tsc/97_ts_host.js"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc1a8f516df28cee2ce96d5738e516809527c9cb6bfb20de8d495cdb1ed47ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resolveLookupPaths (cyclomatic 13, cognitive 13): _resolveLookupPaths has cyclomatic complexity 13 and cognitive complexity 13; 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc665748e059356f6184cad9981d35cfa67ea8b990dc870abb21bf46dcd4216c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createRepl (cyclomatic 13, cognitive 13): createRepl has cyclomatic complexity 13 and cognitive complexity 13; 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":"ext/node/polyfills/internal/repl.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"996c547531053edc40f4bc69e51aa0c24bf8e112f968b2685e359fe9c9ba3c69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newReadableWritablePairFromDuplex (cyclomatic 13, cognitive 13): newReadableWritablePairFromDuplex has cyclomatic complexity 13 and cognitive complexity 13; 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":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa6385a577b612b620eadc0a18f9e1e5ed0b9a28d967b8208b1488447b4c9eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function close (cyclomatic 13, cognitive 13): close has cyclomatic complexity 13 and cognitive complexity 13; 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":"ext/websocket/01_websocket.js"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"7297c10c83688536bbb079cb6de259c53e9dbc89ceeef45a44832b3618d5d87e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addBindingPattern (cyclomatic 13, cognitive 13): addBindingPattern has cyclomatic complexity 13 and cognitive complexity 13; 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":"tools/lint_plugins/prefer_primordials.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"531e8a142f995e5e5e79ba554f7fd391ccdb756b585ddf1ceb569281d13b71b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestOnConnect (cyclomatic 13, cognitive 12): requestOnConnect has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"43319ed3bf93631ed755e8f0cdfe67ff5822596c70753e866a40041ac138450b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hexWrite (cyclomatic 13, cognitive 12): hexWrite has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbeab2e4080984cc533829813e520b4ee89133eb0ccbafa08f59617db605f1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertFileInfoToStats (cyclomatic 13, cognitive 12): convertFileInfoToStats has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/fs/stat_utils.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92e5b261c47caf8920a4b35181204152d14fbe615a4e10f85bfd230fdc64965"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal_binding/uv.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50cc5b3c02a260f16361ca349140527a85b0e36ecca1ea0a737871851861723"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encodePathChars (cyclomatic 13, cognitive 12): encodePathChars has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/url.ts"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba890e4ea92693e1cc7a024e3285c73d0a5b6838a7fa58f4582480a44dee39a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tmpdir (cyclomatic 13, cognitive 11): tmpdir has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/os.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e80e3832ded2dd8b89521ed28a9dadd7a387686c25ada7e41f6db96930ed6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function respond (cyclomatic 13, cognitive 9): respond has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":3196}}}],"partialFingerprints":{"codehealthFindingId/v1":"57067ebb108a927393159b14ca22316577eaf33297a9727b32bcbece1b24a87b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getHostname (cyclomatic 13, cognitive 9): getHostname has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/url.ts"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"225415c93c2c3dda5ca3733e34f6780943b12d9ece718005faec1027a3d6ed02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function traverse (cyclomatic 12, cognitive 36): traverse has cyclomatic complexity 12 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":"cli/js/40_lint.js"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd191da5545d343df276eccfd5599ca0c0e31fd2e8432a932c8729353b1f70e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkObject (cyclomatic 12, cognitive 28): checkObject has cyclomatic complexity 12 and cognitive complexity 28; 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":"tools/lint.js"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"412c5907700f6e29dc3bdeabcdf0c00be25c545f9367eec71a3ca1be3985df56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __bootstrapNodeProcess (cyclomatic 12, cognitive 22): __bootstrapNodeProcess has cyclomatic complexity 12 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":"ext/node/polyfills/process.ts"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca380f3308bc4c9c7e14f7f6a9b36733689f50c674183e660246226251eb82a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 22): (anonymous) has cyclomatic complexity 12 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"864193e6fbb23c9503fefb7b71557226ac5ebb2f40e07eec851b4cdec0e1895e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 21): constructor has cyclomatic complexity 12 and cognitive complexity 21; 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":"ext/ffi/00_ffi.js"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfea16bce770a8fef3bbf40fc68eeb2637d58dde7a356e6d2394c8d0234e10c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createErrDiff (cyclomatic 12, cognitive 20): createErrDiff has cyclomatic complexity 12 and cognitive complexity 20; 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":"ext/node/polyfills/internal/assert/assertion_error.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9607705e4112aaeec8d1a18767e1bf6ffcef06d765b745567a150cab0c22f80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookup (cyclomatic 12, cognitive 20): lookup has cyclomatic complexity 12 and cognitive complexity 20; 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":"ext/node/polyfills/internal/dns/promises.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc72c117b39f13fd49dd0adaae025437bb631cce95057684228048ff58b7c86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeAllListeners (cyclomatic 12, cognitive 19): removeAllListeners has cyclomatic complexity 12 and cognitive complexity 19; 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a7defe4508512ac19b4153dbf8c05e9b0c90f985704342202d1baddcf8a71a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseContentTypeFromRawHeaders (cyclomatic 12, cognitive 19): parseContentTypeFromRawHeaders has cyclomatic complexity 12 and cognitive complexity 19; 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3037d47178f7ea0c48b209713c44d8985b8670c7d3adb74bf581e04e4f2722"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readableByteStreamControllerEnqueue (cyclomatic 12, cognitive 19): readableByteStreamControllerEnqueue has cyclomatic complexity 12 and cognitive complexity 19; 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":"ext/web/06_streams.js"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49c5a52f6b6442fa0fbaba804a2b5958a7da88c35d3c1c807e570b4968833c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 12, cognitive 18): run has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/testing.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb31a5e7a55d60fe82d67658d265f486b5175b0e9636b93fe538112d0960ceb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fn (cyclomatic 12, cognitive 18): fn has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/testing.ts"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"189eca87a1839bb90d2552dfa66d2eb84a681848f4fcc27253aae37ffb7c01ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function close (cyclomatic 12, cognitive 17): close has cyclomatic complexity 12 and cognitive complexity 17; 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":"ext/http/00_serve.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"adca448460e981304aa0759022c2f4b8e9be2afd2ac9c1331802ffdac71f5442"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function myersDiff (cyclomatic 12, cognitive 17): myersDiff has cyclomatic complexity 12 and cognitive complexity 17; 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":"ext/node/polyfills/internal/assert/myers_diff.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8577efeeddc88b1e89804c35a5ed8e030b2b95b79e34a74599ea469a8ba58d49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function innerFail (cyclomatic 12, cognitive 17): innerFail has cyclomatic complexity 12 and cognitive complexity 17; 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":"ext/node/polyfills/internal/assert/utils.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa82f7e1b1a30e501f458d65440def4df3397fe5812e60ae9f584500e736e266"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 12, cognitive 17): update has cyclomatic complexity 12 and cognitive complexity 17; 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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bcaf21abe8451a47117a14419cf943130a0dfbcfc51d9e9cf02b0d07f5f1f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 12, cognitive 17): update has cyclomatic complexity 12 and cognitive complexity 17; 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":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"5819eb146cf2c4adb182c694ac4be1040dde8986bfc419feea698564e0947cf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pump (cyclomatic 12, cognitive 17): pump has cyclomatic complexity 12 and cognitive complexity 17; 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":"ext/node/polyfills/internal/streams/operators.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"123e08d263e57734cea1e3bdeb56cfc514e8edf5ac8604ffebaa8eca74021412"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createPreviewSession (cyclomatic 12, cognitive 16): createPreviewSession has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/node/polyfills/_repl_preview.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bb98ecc04b5f938dc6bf607e4ec992fab5007092345af16012d51b4fd3e9c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openCONNECTTunnel (cyclomatic 12, cognitive 16): openCONNECTTunnel has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/node/polyfills/https.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f639aa19ad97bc1b43d3166a2cd4e5a73fb9fb3707cd22c4ab9723d009fcf47a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeOrBuffer (cyclomatic 12, cognitive 16): writeOrBuffer has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cf725aa218f7074c02ad08c805140088e34707201ab133dbe25c0162234f43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 12, cognitive 15): parseArgs has cyclomatic complexity 12 and cognitive complexity 15; 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":"tools/startup_order/verify_orderfile.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b720fceb84d17ac37c37456e7815178f39ba89de4dcb5de03b533e1c12fb072"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toString (cyclomatic 12, cognitive 14): toString has cyclomatic complexity 12 and cognitive complexity 14; 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c14ac7805685fae7db764eaa52637d4a59b2f08bda7b067c995250b3a53b59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packageData (cyclomatic 12, cognitive 13): packageData has cyclomatic complexity 12 and cognitive complexity 13; 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":"ext/fetch/22_body.js"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dde70503a4181f3e230340218b72912e9bcc2f9bd96a6af91aeee9c4e6ca6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transcode (cyclomatic 12, cognitive 13): transcode has cyclomatic complexity 12 and cognitive complexity 13; 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":3312}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5122fdb603edba6234b824865f32f08f3e5ce6fb0d5bd6e9379f0597d18b305"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function howMuchToRead (cyclomatic 12, cognitive 13): howMuchToRead has cyclomatic complexity 12 and cognitive complexity 13; 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff26936e37c97b843e966c4019c266bd3b1c7eaef526b8c58907db86c71cce6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isArrayIndex (cyclomatic 12, cognitive 13): isArrayIndex has cyclomatic complexity 12 and cognitive complexity 13; 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":"ext/node/polyfills/internal_binding/util.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1509d07538a8a3005d8919ae8b53dd20d7a534ac1e227ed6810d0eda800458"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 12, cognitive 13): resolve has cyclomatic complexity 12 and cognitive complexity 13; 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":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce9dcd8330666ec2da9548b333127d7c393cbc960770ae1a13c5f79c5a8687b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 12, cognitive 13): observe has cyclomatic complexity 12 and cognitive complexity 13; 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":"ext/node/polyfills/perf_hooks.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0221e28c04151043c1b66dbc0b360043647017d345b1194a7812dc6c2af6dbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startSpan (cyclomatic 12, cognitive 13): startSpan has cyclomatic complexity 12 and cognitive complexity 13; 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":"ext/telemetry/telemetry.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8788a0d03a6918b89090f711196a90cca064a09c699899c2abaacdc71dc3726"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readProperty (cyclomatic 12, cognitive 12): readProperty has cyclomatic complexity 12 and cognitive complexity 12; 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":"cli/js/40_lint.js"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b237aef68e871d51d7d9e6dc4768945cf258144ce1c7a129cc38aa7cbdc2987"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _compile (cyclomatic 12, cognitive 12): _compile has cyclomatic complexity 12 and cognitive complexity 12; 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d93bcafc83ca98d3f81714a75894e35d57337b05e77810ff5cdd4298b2d8617"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function destroyer (cyclomatic 12, cognitive 12): destroyer has cyclomatic complexity 12 and cognitive complexity 12; 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":"ext/node/polyfills/internal/streams/destroy.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29264b201d1e439db3cd9dd5f06ab481baaa15cec844d5902410f87fbc7780d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 12, cognitive 12): start has cyclomatic complexity 12 and cognitive complexity 12; 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":"ext/node/polyfills/wasi.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"3173d57c89b09bc24565091a0c3c2808721a34cd1efd052755879eb24a77e71b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function format (cyclomatic 12, cognitive 11): format has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"cli/js/40_jupyter.js"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e784fca3c5abebde0c30a15f715118dbd1e03bc82d8e23dbd045d23742a1f470"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isJSDocDynamicImportDiagnostic (cyclomatic 12, cognitive 11): isJSDocDynamicImportDiagnostic has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"cli/tsc/97_ts_host.js"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a072602179997b4dedb7187a1a59373169f2357d1a238c4435ea1ccce32394"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildInspectorRequestUrl (cyclomatic 12, cognitive 11): buildInspectorRequestUrl has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3779d45c317bb7dc1ebc104c7f65a31675d3a5782897976163a780b8a767e73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b759aa45019f08716a5eeb06f7af8cde7619f085a4d52f6f56a2ec6106b236"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doStreamClose (cyclomatic 12, cognitive 11): doStreamClose has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c2f78ddc60bd40b59a4fc90ce231bb54c522b2d37aa686f19520b1ebcd69e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/js_stream_socket.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"290e702844998ff66990eecc894f3c85d890a718718947fca4eaea16860f89b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateBackupOptions (cyclomatic 12, cognitive 11): validateBackupOptions has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/sqlite.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1c15a9a36676fda986d9defaabc6e43860fea028518b99e30fcea9c1480928"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOptions (cyclomatic 12, cognitive 11): prepareOptions has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bc24521aa6fd70c641ea353951edaad2913ade5c7c510c7818121d3a1257be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 12, cognitive 11): initialize has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/wasi.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b7c324f4a5a2778ea1bc78b23630399fa5eb96d1b8b3015acb9af3a466e1f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function list (cyclomatic 12, cognitive 10): list has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/kv/01_db.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4539c5651872038289d55674604acd1b65d957f1ab6211dad80713fedf6362"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function partialObjectSetEquiv (cyclomatic 11, cognitive 31): partialObjectSetEquiv has cyclomatic complexity 11 and cognitive complexity 31; 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d6ab09cd594ad4535f8bb86fca4f3417974c73089f626023cb4a15da94ab38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listenerCount (cyclomatic 11, cognitive 25): listenerCount has cyclomatic complexity 11 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad5075f16af01e2224c443127aaae9730188ee0ae3dba3b749d6d6591c3d841"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ifError (cyclomatic 11, cognitive 25): ifError has cyclomatic complexity 11 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/assert.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14aef9767a5ead78c9f597d341c4584b6abbce6b63e6f33476ec905feb33a05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasNonZeroContentLength (cyclomatic 11, cognitive 22): hasNonZeroContentLength has cyclomatic complexity 11 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"922cb30791eb763e9177903f5af9d6d722fc610f62849202f1e46cc985087d90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 20): (anonymous) has cyclomatic complexity 11 and cognitive complexity 20; 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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efce32083363e9c63576d1dcb9cd22f59722c559f988d7243fd9d3da69cf962"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 20): (anonymous) has cyclomatic complexity 11 and cognitive complexity 20; 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":"runtime/js/11_workers.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"292d598b49076c68bbd5cf8fea49c93c3acb0fec7816dbed72d059a3f489b160"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function backtrack (cyclomatic 11, cognitive 19): backtrack has cyclomatic complexity 11 and cognitive complexity 19; 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":"ext/node/polyfills/internal/assert/myers_diff.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddcf57ca05f97f3a9380ca78bbe94d35d037ad720d6a91b365a90a9dd1f65d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pump (cyclomatic 11, cognitive 19): pump has cyclomatic complexity 11 and cognitive complexity 19; 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":"ext/web/06_streams.js"},"region":{"startLine":3413}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c76d81a4aae4edd6e8a71138de50abac69d2cd10b5bdef8f6d381cd8af0e855"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setEquiv (cyclomatic 11, cognitive 18): setEquiv has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"1845f22f1e19e0c7c007f449784e3849c3f559ed4ad93aded2563a352ff2d291"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #receiveDatagrams (cyclomatic 11, cognitive 18): #receiveDatagrams has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \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":"ext/web/webtransport.js"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"3357e2d422804304aee22bb199a359caf667c1775a85be309713b456bf426506"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _addListener (cyclomatic 11, cognitive 17): _addListener has cyclomatic complexity 11 and cognitive complexity 17; 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":"ext/node/polyfills/_events.mjs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"827f2ad1d1a2be91304b595f45b95b5f2e1c6011f86165750cf4f57d0b25c967"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getUnpackedSettings (cyclomatic 11, cognitive 17): getUnpackedSettings has cyclomatic complexity 11 and cognitive complexity 17; 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":5518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69a080c7fdc08129a310c4cfc1ab50684ffe3cb64fd13a17ad7c6df4625f95c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchBytes (cyclomatic 11, cognitive 17): searchBytes has cyclomatic complexity 11 and cognitive complexity 17; 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":"ext/node/polyfills/internal_binding/buffer.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1044aa7318a1b4f3d76cc00815fedce36f6a03b5c4dcd6c129331161f0d09407"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completionGroupsLoaded (cyclomatic 11, cognitive 17): completionGroupsLoaded has cyclomatic complexity 11 and cognitive complexity 17; 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad9291167f52d845cbc0e82247f0be8bc44bdd6b3753361feba3c2c0ba0fb2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkChildren (cyclomatic 11, cognitive 17): walkChildren has cyclomatic complexity 11 and cognitive complexity 17; 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":"tools/lint_plugins/prefer_primordials.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a5ccc8fb5ae68715adae83203d622c9c74d4491b76a8a68cd4c8232c336384"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exec (cyclomatic 11, cognitive 16): exec has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"cli/tsc/99_main_compiler.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"648dfc7f218e10792bdaa5ac81cdaebed737207757d3c096a622cc3226dcfa06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseContentTypeForCdp (cyclomatic 11, cognitive 16): parseContentTypeForCdp has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/fetch/26_fetch.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"031f8fed7bfde1476b5c3dbdd9d79762c0b6d7f487e73c4160aaa11d0822ae98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFileFromFd (cyclomatic 11, cognitive 16): readFileFromFd has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/node/polyfills/fs.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee4c01a5574142b4b52088d7a9cf5129eb0ffc26a35c0faa731f7a1a8bd7da8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 11, cognitive 16): (computed) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b339542448375e241e5fcc24d7be9572e5d212549cf7806579cb1442752c85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processTicksAndRejections (cyclomatic 11, cognitive 16): processTicksAndRejections has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"libs/core/01_core.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"391ed7e75aac20e60ac22c96608bcd625d8a0fe25eb846b3f08fcff7646007a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update_text_for_elements (cyclomatic 11, cognitive 16): update_text_for_elements has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"runtime/cpu_profiler/flamegraph.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe38d408737173c9bbc0e5b2ae64fc7f39d067708f2cd97f06aec6d3f09d2102"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onSocketNT (cyclomatic 11, cognitive 15): onSocketNT has cyclomatic complexity 11 and cognitive complexity 15; 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b7e13672136633847942526a62fc78430679ac743c2f8bf94ffd067cf8edf3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function write (cyclomatic 11, cognitive 15): write has cyclomatic complexity 11 and cognitive complexity 15; 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adecdea3a5bd0de7c1ec2664a916e87c0e905bcde5789d6876da659000d202b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; 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":"ext/node/polyfills/internal/http/address_override.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f295cbada7ea0ed7a12e2c4220ce0ddaeb20a44a642984c81a540a0e7f8571"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 11, cognitive 15): read has cyclomatic complexity 11 and cognitive complexity 15; 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":"ext/web/06_streams.js"},"region":{"startLine":6557}}}],"partialFingerprints":{"codehealthFindingId/v1":"6765d5f1752b35c13f6f7c54a5eb65302cac9de590289f0a799798c1e4efca8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runWithTestUtil (cyclomatic 11, cognitive 15): runWithTestUtil has cyclomatic complexity 11 and cognitive complexity 15; 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/wpt/runner/runner.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"274fe69fff1429805a75dc70b47c7071326272ea7cfd9bde7c861ce3f498245a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextResolve (cyclomatic 11, cognitive 14): nextResolve has cyclomatic complexity 11 and cognitive complexity 14; 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73ea3427159687b3339af784f71e829e21bda1b8f3bfc73d70038e5d211c755"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setHeaders (cyclomatic 11, cognitive 14): setHeaders has cyclomatic complexity 11 and cognitive complexity 14; 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":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"90989349672fe113be2c5e8d4dfec507678c14e7b8b67b469044c0c0821fcb08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertKey (cyclomatic 11, cognitive 14): convertKey has cyclomatic complexity 11 and cognitive complexity 14; 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":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1e6aaf9de5f200017d98ef9e1b09d4a8e9dd300aebc1bf10cde6748055d197"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAsyncIterator (cyclomatic 11, cognitive 14): createAsyncIterator has cyclomatic complexity 11 and cognitive complexity 14; 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"394782e86ac403dd384921ee91bf7afa499d3c7dcb3816dbbd76fc75b56c1ef3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _onconnectionImpl (cyclomatic 11, cognitive 14): _onconnectionImpl has cyclomatic complexity 11 and cognitive complexity 14; 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":"ext/node/polyfills/net.ts"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e1be5a2772593c3ae797cdde10e60ba7f488c1742d760119d9526ee12e616c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPathFromURLWin (cyclomatic 11, cognitive 14): getPathFromURLWin has cyclomatic complexity 11 and cognitive complexity 14; 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":"ext/node/polyfills/url.ts"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aa34658177d33f919d6f75acbb28573393a34bebc68b77b53debfa0e346696"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cpuUsage (cyclomatic 11, cognitive 14): cpuUsage has cyclomatic complexity 11 and cognitive complexity 14; 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":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4593c3894f23221cf1676c9287b489bef76b21ef69f3e8493d4195c28281a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processCallback (cyclomatic 11, cognitive 14): processCallback has cyclomatic complexity 11 and cognitive complexity 14; 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":"ext/node/polyfills/zlib.js"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e946ef6f2dedf7dbb0949f4c9bf70700dab9311620928f80ba046652939e207"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 14): constructor has cyclomatic complexity 11 and cognitive complexity 14; 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":"runtime/js/11_workers.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe0d2cf9d5dda85903ff2cadb6a7d73fe50bc841cb93fa70705283dbc1bc2ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isNullProto (cyclomatic 11, cognitive 14): isNullProto has cyclomatic complexity 11 and cognitive complexity 14; 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":"tools/lint_plugins/prefer_primordials.ts"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"f571904f9e79b06ebb708f8ae8af730a24e085fd021c1834c914b0e9d6f749f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; 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":"ext/fetch/22_body.js"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"a675e7e5882bbec9d6dace5fc5a6a6ac94022b0ac2f2892a6bfb2b3861b5119a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _implicitHeader (cyclomatic 11, cognitive 13): _implicitHeader has cyclomatic complexity 11 and cognitive complexity 13; 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":"ext/node/polyfills/_http_client.js"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25fa69a40c83802b2719436ac9a26a65db74cebec06956e1e11fdcf2c2dbc08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIPv4Range (cyclomatic 11, cognitive 13): parseIPv4Range has cyclomatic complexity 11 and cognitive complexity 13; 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":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5137efd7ae044eac96621471afe2d0e31341ee446d6013e06d3782fd41aeba70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mkdir (cyclomatic 11, cognitive 13): mkdir has cyclomatic complexity 11 and cognitive complexity 13; 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":"ext/node/polyfills/fs.ts"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48905d02b68a4a77ffaa185cf1da9ced9b9ad64bc8f28016dbf1422d83f0981"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onData (cyclomatic 11, cognitive 13): onData has cyclomatic complexity 11 and cognitive complexity 13; 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":"ext/node/polyfills/https.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce4392f8938cb38cb83aeeb4061a3c533e28310000bf53da3ea05742e44f9cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reduce (cyclomatic 11, cognitive 13): reduce has cyclomatic complexity 11 and cognitive complexity 13; 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":"ext/node/polyfills/internal/streams/operators.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee674f18adb4ca5a29a9722b9c94de32b62ff0adc7494ffc53ae0983ea87ced"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pipe (cyclomatic 11, cognitive 13): pipe has cyclomatic complexity 11 and cognitive complexity 13; 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":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa9cbceebec50b9c4e7cff47ebd69e597e51672057a66c23922644f29893231"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toNamespacedPath (cyclomatic 11, cognitive 13): toNamespacedPath has cyclomatic complexity 11 and cognitive complexity 13; 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":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"997a576671014f38108501242de7a5e49b3208812e35d855c4ab01dfbec13d5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryInitializeStaticResponseFast (cyclomatic 11, cognitive 12): tryInitializeStaticResponseFast has cyclomatic complexity 11 and cognitive complexity 12; 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":"ext/fetch/23_response.js"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2677b1d64fc8aa317f2b2839178ee797205867c232f15a759fb3f87fee13984d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextLoad (cyclomatic 11, cognitive 12): nextLoad has cyclomatic complexity 11 and cognitive complexity 12; 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":"ext/node/polyfills/01_require.js"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ae0c9fca542ba491d21b06a7b2c296f19d8ea37bb87050e26cefdfb81e03e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 and cognitive complexity 12; 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":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8908b50ae62cd91c0a2aa9264273d52577faada143fc1a128507af9d861fed74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectFormat (cyclomatic 11, cognitive 12): detectFormat has cyclomatic complexity 11 and cognitive complexity 12; 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":"ext/node/polyfills/testing.ts"},"region":{"startLine":3139}}}],"partialFingerprints":{"codehealthFindingId/v1":"560db1a2152a1ca6ed997fbb7c29551eea45eeb3c35d04a1c8185fc6da3f7532"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 11, cognitive 12): (computed) has cyclomatic complexity 11 and cognitive complexity 12; 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":"ext/web/01_broadcast_channel.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be6dfe90f056001d940b473a01a0b9976f45ab6730734439937ea66d1f05003"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function byobReaderChunkStepsMicrotask (cyclomatic 11, cognitive 12): byobReaderChunkStepsMicrotask has cyclomatic complexity 11 and cognitive complexity 12; 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":"ext/web/06_streams.js"},"region":{"startLine":4058}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf81febd25508f81d9f157b2451d3944c407cef52b6fa2303f956833161fc2fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeFile (cyclomatic 11, cognitive 11): writeFile has cyclomatic complexity 11 and cognitive complexity 11; 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":"ext/fs/30_fs.js"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0cf47545eb32563cb77990deb58a752e0f5eb9c910648a08ac04626ae390a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _finishInit (cyclomatic 11, cognitive 11): _finishInit has cyclomatic complexity 11 and cognitive complexity 11; 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":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab64cab72afa40bda728ce94917a382df39632d12b919db35ec17fd76c266c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cursorTo (cyclomatic 11, cognitive 11): cursorTo has cyclomatic complexity 11 and cognitive complexity 11; 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":"ext/node/polyfills/internal/readline/callbacks.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acc8747fca9ae338c002852a81a97d7420fe021a1e9dcc9cc8196ced7990a63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onclose (cyclomatic 11, cognitive 11): onclose has cyclomatic complexity 11 and cognitive complexity 11; 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":"ext/node/polyfills/internal/streams/end-of-stream.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fceda69ee1c66c19c5b5f1cc596953f88484386836cb1ec4a7c0c23addcd6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function timerified (cyclomatic 11, cognitive 11): timerified has cyclomatic complexity 11 and cognitive complexity 11; 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":"ext/node/polyfills/perf_hooks.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53a75d17aade6b14896401de09a11a928747889c6f3bfd26c40a47aac0bfbc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function on (cyclomatic 11, cognitive 11): on has cyclomatic complexity 11 and cognitive complexity 11; 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":"ext/node/polyfills/process.ts"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2ffef942cfa05478aa7e2ccc3e04c30d06f4ea8a0c4d0e1cb02fdd6a96a76b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; 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":"ext/webidl/00_webidl.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed01103a7ff2362922da4af374492d8a3db762ef749706a0243fe4bbf235712d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cloneInnerRequest (cyclomatic 11, cognitive 10): cloneInnerRequest has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/fetch/23_request.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d30c4e0739fcd315f4bcd54c1107e592bb7b66078b44ab7f362e4583124478"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeExecFileArgs (cyclomatic 11, cognitive 10): normalizeExecFileArgs has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/child_process.ts"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f435261288ab55b213e64ed879bb46129501e7558376fbc939ef88676ed4b74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeFile (cyclomatic 11, cognitive 10): writeFile has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/fs.ts"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfdd4cf43ef0ca423e104d82e286beadd0d6b5ce9c7575e7928154d67bab9aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 11, cognitive 10): (computed) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":2644}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcd5494852bd07712b33a3f744f608dbdfc157da34bbd14d532c6cd0b195be1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ping (cyclomatic 11, cognitive 10): ping has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/http2.ts"},"region":{"startLine":4181}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d40032ceed2c595a6154966db4ff1a20f72c1168592f6dbc9aba8322af071f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 10): constructor has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/async_hooks.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"e312e8359da3812affe2ddb1cdbb412015542fca805514edb34f0b225c3034e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function base64Write (cyclomatic 11, cognitive 10): base64Write has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"bead28c9cb22e6eb920dfa0a5f080a1362de1b03488cf7f43b602a71d84702cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function base64urlWrite (cyclomatic 11, cognitive 10): base64urlWrite has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8911b8c98362978d8b69b487a36770d9c9b89336f9048f1c877dc8c050a726d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawn (cyclomatic 11, cognitive 10): spawn has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b995d39b2ad8d97f69ed02d8a70775876ce6a1fd4b6dc85e524c69d735498ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyUsage (cyclomatic 11, cognitive 10): keyUsage has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/crypto/x509.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb832aa28fdde16841f29922768869dfa2094f10552c14b073afe2d238c9915e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uvException (cyclomatic 11, cognitive 10): uvException has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"13305fa20282616d9b515880a5538ea36bf822eb0523da6e95300d23ceaed8a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isEqualBoxedPrimitive (cyclomatic 11, cognitive 10): isEqualBoxedPrimitive has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5df730dbda78af5d60a29542491fbbcf3733dd524f2f896d00c7e6c98ded9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/internal/validators.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc16c415a6e1353fb1c77501c246a6d0c0fb70b9581839800e9db11a1a13394"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/node/polyfills/repl.ts"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c069dc57ee7f41bf633c48c5fbfd35001c357e2662e5a0120ecdaf60dd1f2122"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeEventListener (cyclomatic 11, cognitive 10): removeEventListener has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"ext/web/02_event.js"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"384bc6cee79ef71066cd6ba88800ccca701c4dcb4033d785cea709f2e33e5a85"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/06_streams.js: 8052 lines of code: ext/web/06_streams.js has 8052 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e842def7065881a848b8b436293ba7bc494d83a6247b0952e442f1f37a3c4d7"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/http2.ts: 5055 lines of code: ext/node/polyfills/http2.ts has 5055 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8bdfcf321aeb7fb3702a5fe3b8f93ba6a4890f41f6afbfa27053764361a298"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/errors.ts: 3783 lines of code: ext/node/polyfills/internal/errors.ts has 3783 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b0e3dd934943911a2b4df3d02d88fefd6771dee9e37cda609bbaaa1c9a7a95"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/fs.ts: 3740 lines of code: ext/node/polyfills/fs.ts has 3740 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f331cd85b3ecf4aa7b02362d872ab081fadfe96615e69144d9d26f7620e5983"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/testing.ts: 3321 lines of code: ext/node/polyfills/testing.ts has 3321 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/testing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22518ed31d552369606816bc5fc32e4b3564345360fb8e50e8d8db12002fe8cc"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/01_require.js: 3230 lines of code: ext/node/polyfills/01_require.js has 3230 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/01_require.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72a6402e5bc0a7b4d4dcca5e9d7f0a9b0435b0154a666b0f5069e7acc9edf72"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/buffer.mjs: 3114 lines of code: ext/node/polyfills/internal/buffer.mjs has 3114 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bdd5b691bc3361cb73a02aed75804b69d4af33fcd82028214e2784a13d226a"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/net.ts: 2947 lines of code: ext/node/polyfills/net.ts has 2947 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/net.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5808b00f1fd704fa2e2300a541ded962753569d115ab68821d961cce1b0e9329"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/child_process.ts: 2799 lines of code: ext/node/polyfills/internal/child_process.ts has 2799 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b04c1826f49568ced157d4874e1692406f336d5463f12df362686e62026a9f"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/worker_threads.ts: 2201 lines of code: ext/node/polyfills/worker_threads.ts has 2201 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"656a3a772d2595a30072e42f709ba0ee521a1de8fc9033c558f73eb64b11dc76"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/repl.ts: 1930 lines of code: ext/node/polyfills/repl.ts has 1930 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/repl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"245465f4101ae23b5483401d0e9112c4fb19da4bcc227992a9b826284823cc2a"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/process.ts: 1896 lines of code: ext/node/polyfills/process.ts has 1896 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d082eb7bbf2dce413b58f935712c1c4643b408040a9356fda2c8753bb59ffdb"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/telemetry/telemetry.ts: 1779 lines of code: ext/telemetry/telemetry.ts has 1779 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/telemetry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa23d2fe0cd44e419219b1cd2ac56ff99fa720e97b37a92703e2944d692d40e"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/_tls_wrap.js: 1760 lines of code: ext/node/polyfills/_tls_wrap.js has 1760 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf57dbc4c23433ebbaf7de3dabf90de987953da5dfb3084b12d67e2735ac9049"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/streams/readable.js: 1666 lines of code: ext/node/polyfills/internal/streams/readable.js has 1666 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ecec66eed2de7d015a8c098016a548fa4f70f13f2371efd6156b1d3537f4eb"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/http/00_serve.ts: 1627 lines of code: ext/http/00_serve.ts has 1627 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/00_serve.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d1e1b1364302eebfc4d34e1517339fe334b5a450640852f84741faec9732c9"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/_http_outgoing.ts: 1610 lines of code: ext/node/polyfills/_http_outgoing.ts has 1610 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa6439cb5be2518bac4015eb5b2e511cf3378b0815164a9e2c959b45f1b2bae"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/url.ts: 1597 lines of code: ext/node/polyfills/url.ts has 1597 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/url.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b959a5082559a65937b8e9daa9cb1588bf46700c6bd3fede7c8bbb980bf8df13"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/crypto/diffiehellman.ts: 1592 lines of code: ext/node/polyfills/internal/crypto/diffiehellman.ts has 1592 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8843927ef18bb7ad70862cddd5393568bec645b6daebe744f79cf0ea92c1adac"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/webidl/00_webidl.js: 1553 lines of code: ext/webidl/00_webidl.js has 1553 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webidl/00_webidl.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb7f810a16119655b757103f3577292b5e7457191c4a4a1783fe1ebb7ea4c81"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/02_event.js: 1515 lines of code: ext/web/02_event.js has 1515 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/02_event.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24484bf3512c5f5ccf612c2bf72836cb4f9189e1cd82a40937e618ffbb2ce638"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/_http_client.js: 1510 lines of code: ext/node/polyfills/_http_client.js has 1510 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e262d3508839bbcac64f8844928d2e2bd9e2541422bb0ba82a4690431a5c5a2"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/dgram.ts: 1460 lines of code: ext/node/polyfills/dgram.ts has 1460 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dgram.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9595538ff0b194ef16fa8788500b278f2d10b8e352283d9d82ee563d638821f3"}},{"ruleId":"R3","level":"warning","message":{"text":"cli/js/40_lint.js: 1409 lines of code: cli/js/40_lint.js has 1409 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fcb54010781ee974773db86f48c44ba016f6e12c5e4725c5f521fe87fd4ed4"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/js/99_main.js: 1304 lines of code: runtime/js/99_main.js has 1304 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/99_main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eaac7e7abb9b4e2f8a7695946534894f9485663ab2a6868096fa075708c62c"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/readline/interface.mjs: 1282 lines of code: ext/node/polyfills/internal/readline/interface.mjs has 1282 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9577c52757c456fe27b25cc4246b09ad9bb6be572bb9430dc56ca55ff5d51d"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/util/comparisons.ts: 1282 lines of code: ext/node/polyfills/internal/util/comparisons.ts has 1282 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49daa7bebfc8ed190c89dbc128507bbeea84db2d7e2098506b330e5d8588c0bd"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/zlib.js: 1241 lines of code: ext/node/polyfills/zlib.js has 1241 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/zlib.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c544b91cb4bc6568768784f11668d4626fa11e6c765b65cfbef940a4240a798"}},{"ruleId":"R3","level":"warning","message":{"text":"libs/core/01_core.js: 1230 lines of code: libs/core/01_core.js has 1230 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/01_core.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5d921986032b0574634cd89677fc561e96607b94d51c4773b2d872f0b2ef7d"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/_fs/_fs_glob.ts: 1202 lines of code: ext/node/polyfills/_fs/_fs_glob.ts has 1202 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"388170c944ace325c11a4ad67a0d4cb79630699f12dc838f8ac33d64e9809521"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/_events.mjs: 1198 lines of code: ext/node/polyfills/_events.mjs has 1198 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_events.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b128eac4fede10c7cc6708a44a733ebbf43c5bf6cf1432405d4347a81a8970ee"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/00_url.js: 1169 lines of code: ext/web/00_url.js has 1169 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/00_url.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05933acb884e02ba63c81913add0bd9a7856b2b733783a5fee6e9c146dd95463"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/fs/utils.mjs: 1133 lines of code: ext/node/polyfills/internal/fs/utils.mjs has 1133 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/utils.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6a9bc669a4b79892be36cd137e376c92cc359c8db3ea247d2db09d0c7029ca"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/path/_win32.ts: 1132 lines of code: ext/node/polyfills/path/_win32.ts has 1132 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33808a82de2142eea04346419cf18eb4ecbb3626309283d59732469e644eec0"}},{"ruleId":"R3","level":"warning","message":{"text":"cli/js/jupyter_kernel.js: 1120 lines of code: cli/js/jupyter_kernel.js has 1120 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/jupyter_kernel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8821f32e61c32a6e5b8ac8bdc246c38e2daca4ef92514b918fc76ab831d98b3"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/streams/writable.js: 1118 lines of code: ext/node/polyfills/internal/streams/writable.js has 1118 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/writable.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69f24f7e49e4178ca312d1d96e929ff30bcb0da9a81bab6f9b2e19c0548d123"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/13_message_port.js: 1108 lines of code: ext/web/13_message_port.js has 1108 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/13_message_port.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b8ce4dd52c6659bcec27f841fb9408a172157c7ed8ee0c9cc04a8e637d9b47"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/dns.ts: 1080 lines of code: ext/node/polyfills/dns.ts has 1080 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"359d77b575530bc718b694a994963ccf49e034d527d923a12a05cfa2943a2b52"}},{"ruleId":"R3","level":"warning","message":{"text":"cli/js/40_lint_selector.js: 1072 lines of code: cli/js/40_lint_selector.js has 1072 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint_selector.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adef82f76e10f1fd479061b57e96c44ae737ccfcd3cbd1f8a5c3dd3233e20dc7"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/fetch/26_fetch.js: 1059 lines of code: ext/fetch/26_fetch.js has 1059 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fa75d4edf630b53e1aacaeedb208d673f8eb123fa4694e9490756749fcc4f7"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/event_target.mjs: 1058 lines of code: ext/node/polyfills/internal/event_target.mjs has 1058 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/event_target.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8834f58390efc3ec520284fefd363654a34ff5256b843a348b3667934c59b8"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/crypto/keys.ts: 1057 lines of code: ext/node/polyfills/internal/crypto/keys.ts has 1057 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cea89c42c16d6cb7d92d7bea5698d649ded788f970b83709f90be88c353411"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/http2/util.ts: 1048 lines of code: ext/node/polyfills/internal/http2/util.ts has 1048 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49be017c0e5e7dc9a3ff89f76a75803a5cd91fcc12064f6db0925aecf1bd8b9e"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/webtransport.js: 1040 lines of code: ext/web/webtransport.js has 1040 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/webtransport.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a268f0160a0faa7cfe882d7469c84f3a7654db98d167e07ccb2f2f1a13401ab4"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/lint_plugins/prefer_primordials.ts: 972 lines of code: tools/lint_plugins/prefer_primordials.ts has 972 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/lint_plugins/prefer_primordials.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dae80a8fd932c62f3ffc2b1cd30a0fce33f30453ebc1bc84f393e6fadfb572"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/websocket/01_websocket.js: 955 lines of code: ext/websocket/01_websocket.js has 955 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/01_websocket.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"907c89278e0edae3223fd0dfcca5a98136444536227cad032f2ea138f896e22f"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/fetch/23_response.js: 946 lines of code: ext/fetch/23_response.js has 946 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/23_response.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b3204866bdd343bc2b4a04faf0c54cfbbea200737f2ad13cc38ed4d1f80884"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/assert.ts: 931 lines of code: ext/node/polyfills/assert.ts has 931 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/assert.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f1184402ded9dc0910958ed7bb5da3a00102c81ce6353826bb4535756c2158"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/fs/30_fs.js: 927 lines of code: ext/fs/30_fs.js has 927 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/30_fs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ffbdde76ab88bb8f1fcc1db92c3e0a7265ef48ca5d44afc751c5911ad45929"}},{"ruleId":"R3","level":"warning","message":{"text":"cli/tsc/97_ts_host.js: 916 lines of code: cli/tsc/97_ts_host.js has 916 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/97_ts_host.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82504a387d85e6a1223a76126c10d886b713e19ffda7ad12cc7a666e441695b2"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/kv/01_db.ts: 910 lines of code: ext/kv/01_db.ts has 910 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/kv/01_db.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efbcef4680493e53d7f3ef148ab77ec294f66875650db532c405a56d585f819"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/http2/compat.js: 909 lines of code: ext/node/polyfills/internal/http2/compat.js has 909 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94d79b50de01ceea3e4024afda2f884742758acf40f67c70aa1f92ee5fe685b"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/webgpu/01_webgpu.js: 897 lines of code: ext/webgpu/01_webgpu.js has 897 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/01_webgpu.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fb90bde09662c542c81a5c9cc3785da2967fc2224db98a976ce11bbb1fb91d"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal_binding/constants.ts: 891 lines of code: ext/node/polyfills/internal_binding/constants.ts has 891 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"255573756fae35fcf2d7bfa7de6da55cd72c0b9ee8724feb79033c9438e850d5"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/child_process.ts: 879 lines of code: ext/node/polyfills/child_process.ts has 879 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/child_process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"167ede360d4a922d4540aae1ed75011f98c1c0709e72699a4680c82867a7e44b"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal_binding/cares_wrap.ts: 871 lines of code: ext/node/polyfills/internal_binding/cares_wrap.ts has 871 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfbf406e6a0f584c31e6c7f7cf950911976e1063eae98ac779d91274bd15730"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/crypto/cipher.ts: 867 lines of code: ext/node/polyfills/internal/crypto/cipher.ts has 867 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f70e4d7e2de698f251c9d9a6d9c6a2a389d2b006be410ca71963755074cab33"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/vm.js: 854 lines of code: ext/node/polyfills/vm.js has 854 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/vm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fce05fbc5f46e8a20425512e498f27409f519f90c4dde143f5aaf1917ade4c"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/09_file.js: 835 lines of code: ext/web/09_file.js has 835 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/09_file.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"083a87c3c32abb36aff4a031e56432eddcca336b4df26ce62fc5acac62a68a56"}},{"ruleId":"R3","level":"warning","message":{"text":"cli/js/40_test.js: 826 lines of code: cli/js/40_test.js has 826 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0b683badfaf6fc53c6de6936ab7413eb80642f95fd18c1294a1f3155d51592"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/process/40_process.js: 821 lines of code: ext/process/40_process.js has 821 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/40_process.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11647b693cd27389cce2f95b676880cacb9bd6eba0b69d464b11a0c6cf3128b6"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/fetch/23_request.js: 818 lines of code: ext/fetch/23_request.js has 818 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/23_request.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7fe87d06957edf1d1737a9dd489312b758c188c9c80cc5146c24da078aa2ed"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/lint.js: 794 lines of code: tools/lint.js has 794 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/lint.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0c2600ca4c80cfba4175bfa471ecc26127ea37fac86aaa69ce0dfa63e70ca0"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/v8.ts: 784 lines of code: ext/node/polyfills/v8.ts has 784 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/v8.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22b15884b354be5b9ca433b77a45ab478f62abdd712d149cafb4a075429d195"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/wasi.ts: 782 lines of code: ext/node/polyfills/wasi.ts has 782 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/wasi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b38cfdc3bfbc109fdd4ac7e63ec0c36a1abe8ddf472a51b65de94fa13cbbc4"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/streams/fast-utf8-stream.js: 781 lines of code: ext/node/polyfills/internal/streams/fast-utf8-stream.js has 781 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69c268355f3b9fea5e3b25e4b44903a8145758c0661fb76c2edf0ad7a18b3c7"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/15_performance.js: 768 lines of code: ext/web/15_performance.js has 768 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/15_performance.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7f519566bc6197a0e44bfe311a3aaac3f88873e83405f264fd301930098d9f"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/console/constructor.mjs: 759 lines of code: ext/node/polyfills/internal/console/constructor.mjs has 759 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/console/constructor.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"492d88361cee4f58646026b14c9bbd70e8f73b12aaf26ff5725e22e4adbb365d"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/fetch/20_headers.js: 718 lines of code: ext/fetch/20_headers.js has 718 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/20_headers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf880544e4ff82974c01869be4530c1db2bb8baaf08ecaada26018085a74aac"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/net/01_net.js: 711 lines of code: ext/net/01_net.js has 711 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/01_net.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f49206b64809cc213144e096f3147cebd91076d9c076285dfdd78647852ca4"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/webstreams/adapters.js: 707 lines of code: ext/node/polyfills/internal/webstreams/adapters.js has 707 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f678ec04482de790c64ac46a5a060ff63ad3a9220a369aa1d9dc9b7898a8481"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/util/inspect.mjs: 698 lines of code: ext/node/polyfills/internal/util/inspect.mjs has 698 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"281cc469081bf6f337ad6c5e446cc2f3f6a44043c40322ae2781796bdf19526c"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/_tls_common.ts: 692 lines of code: ext/node/polyfills/_tls_common.ts has 692 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb979539ea39fee73ba2b44688e215238047abaf38db79e8990a0136e7e71b8"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/01_console.js: 672 lines of code: ext/web/01_console.js has 672 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/01_console.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73d13090afb7523e9673a3a08c87bed090f654d035bd5288747a6030b22a1d1"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal_binding/udp_wrap.ts: 657 lines of code: ext/node/polyfills/internal_binding/udp_wrap.ts has 657 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/udp_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db66651ef93d467b3834897ecabc78b514c8e489c5fcf0a63aba662f5c7b8bc5"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/_http_agent.js: 654 lines of code: ext/node/polyfills/_http_agent.js has 654 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a183a751b681ea173cb5311ecacb3fd86da364faaa27b49aec114bd8adda7f51"}},{"ruleId":"R3","level":"warning","message":{"text":"libs/core/00_primordials.js: 652 lines of code: libs/core/00_primordials.js has 652 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/00_primordials.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c683a1c6aee6ac9c673290981aaa89b8702973c04d3e2a5cf2eb0ba70c132656"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/https.ts: 640 lines of code: ext/node/polyfills/https.ts has 640 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/https.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f960f8c3000860dcf98fa33b1a7618c425ab58a8ff94b8c07f5668414798f5"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/fetch/22_body.js: 639 lines of code: ext/fetch/22_body.js has 639 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/22_body.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92b44b7dcc6dca386508253abe5bd7bdb23bf8ad28b3cf649e5df5e585b5dae"}},{"ruleId":"R3","level":"warning","message":{"text":"cli/tsc/98_lsp.js: 634 lines of code: cli/tsc/98_lsp.js has 634 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/98_lsp.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21de8371e9ea0ed61f72a71ae677dfb76ad50270eee43e6cd758b00bdc45bb8b"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/perf_hooks.js: 634 lines of code: ext/node/polyfills/perf_hooks.js has 634 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/perf_hooks.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8a1612609105e6e9b806d87ed5bfae457471b0adfce00657a5234a01da171f"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/http/address_override.js: 594 lines of code: ext/node/polyfills/internal/http/address_override.js has 594 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http/address_override.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"412ba6b0721c9fad3a0551c25f33e9079f9bd6bde2b0bd9fd0dfd89ead5af9ea"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/dns/promises.ts: 591 lines of code: ext/node/polyfills/internal/dns/promises.ts has 591 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/dns/promises.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61109a1ed6532b2451319a444815c3dfe8d31e8f1867b53381a6b1dc36839e5a"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal_binding/uv.ts: 585 lines of code: ext/node/polyfills/internal_binding/uv.ts has 585 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/uv.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf22291bffd284690ad2ff75dfa69063117ac7199299e7bbd4e78ac2a62dc6b"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/08_text_encoding.js: 585 lines of code: ext/web/08_text_encoding.js has 585 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/08_text_encoding.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3464a3dbf13d9551e99d01e83bc455f3f0daf5f951fdfa2fd2e2c579e698cee"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/fs/handle.ts: 583 lines of code: ext/node/polyfills/internal/fs/handle.ts has 583 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/handle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ddd3453b938d3c9ffb0dfb5d25362fc459d6d875277e65407e25ee9487baac"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/fetch/21_formdata.js: 581 lines of code: ext/fetch/21_formdata.js has 581 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/21_formdata.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd46ead0cc8eb5992c49030aa3bc033b784e322d27836dc660d6aecf368cba9"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/startup_order/generate_linux_function_orderfile.ts: 576 lines of code: tools/startup_order/generate_linux_function_orderfile.ts has 576 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92474e9edc8cbc288110770b7cb27416d379e775206fe9aac2e18a8bcf3e7b52"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/js/98_global_scope_shared.js: 574 lines of code: runtime/js/98_global_scope_shared.js has 574 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/98_global_scope_shared.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7349a955a3c6524899bb1e577e282e932ef260766294932be6f4b63c806a4575"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/crypto/keygen.ts: 569 lines of code: ext/node/polyfills/internal/crypto/keygen.ts has 569 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a246b8f1f2b67ce84387f190a73e2c1ee94d25dcf06c64b7c804f49d4421cd1b"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/readline/utils.mjs: 555 lines of code: ext/node/polyfills/internal/readline/utils.mjs has 555 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/utils.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc66a2888ced612d5b9c5be39a509d05a5f7150e27aad80b341e9bb273fb00d"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/crypto/sig.ts: 551 lines of code: ext/node/polyfills/internal/crypto/sig.ts has 551 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20877cc89f47e8d541a1e5f869157fa419c57181a126ab7d5e407767f7aabe45"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/net/03_quic.js: 550 lines of code: ext/net/03_quic.js has 550 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/03_quic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9979171ee4f76bb7f0b8109eb46491039e04a4e562e06e7d0ad915b776a357e"}},{"ruleId":"R3","level":"warning","message":{"text":"cli/js/40_jupyter.js: 534 lines of code: cli/js/40_jupyter.js has 534 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_jupyter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9698ea12b214c236b2e610dbd236154ec6ee37bf4a548e1149353c18756fd14a"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/ffi/00_ffi.js: 534 lines of code: ext/ffi/00_ffi.js has 534 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/ffi/00_ffi.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"575123fb499d0e34a22638b9607e47ddb42d4aa694d4569b99bcbe8227637e29"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/crypto.ts: 530 lines of code: ext/node/polyfills/crypto.ts has 530 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/crypto.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b776ff328f95669b919a5547a9462ec84119973e8128383aa3e1a056991009d"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/fs/streams.mjs: 524 lines of code: ext/node/polyfills/internal/fs/streams.mjs has 524 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7edefecbdbb321e024a1602c1251038e22cfca76a96b02eefbd9f4ef554f49"}},{"ruleId":"R3","level":"warning","message":{"text":"libs/core/00_infra.js: 523 lines of code: libs/core/00_infra.js has 523 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/00_infra.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b1734fa9d97276ac40e384ca69b3ef5cdda7cc2a267ccdfaff04488a667729"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/update_types_node.ts: 506 lines of code: tools/update_types_node.ts has 506 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/update_types_node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeef00e6af731f3bca4a09c1ed57d9f197a4a1ddcb513af17ca2fe7d3b10758a"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/_readline.mjs: 503 lines of code: ext/node/polyfills/_readline.mjs has 503 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_readline.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8568de5cb658b28246c9487aad9672e0a4437ad4534a1b21b45378a7f0925eeb"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/path/_posix.ts: 500 lines of code: ext/node/polyfills/path/_posix.ts has 500 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fc28bf0f01f5a8c861ef71355c4e134a2522d3c664abfe012c866664f59d06"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/10_filereader.js: 490 lines of code: ext/web/10_filereader.js has 490 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/10_filereader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5aad3448d9c68299761e29d335edbf73943e5f84b589cff69970099cca630f"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/async_hooks.ts: 489 lines of code: ext/node/polyfills/internal/async_hooks.ts has 489 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/async_hooks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e838d539575c36778a80c8226fb28eb6a316947fec33a1d62ac2835b77c90b71"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/websocket/02_websocketstream.js: 486 lines of code: ext/websocket/02_websocketstream.js has 486 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/02_websocketstream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf45f4a15050595780cb120a032529b71f8d2a274bcfc3e1583f98d3f25533c"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/util.js: 476 lines of code: tools/util.js has 476 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a46d15f1cbf720e06e62b8cf5fe183990ea1bfda9b749804e9cf710362acf31"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/crypto/util.ts: 472 lines of code: ext/node/polyfills/internal/crypto/util.ts has 472 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d248fd760a5ad6c7a8af1b6a7cf3b82a8be6fbc523cb4ab19269571791f49817"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/querystring.js: 472 lines of code: ext/node/polyfills/querystring.js has 472 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/querystring.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17638c3a5b086c5791f12aa7e5b7a0e3e411dda329330e8fa3fb34c41680907c"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/validators.mjs: 467 lines of code: ext/node/polyfills/internal/validators.mjs has 467 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/validators.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a58e1a9b644a1928e5cecacba9c63e39b5eee44a07df0096b85c1fa81486785"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/_http_proxy.js: 464 lines of code: ext/node/polyfills/_http_proxy.js has 464 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5823bc766e3d9a7de4af3b4089223db2b075c2305701d17bf87881577b4a9111"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/update_node_stream.ts: 464 lines of code: ext/node/update_node_stream.ts has 464 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/update_node_stream.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29be9ebe7c86c337d974db9b52a132c8f6cd8e63bd5fb04eb63c2be33887837d"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/streams/pipeline.js: 463 lines of code: ext/node/polyfills/internal/streams/pipeline.js has 463 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/pipeline.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99804c20848c0bece6815242a44b10979295bfb774bbf11143ee497656916820"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/assert/assertion_error.js: 458 lines of code: ext/node/polyfills/internal/assert/assertion_error.js has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/assertion_error.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"166b2c5f3e506f7e2dcccc8918ff61064e89526a9031a822f75263b1910bcde1"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/timers.mjs: 449 lines of code: ext/node/polyfills/internal/timers.mjs has 449 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/timers.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b651f542f9abfd7141794980a0c1134632e374a4daac83c9b0116a9e1462fe5"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/domain.ts: 447 lines of code: ext/node/polyfills/domain.ts has 447 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/domain.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9765372b2cf9e5b3b81b5c730f16bb8f9fc8654b899c19308429e426e37edcbb"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/01_urlpattern.js: 439 lines of code: ext/web/01_urlpattern.js has 439 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/01_urlpattern.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"226bccc5f699ab767430bba01a6814fcc0afe3434bd930e059c44229e1912252"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/util/parse_args/parse_args.js: 438 lines of code: ext/node/polyfills/internal/util/parse_args/parse_args.js has 438 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/parse_args/parse_args.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dcdc9994d968487f4f068eecbd75eb490df4ac49228c681061d7202609d4b2"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/12_location.js: 431 lines of code: ext/web/12_location.js has 431 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/12_location.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"487196a9d5bb599befcd08aded6808772c9cd90e78fd657af85a9c5d79ed06e2"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/x.ts: 430 lines of code: tools/x.ts has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/x.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2ba69682d4e7bf153c351e3535839c74728b0ab47c8d705ebecd1b0c4e8f55"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/fs/promises.ts: 428 lines of code: ext/node/polyfills/internal/fs/promises.ts has 428 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/promises.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3592aa725a6ec25e1146acc2c36200a12389d1e25106a69d132ddd0c52af7e47"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/dns/utils.ts: 427 lines of code: ext/node/polyfills/internal/dns/utils.ts has 427 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/dns/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8bdfe2086b6ed12cd951a137744fa455186282a2814ca1efd585e10a717b98"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/util.ts: 426 lines of code: ext/node/polyfills/util.ts has 426 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af22c89ed853db8b9dd0469f125954ad51500711d3a02dc42e75254a3fa4c96d"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/03_abort_signal.js: 426 lines of code: ext/web/03_abort_signal.js has 426 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/03_abort_signal.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9710c627a74126c48cb8bd6d3760b7af951e09d74eb7d4a52feac237ec5c201a"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/crypto/random.ts: 421 lines of code: ext/node/polyfills/internal/crypto/random.ts has 421 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/random.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f416f913fe9767545735f10cce78de73bd2d6515acef56b2e8aec91a0f5b8c4a"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/streams/operators.js: 421 lines of code: ext/node/polyfills/internal/streams/operators.js has 421 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/operators.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ec7339d27c5c5b37abf26338aa5e672e0edd51ce500f63bfecfe4f8599363c"}},{"ruleId":"R3","level":"warning","message":{"text":"cli/js/40_test_snapshot.js: 420 lines of code: cli/js/40_test_snapshot.js has 420 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_test_snapshot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a912b6069f8c4b022396c258a858aa586cd3a98f6e86dee2de221e7429e38e4"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/_http_incoming.js: 420 lines of code: ext/node/polyfills/_http_incoming.js has 420 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_incoming.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f78f3778dc267fd8c64de46712dfb05b06de5af5ec7ea583dc3c59fc3f8d7c"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/diagnostics_channel.js: 417 lines of code: ext/node/polyfills/diagnostics_channel.js has 417 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/diagnostics_channel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"590899a722d88837862912b86c9be0b5f235739435f2099828a8afdd66fc2971"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/tls.ts: 414 lines of code: ext/node/polyfills/tls.ts has 414 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/tls.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8c9027a4f611379e9fe17fdf62ecfe5249257e202c2ac53c5a6f11165143ad"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/tty.js: 411 lines of code: ext/node/polyfills/internal/tty.js has 411 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/tty.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"383248cd588c81b86878b1446d80116d7069312c1054a4892b780d2b8f57195e"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/startup_order/generate_macos_function_orderfile.ts: 411 lines of code: tools/startup_order/generate_macos_function_orderfile.ts has 411 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/startup_order/generate_macos_function_orderfile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4424c1123b72c3024a87bb1fb77b271361abbba5a9b7d35574bb172336495376"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/fetch/27_eventsource.js: 407 lines of code: ext/fetch/27_eventsource.js has 407 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/27_eventsource.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e0fa3565a97c32f682669fcd80e33f8197b3474e8215fc3210bf00eac02be9"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/web/01_mimesniff.js: 407 lines of code: ext/web/01_mimesniff.js has 407 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/01_mimesniff.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd22289e1ab87b3fc89dc060febf85e65929d0cffeb4947bdb96b8d8b4ddc362"}},{"ruleId":"R3","level":"warning","message":{"text":"ext/node/polyfills/internal/blocklist.mjs: 401 lines of code: ext/node/polyfills/internal/blocklist.mjs has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/blocklist.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cfe906fcea8558ce841249420d60728c33bfb3af91a585b83152eb23f8cb07"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/registry/npm/@denotest/install-launch-cjs-temp-dir/1.0.0/install.js:6 imports \u0027./index.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/install-launch-cjs-temp-dir/1.0.0/install.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"66255dcef6abb00a75523e2da6f97adb9bffbedff45940720239322f665a4598"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/registry/npm/@denotest/lifecycle-scripts-simple/1.0.0/main.js:2 imports \u0027./message.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/lifecycle-scripts-simple/1.0.0/main.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e7e7d2d362a4a9386391972139bcb6107590b32f8860ae2ea35753e3dc9f06"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/registry/npm/@denotest/node-addon-implicit-node-gyp/1.0.0/index.js:1 imports \u0027./build/Release/node_addon\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/node-addon-implicit-node-gyp/1.0.0/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43009b5d241ded40c3c061060b5f024b99361bff084b8f8a5f5d739e4fe9b9f1"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/registry/npm/@denotest/node-addon/1.0.0/index.js:1 imports \u0027./build/Release/node_addon\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/node-addon/1.0.0/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01816803759b730c40aef6604f2b526283d4ffbb0c016cf6426ee71725a309f0"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/specs/npm/node_modules_import/main.ts:2 imports \u0027./node_modules/@denotest/esm-basic/main.mjs\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/node_modules_import/main.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ceac515fa73196224fdf3c7d80804b4cb4e60c3d030239fe4e116b17dca50e4"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/specs/npm/node_modules_import_auto/main.ts:2 imports \u0027./node_modules/@denotest/esm-basic/main.mjs\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/node_modules_import_auto/main.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4a23056c9aac5921874f8543782cde3813e1ddca023e83e215abdd1c98c9eb"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/specs/npm/workspace_sub_deno_json/member/main.ts:3 imports \u0027../node_modules\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_sub_deno_json/member/main.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aa855ea80cc64e5b821e75c702047be5f8363193aa15caad5f657ddf555cd3"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/specs/npm/workspace_sub_deno_json/member_with_deno_json/main.ts:3 imports \u0027../node_modules\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_sub_deno_json/member_with_deno_json/main.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7becdc4269cee8671982c0ce9d74862297196a26e7c9fa0f7b67b2226566990f"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/specs/run/import_common_js/require_error.js:2 imports \u0027./a\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/import_common_js/require_error.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f33f6b4d90af6c5d761364bc542603ebfacaeef5bf8ebb6feea52b8c18a6a8a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/check/import_non_existent.ts:1 imports \u0027./non-existent-module.ts\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/check/import_non_existent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc65d4c021ffdca61bb8547d3e83ecdd03d49cdac3d165f98b03dea6ec389c1"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/check/module_detection_force.ts:2 imports \u0027./module_detection_force/import.ts\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/check/module_detection_force.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bb28d95175010da20876b5cbf4162d63713f844ee47e383a53e33bd7b94be8"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/dynamic_import/b.js:1 imports \u0027./bad.mjs\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/dynamic_import/b.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1b46000d3ad566939bc45797ee14a9c45438b474e62d355c4f118896353eb0"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/dynamic_import/c.js:1 imports \u0027./bad2.mjs\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/dynamic_import/c.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c259dc3739d11a4b62000ba19b1d3a41bf9aa93b0c4ba5923ff301d8f1c6e127"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/import_maps/test.ts:6 imports \u0027./scope/scoped.ts\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/import_maps/test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3202612d8f890b35561134660fb3fb8e9cf905b941c764b67cb7e0b115213b"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/info/error_009_missing_js_module.js:1 imports \u0027./bad-module.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/info/error_009_missing_js_module.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fe208222d8ed1ad3848087579289d2b4ae7b6dc1291d4dd1b62e777221eac3"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/module_graph/file_tests-a.mjs:1 imports \u0027./b.ts\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/module_graph/file_tests-a.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"053ab19a0bfe8c6dfcf1904ad3e0a55b70eb8c62561b04970bc4dbc654a073b6"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/module_graph/file_tests-diag.ts:1 imports \u0027./c/mod.ts\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/module_graph/file_tests-diag.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5719f902c3b04bb3b38a6c250d36e0b421428bbd9cd587fc0302cefab76de28b"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/module_graph/https_deno.land-x-a-mod.ts:1 imports \u0027../b/mod.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/module_graph/https_deno.land-x-a-mod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28220c19719a1de06932dab029633717fb9b103ba8bdcfa085d14a44a7ffa486"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/module_graph/https_deno.land-x-lib-mod.d.ts:2 imports \u0027./b.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/module_graph/https_deno.land-x-lib-mod.d.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc4316ddba21285cca506c8e8394331caa64e7077a86a3a667ea06a460ad321"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/module_graph/https_deno.land-x-lib-mod.js:2 imports \u0027./b.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/module_graph/https_deno.land-x-lib-mod.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dae0f9972131c61202a4ea4823070e2fcbcd0f7ea8e7bcd020280576a1a1d0"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/run/permissions_prompt_allow_all_2.ts:8 imports \u0027../\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/run/permissions_prompt_allow_all_2.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e50d98a87496d3fc551f5b566c4d50c8c596183cd5c1c91158a685d16b5cefe"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/run/top_level_await/tla3/b.js:2 imports \u0027../circular.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/run/top_level_await/tla3/b.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"805866086da87c399453609d3a68d2a60b40e8b7052008927735e52ecb537d97"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/tsc2/file_reexports.ts:1 imports \u0027./exportc.ts\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/tsc2/file_reexports.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb626f33fec5d5b916ad0e299204783878c1c2214d0843e0531bc4fd1c7dcac"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/testdata/tsc2/https_deno.land-x-a.ts:1 imports \u0027./b.ts\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/testdata/tsc2/https_deno.land-x-a.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e0b7c7bfc1c0a26f55cbce33001306596abc25f7559fb9e95e6dfc2996ead1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/06_streams.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc4646f6cc110552c1dd82ebd8eae61ebd762334d914640e701f702454eb560"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45da43720e7059b8c1821b0bb460a7ca6bde0310dc83103c3fd7ba393de89456"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/errors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9850040262b4a7021acd6bf78928915e5fa65614fbc5dcdf4507d4871609f2ef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/testing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"907114771b07eb086be347dbb26816b999c9fb50b3900dd08384e8513e1b3f47"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af644f1e92367ba647b9de679719520b6025c4f4a3c9971ae2a73644ec68ffc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/net.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de79945278345e71c92021e4cc3752ca5628661298e3d9da0f6f7ac25e80e9ad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e08dce9538b0f8fb7129073f23bb642d34a37c7bc47ce098191ff5257b01dc8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0199f497dc33174f96cc5a7609f88307f0dd1944a14329e601316ef8a550d7d9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/repl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b19a227b906002339c44cd601210633d23efa418215beed5d11ef65228e847d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/telemetry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33ea6f3e3fef5e1705e3c9311eec0d1828d74fd1c596b42ad46050675afb44c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_wrap.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69394291b4ae3224bbcdae343cc78e69ec9bf2ddc37031410dc21b6ae1ab3bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/02_event.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e4f8edcc7c042176e3e5697c29f439241df9409c82636055afbf87d5d536f6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/00_serve.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55396965f43c6399d29e0801ee3cf165bf17df3bcb5be4c30aaa08e25951cb2c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41daaee8ca2defff5b137f5074de55c38bb8b7c8ad48fcc768d4365ce12a047"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dgram.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"721a19fb9545c8ca685a06d7565204933eb91bdb28f1a780cf1e51aac749f66d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webidl/00_webidl.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d728e2618aac2b5471e25068bd59072e9c765b6cf30dde3ff3942c2bb74ed945"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dceffd18440471b80f2f2b0253e0b11bb1de0213d4557d16babd5153c0b074"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/diffiehellman.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a08fdd19b5c203487646e81ee9f1d8279c0b1ce155b654f74848b22d81814f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f580477f65c09f903ff5f4681be2ce6e42ca453d723bb69aef5b92002863b9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a1a03ea2d568f2b4b40c536521cd24a771055a4da56a62c267c6662de8960f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/interface.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a76664bcaffb6121b8a3877f003d1f789807db4c345d9b107b3900ec81b9091"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/99_main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf0fe948d837539224d19c85c15f97d2328759ec4df74f308d1d9b24028d50c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/zlib.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af00dd54a38417c4bb0a89ac0e4f5c1c9182f2b6d618a06d58f9e0cf9ba7039e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/comparisons.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1cf103d8eb0d0bf6ef57a385357593ed629dced70e9289b4746fa9068a2625"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_events.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cf813228d157cfafab76087b61fbe04ac035b00dc6ccc3fba3fc454ebb6034"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/01_core.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45c0b9283b3013f6219d3a948c02e0184940f5fcacdbb7dee28ed2a6317b6aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_glob.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef50862f4e73312e641eed39a014d606123f28f5877835a11ef55c1fb5fd1a7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/00_url.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"979d6ddf4467cd5f6cc4c3a3a377045e057bdd59e02b9fc8f8e827dfbf7f2583"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/utils.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d364768e8b94f137e28f3ee1261ab88e27e7d7578710132670746911d507d04"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint_selector.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c4923ec2de641375084c5304651138c743864d2b41c545d5b54e8f7656cb8a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_win32.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"862b8882f0bb28bf0b62c60b58e41957c165d06c7baf450335e9f9934e0d496c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/jupyter_kernel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a153ca7f527e3fcb744205fb0da69fa40ec86cd11d3b5b900e96c8fbcfbcb774"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/13_message_port.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaa5e788c944381f6e7019c144dae6724cc206e25130504ca791688df21b55f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/event_target.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"123953168da408c1c7e5418ec9add8dffc51e925acdbc4fab94b99fedf10867b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce0ec8e3a92e7d3c481960958cdd91c1bffe2dd2b41b40fc83eeed330bfc5fc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/webtransport.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf8deebf5f7754c6d93526c5e57eef04fea5356981e4440ed3d309252c4b544"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keys.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e951a5a1dca605dcdcd356b3be0e2c2eb6873a98c28e5d26853c361b1f80df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af49fc3a965256ac251bc362ab333d1c76578f8a4fa27056e5ad7f5166a6137f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http2/util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c06e208b8bbadc9cb1659910e3e600b26e19f65854fac05ba06b27cc1e12102"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http2/compat.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d10104b1101bb79bd3032eeac848506a897a2aa794536b6ab7ffa8a1b1db141"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/01_websocket.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10ea17b57f77af9554c40acc0d4f356236028066fd41b503b208b4cad36617a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fs/30_fs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1a5bb6e23b1855439e19788f79cd0546beefb6fdf7785cd3f65bbb7739b903"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/23_response.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7bb6111218b3615c2fcc24a2cee3456e608c5026061b05c26fa29ef77199f5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bb46600df033fbd56e6885336ab739342823ed1e797507f11d18cc1d00b9f1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/kv/01_db.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd04a2d74601c73dd04f9803f885cc555fd7e5d899a6fbd286308741e0bd0668"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf199a9158540a991f19767fa3ed04a4b2ebe6545d18f44afda7775419ebcbd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/97_ts_host.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dc88d9b1ec5f367dfb663479075b263c5006406706db5ee0d9550eb51af6fa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/01_webgpu.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4541628ecb1c5f38f1927d270044bd4a6a5ebbc8dcb11f473cbbcee1dd18dc32"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/vm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b674a656192e4f6182db928a337cc66b76e3abc32e58a3ea1b8549c38ce6bff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/09_file.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"180b768506973da69b758bc8ecd925242a461b1ef2c3ccb2deb64bf90d6b52bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8f25d5f924401019d9859cff78d4cae6dc19608d1b684cbf8df92b75c9ce51"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/23_request.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5911c1942e30ba144ea057e6f3c564e1a6dfc4c7f0067cbc717531143f346017"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/fast-utf8-stream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3048435a68b6bd2da9bf09d2461d9f72e37bc17298bcccb0e5aa292c9233ee4f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/process/40_process.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50b288586fdb146cdb07d7f9c4d286f5313104ac80f1718a5fec481a6caf3ae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"225d464c786a64beb7c1878986a29e8b5d9ed868b795fc2691fd75c765826635"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/15_performance.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b279bfc441284486ec8e031d63959270e5443c9f0444f0c779907a1ee483d97"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/v8.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0201c273c1ba6ee7879575d0c9427dc49e24bb095be51c7a3e78e2c97b0df7fc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/console/constructor.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43957e2b35cb33a2e26e4113a613b6c2a47775feb0cc8d2b738c2f11e6160402"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/wasi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06b266c89ec11bb804b9f9b2c2da3e9b36e0d170c5a8b5c5a21a3000229494d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/webstreams/adapters.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5e2e8682cc26580a1d829144dd23db21a41fbf02c9d2a9dd9412c6cdad6ba4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/20_headers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd4cc4b1e1e112401ab2547f3c32b192094479a97e1a655f41c504e9052fbab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/01_net.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa84756f1373089c4e855a731749412e44716708ecb3c80c0d3154c31e10c1da"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/udp_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1930bf3aed32375b360fde0552f7d8b3cb670b5df7df76d486218270b7d06a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/01_console.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d8d8c265cf604323f04a1de1341cfd36ad491c62d7ea9565df3cc0f0fab478"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/inspect.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e2c2f3544e4a882e75bc862c034d33762395e7eabf3f46ef70631cd4c1cf92"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c06b553efc36877b31a695862f7a0aba8e693925b51d68c3a8c9443e25c1f3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_common.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5790b74dd6c35b37f3420c26436d79a3e28453e1409435a20f2c5e2f4684e4ef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/https.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"444c5df3f87c09db644896abc71a164232b0da85d9fa957157ba6a96cc907189"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/00_primordials.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"173279cacbd4860fb9bec922a72cd5057e3797050814164ff43ab1b541ceba70"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/perf_hooks.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e38cf25492bdca4ce4ad09d145301b5654f1d7aea08b8534d223d1bfd71232f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/98_lsp.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0771e829cb3a749242947de1e56622e2d6103547d3d37878aadd13ffbfe6e3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/dns/promises.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acba8c6930e6dc977d4364c7739a7792eb860ead1fc3db0bcf1f9b0851e5c8c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/22_body.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"114985ba045a14e6322b24460f98a846d53031c7864376fe9911fe9c59096567"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/21_formdata.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"737a294cbe1f0dbc95a2b42279a81fee9768af809523601b451bd19b92645ec9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/handle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e3d8487774d5358948996191802a9b9a1f143f9e57c2bb5aefde8d35d5e5a7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eba04632e3926e6730e5ef2efa212f48077c7e255f335aad084a501a590c409"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http/address_override.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b31a82e5d737450f38d93352e8af1a9a65cf4d18fa4728e578c3a601af0d2b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/08_text_encoding.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60aea852f71eadf3cca419f4265ed82853a296b82f007126f92a743b3e4ceb8a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/03_quic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd799541f9e2b08194ff3f8bb5ccbb71454e3aee04ee6dafe14ccec8364c4d50"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/sig.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6167f31a88ee43e93816b7f5d5aacb059cbf142e64094f73ff9edc01013fd368"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/utils.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6dcd45ba3436ea864e3f578a16b291914958778c1149309d07b16c3bad7189"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/uv.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b34d94529ec0773b2ac66c68614793e68da98256a98fe03d89f3add6074f7e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/streams.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfc8eec00474f4522da9622700c88a5daf93db7cf4db20c855c9ceb5f8528b8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/ffi/00_ffi.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b630439d5b592aa7390846cf43aa202caf290cd107c98bee95d2f66ee24f9658"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_jupyter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ad979260eb6020c89e0bd84b63791e452aabb9a44b5ca321fd31a6b7ce39b1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/98_global_scope_shared.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3a1401ed3344cd1017d8ff98d83e0f986dad153a40d93c99f157efef127948"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"064a33c4868c5fbf78eacea408c43a5a7a8d360a43e6ee48d7225e0151a9b050"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/00_infra.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5483ec549f9a480e0a35aad7be18cadf5366255f0d424e36a239bace8a748b2b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/async_hooks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c1c763e3b3df2dc4b7b351814f8c53160d7443d915b658b017f58bcb75b1bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/10_filereader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88af948ebece54b995309c8915c8f1113188bd532d74d9476a036c6219931c3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_readline.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8529f8ec26b7d49734bbe08d2c44aecbcb3feb5cb71f590915db3aff5a1422a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/02_websocketstream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0388146b4dc4659aa25f3f5aafc1292619072a2b878fabf6a1023cbbfa4de5f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/update_node_stream.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2c4fe1d58414121bd7e0ce2cf690b35fe716369b9c88a18ce043bdd86c0136"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/pipeline.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae08ec906a259585d33b033e07ed8882d003683f157d66eda7068392c2c7140"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/validators.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf91fcb4808555832ca05d93ad09c8d7e8f1b4a74ec0283c4c67a44b74e3ee2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"426427a88cc7607bc56f85bcbabfc49f0ad058cd78083612c8f50bdccdeb9d4a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/assertion_error.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f916a9e10d2764c1847d2aa4c04b6ad6a01a0f98f40435d1cec2141b2982166a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/querystring.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ce3dd03ce9668aa49c0136d7522ddde063076d744495643cc47725c89f0c95"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/domain.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d48ed2dbb3ca5a20c19472a2fdd420518a83b5a0e9b5134b4ef027b5cede58"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/dns/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb229be27658468962cc43c0226c87e43ee23023c953f348c03fc70ba50e3a2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/diagnostics_channel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd46834d5cdd25f89613daf594096f2c2656d84b0fa620153143fee2b739f3b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f636a774cd310f661d6d355d57f04e9f8d90ceae30b4b0939bdd963db099e54e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/timers.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd7f598697e741cb99689d95e8cf9f0e27d5861df6e018299188dae9d7b5ae4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/01_urlpattern.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"679d5b4335871ba8af1f716d66c1060602c89059ef6b414f20a66454eb45dd5b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/promises.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"207c2d7b01fe2bb69704667d0ea8c00faccfa45cbdd6cb51cf1fc15ea195330a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/operators.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32554f69d66d7deb6ebba01c89e50a55274fb0f8e87541d7f14f0c89fc055d00"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/parse_args/parse_args.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28423c94c26b3116f7e249192da37bfd46edeabe673180c5e0a351154c671a81"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/03_abort_signal.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f063cca6723e6e4fddc473889c150e7bf15c0c0979556ba0bfad564e611e667e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/random.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f44b1326ba2759b3cfef6b95150a7db575a2b4ffd187cf149632b8c93d9c6b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_incoming.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"777564e0f30f4ae93e92b91ad68c9a7b21644fe39c46036a8bbfa139d1975cf5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/tty.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01b740dbe15df410bef25243581a62389378afe45c93c6614217f2345dd4f4e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_test_snapshot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bacb55b434933f945969f360657b5a50206116de1795cf43ba621fb6c5e5102"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/27_eventsource.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae0d906a724ff0951499bf47ef286bb3ca9b27ff9190906f27afaeb22f8ac87"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/01_mimesniff.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf56b0aa78ecad6881a5abbca01a6be63484653d9e0d848530dddaabdebdcbb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/12_location.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb73956712792e29d945e930cd4c93ce863b98580cd79df6e2f9dc9bdb62c601"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/tls.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"608b12922c0d112bea903be8c0d6fd801188e42f8eb714ea492b44e117da7264"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/stream_base_commons.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d983919c2024799ab018e70f18efb2d96b46cfe85a610a48079aba5a2adfbe64"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/02_timers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75a1ace4f6088f94a6cdc82bdf4dbee2a9b6f9c466639a7ede8dbc88026124d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_common.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ded89a92ee316f499523d6fd84af4c0eb3fea9ff19656900d150efde0320004"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/blocklist.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f2e949fb496051fefd0ba3d4e34b44c8f7573f3c345bd01bc1b632276977e8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/trace_events.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45890c5875728e35999c06c213d2278e223517ba146ad4fef6892dfc83fbb42"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c885bf27c8620d904fd8a42db6c56e02ef2f87ba6c36fcecb4e1ea12f7f189b7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/00_infra.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b882a64d8695a42f330960926be9330ef0f679aea6c2d2a7501cab73e65b60c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/01_http.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67f2db94cc19aaadd72d6b31324c58e54b233b4bf67dd2e41fac40ae5c1969e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/duplexify.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ff65b062c0ff12f652ecfedf8619538837c2b0d13df19df126caae5357c50a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/primary.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4326697a7449e6ba9aaeb7568abd0edad00f4a4c1e5e5bc6d99502027f45a93"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/resolution/tracing/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17aa0eb219b60a79fa90f52a87f8776a41c68d0c45b08add3f5deb4bea24bd28"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/mime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bb7e95ba50b81ac30840159be62ac3d8f5321e929faa140c0b6f70a314af19"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/timers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e748a0026cc4ac35950fcb58dff7c6f04fae30699e846b1cd9dfea1ebe01370f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/hash.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be0f3dd6cb37d970a1bf7820438dfe30c31ec969a986fd7534a62abf644f99a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/11_workers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3571e66ca960bec325860cd91582aaffad23b2641dc2e2f7a643aae477d97b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http2/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bce8e90e8ab33c8180c768d51c2c577a70764eee3c758f4dce0522a4508f3e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cache/01_cache.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94472ebc809f2c34bd36cb938d3a3db16caf87ac753862cba1879d3fbbcea240"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/90_deno_ns.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"098a5e02df1f92fbb6bccac4f4a2a8e93c996ac1985bf48d3a59efca9e09dd6b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/end-of-stream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8b15025e5a9fe716f398f0ea26340b4c5ffbc23ab166978857c4f225c2db75"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_process/streams.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8de7765d933dbbcaf4c76ebe4405468d0c3bfc3bf1470a87d948bad832e6907"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/destroy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a8838a7a20fe30d30fdd2bb2a2e91c2288cc4f66d54622d8461982e0ff451b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/string_decoder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc37a103be6593021682da05e99be29ce38eb892b6e5f3f888d2e92bc636e3fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/x509.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bce74735a0425a3767b11b6614daf1bc3c014953de05be4c5d2fee8c2224cb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/constants_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92ba5d7bee05cb5488c87b5b8c3cf120eea27a9304be669e1e6e9942207157f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/cpu_profiler/flamegraph.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a3e2c609c8c4a61fe49dd2f7f1f490eccc98c6778dfe6566121c32ba20b7e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/child.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"850afba1f117997c62a418ea434ce48398401027c16248d84e13217e85e67aff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/sqlite.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11cfee200a53128d8abfdc778394f5f4b2af160a98351848105925ecedd182e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/inspector.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de59522dba9f9e2f11de6fa83d2ecb682f96f2776b433029d0f8aaf9d4c05f22"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/async_hooks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f679c4284973109e384e02bf59c7816f68a84acfc4eca6a566c2af6f7503c5eb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/image/01_image.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1fa24a56c97d9bf9e5e9b844638c6e657019d7df14050e49954ff3f7b70c2a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/00_crypto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92eb4620b3ee7e6ee75de80f25961618fb1ae041bfe99502ce38cd2735cecb6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/01_dom_exception.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7b6b44fdab75b51523a5c514a3de1f8015e5c54197bdea173151aa9b0ac8b8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/js_stream_socket.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78adbeb36143a62cc698b9555846445b389a6aa50a27e159958a86fb6ae3b860"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b76db60a89139822cea48607eb10628e5215490044c10a87115b092c932f976"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/cp/cp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b655cb15c25110318b3e2c55c34a0bfb58c473afa70e128c4c26c46853a7397"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/http_parser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f960d4443099fd15b6d806ac0815049d3a20b2d652a7c5dd31e738f0f99c499"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/02_websocket.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b1b0dbddfba76274882ed5c070b4461551bba7df69553f2fd32e91db9cce8b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_readdir.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3884dd29eaca3feb3a93b24de1d41dd0983a23301a0f051d0b9f647a561fc9f0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/locks.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddcad0a4a19346c9ed9abdcf6e1d3c90fdc4b583431c7bfbce4ada337b50f8f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/10_permissions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfce97c3945ac9782b25aad329ab1a6af6a5db9773c72fb7175e38182104175"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/process/per_thread.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3866aebac0827e7cec454b685473667eaddba6905a840bcb9473fed2208351"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/webstreams/util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"251d372d7657a6eb16c03d88abe53d5d20d54d67a38d16508d7be6239ddb9045"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/02_tls.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbd76289624d982c861eda59edfc6481ae95ac1d38a0eb87cc8522607f7a28c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/io/12_io.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9345e482823f452dfa738e000bfdb1808fe338df445ab36e2ed12a5c0f278b8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_process/process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ea5c4938d5da41e2204827da90cfce5691f77066b2ac38617491fef3fe32be"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_read.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dc029f3c0c5b6f1a2fc786c64d823ebf20a7f2eb6c331ee32e62d8ccbc206e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/compose.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"158240a49b5b30a19f896667f4355eaccd510cfaa0c348408a2ae0d3f07f3c8d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/98_global_scope_window.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e8415b666ee988ee1edb503ef91775d58589e649ba7b892d9d51e43e11548b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/cron/01_cron.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ffcb96036c7ee91391dd62cc992a40347f33aab775117ad5c386f38555fbe5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/01_broadcast_channel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d4a72779d31da77115cb2675b5ae68ab949c6b796f0275a7406304b3bf1bf8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_brotli.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49694d51a377974da7a773cd0a0325d9dfaffe35099bbe318e6cbce0946acd98"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5408d9edc22348511a300683b6f2d4f2b992f6a5e47398855b0e996a90fdda13"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/serialize_deserialize_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41309abc7ad71a73256a67a2d6d354e3f1f965b81f1c2a3b4738497eac2f00a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/99_main_compiler.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16347cc91c968771d8686718f84a851d78cd7a4a3190c1bd6d71b2c5eb6c0d03"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/from.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffee81361e26f921a089f7889348dba28eb4cf8fc0b41b0d098c0cae727ba75"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/buffer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d780df481a8e8561c493862a1044e1afde805c7d722e1ca3ac50385c0949d0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/scrypt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f92bea81d2c1ec98844e8d3c0b850ec2470e74472c11fea9bbe94d78c3f113"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/hkdf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db5ef50e21bd29b0b7a0156ad3a7a6af9f4128685affd8650031edc5121a595"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/myers_diff.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d798331718b5537b4981d2edcd1c2bb397e900e3813c7c315b16a691ef011cc1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/pbkdf2.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbe977a09ab0883bf5e7b5764e276f91b6afa29917f753bb717894dcae8e899"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/ts_types/which.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f0b59cc128656381f24afe9594d9f2edbcb20865fe0ea6ebc3239be4f01d67"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/97_navigator_user_agent_data.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef61f04ff2fbfc2d42b377c761f0c0e80b8cc9c701896507c113c241d7332b08"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/parse_args/utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d8149f0b3788196ebbea6616dd2f1d816248875128eac97c044909b37fceca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/98_global_scope_worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0214653d7213dd8660bb834577b7f3e12377d363e4a9a397d02750981703063d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/debuglog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97e19cc13aa421085f6b90fc9456ede6fc725641654fd13b7518e4d67e3c179"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/17_geometry.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb1d730d1f849bd8fc8aa9f9ad0fab9aa408616f19b71e600b37bbe81b023df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf30bd723234b123f20ed41e8171a1d0113b284ef7c41165130eca40139425d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/tls_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56b1d35c86c3ad1d22ac7208be78e94d36e27e34458febaf1f6c1c46d1685fd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/round_robin_handle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"435bf60a213281343aeb202be4106795a23f40424501f74e2aefdb42d1085f09"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/resource_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d394df2b5bb6d64d9bc0d1c0338d5437144739804a9992c5bc5fb2be1d566a4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/node_options.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"652e19ba557b60950a36b4714cee0fd446f98a569c8d30ba7eeb355bb70d8e32"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/_utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38820b38f70192433b6d85ee397ca1d1f7887d22ac95c3ef219c042ce818008f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/01_errors.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0941bb3b8d8fc4514c90f58a9eddf93c5d54abacf4aa66653a80fcd57f0757"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/14_compression.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01dc94af3e8ba5433e6edc18d3c291bb94c81390a291c80e5f09ef7e956d892"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/readline/promises.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fb9deb15857070d887134adfff249d66c361b6cbdbc22209dd0adbd649f60b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/webstreams/readablestream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50a5c7618336b2904b1091731b00f74fee269a1e1593c82548d9368cd67cbc2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/02_timers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c203b7fa1c0c435e107913b2767a46a265041a40eec7ee26c6a1afaeb3e1bb8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/type_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"426c8d2b0b6ef61f0bf3d3751987a7bc8cc59529ed5812f24e03f01e643cc01a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d693e6f52ecf57a25cc0fed45b0c29ec220f8f2c2392357cf76dc33430bb5aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/pipe_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c889970b4080b90c77c4f0d8ef0fd1d68eb2aecacc10b61cb74ed01f5a4e8bd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/calltracker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3352a6932c388694e7ebb0a5db12f0a9d1b2e07a8a5ac47a72aa214e5bdb8d3a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/immediate_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b15d75b12cc7d5ad7d23d9892cab6748c7c81ca189f601c5be796a9f7f1178"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_zlib_binding.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95927724a243f1c2163b40956edb6f2649b97595800dbfdd7c0d4558da8b819"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/os/30_os.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a99a1fa34b952d434a56cce29f491d491d3b6aabf1c3dd4216dede0d47bf15c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/_randomFill.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09774e21baa6bce8a0e22f79b4ac600c833229f59d1fde2dd29b7ef97df15913"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/dgram.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a3da356d528b7fc3e6d6dbf90430cac14bd42a48fabcf051cb305f6f0c0535"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/promises.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60e6aa2ab2bf13b3feac928fede3316436bd1921630ed2d5d4cba0649c69960"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/idna.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fb528efd316627557a8303ca80ca28247378dfa12cd3c346e9b529ea6cfcdb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/callbacks.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec7be0a900954a11c93329c83f1adda2848aa2459e9c11587c651b95f7c512b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_dir.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf081b8c613575dff183d300604e28b3828032018469ed73b76f3594aeb3f190"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b876230c1fb4e0e5f2396a67c0adec80a36c9262af36b6945c4db63cc2f838"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/stats_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1e7549a020b64a063a891bd5b3e2a2fe807d1138f619ce8dea249c7bf8fc70"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_repl_preview.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc1628aa6ca840be0c315172f2738837ac01bc8188a2928894ee0958d53c5c4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runtime/async.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8925617828280e1c072d126fce3f70f2a9a42df9986dfacaa61701049458cff1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/02_structured_clone.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd128e27e1ffb31132adc97431411f9423d9112a8c8571d604537a3ea1e5984"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/stat_utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c726df12f3c001cbbbe2d82c33f130fd439fa27fd567875e1b245f39d38f1e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffa6cdf630845f3b5ca1690e1556c9236781a0171b7668f54279ca23e84816a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/priority_queue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd80430054e0642c0b5cda482ec92de494ee71b932847f3a231df643eeb4cc1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/async_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"728e8c9f8118c2df0acd6ef47e705a2c394de7be0a572dc4376f7c08e9fd8075"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/tcp_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8559f53146b70f890af5eaaf23efb0620c848652484e77f62eb8b1c86a6d3747"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfe9316db85cee3381445ad3153e9c1b215dc13c68bd935654d86fb0cea5e28"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/legacy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a0fa588de625bfcb73a597cfbc3c3129af3b695afe1f4380ee48c445cf4373"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/emitKeypressEvents.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"459b31d5ae953d8ef602118f3e1a214f4d7b3e3d13479e701ebc490fe39bb55f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/_randomBytes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c43512e3440b0df8369a7ab712cd5c73d83fc38f0a179b519ed8c042b863f6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webstorage/01_webstorage.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cdb953369cad6fc48d47e9de3ec06c48040c229c3917326fb8506368678f82"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/22_http_client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2634a5078b8f95cb3c2a98dfdfb385c45e918cb5c1b79245836a92b842f84a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"843aade41dc3a63988647943ad613f1af38f8e1a4412dfd69dca7eadab84256b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fixed_queue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8166f452b8b6c58959f9e76e754d4624788d3321136504cdb7a61e5a13402e98"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9663b8419be419a12ca5710db6cad428c518956a99dcf6f3fff79e81f65bbc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/inspector_network_bridge.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8efe973b0654a4a4a88d4bcdf18d28e4cfef54e856b32c503320821b8cf7700"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/net.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"722b689c1234d3927bbc1d3fc2fb76a26cf60da9c4fc63026452f7ee2dec83ea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/_timingSafeEqual.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b96ae806481e0d9dd10bccdb8d4da475dfe7f93555f1672c60f7611fe88c50b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/timer_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8d52ac4401cc724209ac335cfec1442d845bbc4fd039894517d9b89e0f54c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/querystring.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"194b97d4cb8ef46333ce4af4eb91d3dd06879686e443076e50220790ca2e341d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_next_tick.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eab655ad41080b90d61deb231ce9bc73e902f483183c4cc5ee8a32bd00db868"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/node_file.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9a8b0801bfb75c4e7e5978768ffba31a49faefefa62d32f6eaba80b5e8fd8d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/wasm_stack_trace/wasm_stack_trace.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55d71299f6ff3c02e8a8fa132330dca3b5365309b81d5ce384d2a8012872b3f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1876f13d722aa7e18a183fb1bb5db55aeef0fb8c0b63dd4781dc858b57762512"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_copy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fba73c11d3eb693337ffef3bea19b03401eaa10becef51903cfd6f642a40422"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_fstat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d000af3036861ef86e3605c0aaaaa4a73ab9ff4118fa65b4b03d91dff7ae34"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/process/active_resources.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deba5a14e2ec05a5f012f00a29eef8201183f48ad40345444df3e3b6ed75cf50"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/process/report.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfedb66170c5077b01a5bbd73b5caad2aa1fe93abecb5ebb8dd06eb3d55ff57"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/ops_async_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ef68476b45fe8aa9620ce20c0468a770370809b436612546587a843261c4a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/40_fs_events.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf105735c5635741b1d1fb453b599c99f86eb8b9e2d223fc55b5fa759b33dddd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cli_table.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da31501b8755a9359a8531a89e9463c53e251dc30a95c501c5b3273f9eda76f6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_util/_util_callbackify.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee8920a14919d2af69bd2cc54511bbc710734d38f36733356a6dd188d0e6471"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/encode_decode_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ccd356dea0cffadf72397461e5717e0b77a4df4f20cd38f442ab2ffee5a617"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_common.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f61d45745465b5e085b61fa39fdca45b2608d0b67138f114aab94a3d8f86f1f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/cluster.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6553919a2ea64135e6926a1cf5e174830ff905c48c1f4c9e4075bbbb5ed2d69"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/_randomInt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd088dd71d8b5795919b90f78497a8bea9888735ad2494185f257657cc909392"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/stream_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d508bd13f07852b8ab8b9ed17f7f4edbb425552b1df9b3a0947c4be5cf117b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"250a5db9cc4c5219e86de1d497c70c1d1f40989bba09046d4b1bd9e4c82ae7d5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_lutimes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cc0a2644868993744f7cbfbb27a55e34b259f077281ebf4014c852cdcea2c0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/shared_handle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b3bf3c6ac81ed4ecb6369afa1deadd46550f85284a0f096ac8f7da994715e2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/deps/undici/undici.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b4e6f269323ab1b777eda1e398924ad72dafbb3cf25b6b2290de3fe10cac66"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/stream/consumers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c868f5cc7b4223fb237c8fede7b3a6ce3d511a1cd8c0adac24dcb07bfa4da973"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/telemetry/util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b25183ea4089a5424772f7d106eee1289b7493d33dbbcc2429c8fc2b55769ed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/04_global_interfaces.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"064887b71aaa16c3fbb06eaae0db6aa06df8d0d03946a3f23ce35777ce52a53d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_lstat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac70148443b5aa6c77135cd9aa003310e1acf7a15e12cf47b388fa4cbd456874"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/url.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"207dce633e89031e3c85beb44fadc2cfc67cbceddf9a27d74f961d2641a2ec73"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd01e655385e91827bfc50f3b244cf5da2bceb0019bc723abfe9751e494e691"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runtime/timers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a762523c7f8818d67461337c2f221a1fb0d5a71127be92f7f24652f0aba338"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/os/40_signals.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b389fc2e2109dd54d59619c0491cfa60f5e03f5a62140e6db8be648597e2bc39"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runtime/__init.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01c1a14c8bb9c7ac70afd2ccb7915d510535a62f88506b42df64d1376d6bf86"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runtime/testing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf97d01e7f2335d7ed4a8e76e0aeac8af88e337df03cdd6246a0fdef6da9181"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/add-abort-signal.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7e341b9e22d1c6831bc7b431019946817a8a62f6e7efbc41045c7d08e05bf6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/tls_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef8b57fa415b340b33ebd888de2ff91c866ffa900db42a4fb601e7821b8f25c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/ares.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27d0dda0d9233cdaca509fd9b82b4534854f4a7e2f7a5828c127ed0fb1259ff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/rebuild_async_stubs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f67223f1e502eee24ffd687053459c91f5c1d213c3db7ca94073f404f10519"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/normalize_encoding.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bf92c2e3fadec5833aa3e286658738710817a36565e80dd2e537019be249ec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/options.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76607261cb32bcde274ddaf594d036a75bd5f4bfa33c852b32e4378ec9f32b15"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/tls_common.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"543cc8648523dc506ac4e1481a479081888091516eb73cffec65a7f0eb72c627"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/http2.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e1600215c28c947d035e55af3886ab664c2b126cb8b9ceca575e5acfd15048"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_test_common.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"400bdbf730fc0e60fd2f1ab2728d12489cc3bb1f46b8039e70315995f7716e99"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/state.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1d65d2fed7ce82594617d571db7f82722939721d1bea71441d17f775024cac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_exists.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13356be5ec81458c7a625cf61ebfbf4b2d0e7b04b93d56bb88636a3a3aa9dd46"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns/promises.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d552275b7e24a0cee24f878232561af4f383ca4e75bbeb86a5a521c6b12cdde7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/repl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec83715c48393c828f3df17ed7eb285ebc71accf5acffdf0a0502723d71850c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/crypto_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"446b6f4d33245d6312fdaca423ada16aef4a980d47f2ef55bf018cd90eb7e943"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/readline/symbols.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafd0807574960d501d7ccac629259e56da6c16a5677c30b15162618c8f94f36"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/41_prompt.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c83f4547e8455072d4c3007f408ff72a15565d4968f7f38f1a514ebe1aaec67"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/tty_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c80cbc8b03a0fbf3fab3eba2965d4f5e9c21da3bf990f89b8826e084d72b07"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/fs/sync_write_stream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f9e1a478f73d3c92d7d9ff9c5559568943dabc7226d0ff30ac0ad41a700188"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b887a663d8c866856a17ca0bdb60eb32f7c41d3c894405f85924e69f5a74003"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/duplexpair.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60873a9836ddcdd2b1c115717932cb8d33f68344b87387aeaaafae3ef843658"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/mod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28d84b0ca52ef49e627bd1d52d22f90da99662febd7f47e77cdf9bd53b81192"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_cp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5a37b16734b7d7577598f74a4fc1fb5ae1f0f8a06e523a1479f6dd536fe912"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/_analyze_types_node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2791ede589f763cb56bb7bf5636caf36b0eddd1ddda3e7d0a7bfc13701160caf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/certificate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3823ff85d84aa8cdce82b003ccbe11b2a14ee00dd969aaa003f57b4dcd33068"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/colors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9953046d84ef24cc2b67544f59807164ee443450bc477fc3ffc63eff88f21b80"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/tc39_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dc36421d3ea5adffee973d5fce909ae9a5f2dbee90d1ae5e288981b595a888"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/05_base64.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f30f0c1b5f0096d5d4af9e951c88211316734f5a5a26394053c829770174f7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/autobahn/fuzzingclient.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73222fa139c2e038e2c7ef579d71f66c95e2262222ef072452002598dca2c717"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6953b7496410b17f94e5fe1c329ed0f61823784b076d89f828df14266381d6cf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/common.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30a3e5900b611cf455ea49246adcdcc8f0a12419d943f25163ebc179c85f4ca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/process/warning.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"022464230bd1a56ca5e708cc60f1518ea37cc0e487e7d5817357d1ce97ad2960"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/lazy_transform.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c5462405f42028ee5f0f5307114ced46ebeb796b3031d073e01f86efd0d770"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/18_css_stylesheet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"777f885dc2d7e5936208cc0ecb5141749127035d93d0acec98ef0b0015a40019"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/primordials.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ed725285814c9cdd018746463a87b47b8f15fa5a6811401306f0dc5d100597"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/cp/cp_sync.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d098777b4a650faf8d08494f7ba603cf60dd05e4eb2e845dd6d6ff6e636fa0a7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b9f2726be9592934576d31c25db78ec7a0c8f680ba6e5b24883a7b2057eed7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/block_list.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae89df8ebf3169fb43ea3ac69535b2c2d43536f9d6a57f0a31b1d189c9b5df6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns/promises_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa9165b31c7d064ec31db34ecfa85a0d431d802fdb56df007983a8675810846"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runtime/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"563e55de13ecc2accb4999c3707912e97485d438bdfe39902aac9f38599316fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/console_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c11ae4bedba72fd838e6ce447ff09c0ffb641e92bc0a32e5fde5c2f16934c1f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/events/abort_listener.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"264483144bcaf102a6cddf92a2ede2acf0995ff9f851d3aa8ff1e00384863793"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/stream/web.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fdd662530037cdde89404f91f2bf401a37534abe7de28f0343ceb3d4f6cdf2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/punycode.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9970505ed148be2582886686b9160644c83ced3484a4c472188b210e4a3846"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/util/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5651c43b984e65fc94c44ee25e46ffe58828e9af50fb2376dcc33c73ac70185b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/16_image_data.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da1c82376bff19b364e3a1b35670bff90ac815f44955367af55a66ff5dbb2b5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/02_register_cloneable.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c135d8cafac999af5e6bb54879f78690708293dcecb0c3b26f3c91c8b29a52"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/linkedlist.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca077c6383f3b0bb4f9e3462a5b3be11df7caf447cff21dcca4cdfbb3636ab70"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/worker/js_transferable.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9296f0e19c45dbeb5492ced4c8ee1905c121c329a712423d69d33da3015a23be"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/bundle/bundle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c2b656179a40c3ae3f947aeae1f5c6477a820aced367d201504d47c6c0133a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs/promises.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8bff8f8110fcb9786b19b0049776d96eda34e1cb18054d090764fe75092738"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bf4f88be04d1bc14d44718c92dbda10aae17a535f30567de6f4f72a29f6894"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/dtrace.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bcbb7e124ed54933f8a6fefd6959dc00be430cb0eb8868c53cc8b69740be64"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/hide_stack_frames.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb328f6bba3f25ec06e5b8392e0aa04a8e456d66632e13fc3f2ec9da10af7956"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/task_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8ba048961c74edb6de9c056919c16f6ad97269db91125a5c65394fd68ec261"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs/promises_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b9dc5179210b615d729a98741bcdf12f5e575d4ec9b7e9f3979c6073576af4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util/colorize.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1b67daf6bde7fbb6cfb3a5322eccc7fcf71a5a4c3f048204b66a0fb15c791f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_callsite/error_callsite.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9d1ea5bcdc5dc3b34ca1db74ebb54cff6792ab51febe64ecce344ad1f1a402"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/06_util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c01656c45e00f8295017cf14353b65df3f2eaf9fdd2f135db7e5d2f848e6411"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/symbols.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebacec3a08ef8c691ed35f759be9348e1ca3324d164fd7d54e4d59c1d36b377"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_rejection_catch/error_rejection_catch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9713dd7c90c9105e7ab2766d36c3a23fe12680f87dbede09fcff5eb5359d1fe2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9198b969038c0789fb31a23c5dc7922eaf80eb2b36ae75f4b6eccf7321b577e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_defer/import_defer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0910d12f8279021438a1b42de7997e424d4586fd9dedd43713ff207e1878eb4e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/handle_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b18eedc6f5eb73bfcee3d2ab68daba43ecc9c55a806e55d7c2ef1378a6fcac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/http2/core.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b354290d5c43488fd5d54f7c9a3c28993fe74d59019daa9f8e598019f2a328"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/net_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"150ed9690b53619c5e22c26b77d13bbc09e5571b5fa6692236298beefe1920ec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/os_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cf925a593e5a410b04e7cae976bfa80de94b4bfd0aa76bd2dd5fd7d71c7983"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_interface.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfe944ed6882dc7e58a5c27c4b6521eeef941f5b60fceeaa24ef4e5cab41125"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/error_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3337ba1b544c80eb5064ba409239b064efec619fc76a9e7d2ed7d2b30972c26"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/assert_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99ef33b4fbdad6ce3db298b7604d23724ead8dc8756b56bd30464a9f1691e21"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef303cc5f42326a3cfb77e3800570fc1ba3b7e69c1c036952829610a67d565ed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_prepare_stack_trace/error_prepare_stack_trace.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8195f3485c753034d886992dbb727344c18c9bbaadffcb0c6cba3488ff4c40cf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/inspector/promises.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc42eff1bd3044c5c29bc6236a47ea1a2173398dc0b39c74ff8437dfcaeed3d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/_keys.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fec01e3f3712eb56462c5b894cd000680edaa908df4c0f68a4bca446420e69"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_pending_tla/dyn_import_pending_tla.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c59d8ba77ac06dc3c6d58568014f9a42fddd69419687d1dacdc91f02e6ccff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/01_version.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b1551fc98579a94058effae87216b832093be17fae64674c364831f7dd5c8b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/socketaddress.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b13d45e01bf03f097bf8826f0c4b696e45b7dbea104ac66480c55c728c75361"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/_listen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad7f97263f573e41f2be39370fe4c7cab13f679bf1fbd77d8c0e4d6d2d0481b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/v8_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a4237bfffedd9293e79a16874586cbb1b8e877a48693fd90f64ae9283860a9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/ops_buffer_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd409dced5b7284a748225a2924e3f94cc79c6a070274724c4cbe6cae817724"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/js/40_tty.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d014455224b6921b42902e901b512fc5420f41eee6189946ead2321beb82480f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/stream/web_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9468dc82c06aacf7e53d4eb46a3265fe8de9d047ef45b6fc390105203923de"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runtime/error.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c446af1d20445088a03e857f189474db4a92e51fdf55a2d55e437cfdeff40e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/_node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44917f2cf3297c1b4c0983a8af8f7b28097d7ccf3784821265556074dd6d3fc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/string_decoder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f8dc01430b78b80735ea34b22b59b3910585eab3edd33cf87b447f6aee7fff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_util/os.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b951f833e34293a9367a1ae7ce2151d22bece897797db8fa71abaa1993164a5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/buffer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37124bbb35ce35a17f81fd584b311cf689576912ebf6ea9aec11a2246cac2bfe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/events_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d984647b33c68df67d2581bdccf17467b605730e2034488a31d61ac1d5e23b8f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/http2_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"309effc36178d26c274438b50d8fc1199888d6d4a36748d430e9bd38b47a01d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5736b098343d84f859fd2c3034ab1612d848df2f4576ba170d45286d26b75747"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/crypto.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b652c4ae8c9ae5e4329ee13dbbd1ec28239cdbb2feffcb413f663e6c48d10117"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/vm_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2680fa1d60b6581acdd6b52c5ead6b9c24a2da03e8446d5cad7a201454dd10"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync_throw/import_sync_throw.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee256ae72796e2fa85952cdffe87e62dbda189c971a2975dd5ccc2888e605ed9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/cluster_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85b97d71ad186e3a92368ae1bc52033cf727a1cca272c5568234a458718e35f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/autobahn/autobahn_server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"282f1276bd0d34b062ca0b63b4c093ddf0725ac66941f537200ec617c3eb4203"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/testing_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"824e3e0ec12effe599bead6b8900db0c4c765dd92f907f930a1d300cd305677e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/perf_hooks_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07c3f6b984a1b8722d30cf478c93a875b3b596b635fa32b15e9579493aa24b0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/timers/promises.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e498a4d91d9802748405da3e48f05218e336112878584756dd1f14b1239250"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/ts_types/decorator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7418f21879cedff0f7bb2514ac07623caf70bd3e817edf26f40e178fb6506eb3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/separator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e72dff3dea2d61aae43aa687e470d1694b10d07218bdb9f32b703da3422b1cb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/wasm_imports/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8e9d1e14d4b20af71ac61018335fa525168aa607ec3546f05ef76c3c3aef43"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/callsite_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68edb224914b508d384364496118b1eeb44ad635615cff164c9e0d3b48be743e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/tty.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac496feb2cc81bc11d92bbad1d2bf4cdfc0cb6600126274f205c92d4be5955fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/async_hooks_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"197f653b6b31c8d69a83ae04605382ca1a76cd7c5778ec14e74262ba866dffd8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/querystring_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b683ea3356145e920dea89722baf4777f0f2489256b02cc7e72c24dd5ebf18dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/timers_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3d5bf68bd836576b2735c4fdcabaf57291c41609952c9030eb0dbe744c876e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_no_hang/dyn_import_no_hang.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1846c0112267a224150031513c4e3567d14ee6eb7ce0fed7590f6c755c0b817a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/01_canvas.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fda300aa8a5a2001e241f91ba514bfd98bb73cef467c821ff49ec256a7dadbd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/child_process_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7796f956cfb070ea1e817fa72063ccba01bdcb211018aaa9d6d6c77b1c01c7ee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/diagnostics_channel_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db5b41a86c07535a3099d8491d72e8f8ad5b74427f907b37112103ba84a1234"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/inspector/promises_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c335a198b8344220d7af16feeea34f249aedef7b48aa450b93c12fabea05a107"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/inspector_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afdecc289e1887683e197c722f6d505c3350308df243e1f62ad72c5462b4609"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0720e6cd671fa0c380e087114e2762fa1302f84185a5b97cb0c600ebe5b032"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/inspector.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f081b260fd1c5b7e9ae97322d2863e24bbe14c775aa54c39eb781c28ff7a44f8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/stream/consumers_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaba8a0ea34a7fa60499a57517b4e0a1d36ecf47d209242043c59bdc82419824"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runtime/console.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a2229004400e4af9a54fafd23a853385ad3fcea1662ddabefccbf1f9778012"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_async_stack/error_async_stack.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5cb3bfc2dcb17830df7977f2bfdf610fdc07b93a4813f09268dbae14d53360"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_wrap_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2f07df948080bac38a4e06baea2f6ed6fe26716465b3126308688721972032"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/ops_error_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0febb7424a5449e0b894480d438e92d8c2d1280b479744fb52d893d2c01e1f9f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/https_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8ee59c1336d55b3061748df0692983964d7d0c7c36614b50d52a458a594e3a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/_libuv_winerror.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"738edb4faee204e25471f8b83b238dc87c59ae3c56cafead28264c4d40b75ea4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/tty_wrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e04adef8c5bbcc650f68a8cad9720074113cfdfdcb460955f8b831a04e9f7c7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/sqlite_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33119974ff897f65851c9487aebf16600f3faff4cbb1cb165e7199e60bd7e57c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runtime/callsite.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97609b6e5d022272eea4b5b2fd032fa3f56a8242290050cee72b27a8e847b238"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runtime/throw.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"112bd81ca64f7e636a4c55ef520282f7fe700b35d62798e80694a4722816a0ff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_get_file_name/error_get_file_name.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5cd8e52727ccd4369bd280a0cd10b10e2470e9c2172cb532ed91fab0a21a37"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_get_file_name_to_string/error_get_file_name_to_string.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af644d053b6fb230eba69977591d9937b6f1d1abf7305f500976c7ed2a0bd4ab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_get_script_name_or_source_url/error_get_script_name_or_source_url.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b5684700bed9ff483d78cdf801d25aae2798d3e70aad3b937a9ada0caf79c4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_with_stack/error_with_stack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94492df721ab488c75a60cdb6ce119e0135c3eae09b9e172b7722f8e60586c07"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/worker_terminate_op/worker_terminate_op.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12c2afece843da943b2cc444e180ce7a61299c67a4772efed56e353574e0d66"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/error_codes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3069dd03c2ff3df35cab1da2948e390d612da88514f0c5138ee00341eaa8d49"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/checkin/runtime/object.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0e25c56a93715b28e241352da44ecedce35ccc3f059e8f0e218b2742929628"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_non_existent_eval_source/error_non_existent_eval_source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d60e7bd2b33611feb04d005f13572941479746730fcd6bea780de1a465c32dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/main_module_handler/main_module_handler.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eefffd8074800a06bbe7e9861c215073e0166ab94eeaac83bb9701d7795232b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/microtask_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b12574af9dfa917df44e2ffcc5b26e9c26eac0107433189d1b72b85ae22eb86"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/worker_spawn/worker_spawn.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1ffc3d25b5e6adc7af1e0e3cb1c0060c224292c84ddff72de06f7d56026de9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/worker_terminate/worker_terminate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"834dd73166388fd25d8de5a47376c1af9a3d0594ac2205d7aeb59e2254ccd944"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_process/exiting.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bb13b738e4807520230bb3d8ebe91b394e814b70dc2c0ca62d065b91fce7a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_tls_common_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"988e8e213edc33452f9d16c8cfdb131288eafa73cd5063f426a26f10bd328a50"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/errors/error_source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7699fef0af0122f99c5a0b798a967ef227f594d4e3c699a3689a13b8cd93b0e7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/webgpu/00_init.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b0788df0e91ca30d25c77d5951022e7abde0992a53f1e07485ab5f270c17a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/source_phase_imports/source_phase_imports.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4235ed06c095a5bed60b6930c4063f7286135935bd018af991564c4ceab9c5c6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/source_phase_imports_dynamic/source_phase_imports_dynamic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c962795244a2a4cd4f1f8eb9816e3f483c0fbd09c021a9b90667c8eee9c2e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/timer_ref_and_cancel/timer_ref_and_cancel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"729508df84b9d99624ab3333025f7a4e2d63464139fb3938dee838ca08d067c9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/user_breaks_promise_constructor/user_breaks_promise_constructor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40238fc9871eddf762dfe1238a2e0035e1abc128ba95b6aa0850b8367997d17"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/wasm_imports/import_from_wasm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4834a6267a13764a4f8103524603d4777b8538839efb33694821600a708143"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/duplex_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2e30c683b7306a0466de45c0b43d8d55f23d6ae3e8846342dc6df41be3b971"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/passthrough_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee3b85b214c6b0930334091fa28d83ed6e865d6794fb5b1b29765b3c16a8982"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/readable_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00fff80599d5beca99b2eede957015b5f0eb6043eb455d8cfbcdf18255dc53f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/transform_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"119990c56ad0a8502d0800612298b56707bfcf7cc4bc0f1ceeb7700a748005fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/writable_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d5571941bb4b53b59cc887fa9d65cbe605c758a4216239fe51f11dff04d059"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_no_hang/dynamic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"841fa79c437d326e84741ea898bbc0adb5dec72f0d33a6d4d3ea429be0a7404d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_op/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad81345517c482c4e86a325bef90ceb9e3f34cafc4e78a9c8c004d935de2622"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_eval_stack/error_eval_stack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75ae85c94769e0941034f2eedbe71b2d762b9defe3f57851d02d74b00c10c86"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync/import_sync.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eb33e0b8188c050d4e9382eef50780b15a67c5fe2aabd59ad18024f47b3025"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync_existing/import_sync_existing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f79cd08f233538b8275312d02775f9a6b334347e5ef2c6474f48fb83c277154"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/worker_terminate_op/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"462d7d0e811af3f0445e496aa091c9ad0b98a0e680cddf4a721866c35a79ae65"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/canvas/02_surface.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0802660850f28792d93a1b414c182500b013b479caef666cd3fbdc0ba3a8e9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dgram_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35763f18314a95dc694714fe723af855c58e07209ec0da814bd57e5896a1d10b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/domain_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da37e3c4788d12f2f157d364ec24b978ad3f18620e466663b7156fa1e5e5bed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/punycode_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d750bfb3119b31e78e33ae590f6e6094a00d0ffa3b86e906d05085e2a7c7cd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/string_decoder_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4ef36fa97e3e28c067a6e9de991fd6b216c99e41fc0d2d602b31d15718b434"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/timers/promises_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fadd8048bbe8466b2f2bc97dc910148e375620b9fbfe0aa511fac419410dce"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/trace_events_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"345bc6748fbc4d6bd52e10cd1607b375893108701e73c64902c8896da68e5040"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/wasi_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8116df736e045dca18b47610962288d534e86ae337de7e491f4dc3477da7dfc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/mod.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf022a81c0a74f9b33adf180accc22cfb92ec5da5e441e6bfc868eebeb2a884a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/pending_unref_op_tla/pending_unref_op_tla.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd376ed89ec0f0fef6a06d5392e02fcd30215a88ef2a9b04a8f5d7671d0f77d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/wasm_imports/wasm_imports.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6260cf8cfd04334ca221e1d7ee9c5c814428632e3a9426a3c3482f6717c0c39"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_defer/deferred.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0647235b1e59ca3ba315a0b40908181daf1d5d9fe21414ced94e19a0fc5169fd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/timer_ref/timer_ref.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da591e796437996d0f626537426f0db96ae0001cf10226afbd679ece6461513b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/test_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf299e8975dda73cddece27750f8b2c1ee1fe9b05b44f3eed57e38183a43a14"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_shim/resolve.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9814d2e85d72d9ea7fa7f0e9c06f6bbe39b9ece144d33f4c4f00a85c4ba0fd1b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/dyn_import_circular.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"165862e4e512a94acd2e53cbb6c6d81946bf7fec27fb16491c0ff05809ef23bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_op/dyn_import_op.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b48c2c9acc661ea458adacd86526494e7d8448f70c55d3e30cfccf46a93a00b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_pending_tla/tla_module.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7da387d4539fc4eb154778c23b76cd777c8318897a70284a7933603946f705"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_ext_stack/error_ext_stack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed05efa417101655152e01dde5f803105ec6605bcaaf13cf9daad1104a67966d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_prepare_stack_trace_crash/error_prepare_stack_trace_crash.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7acb85f8891a17a62884b34bd4cb48599a4d993fc52158c10a9a09e032e226"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_without_stack/error_without_stack.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b7dbb419d8e327215eb0d6eb91f4cc1e8ae2d94a12bf4b87cfdfeeeeead420"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/ts_types/ts_types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbd2ebc6fa1f9a27b97b22da3bfdecc14f0c2d7fa674efae90fa13f0ab96007"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/user_breaks_promise_species/user_breaks_promise_species.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2a773b36cd180194d0e07e28a627486002ec5a10e9b153ad97128bdb31e9b2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/worker_spawn/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0256bbcd4a939fad7a4cdd0ea6a9056d6bd1aa532ef47c4eabd8d0ab60f915"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/worker_terminate/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35389a681d72e7a35523e065a220746d0488aaea9f7617841a91536adb132dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/b.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bdd1934b8d45fac638d512f46537447c1bd2ae8f63568e3170abed09c2d966"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_op/dynamic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d28947137725d16bef0199a2bf9e28ece9915cfb1c0563594e5b7ec108f21fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_rejection_order/error_rejection_order.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c432a01549de80cf6eff1feb9512bc6f073804560f63778a4f50a4c8af108ef1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync/async.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97254d873746836404a6478a2d5227c0b288d8dc9f0bad9d6109b9229b0c3ba9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/timer_many/timer_many.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a7f55dd8a193b221850846b71fdc08483fb28f9e99be952201e3cefa2f4c95"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/a.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6b5ac357bd26b36f9c30072cba4f98739ca2b12087b81a0a12ca565d389213"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/c.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2dd5baa4435c8fd8cafd3788abcaf75090e28484f28f0aee9b4d49c8d41897"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_defer/deferred2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4d7ab33d51907a4beeaddb449205fbc160e662c528d506eaede5746a6ff0fc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync/sync.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee1093d1a1172e6cd08fe2f57c38d94156acd7d37975e8d728e3f51b337a0c3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync_existing/sync.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89751e712009a718438bcb9c53fa74018e666244c3f88a78b04f6e5e02bbc149"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/d.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e632b6586d2534203da03a5e268059ce67f6cc62668ed1191c8da0f2316f42d1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync_throw/module.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8e73f0d9d1bdc201e09040147d3fdccf82d0da3f062a2bfe1e425f10671446"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/source_phase_imports/other.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2469ceaf34a5dac88c17aa1fb71303997f87c7019ecd047b7443658299791eca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/source_phase_imports_dynamic/other.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4976398fbaa7e2c6fbd1fd8e2efa99d51ee37e869f09205c924d8eff8d716c88"}},{"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/registry/npm/@denotest/install-launch-cjs-temp-dir/1.0.0/install.js and 23 other test file(s) in this workspace 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/registry/npm/@denotest/install-launch-cjs-temp-dir/1.0.0/install.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc74e2e70205397bde68e68006faf82831bdf0655a0355a07842a1727d84635e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~528 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/pipeline.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c44a11a816e8bc106368017c536d2e482f4b693c822cc0e12fd233f01919487"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~479 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/operators.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0565ddc23bf869a913bda143d46e64c069a873cd76e5152bc944ab0cda103e41"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~268 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/compose.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f82add1e58699ce22dc6ef7199769073a26412c242e87c8f7db6f6ccc202f2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~226 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_brotli.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cc710d1d8c0382a60ec429c1b82457caae403b21b31c76e44144626df63fe9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~219 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/serialize_deserialize_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52ee99e66c3a2e458962de85baf3f56c5185f1ee8e007551661bc5a81c331a7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~209 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/ecosystem_compat_slack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e6f77381cd01001f663def4e68675a19c3313ff1d3045076d3a6765f27aa66"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~205 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/ts_types/ts_types.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/ts_types/which.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bc7d040765911f1c4305996adf120b0d9335913ea65d909af7c117135bb9ae"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~197 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/resource_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90477b2732803931b13870728b4fd9eb8be74fe3a94233e3c1fb6dde9faaf6eb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~179 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/type_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cbc05482a9404d8fd107a6f517bd54fed4139d7441c6f1ce29b6930b050ff1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~170 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/immediate_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99979e9175672491cd530969b85145d582c754cd3b7ca5e18a809bb1d8043224"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~154 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/stats_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73403ea0229917c9e02a11b449ff900818afff901683fe00edad0c363decd7b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~117 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/timer_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2185c1f167350a68b73f3e250489f6626b4fa8fc2a407e4c60e22f8e9583ce6d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~108 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/wasm_stack_trace/wasm_stack_trace.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e200d9d61aab5fffa68017e559bcce4f74b9109108f284169347a05b9a1128"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~101 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/ops_async_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eafbb027663060f2c0fcf390b0fadf42ef38b3d55df1963d5a6b23f6e49234a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~95 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/encode_decode_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a40e65d4d5c34bfe587f072b1e643bc5b819c5ff583420c1d41f1925ba0afa7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~84 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/upload_wptfyi.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84449db4bd15d597219e8afb27aaf30f2afaee7eb8b32a1cd6057a32b75aec05"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/verify_pr_title.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a759b3af946e037dba3c1c55446747a80323e1843943e54369594e12297b4759"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~69 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/duplexpair.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44680e5cfe00d4922955367bceca59b906c29c571912bbbb1bb4f529e64feb7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~64 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/tc39_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4992aecbc18f0758b3bd9c4b7b1d6fb2f6f9da96ada4cebc1ef460b2feca3e9d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~63 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/autobahn/fuzzingclient.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"573182ab5246b95c6eac5cae34bac567eaa4065751ccde19bfed7e720ef86fc4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~53 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns/promises_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de08f9212c030af573f83737356fe9c621dee1868f26e036978cd5013071862f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~42 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/task_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed51ab94af3b7960e345ae1c36751360e4cbc2b9f061f9b99ef89a5f3ae28174"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/fs/promises_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed189e209ebf9bf63d93204637d78feb9bf62deb2cf29ec309f022a74aabd72"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_callsite/error_callsite.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e8a09d3e53b5e2b3aba8a0cb21ca9722b3a7fb99605805a3ebc93bf6171a8f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_rejection_catch/error_rejection_catch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcf6d8d27954ace437dab8dc220e39d43944de6d586867d0341f6140638c745"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_defer/import_defer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df412e2e977dd8510bad6a27828c5c074c49a080dc1b9b8967414e3de1f6719"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/error_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc3807acfe9b8d96a321cfd0249947c334f1f2c8e62012d2dc81412fa0765c7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_prepare_stack_trace/error_prepare_stack_trace.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4c57d23d67db72e67b3ce12caef67137a331c98627434a24b2034e9d1dbb24"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_pending_tla/dyn_import_pending_tla.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88896580df930cca65fb7c31d7c6eaf0cf4c9a0be1776076bc33970eecc168b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/release/create_symcache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c70421113eb0fbcda8421fb1b839366d364a84a7a4f59d15d23ceac07425ae"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/ops_buffer_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43026835284c9163deb4658e732e225a20a415d7d4b1f37f1f15f88fb2cd3cf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/stream/web_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a138c7d4c1dc6cf6750e3a39ceaeba9a5aeaef623da09282d5b335429baf8bf0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/release/version_greater_latest.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec14d01eb52745ebd62d0d849ec3137809ca4270bfbb0277d8b5aa6911087231"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_source_maps_with_prepare_stack_trace/error_source_maps_with_prepare_stack_trace.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3331e1ba3f7995ba0a7ab266d47c8bb556a08c1fa5cfa5ba68c4948f65e74213"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync_throw/import_sync_throw.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a96fb781a2e3fb9d6ee14d92f97cb66ed1d472b1a8c378fa922856d25238956"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/autobahn/autobahn_server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd66c4c5982d0c346ea2da0f03be64e295da83ab4eb1736a603a99f280a9c6ea"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/ts_types/ts_types.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/ts_types/decorator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4746af2d33116e3278aa4d00fffecff05b75da855d9f935c351a5706ca892ef"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 2 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/wasm_imports/import_from_wasm.mjs) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/wasm_imports/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7ddbaae5490ac72e89788d076b08b5146440105ce649cebc9df51ac05f03bb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_no_hang/dyn_import_no_hang.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7deb1b34e42880b6109dd6cf95c643c0eb5153946a1442b4010fee015597a76f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/inspector/promises_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad982f253ffae8e8f0c7b663bd94c5f309770217dd12e707a71ffd8dcabe4d7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/stream/consumers_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"999bbb5a0604ba350cb41963f9ce0d25a3d31eb455c9e9700280dd2a968f8d60"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_async_stack/error_async_stack.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"963a54e007f37441ba4fbf2028027ed0211c62c3f0c62388edc08466951cf4d9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/ops_error_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5239387234014b798f969c381b69ff012149c60f3ffb908d902ee3a020ea46"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_get_file_name/error_get_file_name.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b3a6994e952a38ec579728911c87d0e216cac223f533a6242d413b07c78a57"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_get_file_name_to_string/error_get_file_name_to_string.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0e760ad32be73ea88bb5b8fee86081812b98686cec4a729c432ae93e8fc770"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_get_script_name_or_source_url/error_get_script_name_or_source_url.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee723a40c384ff5ca3436d00e940fb9344730015bc4d01b653dcc1c4a28e73e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_with_stack/error_with_stack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1befc45db3581e54db515ec76adfa0e0ccc168715d4e0dc2c6ce022b5f77f1c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/worker_terminate_op/worker_terminate_op.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d97e33485b0034f5d380682a2f421d2d1f6c44a6d9388ea2557b2cb094ecb45"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_non_existent_eval_source/error_non_existent_eval_source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"011b0b51520c52beeb793a5726a9b8bffcb331ac7ec63aa2033085526e807571"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/main_module_handler/main_module_handler.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"775ef00eae05530d03079af61c55e6b46380dbfe6026e7d02a9bb9478ce42e52"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/microtask_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ebd9bbf59472bf7a0d2afd1a96dbf5aae2a7c8a9b518b756e875bc26bdabac"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/worker_spawn/worker_spawn.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15e22eafb6a795e8b82fd8caabca9ab439a661dba9cd565824e18e8c26fd991"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/worker_terminate/worker_terminate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300f6a74c7ef007673ba664137fab8ffd7391a4449984f65091203bfabdc0fb1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/source_phase_imports/source_phase_imports.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f13fd14315eb91fb8fa9f41393aa195c3ee897aa050e9c8d22d07d768dfb2d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/source_phase_imports_dynamic/source_phase_imports_dynamic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb4b902d068c6f1d508e307b9daeb2263df0138e36b01a595a518e9eb9d64e2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/timer_ref_and_cancel/timer_ref_and_cancel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf5e091f4b451d1911a5408476923ec96ca018a968135196d48b3195edb9249"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/user_breaks_promise_constructor/user_breaks_promise_constructor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"104adb367be67788ebbc278de4bc5c96a202b9cbc3e2f9bdcb816b1d5addf345"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/wasm_imports/import_from_wasm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4749e9b733a4a586a362922a1298c6237f1d09aa0c92b167fac5aa6ccca6b637"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/duplex_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"614f0ca067810717ea55567b68e3bb116caad1b4805eef1c18c12392261f3be1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/passthrough_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a689e4d4a7aa9b650097f1a2569b126db35651dbfeafabcf7125354a742268"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/readable_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad8bb36e8bb5a7b679c8cd15cac32f83940425adeef3bc754742ffffc534aed"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/transform_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da12e7ba5fb7063c23257d4ec32577d1cf9924aea2aa280e3eca82b4932e06d9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/writable_esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c14da2cd85661816b1f1f82e8a1734eba759d4b45357021c3a3a300a4d0bd7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/dyn_import_no_hang/dyn_import_no_hang.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_no_hang/dynamic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78a3286a4b4b55f7481567e84fd1672384ee1cdaaec97628a429ddfd3b6d139"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/dyn_import_op/dyn_import_op.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_op/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca4be730eea97ada9a572d94a579aea6be4e1728436e152a5baeb26825234c6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_eval_stack/error_eval_stack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"318f8e54ab6dbd95d19d061c5c66c0de80eb6cfc13d3a438fd5f2bc2327affff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync/import_sync.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec726b97f38b401f19d7ef94781b5d64d4b656a80e961a73fbc39a52f20914d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync_existing/import_sync_existing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a619fdb6e5a89774265a6dde71b0d4e9736d5b18c2fde4f80887d90f9dfe06b2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/module_types/module_types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3d08ffbc8f0408b2cf68dc00ff90f82539c3d17a0d254991adceb274acf15b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/timers/promises_esm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d59890d9e0fa9e6b05f64f7d7e9d0e014a4723d969ebd90f82753f114cd08df"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/pending_unref_op_tla/pending_unref_op_tla.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a6ce246d6975bc21a4c9dad2303eefb5da23a11876687f4db8e7cd65011f70"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/wasm_imports/wasm_imports.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8896c1a3e9d34ef1b65c5724cbcd2ca3907b16ff3f5653b16a90a976f6f439db"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/import_defer/import_defer.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_defer/deferred.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a1b0531c4ee7622cb6dcdb8cb75b8e79ac2f9aaac2a3063b9bfa31e2c269f0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/timer_ref/timer_ref.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b9648ab54532ec189b2e9646bb05fe0beffd616f574d1bd44800c531e53f53"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/unit/test_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f8e60c4a2c7039d729af75aac093d141d69dd239dd83d82cd8c6cf0a7bb948"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/dyn_import_circular.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"380acbcef363c394e22fb059495048fcd260f26c42c4404b567d98b27cae7626"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_op/dyn_import_op.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ca66c6ae5c177f98fa9879cf70a8f128c33023c1d01a10cf7ed86189791e42"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/dyn_import_pending_tla/dyn_import_pending_tla.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_pending_tla/tla_module.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef6c402bd107e3d2dc64f84b78cd856a9c1ce5d197586224264753ecc103858"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_ext_stack/error_ext_stack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a4f909e0e5b079ced3cb35478228486ebcb30a88012d16fb22f48c25f879c0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_prepare_stack_trace_crash/error_prepare_stack_trace_crash.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c34c7a07c05a05cf5f22a1605d54341cc8938f91640686a57f9ef139801790"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_without_stack/error_without_stack.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"852559271bed0fe846a39fef62f35e761b045f0b2bae95b975011f2d36791857"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/ts_types/ts_types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395a9aaaae8a00a976ef949a599871375cf9d13a14ffdd0af99a448d674c9db0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/user_breaks_promise_species/user_breaks_promise_species.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cbcd87e1d20917a1714716e0e898289257cdae39fa2f5a6c81ed7a22a293a1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~4 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (libs/core_testing/integration/dyn_import_circular/a.js, libs/core_testing/integration/dyn_import_circular/dyn_import_circular.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/b.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f99afebac44ee4c8943f86e64879d38ce90edacafafe2cf3c62672dbbfc133a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~4 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/dyn_import_op/main.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_op/dynamic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c58c7292348aa89dddb6aba80e404e1493fb4d498ea8afab9dbeeb89155df1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~4 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/error_rejection_order/error_rejection_order.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdf295f0c6b78e8d3bb67d09590222b71a3ba5c750f33016f1730d82134669f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~4 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/timer_many/timer_many.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6c61a6613ff2612029caf9b5cc4f3a7a05da3df15bdad875e0eb9c90355b4c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (libs/core_testing/integration/dyn_import_circular/b.js, libs/core_testing/integration/dyn_import_circular/dyn_import_circular.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/a.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa646ea1bc01569bb8601189957b17746a621140dae768a8ede3bbe86f38ff9d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/dyn_import_circular/b.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/c.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4107d74d28573d4a64cfbcad88f766bbed201421a4b433b6673858a1c8026f0b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_defer/deferred2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"222adbd2ff9becc13fc4184aa6261835704ddb68ebd0bcad9b1552a3419c41de"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/import_sync_existing/sync.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b989c3967d7b83a4bf3d63665beec671e70402d3b1b078f6f66e88d0448409"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/module_types/module_types.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/module_types/test.bin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b27d949dec2a07129ebbe402805b4a0110fb17abf9b6c99fc6f181e62e1e63"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/module_types/module_types.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/module_types/test.txt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0836981d94ecc8d1dad0f672d18c9459c9a4a25f1b0a0fb886387a7bc3dfa058"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (libs/core_testing/integration/dyn_import_circular/c.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/d.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe5b6fcef8c2c64b48e8dd6ca1f1c5ebd9983477998ea23687914e92508067f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/source_phase_imports/other.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"533828ff758d23b2a8e4cc35179d9d8c397c244ab8adb423afaa011ebba7459f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2 LoC): no import path from any entry point (910 application, 328 tooling, 1242 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/source_phase_imports_dynamic/other.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5e61b9bebbdf10a876bc3f58595a7d575e364199f50bcfb0d0f2ffca2941f8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_dump\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_lint.js"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"199a5aeebec7f2d1ff520cc0fa9316d16f1ea01b6d50fcda041bc9afda9d65f1"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#remoteAddr\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/01_http.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10b9729c5d838a9ab3aa23216358b169ded5eb4856fd80f4e75f7658989a023"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#localAddr\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/01_http.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63ac774187c9eea6297183ab5d6b5e14eedf7690f8a4b41cb9c5e32991a4f48"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#strong\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/util.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23f334b39c243a34f727d46d2bb29eb7d7eec29ef886df49477fa3b0b802640"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#localAddress\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/cares_wrap.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3034865792546b83dcb161eadaa9d44e8794b64e52f510bc899b90a489e8a36d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#recvPromiseId\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/udp_wrap.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d7c646874bdc1c1ba09769ef7e3c2f9b0098be58111bdd5adecf91d4f894c0"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#settingsTx\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/webtransport.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"709e9bc0aeb425681e7b873bd8172fc47a8a0c9be5275557838d9bd86ced86e4"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#settingsRx\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/webtransport.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22e0fe02aa61716ad8fa64f87c70582ba73c183e10e9848096d976928c3fd8e"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#connect\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/webtransport.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26c5683bf24738893700d75edfb6fe807bdb329cc941219c789a0cc23a03058"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#qpackEncoder\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/webtransport.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9aee6d2d7cd45677980cf56e7225f6f4382f7ccdf616c4e6c77f1cd8479910"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#qpackDecoder\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/webtransport.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b31106bc51b2e5aa3066573a069ae3fd3cf184cf1e3b3d31759a2ac701f6d8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Buffer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/cjs-local-global-decls/1.0.0/index.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"35437564949641ece2cf8ae85f752ca1999d17960f593027f97caaa178e95ade"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CanaryVersion\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/release/promote_to_release.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa102d89385d7af7ca7e26c5d03a47827393c9204f96f533171f05b275363a7"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@std/fmt\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wpt/wpt.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b6fc0c67b4bf3ac6c40e1600e06529b70f983be993b6a08270908d3d94ddb5"}},{"ruleId":"R8","level":"warning","message":{"text":"Unlisted import \u0027wasi\u0027: Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it \u2014 but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/dts/node/process.d.cts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3576a375d180f41ddf95c5846f323a9a9430bc17113f7d35374375719c7c21e8"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027.other-package\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/require-added-nm-folder/1.0.0/index.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c270f0b6298501a7298f0068da81a03c6011aa4a3fefca7a6986a096ae98e8"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027non-existent\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/require-non-existent/1.0.0/index.cjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d077e80e5e8eee471c409d31a4cd72cb93176abff2a8708321d69f33bfc1ce9"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027local-pkg\u0027: Declared in tests/registry/npm/@denotest/file-dep/1.0.0/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":"869c05d286f0fd610a0fa9b750d8a54c0a4b7b64c9bf11dda4cf777798a57c90"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@denotest/conditional-exports-node\u0027: Declared in tests/registry/npm/@denotest/mjs-reexport-cjs/1.0.0/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":"2f329af607d98c17fa167132b8b5f5ca7a77532cbed557bd95d57f5cce342f1a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@denotest/non-existent\u0027: Declared in tests/registry/npm/@denotest/non-existent-dep/1.0.0/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":"a7dbaef5ff6ed87e9e983d986718f30a901a8243f591f13ba5ec2aa874cbd575"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@denotest/peer-dep-test-peer\u0027: Declared in tests/registry/npm/@denotest/peer-dep-test-child/1.0.0/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":"3b6efd0836d0dd335b75958f44d102eb84a273f2e0303e2e2dcfcd9641d4d4bd"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@denotest/peer-dep-test-peer\u0027: Declared in tests/registry/npm/@denotest/peer-dep-test-child/2.0.0/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":"1bebb5cc3bdae87a7d6183adbb295a67d0c2b832f715c0affd2d861f1848e6f0"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): ext/node/polyfills/stream.ts \u2192 ext/node/polyfills/stream/promises.js \u2192 ext/node/polyfills/stream.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/stream.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0b3a86eaee19c4fa472b85c5e8b2f33b7d28c575ef975c0bf22d9b9235abd6"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): libs/core_testing/integration/dyn_import_circular/a.js \u2192 libs/core_testing/integration/dyn_import_circular/b.js \u2192 libs/core_testing/integration/dyn_import_circular/a.js"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core_testing/integration/dyn_import_circular/a.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"16972f62d1ccc7d401d2001173493ce27159ac57eefc97b0852b4211f66f6dd1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/MixedCase/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/MixedCase/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ae0d23fe37b5882fc8cce7b4306a015253df3c139ed07b7f39d2d8db36dad"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/binary-package/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/binary-package/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"77200806bac043a6f426793db42c9aa4eca3611c97d06df33df4d9de4d189977"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/bundled-add/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/bundled-add/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"90610c72521f0e2f9155a556964f8b9e50e7374e24d10faa642309f46cbfbc1c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/bundled-deps/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/bundled-deps/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78af4b7df20f13aaaf12adb7423b7f38937f6bb9dfaedc844121f0a848c8f33"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/cjs-exportstar-reexport/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/cjs-exportstar-reexport/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8afa79b1357c9275ec1e52fb76bad4874b092ec501ad221c57fe2e2bf71132"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/cjs-import-dual/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/cjs-import-dual/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf93dedf834565d09b66a6aa23c2693604654b2f2974433ddc6f63266e05a524"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/create/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/create/1.0.0/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f569bcf44095d2bd657b8a9002a7f0a5e0c7402e8ea4b0e9567d2dde1b7624fe"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/dep-cannot-parse/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/dep-cannot-parse/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c01d308b82303b8cf5b8a7f19a296744316cbd03d93d539c947ebebd7e8b5d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/different-nested-dep/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/different-nested-dep/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8aef2e8a183eed148b41b6dd3edd4ebf59f40138ccdf393fef7ce06d60ef10"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/dual-cjs-esm-dep/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/dual-cjs-esm-dep/1.0.0/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05b5127c3db357b386e664ad49fb13141fa0f75e3d7b48b78a33a941965022f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/esm-import-cjs-default/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/esm-import-cjs-default/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0fa5d3043ad2d81d66b6d7e783f6bb92a5d236e92a60d295019a5231a06784"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/file-dep/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/file-dep/1.0.0/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"440e17b66abbce693b42ad60eb700ad38d70d98a58216d0b924286260035aa9b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/hoisted-cycle-a/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/hoisted-cycle-a/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f623990ddd58f5b2067f37e727c68663228ebad0b7db63c7e4d4014f9c5d310e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/hoisted-cycle-b/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/hoisted-cycle-b/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cfa64145311ee7ed33e649eceefe4aaddfdaea6ee3be80127892473c3305ad"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/hoisted-cycle-trigger/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/hoisted-cycle-trigger/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e552e50bce735ed534e36f2088d3496a67513922393a54e2de709a25c0afdac2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/hoisted-nested-grandchild-chain/2.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/hoisted-nested-grandchild-chain/2.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ab9e0d676ecdee931e39da0862f74cb38cdde44445553404d984cba0d5c93c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/hoisted-nested-grandchild-parent/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/hoisted-nested-grandchild-parent/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3003f3f3331cf4d32e7ae43f47fa6cc4048f1783e37df0d8124d8f7fdf511bbe"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/hoisted-walkup-chain/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/hoisted-walkup-chain/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"193d654a777c71f0c796937c0e18f20fe5de5f12dc5109f83a992783e4a6410a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/hoisted-walkup-needs-chain2/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/hoisted-walkup-needs-chain2/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cf4726b1322aa0d9fedf8435b30d515cf2a2cd6e7a4bbaa9b8a7e17457023a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/hoisted-walkup-needs-x2/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/hoisted-walkup-needs-x2/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4575e55c302769503a0776b0de976ad752581b511b430848b6232b343ff81ffb"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/hoisted-walkup-x/2.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/hoisted-walkup-x/2.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4718ff07f06c3e3679572642df57d4c489b33fc4b51abae04bec8db6271e3ed1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/lifecycle-scripts-cjs/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/lifecycle-scripts-cjs/1.0.0/package.json"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"41233c732644c07f6d8a13bf5997d93623c5cd01770ecfd133ea652de4111f88"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/mjs-reexport-cjs/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/mjs-reexport-cjs/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6097a7a2048d2bab565564830bbd14b4e0c81f64e5467dd6b62afb391045825"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/multiple-arch-deps/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/multiple-arch-deps/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c765e161717cffb8640b5d08e42fb930ce5fa15b2c75693b0debf2fb1a49572a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/needs-different-nested-dep-child-v2/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/needs-different-nested-dep-child-v2/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8602fd5cb61f72a4a6da07137ad51b0b0d69e2b36bc0a16eb77454db9cac32ff"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/node-addon/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/node-addon/1.0.0/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84294515c3a03e32d62c27125653c88f12e17d14eb5a661515b18ccd179c17c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/node-lifecycle-scripts/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/node-lifecycle-scripts/1.0.0/package.json"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf36e0490e5369357d7e01ed53f18248f65bedb2a74a229bcdb48c2c657e8df"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/non-existent-dep-version/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/non-existent-dep-version/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0dcba777b0a114b1a98ab0f9b12001e707d0d87eb70d71bca4216a2cdb5a50"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/non-existent-dep/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/non-existent-dep/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ad975f2a49943ad2ec387bb376c75fd5b1c0f3d95d4bc3954270510b058a53"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/non-existent-optional-peer/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/non-existent-optional-peer/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e1d4daf5ecb6d1fd08abd1f95fcc4352a1da9c3fd92c27a7a81ae53f9e0cd4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/peer-dep-consumer-2/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/peer-dep-consumer-2/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bd8befd023843ee889d862e6d58c507d271916cf5c3f0d3ed9edcca2b91da7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/peer-dep-consumer/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/peer-dep-consumer/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa92383684e60f9012354e3845b2b79cc69442379b854c1e12a69a09f8d5b57"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/peer-dep-specific-constraint/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/peer-dep-specific-constraint/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b224e24959db683b3b2382e1a37936e8e4f7bb5497bbb6e6b7b11c65753bf486"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/peer-dep-test-child/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/peer-dep-test-child/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b424cbe6365b6a1d69be915b9119698864d86113da54b433b28476dfedf2384d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/peer-dep-test-child/2.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/peer-dep-test-child/2.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ba4dd6d8670408dbf2695c5e64039586c4887d0e316726e80ec9bc7bf1d3aa"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/peer-dep-test-grandchild/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/peer-dep-test-grandchild/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48ed8821b1dee60d2405ab73be880b137271e682b2a83f4f85f45eb37768782"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/reexport-from-non-export/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/reexport-from-non-export/1.0.0/package.json"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7e295530f5a5121f083035834770a5791b4bf8f70558db80504f469f8568e9"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/say-hello-on-install/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/say-hello-on-install/1.0.0/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb6f8c2a208e2256a85db7d1dc5a5751ffd3724139f1eaa15bd753232b500a8"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/spawn-keeps-npm-state/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/spawn-keeps-npm-state/1.0.0/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5de8e771848bf79031950028c094219c4a7076fa6d84b667ac91b195bace8a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/transitive-bin/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/transitive-bin/1.0.0/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a7aab8f4660a56918e2f08075003a99f28fde8e47409761b7eed8454dd3491"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/types-no-types-entry/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/types-no-types-entry/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"812c02a6386b8573ede594da5a00fce7e1253815bf3fb6331aeb8d37e0d79c58"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/registry/npm/@denotest/using-vuln/1.0.0/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/registry/npm/@denotest/using-vuln/1.0.0/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa3d53815ebc7a00e10375b4d86ab8f1a1b4cd2ee6a1195bd84abee4bb9fdd7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/add/dev/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/add/dev/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3eb2cb35939e69bb2c71c9e8b86a115d37ed9388a8190a335b9f25be87145b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/add/existing_deps_singleline/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/add/existing_deps_singleline/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3481e1ce3482e0b2f4420542b319314e4728f139c88541bce8a26b51a4057746"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/add/exiting_dev_deps/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/add/exiting_dev_deps/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc17db6efa14d091919c0123ffabac68fb3b1075dc478ae661cf4feebd9c73a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/add/prefer_package_json_remove/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/add/prefer_package_json_remove/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ad8262bdf427290b658c60c8030e9a47eefbbf122e24beac0994ab43f2b641"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/audit/ca_store/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/audit/ca_store/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2e85928688b5f5a3c4f242541c0d12f898be8f30991666d2d621d60c684431"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/audit/deno_json_and_package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/audit/deno_json_and_package_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e0415c7ac7896cfa6b781b0087a32d625877531c131edcd79bbcca17abc0c5"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/audit/fix/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/audit/fix/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09c6463fe2460554f43969882e58bec3976ec645bf05ae3229b943e1d85621d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/audit/ignore/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/audit/ignore/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b6b2f4a0b7b0dd9539e7a892792f8ecf47573f9543880f9cf9da8ae2b82917"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/audit/no_vulns/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/audit/no_vulns/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4277102382bffb0d4883504ade79ddbb8fe31b04ae8a3cd5c23eac2cd2b8550"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/audit/overrides/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/audit/overrides/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"686c0eb0fe4405290da4a8fca707acbcb353de49de755d42076d15cb97763368"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/audit/package_json_only/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/audit/package_json_only/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac52283547e07ba3590199f00b545c55700a5267ea3e35766e7d361957ee89f6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/audit/quiet_flag/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/audit/quiet_flag/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d683bfcc7dc751fec94bc6bc579a7be473518a56de526ef9220d2580515936"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/audit/subpath_registry/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/audit/subpath_registry/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd950ec4efb7612cc2006d6e2b89ee3ccad63247f5bb08612fedb872120481ac"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/bench/package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/bench/package_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d17b943c48a656bb48845a1505b9cf0998badb142aa1adc5b2dcf5612f9da8"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/cache/package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/cache/package_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3494d6ac12667d464fd009f69db44516343d7445df99610d16e46324f75c0f3"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/jsx_automatic_no_explicit_import_source/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/jsx_automatic_no_explicit_import_source/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"562db6d4f512941031f2fa45699a69d9272af18de2663c9445130b9208c6109b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/module_not_found_npm_pkg_entrypoint/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/module_not_found_npm_pkg_entrypoint/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efee1fe962542bd29fb911ad1122ee9c3cceaa8cee37caa3c5991df6a6c0b56"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/module_not_found_npm_pkg_internal/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/module_not_found_npm_pkg_internal/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bca57d743f3af459dffa3a269a91f8dc1e1d7d810a4277fa9ed390b6ac4ddb"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/npm_pkg_empty_main_entry/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/npm_pkg_empty_main_entry/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"54255ae9c32c37e39a8707f892ea0c9fcb6ecde1e7e4c499f5ac44d5ad90b002"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/package_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"108299c6030f63d98e6ab1e8ed3fa962d35686aa5aa882ece73a4dad24e5f9ba"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/package_json_auto_install/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/package_json_auto_install/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff15344385a90ad3aed60761fc93752498dece0ac17b80226bec722398135c81"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/package_json_fail_check/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/package_json_fail_check/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c6fa840616d3931e9f3f81e350e22d73ac2994c57030e439862929157c1afb"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/package_json_with_deno_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/package_json_with_deno_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a8679e55f41a9a20b127795ac7f2079dc8884f675e9960e76759fd71457347"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/special_specifiers/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/special_specifiers/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f25de0994bf5e06e9031f2e8b7534b960a684b90028ce0c6a915ed888ea90a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/uses_types_node_pkg/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/uses_types_node_pkg/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2852f30f8f9addd3c26607b4a51015a24ba0458e8ca49baa450edeb4ee584271"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/check/various_node_errors/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/check/various_node_errors/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbf4bfccec5b5cbe410961e04ec2efa68b2e28643c215477f7efe396a8014e6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/bundle/cjs_deep_graph/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/bundle/cjs_deep_graph/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a051d5534633436765b80f9c9f523319bf00c8320e0c9f566dd85895df588868"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/bundle/cjs_import_from_esm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/bundle/cjs_import_from_esm/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8299c1a0eebafd3749e5fabac82a01a6e883191a4cec19ef610c07cb78275f52"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/bundle/native_addon/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/bundle/native_addon/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"157a1ef73e8cbce1712d167af041b689f85a2e927da0820a93a90adc81bbe6ad"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/bundle/worker_npm_outside_scope/entry/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/bundle/worker_npm_outside_scope/entry/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22cb3e944df005bf7dbd78dd6ed717e911806b06adb7993dbe741cda080cf5d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/byonm_main_sub_dir/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/byonm_main_sub_dir/package.json"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcab2ac27fa92e4e4145271ba5af17a39551ccec78357a0a471394a05d08837"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/cjs_reexport_npm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/cjs_reexport_npm/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"395e0b9d44fba6cd14a5f5c2661ed429a5db70ba1f6617ac3e87a0c8de619507"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/node_api/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/node_api/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63ca932a185a16a1a6614db485678e81bf931ef7e1fc44c9a2f182a83b08e1c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/node_modules_include/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/node_modules_include/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"165b04f7c2a26fdd92fb1d74186d230f5c4392adffbba5945b01523795edcde1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/npmrc_auto_install/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/npmrc_auto_install/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ea218c1dddbaa4482d9287d4a6c6087cea836ff446e62d3e7ee5e7ccaa35f2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/npmrc_byonm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/npmrc_byonm/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1d73a00a0f8d75468aa7c8f1f7dac69d38f38679a0fbc40556c16027309761"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/package_json_type/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/package_json_type/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"029043c755bfbc485ce7dc226f2e763e978a9112882e6850a7dc51a811b749ec"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/compile/self_extracting/npm_and_jsr/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/compile/self_extracting/npm_and_jsr/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d7712b60f1ebfd25f6da5894cd09f4be680e7fe703193ae655cc309971543e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/doc/npm_reexport_byonm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/doc/npm_reexport_byonm/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6856bbff9e98f0c5c1f97d98a92308a7b0f3b883a080c0b58f565114ca7aa523"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/doc/npm_specifier_auto_node_modules/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/doc/npm_specifier_auto_node_modules/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ebbf037bfbc59ca1c8421387fa67db72b08fe96d1233c134605e3bf4b1ddcf"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/doc/npm_specifier_byonm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/doc/npm_specifier_byonm/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ac63fade77a5b13f6404854e21ef4dd7f685b41b0da262bb99f2a85acb7c19"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/future_install_node_modules/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/future_install_node_modules/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"663cd1d82b418bc1b0abf07a5a59dffd11481f619151382ca25ddf1c184b0c51"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/info/byonm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/info/byonm/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"795b222a7a8bff849f90a064b47604d5e5e533b59995b1a0e5eb55bac1c18115"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/info/package_json_basic/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/info/package_json_basic/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"174d8732983a26f19b14cb061ce28c28f7d3f23018e920a34ac927c69dde1112"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/info/package_json_basic_auto_install/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/info/package_json_basic_auto_install/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b259f7f00007114d5867f02e19cb20ecb942b97f9149d433e04fca2c5e2ebb"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/alias_pkg_json_and_deno_json_jsr_pkg/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/alias_pkg_json_and_deno_json_jsr_pkg/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6b63d4dc141802d85cb4f57d9366c333e5f9a63922b57563117c7b1596c48d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/alias_pkg_json_and_deno_json_npm_pkg/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/alias_pkg_json_and_deno_json_npm_pkg/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e395384484b364c7dd1c91d486dcb0a79666067641be9536b5a0fb2d98e3b61"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/bundled_deps_prefers/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/bundled_deps_prefers/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1074cc688fd664e26ac27cc44c1e257398c71d5687603c552029254ed0390110"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/cleanup_unused_packages/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/cleanup_unused_packages/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fba1b73e69f9a3ea6a6dda4e59600dc4b6ac35d6ca99771800192c982012945"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/deno_install_arch/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/deno_install_arch/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd340b34e352a2b147c6a89f651bf260d7025bbcad95789a91a2b39290668c3b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/directories_bin/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/directories_bin/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"407aa20a3afa624337ec299e0e204f157be4ba35e16ce4def5123af7e035f2a4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/entrypoint_only_used_packages/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/entrypoint_only_used_packages/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c32f05499daa348ee526eace3b8a75bbf5dc83bbb592f4584d3be9531ffc67"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/exec_fs_permissions/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/exec_fs_permissions/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d31a9e1628c51997ac8e853bc175b1eaed371218e027bebbe4d74f02766693"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/future_install_node_modules/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/future_install_node_modules/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16f103ea60bc6f0aea6d80f61894c88400c1f67ed720046f99ba6a20c92098b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/future_install_node_modules_tag/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/future_install_node_modules_tag/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0f81d7a004ab643015984e9cb01902fa21296727e834679ff3d208bb2a9722"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/global/package_json_deps/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/global/package_json_deps/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"da74495922106fb5d02a06a4708065a88423345503f281e19aa4c04da3a299f8"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/install_add_dep_existing/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/install_add_dep_existing/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"312f68eeac27d6e5036ac1852cafc9ed0b7560a73acbd47a7394e24249e1cce2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/install_add_dev_existing/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/install_add_dev_existing/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9170566243405ae0ee6480116435b222d89f0c855535cfd3af4909634321dc8"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/install_os_arch_flags/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/install_os_arch_flags/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f76ffd0e05f830ac7a653902960658fb25dffb741181daac4860ef54312fdee"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/install_production/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/install_production/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2e8be1385936e496e59ab8e29bcbdd0009d9b7aedc2971cc83286cce439508"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/invalid_scheme/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/invalid_scheme/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b91a790db3bba9110059232acfe847901500f6fb513bf89686ee0e44931bcb5"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/move_after_install/test-project/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/move_after_install/test-project/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f1ea81c44d3306da27feb496b17a3cecd9f3e5ed4a7511410332e3addf1adc"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/node_modules_lockfile_copy/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/node_modules_lockfile_copy/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9dc941c9d5b88e6ff9450a509c01622f617856ce9a8d5ca009b025b15ee104"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/non_existent_optional_peer/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/non_existent_optional_peer/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"211610b7d7a0c77333e80df21d574a473fbc02b981d838502aaf41c2459fe403"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/peer_dep_override_suppresses_warning/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/peer_dep_override_suppresses_warning/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb09ea1f5c239f626cb2dcf4c41696bae78cc0e3a8e78405b8a60d73ebfacaf2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/peer_dep_specific_constraint/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/peer_dep_specific_constraint/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"52706836b4f8831a72423888da96f994246b53d1480f94db6fb5d09dbebc55af"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/scripts_install_launch_cjs_temp_dir/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/scripts_install_launch_cjs_temp_dir/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cca84f5234d46b7a5f306754dd0c870a1445ae05f8be389ac83b4152dfd69aa"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/scripts_install_no_ext/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/scripts_install_no_ext/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"470997d6c1932c55aab201939d349012a5120b5f1592d005b6a7a8713d4d1506"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/workspace_member_dep_lifecycle_init_cwd/backend/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/workspace_member_dep_lifecycle_init_cwd/backend/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e770943f45358d415554b5dc8a10ef36a573a29afcb8ccb1bdfe1c3c1a8f574"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/workspace_member_dep_lifecycle_init_cwd/frontend/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/workspace_member_dep_lifecycle_init_cwd/frontend/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52c8f3096b9240c315260cb0a7c8ab51a4c657196f44670837b3d09ced99f53"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/workspace_member_node_modules/package1/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/workspace_member_node_modules/package1/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7faa6fae237e500958a10a7aa45f40768dfd3c38c3fb716346fc94f0f6c1997"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/workspace_member_node_modules/package2/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/workspace_member_node_modules/package2/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae3e1ae85c27cc3fa6d44fdc37f47dec45d1bd480652bd6312af182b2fa913c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/workspace_member_node_modules_version_conflict/package1/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/workspace_member_node_modules_version_conflict/package1/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b17ffdb91fe437b377991eb95a525e15bac36662bbdf852479cbd46d5ac33d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/workspace_member_node_modules_version_conflict/package2/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/workspace_member_node_modules_version_conflict/package2/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c8c04e6498f88a49fa843a1950aa2e75bc4039ecf5768749964a8d2d77337c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/workspace_member_with_tag_dep/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/workspace_member_with_tag_dep/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba9d7c77c7d064f13bfb198ef98e41687f54681bf07bcfbefabe3904f7a10e6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/workspace_node_modules_not_exists/package1/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/workspace_node_modules_not_exists/package1/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cdaaa8280dbb8e4e0c9d5b8458f3e2547e779bbff484a9b9830aac0a98d618"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/install/workspace_node_modules_not_exists/package2/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/install/workspace_node_modules_not_exists/package2/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02d31244c5457abc6b81ce527544120c6e72f1ec4cc02a0231dd88d91fa200b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/lockfile/empty_pkg_json_dep_name/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/lockfile/empty_pkg_json_dep_name/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"503a56ac0d6d3e31ff09ddfee224134a8e3e6b1f8d77e2c5c5578320431dc73c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/lockfile/links_change_no_npm_reresolve_pkg_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/lockfile/links_change_no_npm_reresolve_pkg_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e7aad8bca5924f41c6a35209747efc1e4892f8c914d6b2e09041c7469af806"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/lockfile/only_package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/lockfile/only_package_json/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdf775f4a7ca23f25be548ef389ec87574d725dfcc4cde0ec6013da44011d4a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/node/cjs_reexport_node_condition/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/cjs_reexport_node_condition/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77e0cb1e0ed66adcc628675f700653af4893855e705d1fb83714b187e927b5c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/node/dynamic_import_and_require_dual/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/dynamic_import_and_require_dual/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"878275b43f3cb7effcb2fe68070cfbcefc471ed22a74d137d59274ef2732cd47"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/node/esm_import_node_addon/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/esm_import_node_addon/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f167b1c26f0157fe21136bb7830015d8369e27fedead4aed951979127c8d3ed"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/node/missing_ext_suggestion/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/missing_ext_suggestion/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"107afae5843aaec572a78e82f2119443e57dc54c5ec1c7f38d102d3d63a2f78a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/node/require_export_from_parent_with_no_filename/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/require_export_from_parent_with_no_filename/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ae9c346efbb7ccf15e5bb2e22ef41def4e009022068f5df000fa5a69acee0f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/node/types_req_export/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/types_req_export/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a576a90e97fd0681b220f6492e2c079eed6e499662869e1629ed78132bfe38e1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/node/types_versions/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/node/types_versions/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca4dd1eb82effce8269675e9947b5ac09879a431bb79c9efbcedb1864934fed"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/aliases_same_pkg_node_modules/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/aliases_same_pkg_node_modules/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8f260c5f380c0a1787c840b86966b9a64a6dae77c490164dede26639e7263f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/bin_entries_prefer_closer/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/bin_entries_prefer_closer/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9c129af81270594fa5d6257ce9ab8febe7626fd9ceafd4e803a956644d9c88"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/bin_entry_created_by_lifecycle/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/bin_entry_created_by_lifecycle/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31ddefcd24426f0e0126597e83bb80a556ebd21ea4415e1b4f8374512a990ff"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/bundle_dependencies/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/bundle_dependencies/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"328b064e318fc7d618573a51c153f0f9919d33b21437f9b5255ef66c17264ab6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/byonm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/byonm/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c46288097506df7868731961054bfc25416cf7d17c5a8352fcbadb13b13c150"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/byonm_builtin_shadow/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/byonm_builtin_shadow/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"710f285dc95ad816580f8ffcf990f844cdc8b9baa7f86900391833020c0e2b95"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/byonm_version_mismatch_fallback/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/byonm_version_mismatch_fallback/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15b46f03c23d7cee4a4d09c1a6407141c5b51b80b5f4d6bdfd7acaad89e0bf0"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/check_npm_pkg_no_types/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/check_npm_pkg_no_types/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e109c77a67d2e23a2dd7497fce6a442b162db181b7b888b91cfd8473c7d73a0"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/check_prefers_non_types_node_pkg/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/check_prefers_non_types_node_pkg/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e334b2f0e07573e41308e63af8de2d928601450466a5a006ecbf92db83c433d6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/check_types_in_types_pkg/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/check_types_in_types_pkg/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2a3819d81539649bf32109f18dc2805c40893d8dc6e7533924aa82bf4ac4e5"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/cjs_internal_types_default_export/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/cjs_internal_types_default_export/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f82d3b3737979b47d500787cbb9a03ab80c31a8ff81333fe47e5c19f340365"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/different_nested_dep_node_modules_dir_false/different_nested_dep/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/different_nested_dep_node_modules_dir_false/different_nested_dep/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1326ef50c354e5bea44a5d76ea1fd3644ca9c76aaf35a7206c0578856a26c494"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/different_nested_dep_node_modules_dir_true/different_nested_dep/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/different_nested_dep_node_modules_dir_true/different_nested_dep/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c4bd1ff90a4a32173ac25c6235cafb79f2567a31040ea31dc6718d85c84f06"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/dual_cjs_esm/cjs_referrer/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/dual_cjs_esm/cjs_referrer/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49557db8000716fdb342742070ffacc958a0b0d5a44f0c26bf5305fa27c8f61"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/dual_cjs_esm/ts_referrer_type_cjs/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/dual_cjs_esm/ts_referrer_type_cjs/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e719d0f96f976fa8889b4b69ea9fd33274a99e6f04d839b52e82a6482732aa64"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/file_specifier/package-a/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/file_specifier/package-a/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"32eab7e4be412ae5652f1efdfbafd58149036fef82924b900dff63ec0203270a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/file_specifier/package-b/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/file_specifier/package-b/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ea3c388aaf2ed161a1e55aff7131945e4634230b36a0e7021889f015fb3ba9"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/future_node_modules_dir_setting/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/future_node_modules_dir_setting/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1422d665b3abcb1685591feb47ba749753951d5b814d6bad5395e85b71b8937a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/hoisted_cycle/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/hoisted_cycle/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"295a8efbb12733339f1a3b4103ab4a2977f3d7d2dac01fd06454ddacdb393f39"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/hoisted_direct_dep_priority/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/hoisted_direct_dep_priority/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9522e9e844300fc65b97273ad3e89a3b126d1abcf320c0c6eff2e625f012451b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/hoisted_linker/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/hoisted_linker/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"344883c106a6086eec105ede0d8e3fd24110ad2d30ba2c60dbe62f26db4e1149"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/hoisted_nested_grandchild/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/hoisted_nested_grandchild/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f394e2df6a19864dc297277e4ce46354d41d5042ac524f3a822c28f32e42f5c6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/hoisted_walkup_shadow/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/hoisted_walkup_shadow/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f4511a8058efbeed455c943f096f5db125e10c813e4d4240b95be7aa942088"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/imports_package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/imports_package_json/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"93305f7a0a89ce1e30ac00e9ab2233bbf5d52b2447184945ef13631f62043dd0"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/invalid_bin_targets/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/invalid_bin_targets/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"478f6e373e9226c3524ee401f2c27b6e9d11805203b6f041571148e3653b6dfa"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/jsr_specifier/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/jsr_specifier/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a854a4b21867a46ab76057ee4a5bea6ada8ba289c54f897e4d9ae9aef3b3c98"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/legacy_subpath_main/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/legacy_subpath_main/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c3682e0a21f58c38165056b9030d6a4874994c520a7f7540a9065f209a6060"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/lifecycle_scripts/hoisted_dep_bins/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/lifecycle_scripts/hoisted_dep_bins/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d5d888387d8dd459c53aa45c5dcf273c33820cb9e30fb3be81431f31c73312"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/link_npm_package_deep/main/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/link_npm_package_deep/main/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"84131655ade80c36e8cd1d0d4c6c2b502278672b49b504c4653d8090346d0747"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/link_npm_package_file_specifier/cowsay/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/link_npm_package_file_specifier/cowsay/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7d9da1f6e942401391edd0595a3a933d8ae3f9fbca25eaa97e7ead686d5dcb"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/link_npm_package_file_specifier/main/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/link_npm_package_file_specifier/main/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7726d2e2fa8ff5b19f62134832f2454f5350b339b2707d6b91d70d621ff79f1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/link_npm_package_not_on_registry/main/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/link_npm_package_not_on_registry/main/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"821b96b2696a76b26f9f321cca721d0a88f06e188a140e5f11d52c6612257ea4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/link_npm_package_top_level/main/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/link_npm_package_top_level/main/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e3a10f320f945776eba1992e3558531592c31f2f398359fc0846de7659f182"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/local_dir_resolves_symlinks/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/local_dir_resolves_symlinks/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fd2b601f11d5f4f774930094faea275f92483ca45d26fa126a1dc536f5bcf3"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/local_dir_resolves_symlinks_auto/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/local_dir_resolves_symlinks_auto/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e93a98f252d75326e051762c9c436f83b163962ade79bea663abf05d77984a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/module_sync_condition/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/module_sync_condition/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e686861e177301bf11036d93f7386b29f28de4d9149426ef75eacae2a59d15b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/no_shasums/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/no_shasums/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e21b35a4c1c09897df31a6b3be3931cf8b0cb019349231d7966fce2cd53b48"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/node_modules_import/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/node_modules_import/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f506cd12acdb7f7abe42a7fd78b3abfd1c287aa8ef71db1edae291e9df30795"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/node_modules_import_auto/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/node_modules_import_auto/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeed8633206c00c970bf48ad1ba0c1b911f3aadb651742f12045871ba2bcac06"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npm_check_updates/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npm_check_updates/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda69891f27e0cdc717ee31849ca7b8e4a687d77afe2aedc40ee1582f66e53d9"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npm_pkg_depend_dep_same_name/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npm_pkg_depend_dep_same_name/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e76535499c84f8ff046a7bdd37afb1c8939c7d6afc6bde0770e5e7b89ca55f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c016ccb113cff9e9f5daf55599b29034d54d3d50a47ce8f1e4330f6442ef75ec"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_bad_registry_config/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_bad_registry_config/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f578a0a21e29bc4229b6bee6b8fd6c6f416be08d200da68479151e7a6c1cf00"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_bad_token/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_bad_token/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc17313948257a269a56aafd9e7ad57ea5ec31aaf3a644751ee26025d8f23f7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_basic_auth/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_basic_auth/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"638f1442d1b020710ac8081bb31f6e6df0bdff2ee35bfbb2cf51fef236ca6b30"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_certfile/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_certfile/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"da169f1a067c39ea1b27b4798810f8b8436f030467ba49956d607d05490acc78"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_email_auth/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_email_auth/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d837ebb0c25f8af3b784f5cabc860a6130e43035f0736b78776fa5d08e013065"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_email_no_password/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_email_no_password/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a197eff1c07ff19ddc2b04f6909119ee23626c7a386a123bc0c063336b599d37"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_homedir/subdir/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_homedir/subdir/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"097036187c072ab1d01c1086f0419f57c8f6e7af5e822a766be9b48d9c1185d1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_homedir_package_both/subdir/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_homedir_package_both/subdir/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0686d175d4bcea96ac673d846475dbc30cd759e7cdf5cddf6a27493f7fb6e3"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_jsr_scope/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_jsr_scope/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a1ce1ca67e81a80d69bf2b06fdea616e1cf94d8c61fb288cafdea5687b21f1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_min_release_age/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_min_release_age/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d461e8339593bd618121a68a459e22cb79b6ab4ea0f0c667424796758c99a492"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_missing_certfile/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_missing_certfile/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"267320011cb2bf5b455c23a56db5ee32a0d1b37c1033d938c77bde313b3c5b38"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_no_auth_install/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_no_auth_install/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"486514c3d0713c38fb685742c6783f229fcb829ddb68c92b3e693c156aa56e18"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_not_next_to_package_json/subdir/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_not_next_to_package_json/subdir/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b126c8323b0083d256ab237486d36cc0d3d9a07ee092cb89be2c46be5189aea3"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_password_no_username/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_password_no_username/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f486cf65a27329ae01759f6ed22fd0af6816e78a5c1842d4fe5fc6083e7a7a18"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_tarball_other_server/fail/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_tarball_other_server/fail/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"04432089813353c1bb85e2b5e907578b2ca86ba38edb7a795668d6fb020955c4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_tarball_other_server/fail_not_found/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_tarball_other_server/fail_not_found/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"af25cb3e55b9cbab67b7f2869078f4fcf19e0cc450c4ddd464034d139c2ff02e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_tarball_other_server/success/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_tarball_other_server/success/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"92af2f056babf86a223c97b35d6935c51178eea159490accf2954f3139ce5dce"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_username_no_password/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_username_no_password/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d3361da45651a48a0f1a34f567f1681a3b77b6d04476e90edece0e907ab4cf"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/npmrc_username_password/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/npmrc_username_password/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcef2242e7b494f197e90db0438d74cc8fbaf979e2e04fea0336f71f4d4f54b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/overrides/catalog_override/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/overrides/catalog_override/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2fa3c78abfb2015b652e7ea8591d43e0e003eec79760f88e0b3a0299ed9691"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/overrides/catalog_override_workspaces_object/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/overrides/catalog_override_workspaces_object/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3704b4a287f52eb8facc0a21ce47800b37f05d12c13279941c1b90de49c0d1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/overrides/no_override/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/overrides/no_override/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8e43c72681253b44dbc498f490fd93d6d61fac008e0aa701a21805320335f1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/overrides/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/overrides/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b200dfb80429c1f9eb2a36fc26f7e133eb0beebd5360c052b93990870d7d41"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/packument_etag/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/packument_etag/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2ee1afa4499385228a413ef1f87179830608b7dd5044f8cc6689c6ceb0299f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/pkg_index_ts_and_js/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/pkg_index_ts_and_js/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5aac0ba75c400046cb9d4881c97a709acb90af5abaed53886f9abb4f1a80f41"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/require_resolve_url_paths/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/require_resolve_url_paths/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d702f7a44775dd03961bbb4d61d8c4c9d161f9781d706df63de2fd7900610a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/run_existing_npm_package/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/run_existing_npm_package/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6066b77726eff6f2c5d40cce01e6132802cd18c4f3cc2445c3bc4e7209f8be81"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/run_existing_npm_package_with_subpath/run_existing_npm_package_with_subpath/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/run_existing_npm_package_with_subpath/run_existing_npm_package_with_subpath/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a0d887eabce49f7e3cf3d04e377167dea42e4649c93791cf34267f87a90882"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/tarball_relocate_to_registry/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/tarball_relocate_to_registry/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"686eb895a81264883b859443bea245a92f9537add29f6a278fb1da16e8bc9dd1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/user_agent_env_var/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/user_agent_env_var/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1c55b3ec539da21bec4137c92e1d5500503628efbb5a61e835e6a335480027"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_alias_version_mismatch/app/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_alias_version_mismatch/app/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdfb936dcd7183b49d9787d0be0b1d037fac0d1561b42c5ebc4b93016bfb311"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_basic/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_basic/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9cd4021dfa49322baa6080462caf9751270bcf5eed78cd15dc8e28a69e7e50"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_conflicting_dep/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_conflicting_dep/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf9c3c5185a06552f44b59bc4bc5e3849e4a27084ed176915dc8a0b2c7d2c5e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_dep_aliases/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_dep_aliases/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b183eaccdfec1c7131ab7ea748b3a9a96eca2768a6acf1254d56edb188aae6c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_dep_protocol_alias/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_dep_protocol_alias/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3619f17bd52564711b4f57edcc6b3766d03183f92d68a44377378fd81fb1bd8c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_explicit_version_mismatch/app/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_explicit_version_mismatch/app/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7c8c19178da28de22d7277621bf377a53ca6bd67be1bd7f3f6314e6a92f0ba"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_lifecycle_scripts/a/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_lifecycle_scripts/a/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe01cde2315e9b2b2bfe38e00469473cbd781ea37fb2a389e47d7c378d8db79f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_lifecycle_scripts/b/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_lifecycle_scripts/b/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3d7308e831c32807bfca13433eaceedcf8825d0bfeb8e2850aadbbd0e6ab26"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_lifecycle_scripts/c/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_lifecycle_scripts/c/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecd61263ce21a56243294eb390812c5cceade9eab9109d2e4de6a2f0bcad53b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_prerelease_member/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_prerelease_member/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e659be86c209ce2a843e9edb2f1159e1b5edceb0ab3d645edf0ba5cc97cf9d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_prerelease_member_local/app/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_prerelease_member_local/app/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf408f45ad6bb9937dcc48b76dbd6f38b6b515834047c330a6275ddfd9f32e5"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_symlink_cyclic/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_symlink_cyclic/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfd39be2ed6a688faed7676f6e7f7bc6e1ca58b3cebeb2893382d96f9d419fc"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/npm/workspace_version_wildcards/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/npm/workspace_version_wildcards/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ad3eab8ec3d39534002aaaf741996d4be97dc970cd8dabbb6727916744fb1e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/outdated/catalog/member/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/outdated/catalog/member/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"593318fd5a7f76c46eaaf11fedb4c16ce483e4e2b2769087b2866922735f8bcc"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/outdated/catalog_pkg_json/member/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/outdated/catalog_pkg_json/member/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"463c1c9921073f34ed8eaa17be17fb688323f2fe89789a569622573cdfc42772"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/outdated/latest_not_pre_release/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/outdated/latest_not_pre_release/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed56da999d49882173d3862e3bf98b480d171b07c1e36f5e6268fd4d1e28f6a2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/outdated/mixed_workspace/member-b/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/outdated/mixed_workspace/member-b/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdf4ad0f5afb1b0de01ea9ca594384ba5b1641448ade8cacfce953fa0355257"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/outdated/package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/outdated/package_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"681f6f4fc485a644ec05bd579b15857dac8901225187c745007aa26a75af2e3d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/outdated/update_lockfile_only_bumps_within_range/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/outdated/update_lockfile_only_bumps_within_range/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0463a71e45af03526070b579fbcdacaf08b69bb9ab2b6a18d0a5ef0c2674014c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/outdated/update_lockfile_only_preserves_req/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/outdated/update_lockfile_only_preserves_req/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a565d567e1850ebb943acd1c6ee20a237dfae93f5e8528e1a22cf3d32f40ead"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/outdated/update_lockfile_only_stale_cache_no_downgrade/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/outdated/update_lockfile_only_stale_cache_no_downgrade/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"73de1e2bec5f4cf2b3277ce978df46c4862c83fabac2dd697bcbaacc1889a086"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/outdated/update_lockfile_only_stale_npm_cache/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/outdated/update_lockfile_only_stale_npm_cache/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63da4d846b643e98afd28c1014a9972968cf7f677cf9e2e2e9e85adb7cd59ce"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/pm/list/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/pm/list/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18ee0b909b4c433fc75df941bb5d72178c0ac0046a8610a7931b47de0486006"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/pm/why/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/pm/why/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"159bb76d78bbf1ea8367c11cae061b664ffaccb0c83e58df4d92a84be04fff82"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/pm/why_scoped/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/pm/why_scoped/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaf7a1916c6de24e4441001504e0239f4896c414a14beb5a532aa014b798e37"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/publish/byonm_dep/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/publish/byonm_dep/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5436368cdd25035e1e3f0f318a6cd57e8c5b936f9f5cfcccc4675ba2763d76"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/publish/byonm_with_package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/publish/byonm_with_package_json/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c79ac1ecb472a8bef865ab1c1515ac7e7fd60757366c952a92e4495bb336815"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/publish/npm_file_specifier/package-a/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/publish/npm_file_specifier/package-a/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fae64d98a058b330a5c87cbaa69ff0b45f1a57b50152ae3f0e59369616574e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/publish/npm_file_specifier/package-b/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/publish/npm_file_specifier/package-b/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9750671e930cd699ade15c94754e5debd382496005bb21e1eb72e949833b2337"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/publish/npm_workspace_alias_dep/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/publish/npm_workspace_alias_dep/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0f53c9076ff023b79533208eec6351c3a158c0900b014a8060b2d59c19075f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/publish/npm_workspace_jsr_pkg_with_npm_dep/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/publish/npm_workspace_jsr_pkg_with_npm_dep/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d312e4da95935f216ac0c3abbd97c5709536d9ecd08a0fe24149f05a8a9d2b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/publish/package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/publish/package_json/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b705e8a0e59b1e97872d046766cdc4f27f0b67af0b5831ebdf9587cc49209922"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/remove/alias/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/remove/alias/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"391f683ac6a6c813ace6fca1e54cf3e967a1b434068810edb598f833a6ace7be"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/remove/package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/remove/package_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebe8dfe7940437c18515b756509dff26f896bee5c0032eb39e7dd6192074087"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/byonm_tag_specifier/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/byonm_tag_specifier/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4288569f34f076e38f8d036bd2ac5d0fc81ad6c836fd10b3e9eae265334363"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/import_common_js/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/import_common_js/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d7865182fd91532f6f4cb7ca45517aa3268ef7bedb3e42039cf2a5babe5e2b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/import_meta_byonm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/import_meta_byonm/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0869fcbe5ae8a06020958e7639e6ce15ac806fae430a6c2a56c638d77967028b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/lazy_npm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/lazy_npm/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5bf60e4bbd679abfb436bfec2b229287cad4cfcf30af4c22e5fff5174e4e10"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/no_deno_json/code/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/no_deno_json/code/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8d6315a73599373621838cd1be613acac60b87195c41404ecfed75b2fd4d48"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/npm_cjs_reexport_outside_package/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/npm_cjs_reexport_outside_package/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddd7caeca40840caa6ed08b46c967cb0d4ac53729a68d269a4cdf51ea5f6754"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/package_json/invalid_value/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/package_json/invalid_value/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7720d2ea01ae784304c68048a508a98979f7964eb43c1848150c372769c2628d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/package_json/with_deno_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/package_json/with_deno_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"156e0ed00ef8c2635c248c6c74e9d414522a099709e27a2023a7c6e6d29f9271"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/package_json_auto_discovered_for_npm_binary/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/package_json_auto_discovered_for_npm_binary/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7d6de6511adbfaa73f8f322be2de13d24b2e2f9e579c83884b870fc4d38e47"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/package_json_type/commonjs/jsx/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/package_json_type/commonjs/jsx/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5090ca50e1135c49318db609a5d3340a94c4bc96a9e3ae04ee99baca6ab26e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/peer_dep_warning_package_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/peer_dep_warning_package_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c51c4cc48536bc314a089959c35f7298deb4a101c66cc8079cba9fc16b1cfe"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/run/pnpm_workspace_auto_migrate/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/run/pnpm_workspace_auto_migrate/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b00ab6d5caee14ddbc11909821342828f5f638a37be00b152ba04119c1181a9"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/bin_package/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/bin_package/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b8a0cc9dbbd64f4f59fab30f6aaa38b3a97704980d6aa97fa590f6fed61edc"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/bin_pkg_with_scope_auto/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/bin_pkg_with_scope_auto/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c8bdc98e8de1b3e0d74ca85f8c4f83e14bcecb7255e85322abef5986a6b55e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/bin_pkg_with_scope_none/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/bin_pkg_with_scope_none/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c37d15902dbd5921ca73011013f3732b685b61c8af369e8eb66070ae122859"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/both_no_arg/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/both_no_arg/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e639354e22dd10e619cd1ae8137d84d27ab43ffaf128b1d19987e31c5a56a6f9"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/both_package_json_selected/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/both_package_json_selected/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"423c6842321412db5d4c7ea6f7346c4bd99ca7af6c6e73f7fa3f9f25c667a89b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/byonm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/byonm/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9641f6afc7bccf3774f3b3bfab384f15cdbbdffa81691e88e6976bc92d102e34"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/byonm_workspace_ancestor_bin/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/byonm_workspace_ancestor_bin/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faa775a152bae4ff9a13aba36bb014d4ce5e46378d81df9aef86ddf03004fea"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/eval/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/eval/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3d1a5717d45b161ebec9ebbf79a08c2e80f7505adfb502233008c8736e34c7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/filter/npm_workspace_order/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/filter/npm_workspace_order/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5065a5f0f582293cbfbb9e048530e62cca34939a086c1427849871097e2ea2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/lockfile_frozen/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/lockfile_frozen/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3157591f818e9240d7a6dee4fc348e6de5a128702f98a3924cadc88da1211a98"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/npx_installed_pkg_non_byonm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/npx_installed_pkg_non_byonm/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe268442ab94b6c71e97896584b99343546d1adbfe7f18cfe61fd5ae7e69dc5"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/package_json_echo/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/package_json_echo/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11605afe70fabce0b4c36f7d8b819f1187673f1febb540fabe3edc100d47849"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/package_json_no_arg/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/package_json_no_arg/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51819adcb747019056e96a311266e037584a2d6ac1c201ede7bba665fdb79f2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/package_json_node_modules_dir_none/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/package_json_node_modules_dir_none/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c73154e1b2c3146a347ae2a33215b14cb409a792a884305d59e6872da319200"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/package_json_npm_bin/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/package_json_npm_bin/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"776f739c8e81307f0051faf36c5624363fc6e11c15555fcbbf7cd79e7f5f71cf"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/task/recursive_order/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/task/recursive_order/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd485572500619378fbc0f853adfe63ea77263be80fc5aa2db5e4dec0ce011e7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/test/package_json_basic/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/test/package_json_basic/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf424620c8927264d75fb774385416893beab5cb5543bc8c24d516dfb4ebca0"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/test/package_json_basic_auto_install/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/test/package_json_basic_auto_install/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaf96bf78bdc14150f56927bdaffbb148a8b2a84d0cda146d3bd909229aa4d7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/specs/workspaces/auto_install_pkg_json_member_only/pkg_json/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/specs/workspaces/auto_install_pkg_json_member_only/pkg_json/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a5ddadbd559ba66e0385875265c8a80938c0cab227396a74ba4fbbf5fbfd7b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(count) || count \u003C 0 || count \u003E totalStarts || raw.byteLength \u003C (HEADER_WORDS \u002B count) * 8\u0060 appears character-identically in 2 files \u2014 tools/startup_order/generate_linux_function_orderfile.ts, tools/startup_order/generate_macos_function_orderfile.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"90636d490490cf61d23a0aeac03f25ec2ae9897f2de7eefa0b679389b8bf70e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(repeats) || repeats \u003C= 0\u0060 appears character-identically in 2 files \u2014 tools/startup_order/generate_linux_function_orderfile.ts, tools/startup_order/generate_macos_function_orderfile.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"35141d8af42964f2b8822f7caeab6c06c0700cedfdf8d2e2ba96264b6daf3a49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!encoding || encoding === \u0022utf8\u0022 || encoding === \u0022utf-8\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/_fs/_fs_readdir.ts, ext/node/polyfills/fs.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_readdir.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"592065c0e300c1d64dac3a8073b5b73af8e2f56d0f7863fd62a8e3e72a12f790"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isAnyArrayBuffer(buf) \u0026\u0026 !isArrayBufferView(buf)\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/crypto/_randomFill.mjs, ext/node/polyfills/internal_binding/_timingSafeEqual.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/_randomFill.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"206bcaca109d3c2cf5463a3c4df14134cb917a15e5119026571e2ba0f6cde71d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!optOrCallback || typeof optOrCallback === \u0022function\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/_fs/_fs_common.ts, ext/node/polyfills/fs.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_common.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"38730ee6ab606e60a8e753d662d74be01f05d5ac35db1c87d856e40a14ba6ebc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(env.NODE_DISABLE_COLORS !== undefined \u0026\u0026 env.NODE_DISABLE_COLORS !== \u0022\u0022) || (env.NO_COLOR !== undefined \u0026\u0026 env.NO_COLOR !== \u0022\u0022) || env.TERM\u2026\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/tty.js, ext/node/polyfills/internal/util/colorize.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/tty.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8734f64c060c2464b26e62090ee60ae01b9e57cede223c9d0aa24c66ef3cc8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(min != null \u0026\u0026 value \u003C min) || (max != null \u0026\u0026 value \u003E max) || ((min != null || max != null) \u0026\u0026 NumberIsNaN(value))\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/buffer.mjs, ext/node/polyfills/internal/validators.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8d660adfbaf233c0df69e134e5a40beecd2ae2c3a001ec3b0444fd69a6a530"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060NumberIsNaN(size) || size \u003E kMaxPossibleLength || size \u003C 0\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/crypto/_randomBytes.ts, ext/node/polyfills/internal/crypto/_randomFill.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/_randomBytes.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14f87b5a335a36249947e1198f73bd4297a2765d2cafeca12ddb93c5b9c1b61"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060StringPrototypeStartsWith(hostname, \u0022[\u0022) \u0026\u0026 StringPrototypeEndsWith(hostname, \u0022]\u0022)\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/_http_proxy.js, ext/node/polyfills/internal/blocklist.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e88ab8fa940cea9ba1b8a98727ab59b3d98825d29b74dc39063c4fd82d1d78a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060binary === undefined || output === undefined\u0060 appears character-identically in 2 files \u2014 tools/startup_order/generate_linux_function_orderfile.ts, tools/startup_order/generate_macos_function_orderfile.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfc3b8eefb7489c347b24e95e01d76993f017878059965b6504574acbec2340"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060charset.length \u003E= 2 \u0026\u0026 charset[0] === \u0027\u0022\u0027 \u0026\u0026 charset[charset.length - 1] === \u0027\u0022\u0027\u0060 appears character-identically in 2 files \u2014 ext/fetch/26_fetch.js, ext/node/polyfills/_http_client.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/26_fetch.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc861350717da37e23a539af0283c45e843713f975c3f036f10da80407e38ebc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060defaultEncoding == null || defaultEncoding === \u0022utf8\u0022 || defaultEncoding === \u0022utf-8\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/streams/readable.js, ext/node/polyfills/internal/streams/writable.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddce9715d1783d0f7ea724948aad9c23e20c22b66a8eebb4e398639b951f535"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env === undefined \u0026\u0026 (count === undefined || typeof count === \u0022object\u0022 \u0026\u0026 count !== null)\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/_process/streams.mjs, ext/node/polyfills/internal/tty.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_process/streams.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21a66ce0d943e2523a6b32204990de9fa7a4ca6c81725ee933aded5f1cb69f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ext !== undefined \u0026\u0026 ext.length \u003E 0 \u0026\u0026 ext.length \u003C= path.length\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/path/_posix.ts, ext/node/polyfills/path/_win32.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a915e3cdae5063224c57b7d6498e39e1600fa422e7e1439b0deff88301cc4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ext !== undefined \u0026\u0026 typeof ext !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/path/_posix.ts, ext/node/polyfills/path/_win32.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"52781314f308f347d3ae2326f62257d39b0ab74ae1b259a0cb65d8661d52c0db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ext.length === path.length \u0026\u0026 ext === path\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/path/_posix.ts, ext/node/polyfills/path/_win32.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1080a94f82f4a1df62a12b9dede36d9a9ca26c6a0ed0eaf99efb37e19590fd02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060formatStr === undefined \u0026\u0026 defaultFormat !== undefined\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/crypto/keygen.ts, ext/node/polyfills/internal/crypto/keys.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44f27af2ea81c0fe76ade2996c0f257e31dd292978815511ae2970ecfc5020a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060headers.length \u0026\u0026 ArrayIsArray(headers[0])\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/_http_outgoing.ts, ext/node/polyfills/internal/http2/compat.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_outgoing.ts"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"a131d1c7e301d1df388eeae3f43a7cbd1a9e3fea5658d5a357521d3baa8cc23d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C 1000 \u0026\u0026 this.#status !== \u0022TERMINATED\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/worker_threads.ts, runtime/js/11_workers.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82ec954637d843eac4cc6fdc2360f14cfc9535f242f4b2d3434261cc3bd1aae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keyType !== undefined \u0026\u0026 keyType !== \u0022ec\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/crypto/keygen.ts, ext/node/polyfills/internal/crypto/keys.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd4357e08a04e50bdc67a061fce828048a86c6dc63c7ed7c2fc1c5c356809dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keyType !== undefined \u0026\u0026 keyType !== \u0022rsa\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/crypto/keygen.ts, ext/node/polyfills/internal/crypto/keys.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d9aa19d102a4fd255d8a156ca23c3f3524bbfb4251912eda49e3ca159abae4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options !== null \u0026\u0026 typeof options === \u0022object\u0022\u0060 appears character-identically in 3 files \u2014 ext/node/polyfills/dgram.ts, ext/node/polyfills/https.ts, ext/web/01_dom_exception.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dgram.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cd597c087f0c202b1c5f4357f97a19d1200e4efcc155f0e121ed25dacaa236"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options !== undefined \u0026\u0026 (typeof options !== \u0022object\u0022 || options === null)\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/01_require.js, ext/node/polyfills/perf_hooks.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/01_require.js"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23ae1f3c3d3fe9daf49f7762ce6121ce08cb3d7d2e7a983b9b713a6df604123"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options \u0026\u0026 (options as ResolveOptions).ttl\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/dns.ts, ext/node/polyfills/internal/dns/promises.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/dns.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df1e5d5533c2a206a9a3c16207afae8a8e67745148aa83fa4bae326541c5249"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options \u0026\u0026 options.autoDestroy === false\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/streams/readable.js, ext/node/polyfills/internal/streams/writable.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff2ceb87256ab6d0731f8a265bef59d1cdd420a0e3e383a730448051ccc6cd0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options == null || typeof options !== \u0022object\u0022\u0060 appears character-identically in 3 files \u2014 ext/node/polyfills/internal/child_process.ts, ext/node/polyfills/internal/crypto/keygen.ts, ext/node/polyfills/internal/fs/promises.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/child_process.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a784ba3e83eb6ee7e54d0713a4ba3efc16e1ba3dd2164c5bd52bd1caf15b454"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options === null || typeof options !== \u0022object\u0022\u0060 appears character-identically in 3 files \u2014 ext/node/polyfills/internal/cluster/worker.ts, ext/node/polyfills/perf_hooks.js, ext/node/polyfills/testing.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/cluster/worker.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b34cf9f12a57636a95d7c66e7fe99507d1136ecdf5f9f000d8368d3712efe9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options?.throwIfNoEntry === false \u0026\u0026 ObjectPrototypeIsPrototypeOf(Deno.errors.NotFound.prototype, err)\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/_fs/_fs_lstat.ts, ext/node/polyfills/fs.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_fs/_fs_lstat.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e909acd6a9b45d9736c0a6304b278b339adeda9733bc9ea248c36b006aa2bc39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060original !== null \u0026\u0026 typeof original === \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 ext/fetch/22_body.js, ext/node/polyfills/testing.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/22_body.js"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee58bd34b4b57fd27158ef04d10126e225ad2bcd54b6879be7cb34f6d92dad6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pathObject === null || typeof pathObject !== \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/path/_posix.ts, ext/node/polyfills/path/_win32.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39b6fc31a6cb88ad7c4b0ab5fb5515ab1bbb25445d37b06496ee29c583d96a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.domain \u0026\u0026 process.domain.listenerCount(\u0022error\u0022) \u003E 0\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/crypto/_randomBytes.ts, ext/node/polyfills/internal/crypto/pbkdf2.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/_randomBytes.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ac26df6d8edf0da81865f4f121c7d89d247b997f0113e8f2eece9c7f96711c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060providerTypeNames[providerType] || \u0022UNKNOWN\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/_http_agent.js, ext/node/polyfills/net.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_agent.js"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b314055b4f86f2f8dc350f0d9cbdb39190f7b880764e15df522968bd7991d2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060startDot === -1 || end === -1 || preDotState === 0 || ( preDotState === 1 \u0026\u0026 startDot === end - 1 \u0026\u0026 startDot === startPart \u002B 1)\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/path/_posix.ts, ext/node/polyfills/path/_win32.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/path/_posix.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"947b6ea70f45a515660ee3a24d96515ef0bb0fd3ef4a4af2d8a65a63e7417236"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.length \u003C state.highWaterMark || state.length === 0\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/streams/readable.js, ext/node/polyfills/internal/streams/writable.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/streams/readable.js"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e73200aeb2efdf8fed5e24482024bfb638c2d153fb1b0910ea296bc220859"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.#status === \u0022TERMINATED\u0022 || data === null\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/worker_threads.ts, runtime/js/11_workers.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"05508f6562163adc1c7a4f55ad362827d702f92b27f81460f74665fb521dab21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this[kSawReturnAt] \u0026\u0026 key.name !== \u0022enter\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/_readline.mjs, ext/node/polyfills/internal/readline/interface.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_readline.mjs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bff5be55d42ed9422de79e1ef8cb6d7d69108317cf52924bd43ac73166bc886"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this[kSawReturnAt] === 0 || DateNow() - this[kSawReturnAt] \u003E this.crlfDelay\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/_readline.mjs, ext/node/polyfills/internal/readline/interface.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_readline.mjs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38b9e190c5aaee60c0ebca179d71fac42133bf6d095eefee477b9d12502ea14"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060transferOrOptions === undefined || transferOrOptions === null || (arguments.length \u003C= 1)\u0060 appears character-identically in 4 files \u2014 ext/node/polyfills/worker_threads.ts, ext/web/13_message_port.js, runtime/js/11_workers.js, runtime/js/99_main.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0615237285e75c4c027ca9ded4015fa639529ad0b552ee8c939e024bc32cca2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeStr === \u0022pkcs8\u0022 \u0026\u0026 isPublic !== true\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/crypto/keygen.ts, ext/node/polyfills/internal/crypto/keys.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba3db3f29d737bbc12be687a05cfb6988500e671256150f273e39d0a45876c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeStr === \u0022spki\u0022 \u0026\u0026 isPublic !== false\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/crypto/keygen.ts, ext/node/polyfills/internal/crypto/keys.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/keygen.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"730f08a2cbbb3b19520ce10705f3b06c5b395a74804f0aa8b0a28863eaac2570"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof data !== \u0022string\u0022 \u0026\u0026 !isArrayBufferView(data)\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/crypto.ts, ext/node/polyfills/zlib.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/crypto.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f66ba8483f741827518622203bb2ecf8e9679daef4fdd41e7bf5a506e84a90d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof options !== \u0022object\u0022 || options === null\u0060 appears character-identically in 3 files \u2014 cli/js/40_test_snapshot.js, ext/node/polyfills/perf_hooks.js, ext/node/polyfills/sqlite.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/js/40_test_snapshot.js"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"508e6e2775e3be8bc23cdaa662124a9abaf2efb368270fffaf4db54393623df9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof options === \u0022object\u0022 \u0026\u0026 options !== null\u0060 appears character-identically in 5 files \u2014 ext/node/polyfills/01_require.js, ext/node/polyfills/_readline.mjs, ext/node/polyfills/fs.ts, ext/node/polyfills/internal/crypto/hash.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/01_require.js"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4d181f6c195248830c4dc443077adb48d64b7eb62d700a38988aad16fc7781"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof port !== \u0022number\u0022 \u0026\u0026 typeof port !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/validators.mjs, ext/node/polyfills/net.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/validators.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78c38742b6af98acfbeb006303af13e732290757caf609b506f38bf67690c01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof val === \u0022string\u0022 || isArrayBufferView(val) || isAnyArrayBuffer(val) || Buffer.isBuffer(val)\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/crypto/cipher.ts, ext/node/polyfills/internal/crypto/keys.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/crypto/cipher.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7426d105709398cce08f877acde905dc7e7f7442ba9e3b3e4f054abb8f1ad51e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022object\u0022 \u0026\u0026 value !== null\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/internal/buffer.mjs, ext/node/polyfills/internal/child_process.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/buffer.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2038102fddce1d6607f8de8f5a7d7337cc60e066a1bb57550389c2b60df90c60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== \u0022run-first\u0022 \u0026\u0026 value !== \u0022timer-free-first\u0022\u0060 appears character-identically in 2 files \u2014 tools/startup_order/generate_linux_function_orderfile.ts, tools/startup_order/generate_macos_function_orderfile.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d18faea8595c678c89fd3c67abedf1c68351a33700f2b2eb638618020df741a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 ext/node/polyfills/_http_proxy.js, ext/node/polyfills/internal/blocklist.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/_http_proxy.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9296f05f6457e0b2661b338217ef442d132e1a4c24b045cfda4fcdd8be1c34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060view.getBigUint64(0, true) !== TRACE_MAGIC || view.getBigUint64(8, true) !== TRACE_VERSION\u0060 appears character-identically in 2 files \u2014 tools/startup_order/generate_linux_function_orderfile.ts, tools/startup_order/generate_macos_function_orderfile.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/startup_order/generate_linux_function_orderfile.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5249f91256a351729e14cdb31dffc437124d95666ce07dc9afe8be2de0c0e975"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060webidl.type(V) === \u0022Object\u0022 \u0026\u0026 V !== null\u0060 appears character-identically in 4 files \u2014 ext/fetch/20_headers.js, ext/web/00_url.js, ext/web/15_performance.js, ext/websocket/01_websocket.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/fetch/20_headers.js"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"856a3023ae87d6a038d561c4631dff0bf6a34e72b65d8942073c88283f2dd4c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060webidl.type(transferOrOptions) === \u0022Object\u0022 \u0026\u0026 transferOrOptions !== undefined \u0026\u0026 transferOrOptions[SymbolIterator] !== undefined\u0060 appears character-identically in 4 files \u2014 ext/node/polyfills/worker_threads.ts, ext/web/13_message_port.js, runtime/js/11_workers.js, runtime/js/99_main.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/worker_threads.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"87989a933fe4a85cae593a74915b64d3191db6c81e58b4caf3783e8237e99269"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wsURL.hash !== \u0022\u0022 || StringPrototypeEndsWith(wsURL.href, \u0022#\u0022)\u0060 appears character-identically in 2 files \u2014 ext/websocket/01_websocket.js, ext/websocket/02_websocketstream.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/01_websocket.js"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24ad9a93bc12da842ae917cedad32a97309b1566366bb151c45a9e9178c4ba8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wsURL.protocol !== \u0022ws:\u0022 \u0026\u0026 wsURL.protocol !== \u0022wss:\u0022\u0060 appears character-identically in 2 files \u2014 ext/websocket/01_websocket.js, ext/websocket/02_websocketstream.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/01_websocket.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7802d9aad84e1926e26337689f99334c6f62955e5fc38655b3ec07412838a0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(*buf).base.is_null() \u0026\u0026 (*buf).len \u003E 0\u0060 appears character-identically in 2 files \u2014 ext/node/ops/stream_wrap.rs, libs/core/uv_compat/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b8a4db9626607e0fed3edf946674907a2f1dc51280a8e07ab98d509cde3b2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!js_iterator_proto.is_object() \u0026\u0026 !js_iterator_proto.is_null()\u0060 appears character-identically in 2 files \u2014 ext/node_sqlite/sql_tag_store.rs, ext/node_sqlite/statement.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node_sqlite/sql_tag_store.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"b296de9354261e47d2620509aa71f260fa7f90374377e880b00653c06e198567"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(*pipe).internal_async_fd.is_none() \u0026\u0026 (*pipe).internal_stream.is_none() \u0026\u0026 (*pipe).internal_connect.is_none() \u0026\u0026 (*pipe).internal_fd.is_som\u2026\u0060 appears character-identically in 2 files \u2014 libs/core/uv_compat/pipe.rs, libs/core/uv_compat/stream.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/uv_compat/pipe.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2809f5c3457ae7663ea665a7df14e74b60271c05d66334ee79d5b2c659a9edd5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(package.has_bin || package.has_scripts || package.is_deprecated) \u0026\u0026 needs_extra_from_disk\u0060 appears character-identically in 2 files \u2014 libs/npm_installer/hoisted.rs, libs/npm_installer/local.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm_installer/hoisted.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"d105221daf42e69ba3a78894ba0e3cad024aca240186df381fbc9fe18b9cf6b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hmap.get_mut(hyper::header::ETAG) \u0026\u0026 !etag.as_bytes().starts_with(b\u0022W/\u0022)\u0060 appears character-identically in 2 files \u2014 ext/http/http_next.rs, ext/http/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf56c600285e36b583204481d28093b1d108b6097101c5debd3460ad70066c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C bytes.len() \u0026\u0026 bytes[i].is_ascii_digit()\u0060 appears character-identically in 2 files \u2014 ext/web/console/mod.rs, libs/config/util.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/mod.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9102b678f2498665153b9259b046e8d0cf91b154644842511f0a9b6e2d43fa0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060length == 0 || !length.is_multiple_of(8)\u0060 appears character-identically in 2 files \u2014 ext/crypto/subtle_generate_key.rs, ext/crypto/subtle_import_key.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/subtle_generate_key.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e85c8aa7f0f910d606ac8646dc65b1fe18302e8639a542a3d7d49c1c34ec0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.file_type().is_symlink() || !metadata.is_dir()\u0060 appears character-identically in 2 files \u2014 cli/util/temp.rs, ext/rt_helper/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/temp.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6176085b4aa89216073a2cf62ee04e533988c5b73b924dc68b0380cdd2792c06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.auto_select_family \u0026\u0026 addrs.len() \u003E 1\u0060 appears character-identically in 2 files \u2014 ext/net/ops.rs, ext/net/ops_tls.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/net/ops.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd8b31b058464b830167f115561338dccf452f05db079106293d4bf6abad481"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.ends_with(\u0022.d.ts\u0022) || path.ends_with(\u0022.d.mts\u0022) || path.ends_with(\u0022.d.cts\u0022)\u0060 appears character-identically in 2 files \u2014 cli/tools/pack/extensions.rs, cli/tools/pack/unfurl.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/extensions.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6bdd3c9c0564d885517029d20873af4914dfd63ac107484bc4d9a9a7f21b73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.dependencies.is_empty() \u0026\u0026 self.overrides.is_none()\u0060 appears character-identically in 2 files \u2014 libs/lockfile/lib.rs, libs/lockfile/printer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/lockfile/lib.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b7ef406e6f59707707e60bab38f7e85e2af3205e162459c69c7a8d4d01f39f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.dependencies.is_empty() \u0026\u0026 self.package_json.is_empty()\u0060 appears character-identically in 2 files \u2014 libs/lockfile/lib.rs, libs/lockfile/printer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/lockfile/lib.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"883fdc5842cc4fc89e8c2d37bcf755775001b1310727f303b9db7da3644c32bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060specifier.scheme() == \u0022file\u0022 \u0026\u0026 specifier .path() .to_ascii_lowercase() .contains(\u0022/node_modules/\u0022)\u0060 appears character-identically in 2 files \u2014 cli/lsp/resolver.rs, libs/resolver/npm/byonm.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/resolver.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d224bd5e067b35fea721cfa95e6c2599080a31dd9ff481804afa6dd745bf93ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060specifier.scheme() == \u0022file\u0022 \u0026\u0026 specifier.path().contains(\u0022/node_modules/\u0022)\u0060 appears character-identically in 2 files \u2014 libs/node_resolver/resolution.rs, libs/resolver/file_fetcher.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/node_resolver/resolution.rs"},"region":{"startLine":2462}}}],"partialFingerprints":{"codehealthFindingId/v1":"f711eec5035ccd5fa6c5aa48c152c0464224d47675a25b939b8fa5486490f1c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060specifier.starts_with(\u0022./\u0022) || specifier.starts_with(\u0022../\u0022) || specifier.starts_with(\u0027/\u0027)\u0060 appears character-identically in 2 files \u2014 cli/tools/pack/unfurl.rs, libs/node_resolver/resolution.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/pack/unfurl.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddedb03d3c6ac4639c041f01afdd3b095287136a97864103d860b1e5831b95e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status == v8::ModuleStatus::Evaluated || status == v8::ModuleStatus::Errored\u0060 appears character-identically in 2 files \u2014 libs/core/modules/map/dynamic.rs, libs/core/modules/map/evaluation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map/dynamic.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a6e65cb250119e22e6c6a018e72dff9cd210e418ef4c5f200e3997363e68b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060std::env::var(\u0022DENO_KV_REQUIRES_DISTRIBUTED_DATABASE\u0022).as_deref() == Ok(\u0022error\u0022) \u0026\u0026 !checker.check(\u0022kv\u0022)\u0060 appears character-identically in 2 files \u2014 cli/factory.rs, cli/rt/run.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/factory.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7954cee4bac4eced909c8610f9ca48792921d8b6d19f32e37fa2cf89df08ee20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tc_scope.has_caught() || tc_scope.has_terminated()\u0060 appears character-identically in 2 files \u2014 ext/node/ops/fs.rs, ext/node/ops/util.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/fs.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c445d6c5b17d98b54e86311f074c17e3872d757c0976387534fff625045d6910"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tc_scope.has_terminated() || tc_scope.is_execution_terminating()\u0060 appears character-identically in 3 files \u2014 libs/core/modules/map/dynamic.rs, libs/core/modules/map/evaluation.rs, libs/core/runtime/jsruntime.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/modules/map/dynamic.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"31636483bbf8e32d56929b49ed9b9dd70e0d439879e8a01cce7967d181775750"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.starts_with(\u0022../\u0022) || text.starts_with(\u0022./\u0022)\u0060 appears character-identically in 2 files \u2014 cli/util/path.rs, libs/core/error.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/util/path.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca522f46967028021a525425edaeae96f3049ecd183e3ea3e017afecb08668b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_array_buffer() || value.is_shared_array_buffer()\u0060 appears character-identically in 2 files \u2014 ext/web/console/inspect.rs, libs/core/ops_builtin_types.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/inspect.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffea8370706145933514c5d64a3377655c9caa552bc234cdf3e6bed0e6dc3117"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060version_info.has_install_script.unwrap_or(false) || version_info.scripts.contains_key(\u0022preinstall\u0022) || version_info.scripts.contains_key(\u0022in\u2026\u0060 appears character-identically in 3 files \u2014 libs/npm/registry.rs, libs/npm/resolution/graph.rs, libs/resolver/lockfile.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/npm/registry.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"870457d60ce80a1852342b9e98c639e83fd3cec60b3015066794163f47552ef7"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/1 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"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060resolution_to_hover_text\u0060 turns every \u0060Err\u0060 into \u0060\u0022_[errored]_\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/language_server.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"271cd277346c36bfdf46a688b043db23c031fd8f0b941873e832d2c3391813c3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060calculate_fs_version_at_path\u0060 turns every \u0060Err\u0060 into \u0060Some(\u00221\u0022.to_string())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/lsp/cache.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"650269ab7956daf7d47e016e3582d21d20f492a329dcf3ee3defdd2f24438692"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060windows\u0060 turns every \u0060Err\u0060 into \u0060String::from(\u0022unknown\u0022)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/bench/mitata.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd36ffac939c7618d294b452dc7b14188d946ebea2c02a8a8a0d2d73ec5ef62"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060deno_exe\u0060 turns every \u0060Err\u0060 into \u0060\u0022deno\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/framework.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac2f2b2e6cee49e73525b93c512bb6d35c88e9a728b42e1de08fa8024e56d83"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060to_relative_path_or_remote_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Canonymous\u003E\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/test/fmt.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4325338eb39bac3f6916eb2c9582e6a79883f4f8cb4dda340517a9277281a8cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060build_delta_chain\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tools/upgrade.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef190e26f1ecb577a8c0781a8bb7e34dcd58e715ef3d19184f48d37bbae9898f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060package_export_keys\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/tsc/tsconfig_gen.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f66012b3ce3b4623d3b10acbb0e928f1cc22d70a7136aee4078ef2725cdaa9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060value_to_byte_vec\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/crypto/digest.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62501f9a0e9b00640bad58c22305c0927a5918e5761ee432c1d777762a81511"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060op_http_read_request_body\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/http/http_next.rs"},"region":{"startLine":2575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4594fc6ea7ec8e8d1b7901ea607eb22569d2308544ba2bab7fa2971abf45d79"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_start_intercepted_for_stream\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/stream_wrap.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"c874d531296be7970321e7f02ad5d24cae976205a1e78c64201fc74c71b8b63e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060bind_inner\u0060 turns every \u0060Err\u0060 into \u0060Ok(-1)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9059048edcbc0ea671a2f87f50655938d9c67bfa46eab1f59f573ff77c7a16bc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060bind6\u0060 turns every \u0060Err\u0060 into \u0060Ok(-1)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"00632a8ee53305fe0c2bb0cc27c79e79562b50bdc5e212ebfd9cffc190096aa9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060connect\u0060 turns every \u0060Err\u0060 into \u0060Ok(-1)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"51717455320e124a262b22a4896560dcdfb5696a4e640124157079508a9741e9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060connect6\u0060 turns every \u0060Err\u0060 into \u0060Ok(-1)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tcp_wrap.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6e6641d928c3a014315b571c2fcd7576608609a9223e87a024669fda65dc4d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060on_headers_complete\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"498ea94535dd08a0bcaf7ec2293e4dd6845f4251498adb847d410c9a0c45841b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060on_body\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/llhttp/binding.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe8d5746770ddcb6358724c93bc279d5aa6b5f55ac4875d6a89a3f1e2aaa4f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_extra_ca_certs\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/tls.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb63cfe991d7acefd8fa20a9518a9043a6182a07240e7a36d0523660a3dc086"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060op_v8_query_objects_count\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/ops/v8.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48a600f486e06aeaa440a673ac89741f251723dd8235857d1c3873a67fb3757"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060rss\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/os/lib.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26e4e144c9484f740c69792917abf153955599ff2577de149bee8f339822253"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060path_to_file_url_href\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/console/error_fmt.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ceb46787fdf4051fd709aa3f812506c0daec937a68a9ffbe283ea6355ba87e0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060op_ws_get_error\u0060 turns every \u0060Err\u0060 into \u0060\u0022Bad resource\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/websocket/lib.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"374322c4a459077bb6493e6a93cfc8878b9ff5cb6db22413f6beb46389b15e22"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060op_str_byte_length\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/ops_builtin.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5a2eb632c96f3c466e68faa99fb338b3b26e5621d6989112246144599692b1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getConsoleWidth\u0060 swallows every exception into \u0060return 80\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal/assert/assertion_error.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca91d1a0a3dd07a2ff934ea0c5069464c97f173819f578d0126645fc797afee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getExecArgv\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/internal_binding/node_options.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b15293c784ba42ca14fa69b6f48337815dcf4676c81f422c59927ce7ecf65cb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_getPropertyNames\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/node/polyfills/repl.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc060d657ca6ae3c32631c4b82ce256fbcff82dc508e0657e88f5f0f59b8c06b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060origin\u0060 swallows every exception into \u0060return \u0022null\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ext/web/00_url.js"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c61b0bbd1461adf6916f08ba46f06d4bfdff348148e906e1639a9272ae03391"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.contains(\u0022no-lock\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.contains(\u0022no-lock\u0022)\u0060 also satisfies \u0060result.contains(\u0022lock\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1e1195d19ccd4b075f3f4864ea1d77d1045601d9af73dd40090ff6478e98af"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.contains(\u0022frozen-lockfile\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.contains(\u0022frozen-lockfile\u0022)\u0060 also satisfies \u0060result.contains(\u0022lock\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b8e533637b04561fda7bf4fdd676ced2c69e554aa26a114c772abafa3a4c9c"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.contains(\u0022no-check\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.contains(\u0022no-check\u0022)\u0060 also satisfies \u0060result.contains(\u0022check\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cli_parser/src/convert.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7c4f17a161f0dc928edce1391bb2ae09fcad180066cd84797944c4de3e9347"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1164","guid":"793ece19-b164-f952-a8b3-33dc3b591809","name":"CWE-1164","shortDescription":{"text":"CWE-1164"},"helpUri":"https://cwe.mitre.org/data/definitions/1164.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-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.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-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.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":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.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":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"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":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"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":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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":111,"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."]}]}