{"$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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"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":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"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":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"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":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"rspack::builder::target::merge_target_properties (cyclomatic 187): rspack::builder::target::merge_target_properties has cyclomatic complexity 187 (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":"crates/rspack/src/builder/target.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba45cabfa794bef2c25a906838b1969bdbb90733986616965739454e6fc7d99c"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::options::resolve::clever_merge::_merge_resolve (cyclomatic 131): rspack_core::options::resolve::clever_merge::_merge_resolve has cyclomatic complexity 131 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/options/resolve/clever_merge.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d549e2d45cad086aca760d0ffbe190a0c5bf085d07ba6cbd67827e3e44892e"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::options::resolve::clever_merge::parse_resolve (cyclomatic 122): rspack_core::options::resolve::clever_merge::parse_resolve has cyclomatic complexity 122 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/options/resolve/clever_merge.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c695df110e1f09142695800175c90ec4ef009af0d3d808c8e373d9ab1f0b83"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_hmr::generate_hot_update (cyclomatic 113): rspack_plugin_hmr::generate_hot_update has cyclomatic complexity 113 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_hmr/src/lib.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6f73c8ae88b253c23c6c41755d46063d5b50e3a5f7ab05a999372492dc1b6a"}},{"ruleId":"D1","level":"warning","message":{"text":"RspackOptionsApply.process (cyclomatic 90): RspackOptionsApply.process has cyclomatic complexity 90 (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":"packages/rspack/src/rspackOptionsApply.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"13277e7f8fb769c96d04461ad08ddc4ba45f780acfaf42c06a45d36d9fd46f11"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::scan_value (cyclomatic 87): Lexer::scan_value has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c9736cc00e702e9ff783f2b399dafbab79a5df50c15e06b4b603e441f7f162"}},{"ruleId":"D1","level":"warning","message":{"text":"LexDependencies::lex_streaming_inner (cyclomatic 82): LexDependencies::lex_streaming_inner 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba0aaa581689e9a71ee0c06592b1a25e27bf5990f77a7a6f0ad67e1e0b4ace1"}},{"ruleId":"D1","level":"warning","message":{"text":"EsmLibraryPlugin::link_imports_and_exports (cyclomatic 80): EsmLibraryPlugin::link_imports_and_exports has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"361a3efc9c66cd25b568178062d3f59f583be0bc0c57256a8bb280ab715a6de6"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcatenatedModule::code_generation (cyclomatic 77): ConcatenatedModule::code_generation has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2815c4354a717bca25fa06b165ad5f409cf1c73c148dfd7e66bd493529ddc8"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerActions::visit_mut_module_items (cyclomatic 77): ServerActions::visit_mut_module_items has cyclomatic complexity 77 (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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"661d9f805cc2241e57e0a88fed5eb9ea2315583a5ae556cf63bd134d785fd873"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_mf::manifest::process_assets (cyclomatic 71): rspack_plugin_mf::manifest::process_assets 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":"crates/rspack_plugin_mf/src/manifest/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea515593e00dc1be1618e3b8814a81862506f5b48740895eb2322acdcb69d800"}},{"ruleId":"D1","level":"warning","message":{"text":"EsmLibraryPlugin::render_chunk (cyclomatic 70): EsmLibraryPlugin::render_chunk 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":"crates/rspack_plugin_esm_library/src/render.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"317383222f257bde2fcd7366f7f416af9a4c74659b56e5e8accb2705657cfa0d"}},{"ruleId":"D1","level":"warning","message":{"text":"JsPlugin::render_rspack_bootstrap (cyclomatic 60): JsPlugin::render_rspack_bootstrap has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/plugin/runtime_context.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb43b1c8bc71366e3d8e3730af0286cef529c8a0d2dcb5494de989da563f155"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitChunksPlugin::inner_impl (cyclomatic 57): SplitChunksPlugin::inner_impl has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e940ce87014be8f5c4de34a1088aec63393789691b162ec311622a3ea2409067"}},{"ruleId":"D1","level":"warning","message":{"text":"EsmLibraryPlugin::deconflict_symbols (cyclomatic 55): EsmLibraryPlugin::deconflict_symbols has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"9069791ff620faa267c93e81a2fdb68a5db0f09dab15931f7be3701c7d71afea"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleConcatenationPlugin::optimize_chunk_modules_impl (cyclomatic 55): ModuleConcatenationPlugin::optimize_chunk_modules_impl has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8cc4edb21e76db297508a2a25fcb2bd556c1685f9f19865aefe207e61dcd08"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalModuleFactory::resolve_normal_module (cyclomatic 52): NormalModuleFactory::resolve_normal_module 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":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66159831c491928f118bc4e15505675b3087e4befcda268e0bc30b85c61a7fc"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_css_chunking::optimize_chunks (cyclomatic 52): rspack_plugin_css_chunking::optimize_chunks 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":"crates/rspack_plugin_css_chunking/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"925b9148049774985a3961237833bb4b6d0aebc557ef5ea9ca4bda0b82617716"}},{"ruleId":"D1","level":"warning","message":{"text":"JsPlugin::render_webpack_bootstrap (cyclomatic 51): JsPlugin::render_webpack_bootstrap has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21a04680a024ff84197659e3dee8fbb7813393a543309629492ac994684e7c2"}},{"ruleId":"D1","level":"warning","message":{"text":"EventProcessor::process (cyclomatic 50): EventProcessor::process 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":"crates/rspack_watcher/src/trigger.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd24a1134bad18c686b911d9babee26048a1026b17e48f22bb1f6f62b6642033"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::utils::module_rules::module_rule_matcher_async (cyclomatic 49): rspack_core::utils::module_rules::module_rule_matcher_async has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/utils/module_rules.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd74f295e60bce1381b0ab5c807c581a01349092fcc5d0df29eab5d5fa1d20c8"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_runtime::runtime_plugin::runtime_requirements_in_tree (cyclomatic 49): rspack_plugin_runtime::runtime_plugin::runtime_requirements_in_tree has cyclomatic complexity 49 (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":"crates/rspack_plugin_runtime/src/runtime_plugin.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3fe07f11ad1a3f9686e63baca4d65c2c1eb805d8041c824e5b0b2d47c8ca26"}},{"ruleId":"D1","level":"warning","message":{"text":"build.build (cyclomatic 47): build.build has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 2 of the 47 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 39, 168). 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":"crates/node_binding/scripts/build.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"17415bfedcf02e21363fbedc0c50371c0d6d39fb9f76e34b100ad8988c350818"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::side_effects_analysis::may_have_side_effects (cyclomatic 46): rspack_plugin_javascript::parser_plugin::side_effects_analysis::may_have_side_effects has cyclomatic complexity 46 (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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_analysis.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"98944e1160c9fca78389cfdacac6244cd4ecdd8231942745ab5e6619a5df476f"}},{"ruleId":"D1","level":"warning","message":{"text":"worker.loaderImpl (cyclomatic 46): worker.loaderImpl has cyclomatic complexity 46 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 18 belong to 12 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":"packages/rspack/src/loader-runner/worker.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ae17d4cd9b3434d39483a9322ef414da05c811f019c747de5a6ab644cdad60"}},{"ruleId":"D1","level":"warning","message":{"text":"InitializeEvaluating::evaluate_call_expression_member (cyclomatic 45): InitializeEvaluating::evaluate_call_expression_member 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":"crates/rspack_plugin_javascript/src/parser_plugin/initialize_evaluating.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"13edec90fabf6f5d3ac9192ca495e665c3c953893165b0977dc309b3057021c6"}},{"ruleId":"D1","level":"warning","message":{"text":"JsPlugin::render_rspack_main (cyclomatic 45): JsPlugin::render_rspack_main 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":"crates/rspack_plugin_javascript/src/plugin/runtime_context.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaabdc844fec5584a8f41bf6f7cdce1d27c3e5644a8ae037f538f8f686bc2f2"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runLoaders (cyclomatic 45): index.runLoaders has cyclomatic complexity 45 (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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c505dbe5d9de6f8f90642f36d65ede0ede987e9a01041e638575e64557aefc"}},{"ruleId":"D1","level":"warning","message":{"text":"LexDependencies::handle_ident (cyclomatic 44): LexDependencies::handle_ident has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf962a53a92414adc933d66c55dd680fa08067e068a9cbdb35958f9101b7b4ee"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitChunksPlugin::prepare_module_group_map (cyclomatic 44): SplitChunksPlugin::prepare_module_group_map has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dec867a8f22e50e463a44dd5e2d22c51a08cf300cbb0ab5e0ce7ef44731ad17"}},{"ruleId":"D1","level":"warning","message":{"text":"JsPlugin::render_webpack_main (cyclomatic 43): JsPlugin::render_webpack_main 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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedf05ab7841a437d61902e20c4ee9770b12e0a6e6f53b3272807f5f23957cb7"}},{"ruleId":"D1","level":"warning","message":{"text":"ChunkManifest::new (cyclomatic 43): ChunkManifest::new has cyclomatic complexity 43 (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":"crates/rspack_plugin_sri/src/manifest.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcbe588ccca6f7b57c49b91e2b60cbf9d33df69f384403c4ecae805dad758ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Stats::get_module (cyclomatic 41): Stats::get_module 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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9107381b6e8384abbc8b6f2834520e9f88591e9e47d94639b73f7f495fb2f27"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::compilation::create_hash::create_hash (cyclomatic 40): rspack_core::compilation::create_hash::create_hash has cyclomatic complexity 40 (threshold 15). Of this number, 37 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":"crates/rspack_core/src/compilation/create_hash/mod.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a820e452775aac6fd29dac9e0241a702af929439c148e4e482740e3648a6588a"}},{"ruleId":"D1","level":"warning","message":{"text":"EsmLibraryPlugin::link_entry_module_exports (cyclomatic 40): EsmLibraryPlugin::link_entry_module_exports 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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"c227d94c1430a7e1fa37693b92a63f8a7f5b05e0bd42a8344d323773bf68cb34"}},{"ruleId":"D1","level":"warning","message":{"text":"ExternalModule::get_source (cyclomatic 39): ExternalModule::get_source 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":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b99570e100b80881fc6c9105271ef8f7ba0924080e0fc8bcbadc4bb50cb7dd"}},{"ruleId":"D1","level":"warning","message":{"text":"EsmLibraryPlugin::link (cyclomatic 39): EsmLibraryPlugin::link 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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f9f8c0728229258900d0609383c965cb8573feb51f3f846dd08bb91ea26e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_esm_library::optimize_chunks::analyze_dyn_import_targets (cyclomatic 39): rspack_plugin_esm_library::optimize_chunks::analyze_dyn_import_targets 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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c63921aeb6b2c2bf956a446799286921075bac2551b33c1edf2c48825d198f9"}},{"ruleId":"D1","level":"warning","message":{"text":"AMDDefineDependencyParserPlugin::process_call_define (cyclomatic 39): AMDDefineDependencyParserPlugin::process_call_define 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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2ae2425b4beebe1739c32a49101da93a88a732d869c3e4c338a629cbb6ac92"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_const_operation (cyclomatic 39): rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_const_operation 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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee753e4d218e074f32ff447220750aa28dfe0270e9ea66e680fcca33fc210f93"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next_token_without_visit (cyclomatic 38): Lexer::next_token_without_visit has cyclomatic complexity 38 (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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ab82575a0df059961c7c4d3c7ca41802d281a28a07d1629d7e33a5a9c62931"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeSplitter::invalidate_chunk_group (cyclomatic 38): CodeSplitter::invalidate_chunk_group 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":"crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ac311646c5a6c412d88fe8cb152d9093008b7c92be90009a95b967779d3f40"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::utils::module_rules::module_rule_matcher_sync (cyclomatic 38): rspack_core::utils::module_rules::module_rule_matcher_sync has cyclomatic complexity 38 (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":"crates/rspack_core/src/utils/module_rules.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaa5721a0dd642096baae3dbc8d8d8d46596d8d534022ee2818e08d80f89fb8"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_loader_swc::rsc_transforms::react_server_components::collect_top_level_directives_and_imports (cyclomatic 38): rspack_loader_swc::rsc_transforms::react_server_components::collect_top_level_directives_and_imports has cyclomatic complexity 38 (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":"crates/rspack_loader_swc/src/rsc_transforms/react_server_components.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a3baaa7c69e97bd43c9082455281aeeda90ee46294e8963ebef594c374df36"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_esm_library::optimize_chunks::extract_tla_shared_modules (cyclomatic 37): rspack_plugin_esm_library::optimize_chunks::extract_tla_shared_modules 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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae293d8768661f552c81f3eb857df852baa5a702d9f58ede25bdff6fede241c4"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_swc_js_minimizer::process_assets (cyclomatic 37): rspack_plugin_swc_js_minimizer::process_assets 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":"crates/rspack_plugin_swc_js_minimizer/src/lib.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f387bed3e1c5a0176d6be1e5e2ae9a3542f9b01da45af02cd7c2e037b2ef25f2"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiCompiler.#runGraph (cyclomatic 36): MultiCompiler.#runGraph has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 7 of the 36 points are its own statements and the rest belongs to 8 function items inside it that branch (processQueueWorker, nodeDone, nodeInvalidFromParent, \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":"packages/rspack/src/MultiCompiler.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10dbeb3cfe41f2bfabae0ca2680ccb59cf620083da40dc8f1697f0733254fea"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleCodeTemplate::export_from_import (cyclomatic 35): ModuleCodeTemplate::export_from_import 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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc993112fb594a9382a27e0eb27ac0a2eb903363b691d3a7520844fa044abb0"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_esm_library::split_chunks::split (cyclomatic 35): rspack_plugin_esm_library::split_chunks::split 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":"crates/rspack_plugin_esm_library/src/split_chunks.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd6863a460e9f8683f3d548b78898bcfcf8ab02df03854ebc491c264ccd1cbb"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::magic_comment::analyze_raw_comments (cyclomatic 35): rspack_plugin_javascript::magic_comment::analyze_raw_comments 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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"9105fbc415865003ad273e76bba3cc469ce55f8de0111fdcca0b7b7580513f37"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 35): (anonymous) has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 12 of the 35 points are its own statements and the rest belongs to 27 function items inside it that branch (a function literal at line 119, a function literal at line 68, merge, \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":"packages/rspack/src/runtime/moduleFederationDefaultRuntime.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2b8c274f5cc4c46695984b0dbc0e6713ef2ec6f0239dfcda058a3194012191"}},{"ruleId":"D1","level":"warning","message":{"text":"InnerGraphParserPlugin::infer_dependency_usage (cyclomatic 34): InnerGraphParserPlugin::infer_dependency_usage 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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1dfc422543e2dadfb53a254f8d95343010944cad334f7f010b16ac98aa62d7"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::runtime_context::render_runtime_chunk_runtime_modules_sync (cyclomatic 34): rspack_plugin_javascript::runtime_context::render_runtime_chunk_runtime_modules_sync 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":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d922f2cec0305dc2e862576cf918653f47e0c5a5d970ab30b777d41359c8120"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleGroup::update_candidate (cyclomatic 34): ModuleGroup::update_candidate 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":"crates/rspack_plugin_split_chunks/src/module_group.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"797fb916779a7a2cd042480ff9031425149bf0f2a8bfe80ea2e8b23a7034d01d"}},{"ruleId":"D1","level":"warning","message":{"text":"smartGrouping.smartGrouping::runGrouping (cyclomatic 34): smartGrouping.smartGrouping::runGrouping has cyclomatic complexity 34 (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":"packages/rspack/src/util/smartGrouping.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7908fa476644d978d35a530fc4640e552cf84123b4550d1b0aedf954cc3780d4"}},{"ruleId":"D1","level":"warning","message":{"text":"CssModuleParser::handle_dependency (cyclomatic 33): CssModuleParser::handle_dependency has cyclomatic complexity 33 (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":"crates/rspack_plugin_css/src/parser_and_generator/parser.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e777b33d97fa349bc1cbd7986e4fb3aa779a823230f737df3951dd34f45efc"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitChunksPlugin::ensure_max_size_fit (cyclomatic 33): SplitChunksPlugin::ensure_max_size_fit has cyclomatic complexity 33 (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":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca117a8c7cbd32a4f86e8b30964aeea5bb0ee9d023d3282a9799f00ad8fb5525"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcatenatedModule::get_final_binding (cyclomatic 32): ConcatenatedModule::get_final_binding has cyclomatic complexity 32 (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":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"def6eeac60f1d221969de2f6256f73c8c2911e6bf55a4e3fb1a1061ebb80fb3c"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin.HtmlRspackPluginImpl (cyclomatic 32): plugin.HtmlRspackPluginImpl has cyclomatic complexity 32 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 11 belong to 3 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":"packages/rspack/src/builtin-plugin/html-plugin/plugin.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b697cbd77c19df91969742cf30c4ff9c5ac22f0eab780062a5a07bccc0657b20"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::fast_forward_selector (cyclomatic 31): Lexer::fast_forward_selector 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"7130d41656ebfd2c285e2ef1388be0317c9e4223a5583c77d4ac7d0ce236b6fd"}},{"ruleId":"D1","level":"warning","message":{"text":"FileSystemInfo::validate_snapshot (cyclomatic 31): FileSystemInfo::validate_snapshot 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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"b573d0e5b9078a3289610dff08b99fe39290d5677bd6d3c8bdae622296d98f25"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::compilation::runtime_requirements::process_chunks_runtime_requirements (cyclomatic 31): rspack_core::compilation::runtime_requirements::process_chunks_runtime_requirements has cyclomatic complexity 31 (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":"crates/rspack_core/src/compilation/runtime_requirements/mod.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40fea14e0c2462ff14edc72304ce808b9bf9fd09de477ad254f4c635b7dcdae"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::utils::find_graph_roots::find_graph_roots (cyclomatic 31): rspack_core::utils::find_graph_roots::find_graph_roots 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":"crates/rspack_core/src/utils/find_graph_roots.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cefc403120832f5e1e4a2609f2dfd90d27fa6db0a2551747845408e8d5c4220"}},{"ruleId":"D1","level":"warning","message":{"text":"EsmLibraryPlugin::get_binding (cyclomatic 31): EsmLibraryPlugin::get_binding 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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":2909}}}],"partialFingerprints":{"codehealthFindingId/v1":"498d0125ba44eb1419d0faa6497b876ded18390a7ad9ded09813b61ba96643f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportParserPlugin::import_call (cyclomatic 31): ImportParserPlugin::import_call 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":"crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67139321c9901428d1afd5f824fa259af0eafc3fdba1c7180de97e797c471bc"}},{"ruleId":"D1","level":"warning","message":{"text":"ServeCommand.apply (cyclomatic 31): ServeCommand.apply has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 58, 177). 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":"packages/rspack-cli/src/commands/serve.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"195c656a4915530a46df33bd3726023f38ed9bf975fdca4d24d02a6d91817e5d"}},{"ruleId":"D1","level":"warning","message":{"text":"LexDependencies::lex_composes (cyclomatic 30): LexDependencies::lex_composes 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d95dabd25ae45bc222237d77123bc3640b04c54f91953ad80ed8aea024b3dcb"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_watcher::ignored::glob_to_regexp (cyclomatic 30): rspack_watcher::ignored::glob_to_regexp has cyclomatic complexity 30 (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":"crates/rspack_watcher/src/ignored.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"420437cb64451ead0a52bd1fedbc599c48aa8cdd574810cab155c8aec3dfec4e"}},{"ruleId":"D1","level":"warning","message":{"text":"moduleFederationDefaultRuntime.default (cyclomatic 30): moduleFederationDefaultRuntime.default has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 7 of the 30 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 119, a function literal at line 68, merge, \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":"packages/rspack/src/runtime/moduleFederationDefaultRuntime.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7b70bf1b3c642c554f0f10bce9138ff5e75c65d443ca352535661a08998794"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeSplitter::update_with_compilation (cyclomatic 29): CodeSplitter::update_with_compilation 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":"crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fb4020ba9a8598b308d991c37d86dca8ab9b7e76869a8be299c53f1476abae"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcatenationBindingResolver::resolve_inner (cyclomatic 29): ConcatenationBindingResolver::resolve_inner 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":"crates/rspack_core/src/concatenation_backend.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96a8f78d30c87848807ebff6e6fc4d93976b90c5cf0718b5f541821d41c6fa8"}},{"ruleId":"D1","level":"warning","message":{"text":"InnerGraphParserPlugin::finalize_dependency_usage (cyclomatic 29): InnerGraphParserPlugin::finalize_dependency_usage 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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7907f68e2dd06275b38e6c77721bfba57e9972d98eecd915c9ef993312506c6a"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_add (cyclomatic 29): rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_add 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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee306b0fab7dbdac767e8e774678ff5ecd250292649b460a98d555966c4f50f6"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCache::fetch_content (cyclomatic 29): HttpCache::fetch_content 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":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e24166e73a71f432cb980016c635d14181a303f955e8b5fa544b046c586107"}},{"ruleId":"D1","level":"warning","message":{"text":"StrategyHelper::validate (cyclomatic 28): StrategyHelper::validate 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":"crates/rspack_core/src/legacy_cache/persistent/snapshot/strategy/mod.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d06320b47c76abe88a51119aeaf998c6b5845ce1065de1ba10f232445090aa"}},{"ruleId":"D1","level":"warning","message":{"text":"JavascriptParser::evaluating (cyclomatic 28): JavascriptParser::evaluating 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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11fa4601c7ffcb1146081c7601950ddf8ab9ecc6dd0fb9038458920f21546b0"}},{"ruleId":"D1","level":"warning","message":{"text":"OptimizationOptionsBuilder::build (cyclomatic 27): OptimizationOptionsBuilder::build 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":3494}}}],"partialFingerprints":{"codehealthFindingId/v1":"31561e3331c532822356592beb2c6653e10b4de855620e17f026256072d86b4c"}},{"ruleId":"D1","level":"warning","message":{"text":"Executer::compute_jump_table (cyclomatic 27): Executer::compute_jump_table 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":"crates/rspack_dojang/src/exec.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"df029cd608e13cf0f89ba84f86931b88eec1131dbae848513e338ca062f509e0"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_devtool::module_filename_helpers::template_replace (cyclomatic 27): rspack_plugin_devtool::module_filename_helpers::template_replace 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":"crates/rspack_plugin_devtool/src/module_filename_helpers.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbaa33b1e53fd641b0eb6d679cc9ea4c590a18db24cbd1c863b873a011856ee"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_get_linking_error (cyclomatic 27): rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_get_linking_error 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5a4e61b91673c0fb586299adde9c0990d62bcf4de3eee92a253862ec15f572"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_split_chunks::plugin::intersections::collect_intersections (cyclomatic 27): rspack_plugin_split_chunks::plugin::intersections::collect_intersections 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":"crates/rspack_plugin_split_chunks/src/plugin/intersections.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c939fcf94cc1785d560d96b325093dfac570ce2711e6127ea077907c06942758"}},{"ruleId":"D1","level":"warning","message":{"text":"ExternalsPlugin.#getRawExternalItem (cyclomatic 27): ExternalsPlugin.#getRawExternalItem has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 182, 114, 125, \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":"packages/rspack/src/builtin-plugin/ExternalsPlugin.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5e78988542b29a3a969c08b3332a0ea8ae5067fc0edd5a37d7524caae33c0f"}},{"ruleId":"D1","level":"warning","message":{"text":"AssetParserAndGenerator::generate (cyclomatic 26): AssetParserAndGenerator::generate 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":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7b8b294102948162420049b59d21648fb5f8f792ddf5e7c3f20d1086e0ab02"}},{"ruleId":"D1","level":"warning","message":{"text":"ESMExportImportedSpecifierDependency::add_export_fragments (cyclomatic 26): ESMExportImportedSpecifierDependency::add_export_fragments 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b05b9fcf0d3d1a835ba25d655d823a34114f0f2ac6b9baffb951f248d91c1e"}},{"ruleId":"D1","level":"warning","message":{"text":"FlagDependencyUsagePluginProxy::apply (cyclomatic 26): FlagDependencyUsagePluginProxy::apply has cyclomatic complexity 26 (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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"884e07468ecc097725d90135a47045a627cea8270fa16f07e2d7dfa89d1279d7"}},{"ruleId":"D1","level":"warning","message":{"text":"GetChunkFilenameRuntimeModule::generate (cyclomatic 26): GetChunkFilenameRuntimeModule::generate 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":"crates/rspack_plugin_runtime/src/runtime_module/get_chunk_filename.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d1d19df1b97afa3e64da91dca61eb90d9bcd3a43b00b9fd228e08ce028a0f9"}},{"ruleId":"D1","level":"warning","message":{"text":"compilation.createCompilationHooksRegisters (cyclomatic 26): compilation.createCompilationHooksRegisters has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 419, 216, 207, \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":"packages/rspack/src/taps/compilation.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1556d17923d020948d78ac3be23f453cd9de3bcf90c7c3cd9c1a3030d3a72d0a"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecuteTask::main_run (cyclomatic 25): ExecuteTask::main_run 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":"crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01a469bfdf5665fc4bb4a010a0acd78f4a7dcbacfaa190ce2b3eaeb584ada6e"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::utils::compile_boolean_matcher::items_to_regexp (cyclomatic 25): rspack_core::utils::compile_boolean_matcher::items_to_regexp 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":"crates/rspack_core/src/utils/compile_boolean_matcher.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aedb357aa1e8560d097cd8961a65415f846102e25166a8b0a93828a35ce531"}},{"ruleId":"D1","level":"warning","message":{"text":"CopyRspackPlugin::run_pattern (cyclomatic 25): CopyRspackPlugin::run_pattern 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ee2a2897ff9d02bf54333b4f808ec98940badf8c6ce3d1c4dbe1076dbf2814"}},{"ruleId":"D1","level":"warning","message":{"text":"CssLoadingRuntimeModule::generate (cyclomatic 25): CssLoadingRuntimeModule::generate 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":"crates/rspack_plugin_css/src/runtime/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"685d938c2851cd3ce8c13f228330fba416eda3420691c8e6e83873c11a7e4994"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_limit_chunk_count::plan_merges (cyclomatic 25): rspack_plugin_limit_chunk_count::plan_merges 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":"crates/rspack_plugin_limit_chunk_count/src/lib.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"154c40fd7d60faf977072194c934978efe15098793334cd5f3f494c67175014f"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_mf::sharing::shared_used_exports_optimizer_plugin::optimize_dependencies (cyclomatic 25): rspack_plugin_mf::sharing::shared_used_exports_optimizer_plugin::optimize_dependencies 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":"crates/rspack_plugin_mf/src/sharing/shared_used_exports_optimizer_plugin.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c79522dd4aa37327bc83ebf137aa161ed33f938377a39deb8bd1453187e12fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Compilation.getLogger (cyclomatic 25): Compilation.getLogger has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 901, 953, 949, \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":"packages/rspack/src/Compilation.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"37371888e1b771b70380c2e9a5e75897d785c7cb5d5dc6e6611515fb114834e4"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_binding_api::source::apply_replacements (cyclomatic 24): rspack_binding_api::source::apply_replacements 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":"crates/rspack_binding_api/src/source.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3041df94d3864c205f754fe4675e93ce01752e2b312727f73b435de947e845"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeSplitter::split (cyclomatic 24): CodeSplitter::split 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5217175b8914bca82eda40e1b5a2bebac90ce4ce32dda9596375d11efaaccd1e"}},{"ruleId":"D1","level":"warning","message":{"text":"FileSystemInfo::read_context (cyclomatic 24): FileSystemInfo::read_context 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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"3217f87cfc44aa73756f948bdf94674ae4884d947114d10881dc1d3b56818878"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_esm_library::preserve_modules::preserve_modules (cyclomatic 24): rspack_plugin_esm_library::preserve_modules::preserve_modules 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":"crates/rspack_plugin_esm_library/src/preserve_modules.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2c46a04e3732dafb1eebdf041852cf45d121dd023463f111b4bb34e9152945"}},{"ruleId":"D1","level":"warning","message":{"text":"CommonJsExportRequireDependency::get_star_reexports (cyclomatic 24): CommonJsExportRequireDependency::get_star_reexports 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":"crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_export_require_dependency.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7f465b77ef439d5a84d2779eea6ffa720753214a9b56fa3e03f60e03eafb3f"}},{"ruleId":"D1","level":"warning","message":{"text":"FlagDependencyUsagePluginProxy::process_referenced_module (cyclomatic 24): FlagDependencyUsagePluginProxy::process_referenced_module 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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c29203e8ab003d9c664b081a99374a10673095f87d23b45f525bcc1ed21931a"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::collect_pure_annotations (cyclomatic 24): rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::collect_pure_annotations 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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"823b048c5954cd24987efc1dec982f44f31d585ed2832045b90a22b1d216480a"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeWatchFileSystem.watch (cyclomatic 24): NativeWatchFileSystem.watch has cyclomatic complexity 24 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. 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":"packages/rspack/src/NativeWatchFileSystem.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f496ccb4cbef9360385f7b41916dceefd38ddd2d35cc126bba993d5781f284"}},{"ruleId":"D1","level":"warning","message":{"text":"ValueAtRuleStream::push (cyclomatic 23): ValueAtRuleStream::push 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"752a20d68587628ec7d805c621ed3ccb12502745a591842e37df95bdf6014bea"}},{"ruleId":"D1","level":"warning","message":{"text":"LexDependencies::handle_function (cyclomatic 23): LexDependencies::handle_function 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3955}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb175d3ae5bde7636ffe5d4a6b0ca13db205c310197921cf2ecf0dcef4bed56d"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::context_module::create_identifier (cyclomatic 23): rspack_core::context_module::create_identifier 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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"1674600ee4a23868d0eaef12d9d9773afea8ba2a3267c8df34bec246d9cd61f0"}},{"ruleId":"D1","level":"warning","message":{"text":"JsPlugin::get_renamed_inline_module (cyclomatic 23): JsPlugin::get_renamed_inline_module 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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74f7ec39c4cd006a299f8d669f9068a066a52a500cbd485dc40e56ba5873e71"}},{"ruleId":"D1","level":"warning","message":{"text":"JavascriptParser::walk_call_expression (cyclomatic 23): JavascriptParser::walk_call_expression 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: JavascriptParser::walk_expression (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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1afe1a8fa3b83d479b710b3e85177c7ef979f49827ed42efdb2b4a50b875bd"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::const::if_stmt::get_hoisted_declarations (cyclomatic 23): rspack_plugin_javascript::parser_plugin::const::if_stmt::get_hoisted_declarations 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":"crates/rspack_plugin_javascript/src/parser_plugin/const/if_stmt.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ffc93b443d181b3509445ab224af3e5f6e84b7e5b51eea5993d6ef18c62263"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::visitors::dependency::context_dependency_helper::create_context_dependency (cyclomatic 23): rspack_plugin_javascript::visitors::dependency::context_dependency_helper::create_context_dependency 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":"crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c4fc1a485017bfb751dbaba55537f40084566d0af248830fadbdf0e632800a"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_mf::sharing::collect_shared_entry_plugin::finish_make (cyclomatic 23): rspack_plugin_mf::sharing::collect_shared_entry_plugin::finish_make 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":"crates/rspack_plugin_mf/src/sharing/collect_shared_entry_plugin.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"397e28b4f33a5489fdc4fbb4c09681f91062d63678eead8e330de35c188e4903"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolveOptions::fmt (cyclomatic 23): ResolveOptions::fmt 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":"crates/rspack_resolver/src/options.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd4619114e6d3cfa316453357ce7f473dc4a41178ca258147a7b139d323f9fb"}},{"ruleId":"D1","level":"warning","message":{"text":"RspackCLI.buildConfig::internalBuildConfig (cyclomatic 23): RspackCLI.buildConfig::internalBuildConfig 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":"packages/rspack-cli/src/cli.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"48859bbbd17f6c894cc99936d9148eae67c0ba312b14e3f362515cecb41de341"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::scan_url (cyclomatic 22): Lexer::scan_url 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f460ba082c5baffdcc87be7466e61574d3c6ff488dd62fd7d766e1b5cb560f2"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilerOptionsBuilder::build (cyclomatic 22): CompilerOptionsBuilder::build 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e1024ae45b0fd0fb64b5811073ac2826b8d8d8148669959c56e9ea7c83267b"}},{"ruleId":"D1","level":"warning","message":{"text":"Cutout::cutout_artifact (cyclomatic 22): Cutout::cutout_artifact has cyclomatic complexity 22 (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":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"542ccc076d282712b27c4001555ad4ab4e0096a5892766c82b6a8235bcfe1738"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_ids::named_chunk_ids_plugin::assign_named_chunk_ids (cyclomatic 22): rspack_ids::named_chunk_ids_plugin::assign_named_chunk_ids 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":"crates/rspack_ids/src/named_chunk_ids_plugin.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fad76c40277896750c3428c87bb1481faf6d007ba3d74fd1763a09dc077411"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_ids::named_module_ids_plugin::assign_named_module_ids (cyclomatic 22): rspack_ids::named_module_ids_plugin::assign_named_module_ids 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":"crates/rspack_ids/src/named_module_ids_plugin.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6842f996a1410a009065251d62779c9aa000fdb74b71711ae66809aa78c73be7"}},{"ruleId":"D1","level":"warning","message":{"text":"ExternalsPlugin::handle_external (cyclomatic 22): ExternalsPlugin::handle_external has cyclomatic complexity 22 (threshold 15). Of this number, 19 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":"crates/rspack_plugin_externals/src/plugin.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be4c6873ad17a1a15140c1b2bad92a7396eab3d3be2a0bde853e0540e6e77b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ESMExportImportedSpecifierDependency::get_conflicting_star_exports_errors (cyclomatic 22): ESMExportImportedSpecifierDependency::get_conflicting_star_exports_errors 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"f411a57a96c4883e7d01a7c87b302f8d3f4de2ac9ef5a86fe48a2b3fb055bcf4"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeStuffPlugin::identifier (cyclomatic 22): NodeStuffPlugin::identifier 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":"crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4b7a186c40f6976bed19132972760facbac11f6e7689e302a5152c57b32853"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_mf::manifest::asset::collect_assets_from_chunk (cyclomatic 22): rspack_plugin_mf::manifest::asset::collect_assets_from_chunk 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":"crates/rspack_plugin_mf/src/manifest/asset.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bfaa99999b3b2af047c44b96ee4a9cb9ec632ff1ddd146d721cc8fc906d948"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_runtime::module_chunk_loading::runtime_requirements_in_tree (cyclomatic 22): rspack_plugin_runtime::module_chunk_loading::runtime_requirements_in_tree 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":"crates/rspack_plugin_runtime/src/module_chunk_loading.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf3f2ebac21f69f3b1db497deecdf444f59be0bae72c709e0e5a520e02c064f"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolverGeneric::package_target_resolve (cyclomatic 22): ResolverGeneric::package_target_resolve has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"306ead22e575f3385b6c56e08ca878cb73f3ba5467283a0052c76b2efbee27e8"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeExportsCollector::visit_program (cyclomatic 22): TypeExportsCollector::visit_program 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":"crates/swc_plugin_ts_collector/src/type_exports.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"090752d18b4b113760268760b21e32f4bb0f7fdd415bb75b0e310e6b175f61aa"}},{"ruleId":"D1","level":"warning","message":{"text":"LexDependencies::handle_string (cyclomatic 21): LexDependencies::handle_string 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3527}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f726a4ef7a71fee3d4137c6ff782c2a6d068044a60df72fc63a7f16fe9b1e1"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeSplitter::make_chunk_group (cyclomatic 21): CodeSplitter::make_chunk_group 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f80ac41764544c99c78986d5cfc1efed95b89a14e4b55d8101efba3b74a6ea"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::module::get_exports_type_impl (cyclomatic 21): rspack_core::module::get_exports_type_impl has cyclomatic complexity 21 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/module.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b000b1c1ab9dd95d3b7d2e31da162c6ed06ab570eb135dd5423582428b635df"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::resolver::resolve_for_error_hints (cyclomatic 21): rspack_core::resolver::resolve_for_error_hints 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":"crates/rspack_core/src/resolver/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa705ff83575f0437ce2816f792fc554ea0f7000557c6e05b40a4eb9166b050"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::runtime_template::runtime_globals_to_render_map (cyclomatic 21): rspack_core::runtime_template::runtime_globals_to_render_map 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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"906a6129e25d50a2e8246058eb7f560d186337e8c00edf44a430a1d01ba96e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"Eval::run (cyclomatic 21): Eval::run 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":"crates/rspack_dojang/src/context.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae84c30afea73d615125c38d6fa61f5617b85c321e91f7a662085d0302bdb9fa"}},{"ruleId":"D1","level":"warning","message":{"text":"SwcLoader::loader_impl (cyclomatic 21): SwcLoader::loader_impl 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":"crates/rspack_loader_swc/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"293f4b3c0d6d4bfa16e0ca08820d9fd734a240e9fac937b03c0fd0ef7ce3a0c4"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_ensure_chunk_conditions::optimize_chunks (cyclomatic 21): rspack_plugin_ensure_chunk_conditions::optimize_chunks 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":"crates/rspack_plugin_ensure_chunk_conditions/src/lib.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"756f4a438ccbcf0074d317cf02eebe3b8417b113a9bdab7fcd304b6098cedfbd"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlPluginAssets::create_assets (cyclomatic 21): HtmlPluginAssets::create_assets 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":"crates/rspack_plugin_html/src/asset.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b602fdef7b8d49da657a51e8534f909ca7d03d61de70d4e42d4739f170de29"}},{"ruleId":"D1","level":"warning","message":{"text":"ESMExportImportedSpecifierDependency::get_star_reexports (cyclomatic 21): ESMExportImportedSpecifierDependency::get_star_reexports 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"310d396bc4fc67df9e7b81d53ba99a8a2fb019e5a972db8f629749704d54f7ff"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleConcatenationPlugin::compute_incoming_modules (cyclomatic 21): ModuleConcatenationPlugin::compute_incoming_modules 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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de889f6f386b5065503736876bf3d05300e34b81cb31b13843ae8a3b14408c2"}},{"ruleId":"D1","level":"warning","message":{"text":"JavascriptParser::build_plugin_drive (cyclomatic 21): JavascriptParser::build_plugin_drive 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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"62afdc7af27cec7c01a50124ec8ac6662813cf522fcdc9a1719f447255ecee18"}},{"ruleId":"D1","level":"warning","message":{"text":"JavascriptParser::walk_assignment_expression (cyclomatic 21): JavascriptParser::walk_assignment_expression 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: JavascriptParser::walk_expression (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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"241e87e6b40367d84855c413d1a17ef5dae839f19435039f4492b463a29b47ad"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::runtime::render_module (cyclomatic 21): rspack_plugin_javascript::runtime::render_module 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":"crates/rspack_plugin_javascript/src/runtime.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dc056aa921c3b97708f139c59b7ddd7d5ef3d408efa054af00591dc9eaff2d"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_merge_duplicate_chunks::optimize_chunks (cyclomatic 21): rspack_plugin_merge_duplicate_chunks::optimize_chunks 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":"crates/rspack_plugin_merge_duplicate_chunks/src/lib.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c6dbb80c283d1d0d44580f6c42cb89031d1e5201fe5572b08d265142c6ecd3"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_remove_duplicate_modules::optimize_chunks (cyclomatic 21): rspack_plugin_remove_duplicate_modules::optimize_chunks 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":"crates/rspack_plugin_remove_duplicate_modules/src/lib.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ca7456af80a1866f9f13b9296933c7fc2ea76b77f029cf924ad77212f22b62"}},{"ruleId":"D1","level":"warning","message":{"text":"RscServerPlugin::create_client_entries (cyclomatic 21): RscServerPlugin::create_client_entries 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":"crates/rspack_plugin_rsc/src/server_plugin.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1b80e433d154843c11b406b3688f85b6db5b2ae043b49465947f5c48009a33"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_runtime::common_js_chunk_loading::runtime_requirements_in_tree (cyclomatic 21): rspack_plugin_runtime::common_js_chunk_loading::runtime_requirements_in_tree 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":"crates/rspack_plugin_runtime/src/common_js_chunk_loading.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7232928f2d0cfa5242f7d816f3bc7c611a6402bb29eef012615aa0cd7eb18f"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitChunksPlugin::prepare_native_cache_group_matches (cyclomatic 21): SplitChunksPlugin::prepare_native_cache_group_matches 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":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff2e7b26ef83e0a7847627d466c861f4663b9bd9c61392093748a443b48f66f"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportedEnumCollector::evaluate_bin (cyclomatic 21): ExportedEnumCollector::evaluate_bin 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":"crates/swc_plugin_ts_collector/src/enums.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1386a3081055d5bb6b91dde75a61f304b1f414221924b31039462f6aceee9751"}},{"ruleId":"D1","level":"warning","message":{"text":"LexDependencies::lex_local_function_decl (cyclomatic 20): LexDependencies::lex_local_function_decl 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: AnimationReserved::check (cyclomatic 21) 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3044}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d9c5b06e42ff638e6489f31bf0f0b1226770e48487c0b7a9c1ae07be995f89"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputOptionsBuilder::build (cyclomatic 20): OutputOptionsBuilder::build 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"301fc0cdc3f4c3f4f3fda6415dc2cf2fb1e5205f04f60e91bdd7469e9ce6b555"}},{"ruleId":"D1","level":"warning","message":{"text":"FixIssuers::clean_cycle_module (cyclomatic 20): FixIssuers::clean_cycle_module 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":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/fix_issuers.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bb42e0dcf213f264d902991fd3cfef22e0253e0a5dafc9acac8fb13a43e9f3"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextModule::get_lazy_source (cyclomatic 20): ContextModule::get_lazy_source 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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae73eb34a361221ef5c37f953f787e8e263a85235e2867ebd861d33a49074e7"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_ids::named_module_ids_plugin::module_ids (cyclomatic 20): rspack_ids::named_module_ids_plugin::module_ids 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":"crates/rspack_ids/src/named_module_ids_plugin.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"754b5e8ee54090c4c29870fde2acebeaf6d2a0c6356261c517a4c71a15a650a7"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_macros::string_enum::expand (cyclomatic 20): rspack_macros::string_enum::expand 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":"crates/rspack_macros/src/string_enum.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c4c0216d6bdf76b6484b410efff22e8ea75922434c1ef0d1c72dc2aaffdb53"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_unary_expr::eval_typeof (cyclomatic 20): rspack_plugin_javascript::utils::eval::eval_unary_expr::eval_typeof 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":"crates/rspack_plugin_javascript/src/utils/eval/eval_unary_expr.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8436c3ffaa6e9d8e05ddd1367577674f7011b346339b35a487671097abf66771"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_rslib::dyn_import_external::cutout_star_re_export_externals (cyclomatic 20): rspack_plugin_rslib::dyn_import_external::cutout_star_re_export_externals 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":"crates/rspack_plugin_rslib/src/dyn_import_external.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b72c1799ff424918259b8f8c0401781b4916ea03734f6ed0abf7efb99e940bc"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_runtime::module_chunk_format::render_chunk (cyclomatic 20): rspack_plugin_runtime::module_chunk_format::render_chunk 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":"crates/rspack_plugin_runtime/src/module_chunk_format.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a630832e6a484c8323b5d5cc6f8c7b621067bcdf24e2cecaea2ab651ef92aa"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_split_chunks::plugin::max_size::deterministic_grouping (cyclomatic 20): rspack_plugin_split_chunks::plugin::max_size::deterministic_grouping 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":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb7f18c68c83e40a2b5bb7f2471cd626f98137559fbb41cae9dd345a70b949e"}},{"ruleId":"D1","level":"warning","message":{"text":"WatcherDirectoriesAnalyzer::analyze (cyclomatic 20): WatcherDirectoriesAnalyzer::analyze 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":"crates/rspack_watcher/src/analyzer/directories.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4880bdc81a9dfcd5803fa3d921380ad48281c36d2344c4c53bc076b629b0f36"}},{"ruleId":"D1","level":"warning","message":{"text":"LexDependencies::lex_value_at_rule (cyclomatic 19): LexDependencies::lex_value_at_rule 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: AnimationReserved::check (cyclomatic 21) 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3631d11d285e6b35f13aa5bf1bfc427e9d8c2f541427d048ffcc3cee101da5"}},{"ruleId":"D1","level":"warning","message":{"text":"LexDependencies::handle_left_curly_bracket (cyclomatic 19): LexDependencies::handle_left_curly_bracket 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: AnimationReserved::check (cyclomatic 21) 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":4398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba26a14dadcb0493460e85d29b8d8a5d44cb2cf79d81c0644a592c4ddc2e66f"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockItemCandidates::observe (cyclomatic 19): BlockItemCandidates::observe 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":"crates/css-module-lexer/src/parser.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dee71113d111e606f4d84c5bedadb75ba4da80a31b562049695bc1be66202a1"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeSplitter::process_chunk_groups_for_merging (cyclomatic 19): CodeSplitter::process_chunk_groups_for_merging 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":2759}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ae0ecb32847f1b2d06e5de3bbde80e2d8085e41fec685c12a78f85bcf8942e"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_ids::named_chunk_ids_plugin::chunk_ids (cyclomatic 19): rspack_ids::named_chunk_ids_plugin::chunk_ids 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":"crates/rspack_ids/src/named_chunk_ids_plugin.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e644ff8ba4273d204c98238286b284af171c52cd649d71a5ae337ed007b922"}},{"ruleId":"D1","level":"warning","message":{"text":"AssetParserAndGenerator::source_types (cyclomatic 19): AssetParserAndGenerator::source_types 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":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a16affdba2963f5bf4ae4b42209f4d2681da22acc547a9e336ab042efb7613"}},{"ruleId":"D1","level":"warning","message":{"text":"CopyRspackPlugin::analyze_every_entry (cyclomatic 19): CopyRspackPlugin::analyze_every_entry 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0532b194de351e5e9f62392ece86e85e514fc8819aac56574b29ccf9097041dd"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_copy::process_assets (cyclomatic 19): rspack_plugin_copy::process_assets 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ab380ad90aa0f1cefc179477b45867d691811f1db9338f2d476355c977c3a7"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_css::plugin::impl_plugin_for_css_plugin::runtime_requirements_in_tree (cyclomatic 19): rspack_plugin_css::plugin::impl_plugin_for_css_plugin::runtime_requirements_in_tree 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":"crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"614d5ec2d78e7e5fc0f696a9d64815dee140545adfbe509094309374ccd65eee"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_rsdoctor::plugin::optimize_chunk_modules (cyclomatic 19): rspack_plugin_rsdoctor::plugin::optimize_chunk_modules 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":"crates/rspack_plugin_rsdoctor/src/plugin.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cb6863c1d58c6a19c1aab97456785c417bc0fe55bdce862d9970a7c7c8e310"}},{"ruleId":"D1","level":"warning","message":{"text":"PathManager::collect_time_info_entries (cyclomatic 19): PathManager::collect_time_info_entries 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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8e5502503981e441bb3f32e1ee57e748d1f000fe941361a53c85da3f870adf"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiStats.toJson (cyclomatic 19): MultiStats.toJson 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. 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":"packages/rspack/src/MultiStats.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c712351fcf47d43d53382fb1933d7ec06a7a51d9c2a89eba8879139758a67d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeSplitter::set_entry_runtime_and_depend_on (cyclomatic 18): CodeSplitter::set_entry_runtime_and_depend_on 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d07e669b8ee4930c5390446783295d50e6e90fc15c61be7a1b75720ac6833c"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleCodeTemplate::module_namespace_promise (cyclomatic 18): ModuleCodeTemplate::module_namespace_promise 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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a7187442f9c27e62c4d4d047856bb1df4dc97f959b153f42341ca874b73775"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::compilation::build_chunk_graph::code_splitter::extract_block_modules (cyclomatic 18): rspack_core::compilation::build_chunk_graph::code_splitter::extract_block_modules 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":3029}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac0d41e7c21c8cda261e942cb7522df99eb01162e06634e7423726d9ae66ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"Executer::render (cyclomatic 18): Executer::render 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":"crates/rspack_dojang/src/exec.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3819847a8d1604885d4d06e52b47d5fea73611cde8e5d977d5e869957d7d33ef"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_macros::ast_object::expand_ast_object_derive (cyclomatic 18): rspack_macros::ast_object::expand_ast_object_derive 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":"crates/rspack_macros/src/ast_object.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"635574883440d1fc27c6f411f37eca4d8aea652e7fe85f9d940aab87c8f71ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"CssPlugin::get_modules_in_order (cyclomatic 18): CssPlugin::get_modules_in_order 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":"crates/rspack_plugin_css/src/plugin/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ac21bc0c3d135067456b3fa51f2179d171cffce76132ff1bb5c1b55a51355d"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceMapDevToolPlugin::collect_tasks (cyclomatic 18): SourceMapDevToolPlugin::collect_tasks 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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"926c84ad19f10b53432c0d26b858a432883e5fc7734fe652c707f0f402b2ee8d"}},{"ruleId":"D1","level":"warning","message":{"text":"EsmLibraryPlugin::mark_modules (cyclomatic 18): EsmLibraryPlugin::mark_modules 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":"crates/rspack_plugin_esm_library/src/plugin.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb1bfff58933c050ca4076d56e253621e8178072ccfe847a9d930854ab6a821"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_esm_library::dependency::commonjs_external::cutout_commonjs_externals (cyclomatic 18): rspack_plugin_esm_library::dependency::commonjs_external::cutout_commonjs_externals 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":"crates/rspack_plugin_esm_library/src/dependency/commonjs_external.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb071ed4ac4ce7deb93c34d926de1e7984b625ee9776dc526d7fef58fb081c3"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_esm_library::optimize_chunks::assign_dyn_import_chunk_short_names (cyclomatic 18): rspack_plugin_esm_library::optimize_chunks::assign_dyn_import_chunk_short_names 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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7616555b97f2b85783733f360c380f5dd57eff95fd63e606bb509a6e600943"}},{"ruleId":"D1","level":"warning","message":{"text":"ESMImportSpecifierDependencyTemplate::render_evaluated_in_operator (cyclomatic 18): ESMImportSpecifierDependencyTemplate::render_evaluated_in_operator 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf0355675551da47e2291d6a9e42e7ab9962db3e739072a93695a50552a2115"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportParserPlugin::finish (cyclomatic 18): ImportParserPlugin::finish 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":"crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28a620ff3d5c309cfb2a2682179d383e17ea82020b819138c86bda728dff419"}},{"ruleId":"D1","level":"warning","message":{"text":"JavascriptParser::_walk_iife (cyclomatic 18): JavascriptParser::_walk_iife 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. This is NOT this file\u0027s highest cyclomatic complexity: JavascriptParser::walk_expression (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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee5381a1f4b1c01bb78119e1aaeeb27b9d53b1b7222a974e9a125dd6be8c07a"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::plugin::side_effects_flag_plugin::optimize_dependencies (cyclomatic 18): rspack_plugin_javascript::plugin::side_effects_flag_plugin::optimize_dependencies has cyclomatic complexity 18 (threshold 15). Of this number, 13 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":"crates/rspack_plugin_javascript/src/plugin/side_effects_flag_plugin.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"73072122d6107944bd596dbc84d4d913a2f07573ad409c69afcf534e075b88a1"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::runtime::render_runtime_module_sources (cyclomatic 18): rspack_plugin_javascript::runtime::render_runtime_module_sources 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":"crates/rspack_plugin_javascript/src/runtime.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"448de1a108d664302ab69d0aa337cd5755a025030bd333ffa557d1086cbea716"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::runtime_context::render_hot_update_chunk_runtime_modules (cyclomatic 18): rspack_plugin_javascript::runtime_context::render_hot_update_chunk_runtime_modules 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":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"56514be46c70062ec955c91e86ef6a3bbaaf0ccb8044b3611b255729033e4fd2"}},{"ruleId":"D1","level":"warning","message":{"text":"RscClientPlugin::traverse_modules (cyclomatic 18): RscClientPlugin::traverse_modules 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":"crates/rspack_plugin_rsc/src/client_plugin.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0b158771366f2b0f4b0d17f7f9ce767d89f730ee13fe411b133524cfbbb71e"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_rstest::import_dependency::module_namespace_promise_rstest (cyclomatic 18): rspack_plugin_rstest::import_dependency::module_namespace_promise_rstest 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":"crates/rspack_plugin_rstest/src/import_dependency.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8105480ba29472a12f727ae112f91b2caba5f19b2f96ad12577011f5b456b20f"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleChunkLoadingRuntimeModule::generate (cyclomatic 18): ModuleChunkLoadingRuntimeModule::generate 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":"crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1055c9c27d17a594cb48297a17cad5c733b17a6429b643bb9134c7c6843d2747"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolverGeneric::package_exports_resolve (cyclomatic 18): ResolverGeneric::package_exports_resolve 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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3936d19502faf03c7e45a9535ba651f9ccbda3b3db816fa8ad162adaffb97b"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_util::node_path::normalize_string (cyclomatic 18): rspack_util::node_path::normalize_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":"crates/rspack_util/src/node_path.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d847e38a25235d8e3bfb39e6cb410abd0cb1ef1211c1cbc5d378b6f2953df4"}},{"ruleId":"D1","level":"warning","message":{"text":"PathManager::scan_below (cyclomatic 18): PathManager::scan_below 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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"7335177c13a39bd3c41c6d0c21ad7cefb9d47bd664c1901621d6bf8c1aa07a38"}},{"ruleId":"D1","level":"warning","message":{"text":"loadConfig.loadExtendedConfig (cyclomatic 18): loadConfig.loadExtendedConfig 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":"packages/rspack-cli/src/utils/loadConfig.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15586e9e1378dcf2b7b6b62aed15348d4694b577f2ff4470fad3bf6a1b2de1a"}},{"ruleId":"D1","level":"warning","message":{"text":"cleverMerge.mergeSingleValue (cyclomatic 18): cleverMerge.mergeSingleValue has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a0e3e6e9539061debc23f4c153eca4f15e7fc4a99251e7b483b55ee1a8918b"}},{"ruleId":"D1","level":"warning","message":{"text":"validateConfig.validateExternalUmd (cyclomatic 18): validateConfig.validateExternalUmd has cyclomatic complexity 18 (threshold 15). 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 (checkExternalItem, checkExternalItemValue). 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":"packages/rspack/src/util/validateConfig.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1ad4d58ee027ef1e349c8c70796722b993c9f014e43afea10eb0d269ee76a2"}},{"ruleId":"D1","level":"warning","message":{"text":"LexDependencies::handle_at_keyword (cyclomatic 17): LexDependencies::handle_at_keyword 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: AnimationReserved::check (cyclomatic 21) 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"9109497c1b9031b7bb2f3f5843851ec458341d30359cbb73adb83b5ceefc8659"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::scan_string (cyclomatic 17): Lexer::scan_string 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2411c29a78832db0ca21869db695c21caca7168ef333cfaa04f45ba07bc590"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleSetLogicalConditions::try_match_sync (cyclomatic 17): RuleSetLogicalConditions::try_match_sync 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":"crates/rspack_core/src/options/module.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e3d1ae257907a6724846e3f506802ad4c04320975bdc97baab5b6c67879c10"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_javascript_compiler::compiler::stringify::build_rspack_source_map (cyclomatic 17): rspack_javascript_compiler::compiler::stringify::build_rspack_source_map 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":"crates/rspack_javascript_compiler/src/compiler/stringify.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17e59708768535359b714492fa885cb0ca6917d2f42d78c1ec06d6327ffef99"}},{"ruleId":"D1","level":"warning","message":{"text":"ESMExportImportedSpecifierDependency::get_mode_inner (cyclomatic 17): ESMExportImportedSpecifierDependency::get_mode_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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef4523d34640ad87110f17f8e4a79f11809e5be56ac2e215e1f64b3459b4621"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportInfoDependency::get_property (cyclomatic 17): ExportInfoDependency::get_property 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":"crates/rspack_plugin_javascript/src/dependency/export_info_dependency.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"01721283d02ecd3e1e47c917189e00f9a3e20d7f34ddd53c95dde102bff73a9a"}},{"ruleId":"D1","level":"warning","message":{"text":"CommonJsImportsParserPlugin::declarator (cyclomatic 17): CommonJsImportsParserPlugin::declarator 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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3360c431f0b3f40351324749bb6a0704abf4480485b00b0a031435a46f6c474"}},{"ruleId":"D1","level":"warning","message":{"text":"CommonJsImportsParserPlugin::call (cyclomatic 17): CommonJsImportsParserPlugin::call 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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"668f78017b5aecc817c38356db1c759af47552c5648569dbad4bcf68499f98e4"}},{"ruleId":"D1","level":"warning","message":{"text":"URLPlugin::new_expression (cyclomatic 17): URLPlugin::new_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":"crates/rspack_plugin_javascript/src/parser_plugin/url_plugin.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e029636d8ac220675f6d7c800407fbea5182a3db01bb65305bde1e58fb8b7b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleConcatenationPlugin::try_to_add (cyclomatic 17): ModuleConcatenationPlugin::try_to_add 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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"389e2b236f5efc1584b201658c447aed0835b836d04059b3d8ff3c11ec041093"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_apply (cyclomatic 17): rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_apply 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c136387121d42303b36437db73a382fc6d727cce036e0f15b58f01d8a08035cd"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::is_pure_expression (cyclomatic 17): rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::is_pure_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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"db315ab281e8a82c842fded40c9f8c1478b70500aa52859c0971c3c5423698b8"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_strict_equality_comparison (cyclomatic 17): rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_strict_equality_comparison 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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8235036e3ae34334db398ce93c2dc6c9d521ee1d8421068a2dc66dec1d85af"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_mf::manifest::utils::collect_entry_files (cyclomatic 17): rspack_plugin_mf::manifest::utils::collect_entry_files 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":"crates/rspack_plugin_mf/src/manifest/utils.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"60be8f8da54e59bdc1f655f3a4da4111de9f5db1297453ee3e4ee01934fe6c6d"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_mf::sharing::shared_used_exports_optimizer_plugin::dependency_referenced_exports (cyclomatic 17): rspack_plugin_mf::sharing::shared_used_exports_optimizer_plugin::dependency_referenced_exports has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_mf/src/sharing/shared_used_exports_optimizer_plugin.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0c74c4903781d60c7cfdf5faafe47710e4e0aac296334dd016b9ec508a0fc7"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_real_content_hash::inner_impl (cyclomatic 17): rspack_plugin_real_content_hash::inner_impl 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":"crates/rspack_plugin_real_content_hash/src/lib.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a341644a1f6edc92a170e8aa376d2c3152ffa44e633aa7e3d6c20008c418ec7f"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_size_limits::after_emit (cyclomatic 17): rspack_plugin_size_limits::after_emit 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":"crates/rspack_plugin_size_limits/src/lib.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac612e42a8e392868c83dee6989fada7ff9811cbf9c8615603b0e93ef158379"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.runSyncOrAsync (cyclomatic 17): utils.runSyncOrAsync has cyclomatic complexity 17 (threshold 15). Of this number, 12 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":"packages/rspack/src/loader-runner/utils.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"84866b9105b5f8b3b895b639ed61c0bb29d8430c6767134ff9d73d945c3c433b"}},{"ruleId":"D1","level":"warning","message":{"text":"IndependentSharedPlugin.createIndependentCompiler (cyclomatic 17): IndependentSharedPlugin.createIndependentCompiler has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 476, 382, 400, \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":"packages/rspack/src/sharing/IndependentSharedPlugin.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ff3800ee577270e323c6271a2241bcb6f7b93cf4d7aba21f73b0f076bbf667"}},{"ruleId":"D1","level":"warning","message":{"text":"ValueAtRuleStream::push_parsed_item (cyclomatic 16): ValueAtRuleStream::push_parsed_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: AnimationReserved::check (cyclomatic 21) 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a94c261ed2964d41258b194148439b3c5d378f138b92284d33df4525a32c2f7"}},{"ruleId":"D1","level":"warning","message":{"text":"LexDependencies::lex_local_keyframes_decl (cyclomatic 16): LexDependencies::lex_local_keyframes_decl 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: AnimationReserved::check (cyclomatic 21) 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabf657958207f547eece117879d3553aadf1fcfa46ebeb42085e9a19a9fd0d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::fast_forward (cyclomatic 16): Lexer::fast_forward 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6d0e383f22787b4986cbb1949d982065611ad8dc25c1772464ea82fe2ab052"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclarationCandidate::advance (cyclomatic 16): DeclarationCandidate::advance 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":"crates/css-module-lexer/src/parser.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"445b368d38241b97cd10467fe7fafc69bee2d1fa957e51dc69c550e6ff0483f3"}},{"ruleId":"D1","level":"warning","message":{"text":"IncrementalArtifacts::recover (cyclomatic 16): IncrementalArtifacts::recover 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":"crates/rspack_core/src/artifacts/incremental_artifacts.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ac83bb7f6a7c004d1f4dbbb017ea163e8edd0cf6d0b7385c2751c8f22451d9"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeSplitter::get_module_reuse_info (cyclomatic 16): CodeSplitter::get_module_reuse_info 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2434bf6e0182900d1a8f9391c5753df2813b9c0ba77fe0e4f4eb1edfb33ed19f"}},{"ruleId":"D1","level":"warning","message":{"text":"ExternalModule::build (cyclomatic 16): ExternalModule::build 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":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39ade48234d61781c291f88a37208ad6bce4b89206f2dd0d1b60f5711c63cbe"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::compilation::create_module_hashes::create_module_hashes_pass_impl (cyclomatic 16): rspack_core::compilation::create_module_hashes::create_module_hashes_pass_impl 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":"crates/rspack_core/src/compilation/create_module_hashes/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a5777e3879a82063e7b87313bba56a658b3d51a5d6d05b224daf0113349c3b"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::context_module_factory::visit_dirs (cyclomatic 16): rspack_core::context_module_factory::visit_dirs 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":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e615fa9db144fda59c1e8a4d04b80916e0a07b6c61900c960e8766cf6e6b6a6e"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_core::stats::utils::get_chunk_relations (cyclomatic 16): rspack_core::stats::utils::get_chunk_relations 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":"crates/rspack_core/src/stats/utils.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c6a1355ade8867e638ea24cd2b54251743e91c842815c95ce456d3bd75973a"}},{"ruleId":"D1","level":"warning","message":{"text":"Eval::new (cyclomatic 16): Eval::new 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":"crates/rspack_dojang/src/eval.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f6b582e98c59fcab69c5dce538083c6df029dfb84cb534d90986a4464d3269"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_loader_runner::scheme::get_scheme (cyclomatic 16): rspack_loader_runner::scheme::get_scheme 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":"crates/rspack_loader_runner/src/scheme.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2ec082e507c6145f42e69eaa04502dac9bd1f74df822b2ea44d04c11920260"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginCssExtract::render_content_asset (cyclomatic 16): PluginCssExtract::render_content_asset 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":"crates/rspack_plugin_extract_css/src/plugin.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bc1d2680b7e8a12326d3b6df00c68ecd9382eb62d9a856b0705c3744d8c71e"}},{"ruleId":"D1","level":"warning","message":{"text":"RequireEnsureDependenciesBlockParserPlugin::call (cyclomatic 16): RequireEnsureDependenciesBlockParserPlugin::call 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":"crates/rspack_plugin_javascript/src/parser_plugin/require_ensure_dependencies_block_parse_plugin.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb904992107caefcdb2f6331f51f070f3b3b4957c06d16c4bc4ecfa0d315873f"}},{"ruleId":"D1","level":"warning","message":{"text":"JavascriptParser::walk_member_expression (cyclomatic 16): JavascriptParser::walk_member_expression 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: JavascriptParser::walk_expression (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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b18771d342d81cf249be860430ae9d357dab467c162f79a9396446c5ab7c122"}},{"ruleId":"D1","level":"warning","message":{"text":"JavascriptParser::walk_class (cyclomatic 16): JavascriptParser::walk_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: JavascriptParser::walk_expression (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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d29c08dc730b0f177e5e33bd72d2b6ed96847781f40f967cd4372de3eb4c3d"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::dependency::branch_guard::is_dependency_export_presence_guarded (cyclomatic 16): rspack_plugin_javascript::dependency::branch_guard::is_dependency_export_presence_guarded has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (implies_export_presence, dependency_guards_export_presence). 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":"crates/rspack_plugin_javascript/src/dependency/branch_guard.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8aef0ed6e7e693ecdbd8e6068cb3a068f7aae4b9d25fdc700be78974c1b83f"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::common_js_imports_parse_plugin::evaluate_create_require_argument (cyclomatic 16): rspack_plugin_javascript::parser_plugin::common_js_imports_parse_plugin::evaluate_create_require_argument 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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f30db1a3daba55fd31014d9057e980a6742b279d47e6df4780ed1484585f04"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_javascript::plugin::flag_dependency_usage_plugin::process_referenced_module_without_nested (cyclomatic 16): rspack_plugin_javascript::plugin::flag_dependency_usage_plugin::process_referenced_module_without_nested 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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"de801626d7137dce886c5f3fcc4a784f6c2912c52a36cbee9bd094fae481f030"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_mf::manifest::asset::module_source_path (cyclomatic 16): rspack_plugin_mf::manifest::asset::module_source_path 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":"crates/rspack_plugin_mf/src/manifest/asset.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3880c767e3e8fa4f3e4e8c9fe1062999f7e80683128696ccd27a61e47ad9bf"}},{"ruleId":"D1","level":"warning","message":{"text":"ChunkModules::next (cyclomatic 16): ChunkModules::next 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":"crates/rspack_plugin_rsc/src/utils.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b3689471abdb80b6ea616769295a40bee45f8527cdab0379c1f87c318f3b27"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_rslib::isolated_dts::complete_isolated_dts_outputs (cyclomatic 16): rspack_plugin_rslib::isolated_dts::complete_isolated_dts_outputs 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":"crates/rspack_plugin_rslib/src/isolated_dts.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"187c1ef6e7a8b1873f62b95765d796f4cda8f88872575f34c3c2448d4e8053f2"}},{"ruleId":"D1","level":"warning","message":{"text":"RstestPlugin::resolve_mock_request (cyclomatic 16): RstestPlugin::resolve_mock_request has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rstest/src/plugin.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2571baec892a1b405206a3e4ead51305cd31d411cef1b58b32706f7e0fc824"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonpChunkLoadingRuntimeModule::generate (cyclomatic 16): JsonpChunkLoadingRuntimeModule::generate 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":"crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4061604334dd4c0b8d0d51dd37dfadb2994d72676cf5cc5cd6fda3c84fa83b"}},{"ruleId":"D1","level":"warning","message":{"text":"rspack_plugin_sri::asset::process_chunks (cyclomatic 16): rspack_plugin_sri::asset::process_chunks 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":"crates/rspack_plugin_sri/src/asset.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2229eb3b38e76c1ca88390fa981d544cbc7eb6fe31886cf65b7c1055129413f"}},{"ruleId":"D1","level":"warning","message":{"text":"PathManager::set_context_entry (cyclomatic 16): PathManager::set_context_entry 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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f38bc9e44a60aeca58cb80eb087151438a9ad4a5c18b94bedc4dbcacf060e6"}},{"ruleId":"D1","level":"warning","message":{"text":"PathManager::update (cyclomatic 16): PathManager::update 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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"476c5ad79e04344b9ba325ec15adf25f15e64ef670bca561f13075a0e689cdd6"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportPlugin::transform (cyclomatic 16): ImportPlugin::transform 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":"crates/swc_plugin_import/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"539eaeb91b5858d5ecb46dc23e1fda5a698d0970948a5dc7dcb240a9f0f507ad"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportPlugin::visit_mut_module (cyclomatic 16): ImportPlugin::visit_mut_module 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":"crates/swc_plugin_import/src/lib.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1658cb64cf1e0d81d3aeff2bc465e402549603e5b02ca5649d2b6731990e42"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportedEnumCollector::visit_program (cyclomatic 16): ExportedEnumCollector::visit_program 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":"crates/swc_plugin_ts_collector/src/enums.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"119f57e25a4293d1c1ceabcf7da864897d87bb68f39e148991bd400a66be46d6"}},{"ruleId":"D1","level":"warning","message":{"text":"build.runBuild (cyclomatic 16): build.runBuild has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (errorHandler, errorHandler::getStatsOptions, a function literal at line 59, \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":"packages/rspack-cli/src/commands/build.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"031d08242759a170e70c0c93bbd8b0f40e4689fe43e855fea364c353bfbe031f"}},{"ruleId":"D1","level":"warning","message":{"text":"Watching.#go (cyclomatic 16): Watching.#go has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 6 function items inside it that branch. 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":"packages/rspack/src/Watching.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1f20775b79b345c5636ca94ad568dad5b750ba0c5445d57319ef0b612af765"}},{"ruleId":"D1","level":"warning","message":{"text":"loader.pitch::handleExports (cyclomatic 16): loader.pitch::handleExports 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":"packages/rspack/src/builtin-plugin/css-extract/loader.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e45db4a3af1adf4166a837f85455b04b788fa074bd21fd00559fe44ca5419e9"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_hmr::generate_hot_update (cognitive 273): rspack_plugin_hmr::generate_hot_update has cognitive complexity 273 (threshold 15). Drivers by points: if/else 66 (179 pts), loops 35 (76 pts), boolean chains 15, match/switch 2 (3 pts) (nesting depth added 155). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_hmr/src/lib.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"260b0179de95f008a37d0ef8c03d5a436e11fdcc2ca95da9d4c42ab46be0ef59"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::options::resolve::clever_merge::_merge_resolve (cognitive 264): rspack_core::options::resolve::clever_merge::_merge_resolve has cognitive complexity 264 (threshold 15). Drivers by points: if/else 93 (178 pts), loops 42 (86 pts) (nesting depth added 129). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/options/resolve/clever_merge.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff761866eeaa1d0140451c396de8548d4521c41e17e63028a078217ed5e4d76"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::options::resolve::clever_merge::parse_resolve (cognitive 261): rspack_core::options::resolve::clever_merge::parse_resolve has cognitive complexity 261 (threshold 15). Drivers by points: if/else 81 (181 pts), loops 40 (80 pts) (nesting depth added 140). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/options/resolve/clever_merge.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc97a0b2a69e4177f06860db2928c7c0b65179f6de8af8463f321cfd01580b4b"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_mf::manifest::process_assets (cognitive 238): rspack_plugin_mf::manifest::process_assets has cognitive complexity 238 (threshold 15). Drivers by points: if/else 47 (165 pts), loops 19 (60 pts), boolean chains 7, match/switch 3 (6 pts) (nesting depth added 162). 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":"crates/rspack_plugin_mf/src/manifest/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5dc698346dd46124eb744ac4bf44b7abb260a728363e35745b187ce9b811c9"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::link_imports_and_exports (cognitive 218): EsmLibraryPlugin::link_imports_and_exports has cognitive complexity 218 (threshold 15). Drivers by points: if/else 43 (139 pts), loops 27 (59 pts), match/switch 5 (13 pts), boolean chains 7 (nesting depth added 136). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"567902d8c5ca4c3a7501d15070d105754454e007cd91c42c06268fdeed8266be"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerActions::visit_mut_module_items (cognitive 191): ServerActions::visit_mut_module_items has cognitive complexity 191 (threshold 15). Drivers by points: if/else 41 (111 pts), match/switch 9 (38 pts), loops 9 (31 pts), boolean chains 11 (nesting depth added 121). 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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c8025394b6efeca1cd62f7c40424eb470d0b6751f216cc2ecba2e34255c9cf"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack::builder::target::merge_target_properties (cognitive 186): rspack::builder::target::merge_target_properties has cognitive complexity 186 (threshold 15). Drivers by points: boolean chains 62, match/switch 31 (62 pts), if/else 31, loops 31 (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":"crates/rspack/src/builder/target.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f824aca5a6a2d9663d87340eb8cd1175f07461838b2372ea50b35e213b9a746"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcatenatedModule::code_generation (cognitive 174): ConcatenatedModule::code_generation has cognitive complexity 174 (threshold 15). Drivers by points: if/else 56 (132 pts), loops 18 (31 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 91). 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":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b078db136fea710854f4a206c452db50de8955ff4049ca0d447860d75ee0bff"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::scan_value (cognitive 164): Lexer::scan_value has cognitive complexity 164 (threshold 15). Drivers by points: if/else 47 (125 pts), boolean chains 28, match/switch 3 (6 pts), loops 2 (5 pts) (nesting depth added 84). 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bf1e74811e813066e6abc6b6f2e9f7c1341a88a1735284565f28af65ea2db3"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitChunksPlugin::inner_impl (cognitive 160): SplitChunksPlugin::inner_impl has cognitive complexity 160 (threshold 15). Drivers by points: if/else 27 (80 pts), loops 14 (53 pts), match/switch 5 (16 pts), boolean chains 11 (nesting depth added 103). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2a13b94e89d7067a9628c2f2311ae9ad2d4399ede32d05ea0fcb0f8bad732a"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::link (cognitive 158): EsmLibraryPlugin::link has cognitive complexity 158 (threshold 15). Drivers by points: if/else 27 (112 pts), match/switch 3 (28 pts), loops 7 (13 pts), boolean chains 5 (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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"8257b1b58b10609330b0fce6953098f16397b19d75b4d280d02179df06c4ec08"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::render_chunk (cognitive 136): EsmLibraryPlugin::render_chunk has cognitive complexity 136 (threshold 15). Drivers by points: if/else 50 (95 pts), loops 20 (32 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/render.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5930ffd8e2e32995f5ad544639c268f291992c829ff79eba6ec548c482970b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_css_chunking::optimize_chunks (cognitive 134): rspack_plugin_css_chunking::optimize_chunks has cognitive complexity 134 (threshold 15). Drivers by points: if/else 22 (74 pts), loops 16 (38 pts), match/switch 4 (16 pts), boolean chains 6 (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_css_chunking/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"991c9a51afb2d9ba7c1352e8439ae8edacfda6149ebfc30450b0aca3f8be5795"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::deconflict_symbols (cognitive 129): EsmLibraryPlugin::deconflict_symbols has cognitive complexity 129 (threshold 15). Drivers by points: if/else 33 (93 pts), loops 11 (19 pts), boolean chains 11, match/switch 3 (6 pts) (nesting depth added 71). 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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b48e6a38565c71e367d28e9ddec02d40f855016a232960d7dc882c4801543d"}},{"ruleId":"D2","level":"warning","message":{"text":"JsPlugin::render_rspack_bootstrap (cognitive 128): JsPlugin::render_rspack_bootstrap has cognitive complexity 128 (threshold 15). Drivers by points: if/else 44 (104 pts), boolean chains 21, loops 1 (3 pts) (nesting depth added 62). 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":"crates/rspack_plugin_javascript/src/plugin/runtime_context.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b418a4c4f1aa3e9fd66521dab947e93be02680977193fd2d04044bd095b98014"}},{"ruleId":"D2","level":"warning","message":{"text":"InnerGraphParserPlugin::infer_dependency_usage (cognitive 121): InnerGraphParserPlugin::infer_dependency_usage has cognitive complexity 121 (threshold 15). Drivers by points: if/else 20 (75 pts), match/switch 5 (24 pts), loops 7 (21 pts), boolean chains 1 (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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"633d2a24d6dee7db582628fd6d240205053b20d9919ca80d49485f72de010597"}},{"ruleId":"D2","level":"warning","message":{"text":"JsPlugin::render_webpack_bootstrap (cognitive 116): JsPlugin::render_webpack_bootstrap has cognitive complexity 116 (threshold 15). Drivers by points: if/else 40 (98 pts), boolean chains 15, loops 1 (3 pts) (nesting depth added 60). 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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"474c32db2072cbf6f41fbf95acaead17c3312801bd96c3746a4097df4c811fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalModule::get_source (cognitive 115): ExternalModule::get_source has cognitive complexity 115 (threshold 15). Drivers by points: if/else 31 (83 pts), loops 3 (20 pts), boolean chains 7, match/switch 2 (5 pts) (nesting depth added 72). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8324c8062a68702b6cfc09e094e2d283699540b10d43ee30fa4191d644fc254d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runLoaders (cognitive 106): index.runLoaders has cognitive complexity 106 (threshold 15). Drivers by points: if/else 33 (57 pts), boolean chains 26, ternaries 9 (11 pts), loops 5 (9 pts), match/switch 2, error handling 1 (nesting depth added 30). Of this number, 60 points are the body\u0027s own statements and 46 belong to 28 function items inside it that branch. 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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe093bbbe7961f2f4212ef892955cadd8a77b4240bfad632c1241e614f24808f"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::utils::find_graph_roots::find_graph_roots (cognitive 103): rspack_core::utils::find_graph_roots::find_graph_roots has cognitive complexity 103 (threshold 15). Drivers by points: if/else 19 (66 pts), loops 10 (32 pts), match/switch 1 (5 pts) (nesting depth added 73). 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":"crates/rspack_core/src/utils/find_graph_roots.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b915a49fefb4d7105d96cc633896eadb3aad8e1f2d1d1cad18f9baaa6496dba"}},{"ruleId":"D2","level":"warning","message":{"text":"RspackOptionsApply.process (cognitive 103): RspackOptionsApply.process has cognitive complexity 103 (threshold 15). Drivers by points: if/else 49 (57 pts), ternaries 6 (20 pts), boolean chains 12, loops 4 (8 pts), match/switch 3 (6 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":"packages/rspack/src/rspackOptionsApply.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"42061c8e2280c322c528b52ee196be56b0757b655f3d637b39629c6ab4cd67d7"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_esm_library::optimize_chunks::extract_tla_shared_modules (cognitive 99): rspack_plugin_esm_library::optimize_chunks::extract_tla_shared_modules has cognitive complexity 99 (threshold 15). Drivers by points: if/else 19 (62 pts), loops 16 (36 pts), boolean chains 1 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"288cd14745c23416fbd60e5af545aea1757bf87dd1a1656b2e43ae8d64bc5d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitChunksPlugin::prepare_module_group_map (cognitive 95): SplitChunksPlugin::prepare_module_group_map has cognitive complexity 95 (threshold 15). Drivers by points: if/else 31 (69 pts), match/switch 3 (10 pts), loops 5 (9 pts), boolean chains 7 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ea44d9b5e192497b8358dc7568b0903cc5e44cb4fc7479b871d7cd76abea91"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalModuleFactory::resolve_normal_module (cognitive 94): NormalModuleFactory::resolve_normal_module has cognitive complexity 94 (threshold 15). Drivers by points: if/else 40 (61 pts), boolean chains 14, match/switch 5 (13 pts), loops 6 (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":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"47edc795fac87aed0a15181958f6686401e3f6dfb5d1dbaa193cd8fd0f1c6ec3"}},{"ruleId":"D2","level":"warning","message":{"text":"FlagDependencyUsagePluginProxy::process_referenced_module (cognitive 94): FlagDependencyUsagePluginProxy::process_referenced_module has cognitive complexity 94 (threshold 15). Drivers by points: if/else 24 (86 pts), loops 2 (6 pts), boolean chains 2 (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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"025245b6793278a19940e7cb643028eb9e815058619fbe53497b008defe6a1ec"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::link_entry_module_exports (cognitive 91): EsmLibraryPlugin::link_entry_module_exports has cognitive complexity 91 (threshold 15). Drivers by points: if/else 19 (59 pts), boolean chains 17, match/switch 4 (12 pts), loops 2 (3 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb8eae8eb54416a2de5752f7049ea3a138f024ef93a39889734376d3144ea9c"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::lex_streaming_inner (cognitive 90): LexDependencies::lex_streaming_inner has cognitive complexity 90 (threshold 15). Drivers by points: if/else 27 (62 pts), boolean chains 23, match/switch 2 (4 pts), loops 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"2340ed3db58c0cb07348aa95b0b471751863b20a9abdd9fbbe9dfe811942525e"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::magic_comment::analyze_raw_comments (cognitive 89): rspack_plugin_javascript::magic_comment::analyze_raw_comments has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (78 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1a9e101cb2fa4bd3e9644c581cb942594e31d1600f04f997682a64bcfdd0ac"}},{"ruleId":"D2","level":"warning","message":{"text":"EventProcessor::process (cognitive 85): EventProcessor::process has cognitive complexity 85 (threshold 15). Drivers by points: if/else 21 (54 pts), boolean chains 22, loops 4 (8 pts), 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":"crates/rspack_watcher/src/trigger.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3c987b79a90ff2faee5aed572499c852097129fbb3d3db4754c8ff65d8902d"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::handle_ident (cognitive 84): LexDependencies::handle_ident has cognitive complexity 84 (threshold 15). Drivers by points: if/else 27 (70 pts), boolean chains 13, match/switch 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5122aad3ffaa97f773e0092a10cb28964e60fd9076f2646e665bc5257cb88f52"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_esm_library::optimize_chunks::analyze_dyn_import_targets (cognitive 84): rspack_plugin_esm_library::optimize_chunks::analyze_dyn_import_targets has cognitive complexity 84 (threshold 15). Drivers by points: if/else 22 (59 pts), loops 10 (18 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"659a2ea5d2cea0b9607aa1beff798642c569bed7f9d4f59ec04f90461be4152b"}},{"ruleId":"D2","level":"warning","message":{"text":"JsPlugin::render_rspack_main (cognitive 84): JsPlugin::render_rspack_main has cognitive complexity 84 (threshold 15). Drivers by points: if/else 45 (72 pts), boolean chains 10, loops 1 (2 pts) (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":"crates/rspack_plugin_javascript/src/plugin/runtime_context.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"66060d1f02b79c0c396d022ae69a0bd9fb20aac0bfe3f803d6caab6e62097c51"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 83): (anonymous) has cognitive complexity 83 (threshold 15). Drivers by points: if/else 15 (45 pts), ternaries 5 (16 pts), loops 6 (13 pts), other 5, boolean chains 4 (nesting depth added 48). Most of this is not in the body itself: 14 of the 83 points are its own statements and the rest belongs to 27 function items inside it that branch (a function literal at line 119, a function literal at line 68, merge, \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":"packages/rspack/src/runtime/moduleFederationDefaultRuntime.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a0bd6042bfeb3407a48a8359c5b3b8b1e19efa2ebf5806be12768b920e62b3"}},{"ruleId":"D2","level":"warning","message":{"text":"JsPlugin::render_webpack_main (cognitive 82): JsPlugin::render_webpack_main has cognitive complexity 82 (threshold 15). Drivers by points: if/else 44 (71 pts), boolean chains 9, loops 1 (2 pts) (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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbb3583bad29b26384efa5d2b3d873fa58959a5a0e51c2baff6a7d3f2e6ba8d"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleConcatenationPlugin::optimize_chunk_modules_impl (cognitive 82): ModuleConcatenationPlugin::optimize_chunk_modules_impl has cognitive complexity 82 (threshold 15). Drivers by points: if/else 30 (44 pts), loops 17 (24 pts), boolean chains 9, match/switch 2 (5 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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"c206cb66ffdcf91ff58372f9efe4e35d630fb5cc59f90d36f98eb292563160c7"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleCodeTemplate::export_from_import (cognitive 81): ModuleCodeTemplate::export_from_import has cognitive complexity 81 (threshold 15). Drivers by points: if/else 30 (63 pts), match/switch 5 (13 pts), boolean chains 5 (nesting depth added 41). 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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b47a27b038b363e9d6d630fea58a590b3d841f16c2fcb9e241c5f02be065b90"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_limit_chunk_count::plan_merges (cognitive 81): rspack_plugin_limit_chunk_count::plan_merges has cognitive complexity 81 (threshold 15). Drivers by points: if/else 14 (53 pts), loops 9 (27 pts), boolean chains 1 (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":"crates/rspack_plugin_limit_chunk_count/src/lib.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcd9222d6519e6e9c10e3f979b9e449947fb881a3e8ff183ebb0b37bf3d2785"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkManifest::new (cognitive 81): ChunkManifest::new has cognitive complexity 81 (threshold 15). Drivers by points: loops 27 (43 pts), if/else 14 (34 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 38). 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":"crates/rspack_plugin_sri/src/manifest.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98503056333e26032a75fa6cb562dbedef8e678f6b1840fe1bd14a65b576c84"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::utils::module_rules::module_rule_matcher_async (cognitive 80): rspack_core::utils::module_rules::module_rule_matcher_async has cognitive complexity 80 (threshold 15). Drivers by points: if/else 31 (51 pts), loops 5 (14 pts), boolean chains 13, match/switch 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/utils/module_rules.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4ad39301040686dbdc1a30cc2d64866604482c50c5f83236baa33439205c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleGroup::update_candidate (cognitive 79): ModuleGroup::update_candidate has cognitive complexity 79 (threshold 15). Drivers by points: if/else 32 (68 pts), loops 3 (6 pts), boolean chains 4, match/switch 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":"crates/rspack_plugin_split_chunks/src/module_group.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"1528d87e92a4aaf3a6450492017fc311f43b05e95da051d3028a09ba7477d723"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_swc_js_minimizer::process_assets (cognitive 79): rspack_plugin_swc_js_minimizer::process_assets has cognitive complexity 79 (threshold 15). Drivers by points: if/else 32 (62 pts), match/switch 5 (11 pts), boolean chains 4, loops 1 (2 pts) (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":"crates/rspack_plugin_swc_js_minimizer/src/lib.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a7a50424594185760f14066632f66e7b6d9a89ef974ef10698e6ee8ba993af"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::invalidate_chunk_group (cognitive 77): CodeSplitter::invalidate_chunk_group has cognitive complexity 77 (threshold 15). Drivers by points: if/else 24 (57 pts), loops 9 (16 pts), boolean chains 4 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"625a4f06bfc749037c5910f3077e4d1551f85c766bf2989ee276d4d2ab372aa5"}},{"ruleId":"D2","level":"warning","message":{"text":"Stats::get_module (cognitive 76): Stats::get_module has cognitive complexity 76 (threshold 15). Drivers by points: if/else 42 (58 pts), boolean chains 8, match/switch 3 (8 pts), loops 1 (2 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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a5c5cd0a613dd8f287a251a9b11e23e731c9654fe778bd16f38768b058fc91"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitChunksPlugin::ensure_max_size_fit (cognitive 76): SplitChunksPlugin::ensure_max_size_fit has cognitive complexity 76 (threshold 15). Drivers by points: if/else 27 (61 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 38). 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":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae37d64db0a3949d2a4c8311c420baa2f7a944d8fac9edc5bb9fe886ba759a5e"}},{"ruleId":"D2","level":"warning","message":{"text":"smartGrouping.smartGrouping::runGrouping (cognitive 76): smartGrouping.smartGrouping::runGrouping has cognitive complexity 76 (threshold 15). Drivers by points: if/else 15 (48 pts), loops 8 (13 pts), boolean chains 10, ternaries 2 (5 pts) (nesting depth added 41). 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":"packages/rspack/src/util/smartGrouping.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"181ab69738ed96381c09e26b8b264fcfebbbf8f37048c4ebcdea9abb416d1072"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_loader_swc::rsc_transforms::react_server_components::collect_top_level_directives_and_imports (cognitive 75): rspack_loader_swc::rsc_transforms::react_server_components::collect_top_level_directives_and_imports has cognitive complexity 75 (threshold 15). Drivers by points: match/switch 11 (34 pts), if/else 10 (33 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 49). 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":"crates/rspack_loader_swc/src/rsc_transforms/react_server_components.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c484f9e8e62283e06fd0dd8194e958bdbd1470288502c667b94a68bbc06fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_ensure_chunk_conditions::optimize_chunks (cognitive 74): rspack_plugin_ensure_chunk_conditions::optimize_chunks has cognitive complexity 74 (threshold 15). Drivers by points: if/else 12 (52 pts), loops 10 (22 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":"crates/rspack_plugin_ensure_chunk_conditions/src/lib.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"871362040820a08859e72c8ceefcf66c43df7c85f5881f3c8f77612b8c054d32"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_mf::sharing::shared_used_exports_optimizer_plugin::optimize_dependencies (cognitive 72): rspack_plugin_mf::sharing::shared_used_exports_optimizer_plugin::optimize_dependencies has cognitive complexity 72 (threshold 15). Drivers by points: if/else 17 (51 pts), loops 4 (15 pts), match/switch 2 (4 pts), boolean chains 2 (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":"crates/rspack_plugin_mf/src/sharing/shared_used_exports_optimizer_plugin.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8a09323590c349995d279cce1968ec8cc40e0d638dab07eacddd3c83a78bf5"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::lex_composes (cognitive 71): LexDependencies::lex_composes has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (64 pts), boolean chains 4, loops 2 (3 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3202}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d27fbf9c8a198cb2373abe33ec3a5479db00daf1e983d55d109ebbc54e5c17"}},{"ruleId":"D2","level":"warning","message":{"text":"AMDDefineDependencyParserPlugin::process_call_define (cognitive 69): AMDDefineDependencyParserPlugin::process_call_define has cognitive complexity 69 (threshold 15). Drivers by points: if/else 37 (62 pts), loops 2 (4 pts), match/switch 2, 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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b51ba4202a9210368704f2f98699b408e7fef0b423152319b0596e773d4060b"}},{"ruleId":"D2","level":"warning","message":{"text":"InitializeEvaluating::evaluate_call_expression_member (cognitive 69): InitializeEvaluating::evaluate_call_expression_member has cognitive complexity 69 (threshold 15). Drivers by points: if/else 27 (45 pts), boolean chains 14, match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/initialize_evaluating.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2607916dbba2e410028309496c6380b0b763ab4b3bda84e70846b7557270d63a"}},{"ruleId":"D2","level":"warning","message":{"text":"InnerGraphParserPlugin::finalize_dependency_usage (cognitive 69): InnerGraphParserPlugin::finalize_dependency_usage has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (51 pts), loops 7 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"8916a4f99cc2035096d71e74b2891907da1024b369f29ad752ffad7af278f489"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_esm_library::split_chunks::split (cognitive 68): rspack_plugin_esm_library::split_chunks::split has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 8 (15 pts), match/switch 6 (13 pts) (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":"crates/rspack_plugin_esm_library/src/split_chunks.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f6d3990ee1411be7a838d6f0e141a859d0fde9c40411ad5f253f59dbf45459"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_mf::manifest::utils::collect_entry_files (cognitive 67): rspack_plugin_mf::manifest::utils::collect_entry_files has cognitive complexity 67 (threshold 15). Drivers by points: if/else 8 (38 pts), loops 7 (28 pts), boolean chains 1 (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_mf/src/manifest/utils.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"525b0a7c0216b2c831f3db78822049cbb56bbd22b5a1712ef6ba24faee188a9e"}},{"ruleId":"D2","level":"warning","message":{"text":"build.build (cognitive 67): build.build has cognitive complexity 67 (threshold 15). Drivers by points: if/else 31 (46 pts), ternaries 5 (12 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 23). Most of this is not in the body itself: 1 of the 67 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 39, 168). 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":"crates/node_binding/scripts/build.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d055dc3c94ac8c4a5b43dba79cf39bd08f53d4b4f2fabb3b598eab68e31f9d3e"}},{"ruleId":"D2","level":"warning","message":{"text":"moduleFederationDefaultRuntime.default (cognitive 67): moduleFederationDefaultRuntime.default has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (45 pts), loops 6 (13 pts), ternaries 1 (5 pts), boolean chains 4 (nesting depth added 41). Most of this is not in the body itself: 9 of the 67 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 119, merge, a function literal at line 226, \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":"packages/rspack/src/runtime/moduleFederationDefaultRuntime.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6c30b21ae427ea49b859111358afd77f1448132c2e92ae05c9c7e316e61670"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetParserAndGenerator::generate (cognitive 66): AssetParserAndGenerator::generate has cognitive complexity 66 (threshold 15). Drivers by points: if/else 28 (55 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 32). 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":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"64448060f9061c6595916c4e731b9d87d679165bff2844f52776bcc8457c07ab"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::compilation::create_hash::create_hash (cognitive 65): rspack_core::compilation::create_hash::create_hash has cognitive complexity 65 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 14 (22 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 25). Of this number, 61 points are the body\u0027s own statements and 4 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":"crates/rspack_core/src/compilation/create_hash/mod.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"360cb6f5762089b919175b8ee461afe3a16b87742dc9c3349b5d3ae9211c810e"}},{"ruleId":"D2","level":"warning","message":{"text":"FixIssuers::clean_cycle_module (cognitive 64): FixIssuers::clean_cycle_module has cognitive complexity 64 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 8 (21 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/fix_issuers.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"45797840936a04039df7b35e137b8e92b052eea43e527fa6dd797f34e6ecea82"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::compilation::runtime_requirements::process_chunks_runtime_requirements (cognitive 64): rspack_core::compilation::runtime_requirements::process_chunks_runtime_requirements has cognitive complexity 64 (threshold 15). Drivers by points: loops 17 (32 pts), if/else 14 (30 pts), boolean chains 2 (nesting depth added 31). 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":"crates/rspack_core/src/compilation/runtime_requirements/mod.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"75469a6ec9973615818209bd29e3bd16a83ce275b2adf75d17f699f8c76c794c"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleConcatenationPlugin::compute_incoming_modules (cognitive 62): ModuleConcatenationPlugin::compute_incoming_modules has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (50 pts), loops 5 (12 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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"0296015eee4206cc6ba889a967b96dc9fc15ccfa1608bb822e0ecba9a3307d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystemInfo::validate_snapshot (cognitive 61): FileSystemInfo::validate_snapshot has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 9 (18 pts), match/switch 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"61704ad89a0003e10ae2f2f93208d94ec672e3798c61eaec10a61d68885d6476"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_get_linking_error (cognitive 59): rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_get_linking_error has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (48 pts), boolean chains 7, loops 1 (3 pts), match/switch 1 (nesting depth added 29). 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bc33be391022ed6767253b62b71631899c374a958f8c884ffced845e6772a5"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalsPlugin.#getRawExternalItem (cognitive 59): ExternalsPlugin.#getRawExternalItem has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (44 pts), ternaries 3 (10 pts), boolean chains 5 (nesting depth added 30). Most of this is not in the body itself: 10 of the 59 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 182, 114, 125, \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":"packages/rspack/src/builtin-plugin/ExternalsPlugin.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1274f2bb84ae63605a49353f8d1abf361dc23724e8d9bc3bef532be5ee150223"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_merge_duplicate_chunks::optimize_chunks (cognitive 58): rspack_plugin_merge_duplicate_chunks::optimize_chunks has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (45 pts), loops 4 (10 pts), boolean chains 3 (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":"crates/rspack_plugin_merge_duplicate_chunks/src/lib.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8af587618ed8b54893831741236799efe548056f74bd296bc74273925a5e00"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::module::get_exports_type_impl (cognitive 57): rspack_core::module::get_exports_type_impl has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (45 pts), match/switch 4 (12 pts) (nesting depth added 35). Of this number, 54 points are the body\u0027s own statements and 3 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":"crates/rspack_core/src/module.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"908c31be5af0ca493836a51a28dec8f328823a2cc769dac9aa9671ca96278ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitChunksPlugin::prepare_native_cache_group_matches (cognitive 57): SplitChunksPlugin::prepare_native_cache_group_matches has cognitive complexity 57 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 8 (20 pts), match/switch 1 (5 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":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0690bf2c962b58fc48bb3432f549b15bd8c085f1205e8b4d67b60980c32706d"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::update_with_compilation (cognitive 56): CodeSplitter::update_with_compilation has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (31 pts), loops 12 (22 pts), match/switch 1 (2 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":"crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3999a92bca91c7a8c5c8d09c61db23324a49124b903b3782a0381b73b3bc9d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_binding_api::source::apply_replacements (cognitive 55): rspack_binding_api::source::apply_replacements has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 7 (15 pts), boolean chains 2, match/switch 1 (2 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":"crates/rspack_binding_api/src/source.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f44a9021a675a3e712f55b2c8d330be4c7f935dbc137846fbcf970ffcd0ca64"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_split_chunks::plugin::max_size::deterministic_grouping (cognitive 55): rspack_plugin_split_chunks::plugin::max_size::deterministic_grouping has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 6 (20 pts), boolean chains 4 (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":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce273e04f27d1ba41c94ae82755cb45c80461bfb2a06df9be6a00f87735f3afe"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::scan_url (cognitive 54): Lexer::scan_url has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (48 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bf415cf287f2810212bed69bda0238a93046299ca60bd68137a4a314f82245"}},{"ruleId":"D2","level":"warning","message":{"text":"Eval::run (cognitive 54): Eval::run has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 8 (27 pts), if/else 6 (18 pts), loops 3 (9 pts) (nesting depth added 37). 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":"crates/rspack_dojang/src/context.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ff0aeac160d7fb0f3d2194b69183f394a4c620d113c6a310063ac2bc3a787e"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonJsExportRequireDependency::get_star_reexports (cognitive 54): CommonJsExportRequireDependency::get_star_reexports has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 2 (4 pts), boolean chains 2 (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":"crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_export_require_dependency.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2a0a9b007299e055ee58d2a95bc9f58ce070697b536a187094b3e46cc85251"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_esm_library::preserve_modules::preserve_modules (cognitive 53): rspack_plugin_esm_library::preserve_modules::preserve_modules has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (46 pts), match/switch 2 (4 pts), boolean chains 2, 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":"crates/rspack_plugin_esm_library/src/preserve_modules.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97accbb120c308677f9d5e40c9d7261b18c3bd1710afbdece40df7a0d86113a"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_mf::sharing::collect_shared_entry_plugin::finish_make (cognitive 53): rspack_plugin_mf::sharing::collect_shared_entry_plugin::finish_make has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 6 (12 pts), match/switch 2 (6 pts), boolean chains 2 (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":"crates/rspack_plugin_mf/src/sharing/collect_shared_entry_plugin.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddd7ffd5536d5c73341caa89deb8e963d747c74806153128e926c509d38dd6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportPlugin::visit_mut_module (cognitive 53): ImportPlugin::visit_mut_module has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (35 pts), match/switch 2 (11 pts), loops 4 (7 pts) (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":"crates/swc_plugin_import/src/lib.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2938f52f006bd443c3d6d8fc0ad3fc607293ea9842c9d7732ced97e57babe8"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::utils::module_rules::module_rule_matcher_sync (cognitive 52): rspack_core::utils::module_rules::module_rule_matcher_sync has cognitive complexity 52 (threshold 15). Drivers by points: if/else 26 (30 pts), loops 5 (14 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 17). 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":"crates/rspack_core/src/utils/module_rules.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"948564b9f35dbb8d1b7e907c97476d1366f4ce745f5aaad16381ad2347dcf75b"}},{"ruleId":"D2","level":"warning","message":{"text":"FlagDependencyUsagePluginProxy::apply (cognitive 52): FlagDependencyUsagePluginProxy::apply has cognitive complexity 52 (threshold 15). Drivers by points: loops 18 (35 pts), if/else 9 (16 pts), boolean chains 1 (nesting depth added 24). 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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4dfde733d781b5d6ee57552bf8b4467673126f7ef6d5e7131284a3241ecaa2"}},{"ruleId":"D2","level":"warning","message":{"text":"cleverMerge.parseObject (cognitive 52): cleverMerge.parseObject has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 4 (17 pts) (nesting depth added 36). Of this number, 51 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5605fef2e7a59962f7ab5610329df9cae1b7a1a56564ce47111d4d88b37eaf48"}},{"ruleId":"D2","level":"warning","message":{"text":"worker.loaderImpl (cognitive 52): worker.loaderImpl has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (34 pts), boolean chains 11, loops 2 (4 pts), ternaries 2, match/switch 1 (nesting depth added 24). Of this number, 44 points are the body\u0027s own statements and 8 belong to 12 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":"packages/rspack/src/loader-runner/worker.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5418f9e3076dc45f2b2e493e4db3a58f695bad4f27dc2eb1f31a328c6eb7c506"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::resolver::resolve_for_error_hints (cognitive 51): rspack_core::resolver::resolve_for_error_hints has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (42 pts), loops 1 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 27). 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":"crates/rspack_core/src/resolver/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc4453b8ff5cf033309cf2fc788308cdcd74ca0760f7073c8118e1f16cedd1d"}},{"ruleId":"D2","level":"warning","message":{"text":"ESMExportImportedSpecifierDependency::get_conflicting_star_exports_errors (cognitive 51): ESMExportImportedSpecifierDependency::get_conflicting_star_exports_errors has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (47 pts), boolean chains 2, loops 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8b0228ca0583eb661a06f5749e06488df92c89ff0484fdbccf13b90b925f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::runtime_context::render_runtime_chunk_runtime_modules_sync (cognitive 51): rspack_plugin_javascript::runtime_context::render_runtime_chunk_runtime_modules_sync has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (34 pts), loops 6 (11 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":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b375a44e0bf0328e7b7cd7b43cf33823081203854bed243e9b5d9672e4c63c"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::visitors::dependency::context_dependency_helper::create_context_dependency (cognitive 51): rspack_plugin_javascript::visitors::dependency::context_dependency_helper::create_context_dependency has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (36 pts), match/switch 3 (8 pts), loops 2 (5 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":"crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9b434269805f04d9766063383df8277bd618101ab871c81a865de737bedb54"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkModules::next (cognitive 51): ChunkModules::next has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (42 pts), match/switch 2 (8 pts), loops 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":"crates/rspack_plugin_rsc/src/utils.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b0862f8c13b7d3391d45575cda26368ad6118a827f37295b7466ce23acec23"}},{"ruleId":"D2","level":"warning","message":{"text":"GetChunkFilenameRuntimeModule::generate (cognitive 51): GetChunkFilenameRuntimeModule::generate has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 7 (23 pts), loops 1 (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":"crates/rspack_plugin_runtime/src/runtime_module/get_chunk_filename.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ed1c35c84c232397801f7249481f76f5bf5c4ec524d79a82325788488c0944"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeExportsCollector::visit_program (cognitive 51): TypeExportsCollector::visit_program has cognitive complexity 51 (threshold 15). Drivers by points: if/else 8 (27 pts), match/switch 5 (18 pts), loops 2 (6 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":"crates/swc_plugin_ts_collector/src/type_exports.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1d903cbc5ac6d80f65cad52e0337d8667316342e97f73292c6230a3c444490"}},{"ruleId":"D2","level":"warning","message":{"text":"CopyRspackPlugin::run_pattern (cognitive 50): CopyRspackPlugin::run_pattern has cognitive complexity 50 (threshold 15). Drivers by points: if/else 27 (43 pts), match/switch 3 (6 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"358c37bed3587f298df75cc4cd44553180554d260072633909cf90200590d9da"}},{"ruleId":"D2","level":"warning","message":{"text":"Compilation.getLogger (cognitive 50): Compilation.getLogger has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (48 pts), boolean chains 1, ternaries 1 (nesting depth added 27). Most of this is not in the body itself: 1 of the 50 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 901, 953, 949, \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":"packages/rspack/src/Compilation.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"75482def80cab48c19c001b23359af5d191eb5f614eaee33b7d39e93ef1ef064"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::compilation::create_module_hashes::create_module_hashes_pass_impl (cognitive 49): rspack_core::compilation::create_module_hashes::create_module_hashes_pass_impl has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (36 pts), loops 3 (9 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 32). 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":"crates/rspack_core/src/compilation/create_module_hashes/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b69a21147c140fffd8cec46f78d182d791a7973670fb0559717dfd01f81a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::stats::utils::get_chunk_relations (cognitive 49): rspack_core::stats::utils::get_chunk_relations has cognitive complexity 49 (threshold 15). Drivers by points: if/else 6 (26 pts), loops 6 (20 pts), boolean chains 3 (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":"crates/rspack_core/src/stats/utils.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f062b09695b18cb0502086b10922f1b2e66a6a8bfd1af77b33d388bd192f8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_add (cognitive 49): rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_add has cognitive complexity 49 (threshold 15). Drivers by points: if/else 30 (45 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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c822819aeda3a64a9b308134d099e0ee2eb39e630674b59f99656cc1c9b4f08e"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_remove_duplicate_modules::optimize_chunks (cognitive 49): rspack_plugin_remove_duplicate_modules::optimize_chunks has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 5 (12 pts), boolean chains 4 (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":"crates/rspack_plugin_remove_duplicate_modules/src/lib.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8089c0a6456c9cd83f1041a5ce512e8166c8d49b77317933077cb2fcba437d"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::fast_forward_selector (cognitive 48): Lexer::fast_forward_selector has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 4 (9 pts), boolean chains 5, 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e52e25f00515ace05455e5eb3cba717272b3af57888c23569b63b121f27343"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_mf::manifest::asset::collect_assets_from_chunk (cognitive 48): rspack_plugin_mf::manifest::asset::collect_assets_from_chunk has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 8 (18 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":"crates/rspack_plugin_mf/src/manifest/asset.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"167b9a72dbf0de47ac3fd45b37e4b623ce0f2032e733c302f5c75a4e4354b1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_util::node_path::normalize_string (cognitive 48): rspack_util::node_path::normalize_string has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (44 pts), boolean chains 3, loops 1 (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":"crates/rspack_util/src/node_path.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc07b8c7ef2d17cd2061f0aa5636c824682c4b2eb9cae798b436128bf2e8b19c"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcatenationBindingResolver::resolve_inner (cognitive 47): ConcatenationBindingResolver::resolve_inner has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (34 pts), match/switch 6 (11 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":"crates/rspack_core/src/concatenation_backend.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"428aba0d6b2a5789ad9feb04ab6117b297491fe63dacffffbd807e4e30714555"}},{"ruleId":"D2","level":"warning","message":{"text":"StrategyHelper::validate (cognitive 47): StrategyHelper::validate has cognitive complexity 47 (threshold 15). Drivers by points: if/else 27 (46 pts), match/switch 1 (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":"crates/rspack_core/src/legacy_cache/persistent/snapshot/strategy/mod.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcea0aadb6680205a15510a230fbb0e222e46dd681202d05aa0d25a655b1122d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_devtool::module_filename_helpers::template_replace (cognitive 47): rspack_plugin_devtool::module_filename_helpers::template_replace has cognitive complexity 47 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 5, match/switch 1 (2 pts), 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":"crates/rspack_plugin_devtool/src/module_filename_helpers.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"764ed9314401ecd4caec69d2b5c44da2fd77b9fe0b27f4946b6f51e36fc77ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportParserPlugin::import_call (cognitive 47): ImportParserPlugin::import_call has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (37 pts), boolean chains 10 (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":"crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3c95795e54e61b0808a3d081b51ac1c3243f58db65b62bd709d8934219ac71"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_runtime::module_chunk_format::render_chunk (cognitive 47): rspack_plugin_runtime::module_chunk_format::render_chunk has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 2 (5 pts), boolean chains 4 (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":"crates/rspack_plugin_runtime/src/module_chunk_format.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3e586fe56148e256067cd5a5b76be9f31a85ee7e9a677423dde7de6ba9a0ae"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_split_chunks::plugin::intersections::collect_intersections (cognitive 47): rspack_plugin_split_chunks::plugin::intersections::collect_intersections has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (31 pts), loops 8 (13 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":"crates/rspack_plugin_split_chunks/src/plugin/intersections.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d62bdef93a2177b104a60185914de64f72d939b998f794b016b6cdda78a7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportInfoData::get_used (cognitive 46): ExportInfoData::get_used has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 3 (11 pts), match/switch 1 (4 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":"crates/rspack_core/src/exports/export_info_getter.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cedb4f1b01cc885f0b57905e5245eee6305ed64e600d0b1d4e3215241ab523"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiCompiler.#runGraph (cognitive 46): MultiCompiler.#runGraph has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (29 pts), loops 9 (12 pts), boolean chains 5 (nesting depth added 12). Most of this is not in the body itself: 9 of the 46 points are its own statements and the rest belongs to 8 function items inside it that branch (processQueueWorker, nodeDone, nodeInvalidFromParent, \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":"packages/rspack/src/MultiCompiler.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60f81153ef6cc7131aa933b1017de9af0d966b2a9e6907f7570db31b9ec73f3"}},{"ruleId":"D2","level":"warning","message":{"text":"CssLoadingRuntimeModule::generate (cognitive 45): CssLoadingRuntimeModule::generate has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 11, 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":"crates/rspack_plugin_css/src/runtime/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a5a87d674395b42c486654e03f1786931207af8475b9603b6a8d50b5355776"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::plugin::flag_dependency_usage_plugin::process_referenced_module_without_nested (cognitive 45): rspack_plugin_javascript::plugin::flag_dependency_usage_plugin::process_referenced_module_without_nested has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 27). 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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ef5b006c8f1fedd4e1cbddeefbf9ed7cfcb04bab653209f0f33d0340b30d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::split (cognitive 44): CodeSplitter::split has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 6 (10 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ed05933c46e972bdacbf5e336a454c68ec7b2d7e8e9ca2fb9901943a7b0918"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::make_chunk_group (cognitive 44): CodeSplitter::make_chunk_group has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (40 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"80416bb51af6b2fec57a3d7d1cf1d69522958875d9ca3ad6ff222057bb0ae5a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ESMExportImportedSpecifierDependency::add_export_fragments (cognitive 44): ESMExportImportedSpecifierDependency::add_export_fragments has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74bc69ae502d2e2c31e587d51ee73fef84a44d5cd35b8d5c6728f371ad3c50d"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin.HtmlRspackPluginImpl (cognitive 44): plugin.HtmlRspackPluginImpl has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (24 pts), loops 5 (12 pts), ternaries 5 (7 pts), boolean chains 1 (nesting depth added 15). Of this number, 37 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/builtin-plugin/html-plugin/plugin.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9359684bf44e43e3c20ff2734b6b247c61ad7852774f65a9fa8d5d66830220de"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::process_chunk_groups_for_merging (cognitive 43): CodeSplitter::process_chunk_groups_for_merging has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 6 (11 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":2759}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecdeee84fbdad9e0085002cbf37e061dee4dc0015af85abad544e088baff1dc"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_ids::named_chunk_ids_plugin::assign_named_chunk_ids (cognitive 43): rspack_ids::named_chunk_ids_plugin::assign_named_chunk_ids has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 7 (14 pts), boolean chains 4 (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":"crates/rspack_ids/src/named_chunk_ids_plugin.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0da8aea19bb50e3abb8e71dd3e3fe53a388f3c9e4400f611bc3a7ee18bd77f7"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_macros::string_enum::expand (cognitive 43): rspack_macros::string_enum::expand has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 3 (4 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":"crates/rspack_macros/src/string_enum.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c1c693ff5a7631360e10250eeb8db6743c7b114806666402aeebe359dc9708"}},{"ruleId":"D2","level":"warning","message":{"text":"CssPlugin::get_modules_in_order (cognitive 43): CssPlugin::get_modules_in_order has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 4 (8 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":"crates/rspack_plugin_css/src/plugin/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd449dda53bd300bed80d93db1e943e4a53fb37c25aa4ee1323763e818913e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"ESMExportImportedSpecifierDependency::get_star_reexports (cognitive 43): ESMExportImportedSpecifierDependency::get_star_reexports has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (35 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b019c17fc801bc6718ec6cbf471fd31064e212f6f9c1d6bd9f76a468094ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_const_operation (cognitive 43): rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_const_operation has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 6 (14 pts), boolean chains 5 (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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e38db651bae16c6cdbb86ef623e0417785bcf555d3c4a97ebbd1c3ec1fb1b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"RscClientPlugin::traverse_modules (cognitive 43): RscClientPlugin::traverse_modules has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 5 (11 pts), match/switch 3 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rsc/src/client_plugin.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d66747f4722d96b38790224b4cbb5e64633123965e8cb642baa9a46a4caf36"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rslib::dyn_import_external::cutout_dyn_import_externals (cognitive 43): rspack_plugin_rslib::dyn_import_external::cutout_dyn_import_externals has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (36 pts), loops 4 (7 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":"crates/rspack_plugin_rslib/src/dyn_import_external.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"265642c00de2da71864926910dba725c35578005557d1ee4cb00fd379d76a303"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecuteTask::main_run (cognitive 42): ExecuteTask::main_run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 6 (9 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":"crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cec4a5fe0ec863e38c0f68eaf1c358620b6f72dd570c97db7078568ce79477"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::collect_pure_annotations (cognitive 42): rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::collect_pure_annotations has cognitive complexity 42 (threshold 15). Drivers by points: if/else 5 (20 pts), match/switch 5 (15 pts), boolean chains 6, 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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba35d287d8facb5ecee95b51ffdbadadee5e36db72015e7dc4be6cc39db4a684"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::scan_string (cognitive 41): Lexer::scan_string has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 2 (3 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"100729c6fff738702165bbc182e7488d7c8148f569ee89ce8eecb3e53b2889d4"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_split_chunks::plugin::intersections::discover_intersections (cognitive 41): rspack_plugin_split_chunks::plugin::intersections::discover_intersections has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 2 (4 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":"crates/rspack_plugin_split_chunks/src/plugin/intersections.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c5339ea0cb3c3a905a7e1e34fca53a8efb8727f66367db48400612ba8f7b41"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolverGeneric::package_target_resolve (cognitive 41): ResolverGeneric::package_target_resolve has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (nesting depth added 19). Of this number, 30 points are the body\u0027s own statements and 11 belong to one function item inside it that branches. 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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaff5c5df9f92116c0c56a3ce0c495ac5ee58106a26eed6a95b6b5b69c1b7b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_esm_library::optimize_chunks::assign_dyn_import_chunk_short_names (cognitive 40): rspack_plugin_esm_library::optimize_chunks::assign_dyn_import_chunk_short_names has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 7 (12 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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ec0b8d258008da689ba2be738ab50d674fd4d29b35ed5e6d00c4284635652f"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rslib::dyn_import_external::cutout_star_re_export_externals (cognitive 40): rspack_plugin_rslib::dyn_import_external::cutout_star_re_export_externals has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 5 (7 pts), match/switch 1 (3 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":"crates/rspack_plugin_rslib/src/dyn_import_external.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"882ed3fac060d9783b5bbfe4634804443b2928b0c0d0ce7ac020ec2850d03662"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCache::fetch_content (cognitive 40): HttpCache::fetch_content has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 7, match/switch 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":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bcb7e7415498a668851709ba88c5dfb829d4cee081385f0f5a6e92ad7bcbeb"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleCodeTemplate::module_namespace_promise (cognitive 39): ModuleCodeTemplate::module_namespace_promise has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 2, 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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b75cc1980e73f9cdfa1bb847ee9b0073e9a254749cff7c829a3a30fab665b17"}},{"ruleId":"D2","level":"warning","message":{"text":"Executer::compute_jump_table (cognitive 39): Executer::compute_jump_table has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 5 (7 pts), match/switch 2 (5 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":"crates/rspack_dojang/src/exec.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6660088aa8b84d3f54075b94e3ea05d23a9ba2fd84fd153472e743046a9f2c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_ids::named_module_ids_plugin::assign_named_module_ids (cognitive 39): rspack_ids::named_module_ids_plugin::assign_named_module_ids has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 7 (14 pts), boolean chains 3 (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":"crates/rspack_ids/src/named_module_ids_plugin.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"49150c0fe60bcdbe61b045c3fcd6f6beaeb16fc887d95a6636c5a7d0f867ea68"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlPluginAssets::create_assets (cognitive 39): HtmlPluginAssets::create_assets has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 6, 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":"crates/rspack_plugin_html/src/asset.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2acfc752addeb1960d81c9cbf2f77d338b3ef08502c2f64712d79e8949d2578"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportMetaPlugin::meta_property (cognitive 39): ImportMetaPlugin::meta_property has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 22). 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":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f418bd79b2e67c8a9beda92e4d2bda7a8ae6a44c7c208add7921855bee442e"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rsdoctor::chunk_graph::collect_chunk_dependencies (cognitive 39): rspack_plugin_rsdoctor::chunk_graph::collect_chunk_dependencies has cognitive complexity 39 (threshold 15). Drivers by points: if/else 5 (22 pts), loops 5 (17 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":"crates/rspack_plugin_rsdoctor/src/chunk_graph.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7768e53819b0014303d99e146c07322d0e902b68eb4e74cb00e44393a7923236"}},{"ruleId":"D2","level":"warning","message":{"text":"PathManager::scan_below (cognitive 39): PathManager::scan_below has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 2 (3 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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24ac2d847aad2d2428b41cdfd7a943a58993eb6caf35a36504c4a6a3dbfc607"}},{"ruleId":"D2","level":"warning","message":{"text":"css_module_lexer::css_syntax::decode_css_keyword (cognitive 38): css_module_lexer::css_syntax::decode_css_keyword has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 22). 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":"crates/css-module-lexer/src/css_syntax.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a04c0fd4dad2e4ca26433c4647ef420e95fd7790faa5dcf23ef7ab20615a87"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::set_entry_runtime_and_depend_on (cognitive 38): CodeSplitter::set_entry_runtime_and_depend_on has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (8 pts), boolean chains 3, 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27c0639cdd9fb489886a497fc7e4778aadcc64ae6472f22eab8426d10feaace"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcatenatedModule::get_final_binding (cognitive 38): ConcatenatedModule::get_final_binding has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 6 (12 pts), boolean chains 3 (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":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be6a1aae31c076c73bb7c430247bf74925b596fdc76bf050b5072ef603f9478"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::utils::compile_boolean_matcher::items_to_regexp (cognitive 38): rspack_core::utils::compile_boolean_matcher::items_to_regexp has cognitive complexity 38 (threshold 15). Drivers by points: if/else 24 (30 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/utils/compile_boolean_matcher.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8e45cdea602f309da70834c61cafdf5f0ff563c4c38397e45757a468a7be35"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_copy::process_assets (cognitive 38): rspack_plugin_copy::process_assets has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 4 (7 pts), boolean chains 3, match/switch 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aca2c427cc206f278dcc70118681a647f5d89afff5397b5c3c60355eab74a8"}},{"ruleId":"D2","level":"warning","message":{"text":"JsPlugin::get_renamed_inline_module (cognitive 38): JsPlugin::get_renamed_inline_module has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 5, loops 3 (4 pts), match/switch 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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96d3d3cbf43f1c8104c5fb3f9178207e35660a925a0a0fe649db76ff5e810d0"}},{"ruleId":"D2","level":"warning","message":{"text":"RscServerPlugin::create_client_entries (cognitive 38): RscServerPlugin::create_client_entries has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 9 (14 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rsc/src/server_plugin.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b3cc288d3a87d251346a7d5d9a005656e117a55df652b9389873246e44a763"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::lex_value_at_rule (cognitive 37): LexDependencies::lex_value_at_rule has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 5, loops 2 (4 pts), 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2510}}}],"partialFingerprints":{"codehealthFindingId/v1":"5412ec8e7b1146f3f08f7f7ba78dad9fc8700ee391578d16440a87dc0ae2bfaf"}},{"ruleId":"D2","level":"warning","message":{"text":"Eval::new (cognitive 37): Eval::new has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (10 pts), loops 3 (8 pts), boolean chains 3 (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":"crates/rspack_dojang/src/eval.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"701202c444678e529bb1a6e5a2ac42d91258dab89036a920f1b6c55b1125505c"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMapDevToolPlugin::collect_tasks (cognitive 37): SourceMapDevToolPlugin::collect_tasks has cognitive complexity 37 (threshold 15). Drivers by points: loops 6 (13 pts), match/switch 6 (12 pts), if/else 3 (10 pts), boolean chains 2 (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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e8a22a245110a9692014ad89d4709ec1990b8ac37eec745395ff9789e4e828"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_esm_library::plugin::process_assets (cognitive 37): rspack_plugin_esm_library::plugin::process_assets has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 4 (6 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":"crates/rspack_plugin_esm_library/src/plugin.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02e038a518e47c818e77f7ff41b1fbd3306b910b2dd4a05897f44e2b30416a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ShareRuntimeModule::generate (cognitive 37): ShareRuntimeModule::generate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 4 (10 pts), match/switch 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":"crates/rspack_plugin_mf/src/sharing/share_runtime_module.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1139830f8ff96123ef4b22aac8f5b99dafe43aaa50e2e370935b43a2ecc09553"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::release_check::run_inner (cognitive 37): xtask::release_check::run_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (31 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":"xtask/src/release_check/mod.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4890350fd3461c4e3faa3892dc7a7545666dacccf2f547a788f053e9e8ffeb"}},{"ruleId":"D2","level":"warning","message":{"text":"ServeCommand.apply (cognitive 37): ServeCommand.apply has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 7, ternaries 4, error handling 2, loops 1 (nesting depth added 10). None of this is in the body itself: all 37 points belong to 2 function literals inside it that branch (lines 58, 177). 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":"packages/rspack-cli/src/commands/serve.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f036718222bcca636ddc34a3ec8a1b20aa3a44b1c2c116dc86537edad9e4240"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueAtRuleStream::push (cognitive 36): ValueAtRuleStream::push has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 6 (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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"33853856483e988e42cf89df32b045f445abf797d09f55c58f894645cf006da6"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::scan_bad_url (cognitive 36): Lexer::scan_bad_url has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 2 (3 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"6662d471ac96c89d4a9dbc7d3ceb2e46a0a2e59ef67be07ab82de6f30f8f0b71"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkGraph::get_runtime_chunk_dependent_chunks_iterable (cognitive 36): ChunkGraph::get_runtime_chunk_dependent_chunks_iterable has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (20 pts), loops 6 (14 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":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0efd87ffb2c03045fcd54175ebbd2fb6cf793cf885c0a54867b1e411f9d6e1"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystemInfo::read_context (cognitive 36): FileSystemInfo::read_context has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 4 (7 pts), loops 2, 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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"601b76b56044a0aef81943fcf091362dba27cc9862d7229ca68b8bc5fdf18b25"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_esm_library::dependency::commonjs_external::cutout_commonjs_externals (cognitive 36): rspack_plugin_esm_library::dependency::commonjs_external::cutout_commonjs_externals has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 4 (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":"crates/rspack_plugin_esm_library/src/dependency/commonjs_external.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac00306f818e9974a3ef5a6aece47d7d9de10eb71877b4fdea52f3760d543a5"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::runtime::render_module (cognitive 36): rspack_plugin_javascript::runtime::render_module has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 6, loops 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":"crates/rspack_plugin_javascript/src/runtime.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7754c216f018a78f5fda26d68042eb5322d7b5b85825099001c8628245b0f2f7"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_runtime::common_js_chunk_loading::runtime_requirements_in_tree (cognitive 36): rspack_plugin_runtime::common_js_chunk_loading::runtime_requirements_in_tree has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (36 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":"crates/rspack_plugin_runtime/src/common_js_chunk_loading.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc01decf8a8c9f609b35096442ff941cc57b09d67ad538a6531791ecad24544"}},{"ruleId":"D2","level":"warning","message":{"text":"WatcherDirectoriesAnalyzer::analyze (cognitive 36): WatcherDirectoriesAnalyzer::analyze has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 6, loops 4 (6 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":"crates/rspack_watcher/src/analyzer/directories.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d19b42e7b09c5ab6a1481d4d52d54727e634f1b04185ecb480569bd11ea33df"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::deny_ext::enforce_workspace_version (cognitive 36): xtask::deny_ext::enforce_workspace_version has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 3 (8 pts), boolean chains 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":"xtask/src/deny_ext/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5691f4988403db5983683196a1f12ffb696fca4c76229c5c06b6201e5b53a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::runtime_template::runtime_globals_to_render_map (cognitive 35): rspack_core::runtime_template::runtime_globals_to_render_map has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2166d7e91ff90709bfcc369651a2ad458dbc01effc38df4c8c0c788a4fbf287d"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphicalReportHandler::render_snippets (cognitive 35): GraphicalReportHandler::render_snippets has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (6 pts), boolean chains 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":"crates/rspack_error/src/displayer/renderer/graphical.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10343b8c9fc1ed368bb2a3f8e7f871b16bb20732f272a40ea91176c703f59d1"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginCssExtract::render_content_asset (cognitive 35): PluginCssExtract::render_content_asset has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 2, 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":"crates/rspack_plugin_extract_css/src/plugin.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4662261c79903840c7307ce215ca7e0d559044df780394bd7ee27017246ae760"}},{"ruleId":"D2","level":"warning","message":{"text":"PathManager::collect_time_info_entries (cognitive 35): PathManager::collect_time_info_entries has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 9 (14 pts), 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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"89698277faa877da001e2e590480e64c1096fa62c5ec4b7a9d4296cf5f486488"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::scan_name_impl (cognitive 34): Lexer::scan_name_impl has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 2 (3 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"61035cdf389df89606105c3371935a126d84df8ceb15bdcbe65c745a198a64ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Executer::render (cognitive 34): Executer::render has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 4 (11 pts), loops 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":"crates/rspack_dojang/src/exec.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c448fc0e0d4f1bf40a50ffe7d128204e30b7ded97ea2ede1ea99037ea2c1cab"}},{"ruleId":"D2","level":"warning","message":{"text":"ESMExportExpressionDependencyTemplate::render (cognitive 34): ESMExportExpressionDependencyTemplate::render has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 3, 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_expression_dependency.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"503cd0549d8aadfa9a3fa01dac6345190077a9fa44a750e1279f825b1f08f711"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_mf::container::hoist_container_references_plugin::optimize_chunks (cognitive 34): rspack_plugin_mf::container::hoist_container_references_plugin::optimize_chunks has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 6 (9 pts), boolean chains 1 (nesting depth added 20). Of this number, 21 points are the body\u0027s own statements and 13 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":"crates/rspack_plugin_mf/src/container/hoist_container_references_plugin.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ecce41278baae4a6471495c4e13a762d6a26415f633701055e6b5c94ae3c85"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_macros::ast_object::expand_ast_object_derive (cognitive 33): rspack_macros::ast_object::expand_ast_object_derive has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 3 (5 pts), loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_macros/src/ast_object.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bca7d3801579068601001b139b148ee59f34082d49af3f9303236ad50165f19"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::get_binding (cognitive 33): EsmLibraryPlugin::get_binding has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 9 (15 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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":2909}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc1b7a9a88339e237581505fc5f6fc60fe7215f159cebac07250749a5d1fbbc"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_esm_library::plugin::optimize_chunk_modules (cognitive 33): rspack_plugin_esm_library::plugin::optimize_chunk_modules has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (13 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":"crates/rspack_plugin_esm_library/src/plugin.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a023e0e79fcb6045a92217729bd4427d6475f91ba661d03f06f5ddad4689c8e"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginCssExtract::sort_modules (cognitive 33): PluginCssExtract::sort_modules has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 5 (9 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":"crates/rspack_plugin_extract_css/src/plugin.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8e6fdb5a8c9bd844830805cb215e76da517e49039b401126bf5030d6c8daec"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::walk_assignment_expression (cognitive 33): JavascriptParser::walk_assignment_expression has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 5 (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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28e6238c59c744d96456b3fa94019790a77e6c4166f9f67445f97708dbe382f"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::side_effects_analysis::may_have_side_effects (cognitive 33): rspack_plugin_javascript::parser_plugin::side_effects_analysis::may_have_side_effects has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 5 (9 pts), boolean chains 8 (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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_analysis.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b5a0cd5ba519c6bfdab2a3ba90ad112e7d130ba935427545fb8a285419401a"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rsdoctor::plugin::optimize_chunk_modules (cognitive 33): rspack_plugin_rsdoctor::plugin::optimize_chunk_modules has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 8 (10 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":"crates/rspack_plugin_rsdoctor/src/plugin.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"c371b171fe7a618f94c93eb815511496c1cd954f0b22d7e23443a2eb604a94e8"}},{"ruleId":"D2","level":"warning","message":{"text":"RstestParserPlugin::process_mock (cognitive 33): RstestParserPlugin::process_mock has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (31 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":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"97776493f898e8b9f89c26c66b72a6dee8d22c9a9b5baafa885df9efb80be0ef"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rstest::import_dependency::module_namespace_promise_rstest (cognitive 33): rspack_plugin_rstest::import_dependency::module_namespace_promise_rstest has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 1, 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":"crates/rspack_plugin_rstest/src/import_dependency.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38b22776b28ad8c6b03bb184853a0caad4abe13777e382ec3c4fbadf2e3ced0"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.getInfrastructureLogger (cognitive 33): Compiler.getInfrastructureLogger has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (33 pts) (nesting depth added 18). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 482, 466, 478, \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":"packages/rspack/src/Compiler.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13e36c79cee6e68e5036c541b0bbe529795beee8179258bb4522ae2e7188719"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::compilation::build_chunk_graph::code_splitter::extract_block_modules (cognitive 32): rspack_core::compilation::build_chunk_graph::code_splitter::extract_block_modules has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 4 (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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":3029}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5fea9cce9fa021cef23279a44b50cb765bb8a7e3dfa9d9bf138d9985a2484b"}},{"ruleId":"D2","level":"warning","message":{"text":"CopyRspackPlugin::analyze_every_entry (cognitive 32): CopyRspackPlugin::analyze_every_entry has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23 (25 pts), match/switch 3 (6 pts), boolean chains 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2087c086f4f86387c05db419bfe6bece3fb09f3b9331fe3dd141fbbcd595846"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::walk_call_expression (cognitive 32): JavascriptParser::walk_call_expression has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 4, match/switch 3 (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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1ef256c648c04cdaa078f1d0a6ead64da8ecc78844b565a09eb9d7a0de905a"}},{"ruleId":"D2","level":"warning","message":{"text":"Cutout::cutout_artifact (cognitive 31): Cutout::cutout_artifact has cognitive complexity 31 (threshold 15). Drivers by points: loops 9 (16 pts), if/else 6 (11 pts), boolean chains 2, match/switch 1 (2 pts) (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":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ec273e8e64155dcdf71c04fcd7399c892cdd530bf7c19fa67daa93f985a93e"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::plugin::side_effects_flag_plugin::optimize_dependencies (cognitive 31): rspack_plugin_javascript::plugin::side_effects_flag_plugin::optimize_dependencies has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (5 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 12). Of this number, 19 points are the body\u0027s own statements and 12 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":"crates/rspack_plugin_javascript/src/plugin/side_effects_flag_plugin.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb0955114615e1b3b0620cd4b38869470a5331dcd7e113196371b46c20d0989"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_real_content_hash::inner_impl (cognitive 31): rspack_plugin_real_content_hash::inner_impl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 7 (12 pts), boolean chains 2, 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":"crates/rspack_plugin_real_content_hash/src/lib.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5a23676196c0eac0fbb27c2e5e9e552f05e702d852e682b058ae1bb0b92c64"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_sri::asset::process_chunks (cognitive 31): rspack_plugin_sri::asset::process_chunks has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_sri/src/asset.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a96a13142f8b99c584856040388187447681e8f27c88d95b83a054cdba542a"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_sri::manifest::strongly_connected_components (cognitive 31): rspack_plugin_sri::manifest::strongly_connected_components has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (7 pts), match/switch 1 (4 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":"crates/rspack_plugin_sri/src/manifest.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"8531d9f53b9e05a68ea7241bab794ff54e3702d3584bd6a11bdac8891a609008"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolverGeneric::resolve_in_module_dir (cognitive 31): ResolverGeneric::resolve_in_module_dir has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 1 (nesting depth added 18). 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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e053695d2d66673d3e9a5395f0d12a991f2aad8ac7190c214a3ed510dbce1e"}},{"ruleId":"D2","level":"warning","message":{"text":"cleverMerge.mergeSingleValue (cognitive 31): cleverMerge.mergeSingleValue has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 5 (15 pts), loops 2 (8 pts), if/else 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 20). Of this number, 28 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f83977a3b98b236e050da0c34fd26358fdbf8d7510456ccab25ad9f3faf1cb"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_allocative_derive::derive_allocative::extract_attrs (cognitive 30): rspack_allocative_derive::derive_allocative::extract_attrs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 2 (3 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":"crates/rspack_allocative_derive/src/derive_allocative.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0edefbea24430e242ab2dd0de76bd14be156873aae35de92212bbef384c35b"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_javascript_compiler::compiler::stringify::build_rspack_source_map (cognitive 30): rspack_javascript_compiler::compiler::stringify::build_rspack_source_map has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, match/switch 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":"crates/rspack_javascript_compiler/src/compiler/stringify.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e756563659e49e761f76e58bbcf1a25a02cb732cf6e978eba169ed045ec59725"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetParserAndGenerator::source_types (cognitive 30): AssetParserAndGenerator::source_types has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 6, 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":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"2587f7fb32c408d4b672c85f0d676985313774962087e327b6011318d075c3a7"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMapDevToolPlugin::create_mapped_asset (cognitive 30): SourceMapDevToolPlugin::create_mapped_asset has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 5 (10 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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1224d39e13897566eba1a76e2f640be1d73a1669ea72f1ff14dcbb002178cc"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_dll::lib_manifest_plugin::emit (cognitive 30): rspack_plugin_dll::lib_manifest_plugin::emit has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (7 pts), loops 3 (4 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":"crates/rspack_plugin_dll/src/lib_manifest_plugin.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f50d158276632290a0a6144dc4f7bef2a04f83008668fc8b9d18a1236afb74e"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::mark_modules (cognitive 30): EsmLibraryPlugin::mark_modules has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 5, loops 3 (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":"crates/rspack_plugin_esm_library/src/plugin.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4c21c03e17a5dca4d2a14423d6c58a1cff19a66c4572c80e27d0bebd790f89"}},{"ruleId":"D2","level":"warning","message":{"text":"ESMImportSpecifierDependencyTemplate::render_evaluated_in_operator (cognitive 30): ESMImportSpecifierDependencyTemplate::render_evaluated_in_operator has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 3 (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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34685407aec74a6937e3bc1658655494aad1ac0c07d13daa3e22d95bcd8810d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::api_plugin::static_require_member_chain (cognitive 30): rspack_plugin_javascript::parser_plugin::api_plugin::static_require_member_chain has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (28 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":"crates/rspack_plugin_javascript/src/parser_plugin/api_plugin.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e70920baaf519e1394d7d78180578500661613ee9f6e632b953786aaf4dc404"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::const::if_stmt::get_hoisted_declarations (cognitive 30): rspack_plugin_javascript::parser_plugin::const::if_stmt::get_hoisted_declarations has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (7 pts), 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":"crates/rspack_plugin_javascript/src/parser_plugin/const/if_stmt.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f49fc38e9e0b5cea8ff799db82bcdd42f56b62acd6896f0a98df20c0b08aff2"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rslib::isolated_dts::complete_isolated_dts_outputs (cognitive 30): rspack_plugin_rslib::isolated_dts::complete_isolated_dts_outputs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (4 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":"crates/rspack_plugin_rslib/src/isolated_dts.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f66fb031f2a622f1910b49f47e3f67d3f165dd2b6647bffdcdb7ac6e146a9af"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rslib::worker_external::cutout_worker_externals (cognitive 30): rspack_plugin_rslib::worker_external::cutout_worker_externals has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 4 (7 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":"crates/rspack_plugin_rslib/src/worker_external.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48a94da870586bb0a90ed67a635faa0ac5c7b1d67cd631e2490b4adbdeab0e6"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::handle_function (cognitive 29): LexDependencies::handle_function has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 8 (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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3955}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4785c5845111f41787ca0442ef3b5026c550ad55dd68e107d8144c183e4578"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilerOptionsBuilder::build (cognitive 29): CompilerOptionsBuilder::build has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23 (26 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cb79e0ad574fd77a7308d6210f0b2fee6e91cd43c4a2a36c76601f03e988ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextModule::get_lazy_source (cognitive 29): ContextModule::get_lazy_source has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23 (25 pts), boolean chains 3, match/switch 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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"7effe3a61a4d7223fa29c401eb0d5d5916e41bb777c0d735e7c2c4db6843a3de"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_devtool::eval_source_map_dev_tool_plugin::render_module_content (cognitive 29): rspack_plugin_devtool::eval_source_map_dev_tool_plugin::render_module_content has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 2 (5 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":"crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceda9edcf9c1ead1b6df606c1d0ab44c3aabbaedd4e3c15de2e43d0930301409"}},{"ruleId":"D2","level":"warning","message":{"text":"FlagDependencyExportsState::apply (cognitive 29): FlagDependencyExportsState::apply has cognitive complexity 29 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 4 (10 pts), boolean chains 1 (nesting depth added 16). 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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed8d4703ce9a2cc2dbd309a959200f4e11c5487731432e2070cef7dcbf581dd"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::mark_auto_side_effects_free_program (cognitive 29): rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::mark_auto_side_effects_free_program has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (20 pts), match/switch 2 (5 pts), boolean chains 3, 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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68643e53793d9dd723fdbb7c891ad670972c3fbc016a51a8ade66138b91639b"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_size_limits::after_emit (cognitive 29): rspack_plugin_size_limits::after_emit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 5 (7 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":"crates/rspack_plugin_size_limits/src/lib.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b659137818526e96edb84a884036ebf46e6a1ba83039f15d1a60ce3f44fb8d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_sri::asset::digest_chunks (cognitive 29): rspack_plugin_sri::asset::digest_chunks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 3 (7 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":"crates/rspack_plugin_sri/src/asset.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f2541728f69e55e161239c8c6ab8033c4ac6fce616a6fe0c19b025431a9cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportedEnumCollector::visit_program (cognitive 29): ExportedEnumCollector::visit_program has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (5 pts), match/switch 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":"crates/swc_plugin_ts_collector/src/enums.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c52b1736c2615836642dd6c36e3b7c2b761512bd5edcd416d45a60d341cb37"}},{"ruleId":"D2","level":"warning","message":{"text":"loadConfig.loadExtendedConfig (cognitive 29): loadConfig.loadExtendedConfig has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 2 (6 pts), boolean chains 4, 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":"packages/rspack-cli/src/utils/loadConfig.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4299fade864b11dcd89f2e0e12e5785217d0e7676bb4b6b005170bbc34e8f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeWatchFileSystem.watch (cognitive 29): NativeWatchFileSystem.watch has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12, loops 4 (8 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 12 of the 29 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 224, info, a function literal at line 266, \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":"packages/rspack/src/NativeWatchFileSystem.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cdca492b5a82faae51f99d5fb9605debd40475134bce55e759f99cfd5337c9"}},{"ruleId":"D2","level":"warning","message":{"text":"HashHelper::dir_hash (cognitive 28): HashHelper::dir_hash has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/snapshot/strategy/hash_helper.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0be685b1a80a37c1693399998660f6396c6d9a715904e75f1761b08890ee5f3"}},{"ruleId":"D2","level":"warning","message":{"text":"HashHelper::dir_timestamp_hash (cognitive 28): HashHelper::dir_timestamp_hash has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (25 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":"crates/rspack_core/src/legacy_cache/persistent/snapshot/strategy/hash_helper.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53d13d1dad3dc51dae5674994fa5d3c7d5d7a79f8a080a6e5720501681ae55e"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_ids::named_module_ids_plugin::module_ids (cognitive 28): rspack_ids::named_module_ids_plugin::module_ids has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, loops 2 (5 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":"crates/rspack_ids/src/named_module_ids_plugin.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c6be6624355d409a5cb20995646de3bca7f58b701e3fe64f7c654360c56089"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaScriptTransformer::input_source_map (cognitive 28): JavaScriptTransformer::input_source_map has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 8 (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":"crates/rspack_javascript_compiler/src/compiler/transform.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f864fa00c056ffb84a61ddd236501f975331e1707437d731247250ea0d224ee"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalsPlugin::handle_external (cognitive 28): ExternalsPlugin::handle_external has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 5). Of this number, 25 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":"crates/rspack_plugin_externals/src/plugin.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"325b2e8c02c33ef9ee9c736fe4f087fe713c53dfec42b1543154152f82b0d183"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::plugin::mangle_exports_plugin::mangle_exports_info (cognitive 28): rspack_plugin_javascript::plugin::mangle_exports_plugin::mangle_exports_info has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (13 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":"crates/rspack_plugin_javascript/src/plugin/mangle_exports_plugin.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2827885efc2b725c05092161e79d8a1a03cb8f64d4359d92babc563c774348"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_json::create_object_for_exports_info (cognitive 28): rspack_plugin_json::create_object_for_exports_info has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (4 pts), match/switch 2 (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":"crates/rspack_plugin_json/src/lib.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"80375fce8c4bdebf8ef0fb92858d949cbff49dbae76594da930132688ce73f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleChunkLoadingRuntimeModule::generate (cognitive 28): ModuleChunkLoadingRuntimeModule::generate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 6 (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":"crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316109cdc637b79b6865befa6296da8a0d3744c0076668f9999539693b99dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolverGeneric::package_exports_resolve (cognitive 28): ResolverGeneric::package_exports_resolve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (2 pts) (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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2981e56c9955f988903ce66fefc464c1fe57f2f66a6b8cd5ab06476ac9405fe"}},{"ruleId":"D2","level":"warning","message":{"text":"compilation.createCompilationHooksRegisters (cognitive 28): compilation.createCompilationHooksRegisters has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 5, boolean chains 3, ternaries 3, error handling 1 (nesting depth added 2). None of this is in the body itself: all 28 points belong to 8 function literals inside it that branch (lines 419, 216, 140, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/taps/compilation.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb84c366f81e3243c055d1cfdfee8e7b7a28fc28f700fb510a622188b6ad6d1"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::lex_local_function_decl (cognitive 27): LexDependencies::lex_local_function_decl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 6 (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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3044}}}],"partialFingerprints":{"codehealthFindingId/v1":"5319c7aa81ed0c840444628fce4d22da99de852b4d079feb4099664c18bd05ff"}},{"ruleId":"D2","level":"warning","message":{"text":"SwcLoader::loader_impl (cognitive 27): SwcLoader::loader_impl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (22 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":"crates/rspack_loader_swc/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c711741dfa65aaa2786b02cd2f3f4e31355e3bb7421a9e583a996100ff086e"}},{"ruleId":"D2","level":"warning","message":{"text":"ESMExportImportedSpecifierDependency::get_mode_inner (cognitive 27): ESMExportImportedSpecifierDependency::get_mode_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 3 (9 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb469cd1e987e8b036a699322b911c4d41a79c0a40d26994bcd0df887e9ff3c"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::walk_member_expression (cognitive 27): JavascriptParser::walk_member_expression has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 3, 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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd3f7319c0d13fc5449a22e0b44d19e7e2adaa8d9f5515a015d910f59ff43df"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_module_info_header::print_exports_info_to_source (cognitive 27): rspack_plugin_module_info_header::print_exports_info_to_source has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 3 (8 pts), boolean chains 2, loops 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":"crates/rspack_plugin_module_info_header/src/lib.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f2f9c8ae3efd605ec6b0374c938cd3491b9dd31716f55d7456e2f70831d305"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_runtime::array_push_callback_chunk_format::render_chunk (cognitive 27): rspack_plugin_runtime::array_push_callback_chunk_format::render_chunk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (24 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":"crates/rspack_plugin_runtime/src/array_push_callback_chunk_format.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d690ec9b455f93c64a666cef2e373bb1f119d8030d77fb41d18c2b65850a70d4"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncWasmParserAndGenerator::parse (cognitive 27): AsyncWasmParserAndGenerator::parse has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 4 (15 pts), loops 3 (9 pts), if/else 2 (3 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":"crates/rspack_plugin_wasm/src/parser_and_generator.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"263f9a4a1a41c72233a6e5dbb749e91223f4d846a6fd08a29c9bd6584ea8f361"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiCompiler.validateDependencies (cognitive 27): MultiCompiler.validateDependencies has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 13). Of this number, 23 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"packages/rspack/src/MultiCompiler.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"84972a733e84d693d3b8676a938606488134fef12207e3ec746fe073c2c01026"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueAtRuleStream::push_parsed_item (cognitive 26): ValueAtRuleStream::push_parsed_item has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"4928770eb94806cf158bff1af570299ebd023b2189a71ff8da24c542e904ea04"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::handle_string (cognitive 26): LexDependencies::handle_string has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, match/switch 3 (4 pts), 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3527}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c20d615963ecb290ad0a351a5a189ac4b1ed69eab443a8196ac6ceed7e4d52"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::next_token_without_visit (cognitive 26): Lexer::next_token_without_visit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (24 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd239f9304bfdbdf3f2bb0b042f6de82a43899c8691c0acc9c29110640f803b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::get_module_reuse_info (cognitive 26): CodeSplitter::get_module_reuse_info has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (8 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84b93ac0c4697b5ec279db0a7925693f92a8958bb31bf7e638a703b9114cb85"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_dojang::eval::get_tokens_belong_to_accessor (cognitive 26): rspack_dojang::eval::get_tokens_belong_to_accessor has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 3 (10 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_dojang/src/eval.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf29ee4b16b4a32b736cb6f74a60095ef18fe6dcfc186189368617f27002be69"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_ids::named_chunk_ids_plugin::chunk_ids (cognitive 26): rspack_ids::named_chunk_ids_plugin::chunk_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (7 pts), boolean chains 5, match/switch 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":"crates/rspack_ids/src/named_chunk_ids_plugin.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b8da405528bb7ebf78bebba2322fcc195b9a55bc6e1d360546a529e5ecf849"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonJsImportsParserPlugin::call (cognitive 26): CommonJsImportsParserPlugin::call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 5 (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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"b573c3eef9e8b1367d0e672070e75728df5dad4b92e825a5f88c37782ca36211"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportParserPlugin::finish (cognitive 26): ImportParserPlugin::finish has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (8 pts), boolean chains 3, 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":"crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"90961c48b1910adbcb20551dee00af2d84477b2753bc44ad3bfaa8c2bec91f25"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_apply (cognitive 26): rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 4, 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb21a9fb8ee6d23a1dc77c04323296b9ab7e69e6a75def12adc2809144b7ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::plugin::mangle_exports_plugin::optimize_code_generation (cognitive 26): rspack_plugin_javascript::plugin::mangle_exports_plugin::optimize_code_generation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (6 pts), boolean chains 5 (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":"crates/rspack_plugin_javascript/src/plugin/mangle_exports_plugin.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a8add4eb1b7926df4fbbddde78a6f18ed8963cb632c37f414fb4c1fbc998c6"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::runtime::render_runtime_module_sources (cognitive 26): rspack_plugin_javascript::runtime::render_runtime_module_sources has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6, 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":"crates/rspack_plugin_javascript/src/runtime.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"34825fab22c7b3779e62e63b626cf9cda83984330099cfe2df011c75625a4769"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_library::umd_library_plugin::render (cognitive 26): rspack_plugin_library::umd_library_plugin::render has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (22 pts), 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":"crates/rspack_plugin_library/src/umd_library_plugin.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4253a14f3583a5bbe647c59f82e0be88774c590edd703d402f9556a01558aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsumeSharedPlugin::get_required_version (cognitive 26): ConsumeSharedPlugin::get_required_version has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 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":"crates/rspack_plugin_mf/src/sharing/consume_shared_plugin.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"390bade0acc0d70673983ffdb8e161512fa0a384dfd1e32796c0f3755245d305"}},{"ruleId":"D2","level":"warning","message":{"text":"StdoutTracer::sync_trace (cognitive 26): StdoutTracer::sync_trace has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (8 pts), match/switch 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":"crates/rspack_tracing/src/stdout.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0511019cd546e835565b516a9004828adecf02bc3d1daa11e3d4bd22bac32668"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.rmrf (cognitive 26): fs.rmrf has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 14). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 603, 595, 616). 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":"packages/rspack/src/util/fs.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a9ad9f71a6a0d2ccae3ace5a1266df0b443b3070fbec038a19bf2c8289a7ae"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiStats.toJson (cognitive 26): MultiStats.toJson has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 6, boolean chains 5, ternaries 1 (nesting depth added 8). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"packages/rspack/src/MultiStats.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c342f2c7e257946d5bd90b4cf1ca12525dddf82b4c8ef86ffa447e1f14e226"}},{"ruleId":"D2","level":"warning","message":{"text":"validateConfig.validateExternalUmd (cognitive 26): validateConfig.validateExternalUmd has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 7). Most of this is not in the body itself: 8 of the 26 points are its own statements and the rest belongs to 2 function items inside it that branch (checkExternalItem, checkExternalItemValue). 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":"packages/rspack/src/util/validateConfig.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab4ecc05df14ac8c8eba5e8fdbbca288d84748bc1936d5c5bac56da0d4b4496"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputOptionsBuilder::build (cognitive 25): OutputOptionsBuilder::build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 3, 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59c1dc41f95240aac2e51e595f34c073e921ccb12a2d74622b0dd8891bd2113"}},{"ruleId":"D2","level":"warning","message":{"text":"Chunk::get_all_async_chunks (cognitive 25): Chunk::get_all_async_chunks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 12). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (add_to_queue, add_chunks). 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":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"883423771fa5d994830a04d380de7fb8f2906f06b2a72b6f80dc9457bc700e38"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_css::plugin::impl_plugin_for_css_plugin::runtime_requirements_in_tree (cognitive 25): rspack_plugin_css::plugin::impl_plugin_for_css_plugin::runtime_requirements_in_tree has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 8 (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":"crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cea6a8d4de74dc92e7b6c2809b06f52f7aec0f289bab05c025317f642ada8f"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::analyze_module (cognitive 25): EsmLibraryPlugin::analyze_module has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2, match/switch 1 (2 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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd907a825e3c870bb6c1db77458fdd4d1b0c47781c9f57536e3ae9474ba234d"}},{"ruleId":"D2","level":"warning","message":{"text":"CollectSharedEntryPlugin::infer_version (cognitive 25): CollectSharedEntryPlugin::infer_version has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (6 pts), boolean chains 2 (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":"crates/rspack_plugin_mf/src/sharing/collect_shared_entry_plugin.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fe88a6ae03150ee7785e791dd10634da25437792aaa37b0331fcd333b353f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_runtime::module_chunk_loading::runtime_requirements_in_tree (cognitive 25): rspack_plugin_runtime::module_chunk_loading::runtime_requirements_in_tree has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 6 (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":"crates/rspack_plugin_runtime/src/module_chunk_loading.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d3f2e79ac0b534601da230e4a9a6082d003c09c4f00d90aeaa657a52dcbf47"}},{"ruleId":"D2","level":"warning","message":{"text":"PathManager::update (cognitive 25): PathManager::update has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 7, 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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0e43c118366e157adeaed1417b94fc5d76f3e372ed13ee89d5728d92cea409"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcatenatedModule::enter_module (cognitive 24): ConcatenatedModule::enter_module has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, 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":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dbef0e44e3a14e7cfbf2967ede29ce81fc64e4b56f1cb7c549e857d1610453"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportInfoData::set_used_conditionally (cognitive 24): ExportInfoData::set_used_conditionally has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (7 pts), boolean chains 4, 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":"crates/rspack_core/src/exports/export_info_setter.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"72aa6df32922202bb4a7524f8a28314428a1369b8ad9bcbcd1fa17cf723fa087"}},{"ruleId":"D2","level":"warning","message":{"text":"Stats::get_assets (cognitive 24): Stats::get_assets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6 (9 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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1715839c7b4ec90603a2cf13c0838ba992b7a006fc302037ca3c603ea2e99585"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::context_module::create_identifier (cognitive 24): rspack_core::context_module::create_identifier has cognitive complexity 24 (threshold 15). Drivers by points: if/else 21 (23 pts), match/switch 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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f34df665fc447a9d259add4a6e97e7911655ad6084f8c7134939ae99833bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::exports::target::resolve_target (cognitive 24): rspack_core::exports::target::resolve_target has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 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":"crates/rspack_core/src/exports/target.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2569b7d63dfdf7688ee93e80c978fb6e9ae11f1c73f236650dab02ae2b8761d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_tag (cognitive 24): Parser::parse_tag has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 6 (9 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":"crates/rspack_dojang/src/expr.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f4b04afdbe9928cd12826bf4eec5e7107f043c73c4be479dffb795ec8ab478"}},{"ruleId":"D2","level":"warning","message":{"text":"LightningCssLoader::loader_impl (cognitive 24): LightningCssLoader::loader_impl has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 3 (5 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":"crates/rspack_loader_lightningcss/src/lib.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b01b14a6ee104c9fd3e01de07241dd7166b9a0ebd2382bdf28af652e046b28"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_napi::utils::unknown_to_json_value (cognitive 24): rspack_napi::utils::unknown_to_json_value has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), match/switch 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":"crates/rspack_napi/src/utils.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4f71556ea7385eba7d9adddbc5d6e5c65db24115de26ad4dea45c7a897a2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"CssModuleParser::handle_composes (cognitive 24): CssModuleParser::handle_composes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 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":"crates/rspack_plugin_css/src/parser_and_generator/parser.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad20eb2e206b7eba3d919bb18e2fd1dd043e9bae1e44567f8eca922a468eed8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportMetaPlugin::unhandled_expression_member_chain (cognitive 24): ImportMetaPlugin::unhandled_expression_member_chain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80401f6d75b35555adeb12c2bb6b13cdcbb914e94c6cea811d0c6c2103ebee9"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::evaluating (cognitive 24): JavascriptParser::evaluating has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, match/switch 2 (3 pts) (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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e827597d496d5dfe463b4e14ec6fd33759e4ebc60b5aa9e928f8d480fe46cad"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::walk_variable_declaration (cognitive 24): JavascriptParser::walk_variable_declaration has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 4, 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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c02814c8fb087ae2e778a41f122b71cdf79bd7927fff711adc546175b531572"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::walk_class (cognitive 24): JavascriptParser::walk_class has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcb69779f8e1b7ace67a96a638ad50acfc019c02438ba340d3c9ddb77592a48"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeInfoDB::set_symbol (cognitive 24): ScopeInfoDB::set_symbol has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 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":"crates/rspack_plugin_javascript/src/visitors/scope_info/semantic.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff0c72b7e327b56725a5dace0c05a5e6f1d14e3639b69b6962b6a844c6c9848"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::runtime_context::render_hot_update_chunk_runtime_modules (cognitive 24): rspack_plugin_javascript::runtime_context::render_hot_update_chunk_runtime_modules has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (6 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":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d291f5081257bd4274ad52184d5148dd28d733b891991c599988649bc8d832bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::is_valid_reg_exp_flags (cognitive 24): rspack_plugin_javascript::utils::eval::is_valid_reg_exp_flags has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 1 (3 pts), 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":"crates/rspack_plugin_javascript/src/utils/eval/mod.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2aeaf1e66a60c0c21f213ec9d01e0e40fd989d21bd02b1d76c52fa7c2beba3"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_mf::sharing::shared_used_exports_optimizer_plugin::dependency_referenced_exports (cognitive 24): rspack_plugin_mf::sharing::shared_used_exports_optimizer_plugin::dependency_referenced_exports has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (5 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":"crates/rspack_plugin_mf/src/sharing/shared_used_exports_optimizer_plugin.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"baee4c91bb45c7330c96b3ca736d96cdcefd8f61e3cdd2e05428e4c46fce16ab"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rsc::reference_manifest::build_server_manifest_per_entry (cognitive 24): rspack_plugin_rsc::reference_manifest::build_server_manifest_per_entry has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (8 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":"crates/rspack_plugin_rsc/src/reference_manifest.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"257a8e625124c76f79eebc656eabc1c36bc7bf5ff6b6ab0e859164ade874de93"}},{"ruleId":"D2","level":"warning","message":{"text":"cleverMerge.mergeEntries (cognitive 24): cleverMerge.mergeEntries has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 pts), boolean chains 1, match/switch 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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"02389d7c5544a6b9479ed371db97ae5051a9dea0168bc831b3ba8a867722895a"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::handle_at_keyword (cognitive 23): LexDependencies::handle_at_keyword has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (22 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f285b5ccdd18c3240552e23a4faf12eec674927d39333f1d555c273073cdde7"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::handle_semicolon (cognitive 23): LexDependencies::handle_semicolon has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (5 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3825}}}],"partialFingerprints":{"codehealthFindingId/v1":"da953c3b98526f4a0903551453a6603d3b2ed8db64141084ee14eb187a9c95c9"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeOptionBuilder::build (cognitive 23): NodeOptionBuilder::build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"96292e7f659157e7decc127df3a0f3ee7cfbf77abb07a59af66d3e39bf2b1a93"}},{"ruleId":"D2","level":"warning","message":{"text":"Chunk::has_async_chunks (cognitive 23): Chunk::has_async_chunks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (7 pts) (nesting depth added 11). Of this number, 13 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"794b918cbe4f1a1dedeeaea4596ffab033fd52948fba0d492e81c4fe5c3f500e"}},{"ruleId":"D2","level":"warning","message":{"text":"Chunk::get_child_ids_by_order (cognitive 23): Chunk::get_child_ids_by_order has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 pts), match/switch 2 (5 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":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"284479c5f41c14fc0ea5caeef2261adf399f1bc82850215194d28df531dc08da"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkGraph::integrate_chunks (cognitive 23): ChunkGraph::integrate_chunks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 6 (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":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba584eb8cbf892c6c1549cc88a52ad36896d98316287d1e0218598ae366b324"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcatenationContext::prepare (cognitive 23): ConcatenationContext::prepare has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (11 pts), 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":"crates/rspack_core/src/concatenation_backend.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d6a58843f765616009532252373af43fb556528a60d7e0e5550c975d549785"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::compilation::code_generation::code_generation_modules (cognitive 23): rspack_core::compilation::code_generation::code_generation_modules has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3 (4 pts), match/switch 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":"crates/rspack_core/src/compilation/code_generation/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4803431929cebd50ec2077792f0a9a22b3560fd08d4fb3fad1af57bf1485b09"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::compilation::create_chunk_assets::create_chunk_assets (cognitive 23): rspack_core::compilation::create_chunk_assets::create_chunk_assets has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (6 pts), match/switch 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":"crates/rspack_core/src/compilation/create_chunk_assets/mod.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce580dd359c96c12d6dc76f22a2531de5d64b69a9c37fd0d89aa67c90ad87079"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_loader_swc::rsc_transforms::server_actions::retain_names_from_declared_idents (cognitive 23): rspack_loader_swc::rsc_transforms::server_actions::retain_names_from_declared_idents has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 14). 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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7e89a9775cc40cc7d31c70776f2cb517862605e3ddb4240e04543c66d736b2"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_devtool::source_map_dev_tool_plugin::process_assets (cognitive 23): rspack_plugin_devtool::source_map_dev_tool_plugin::process_assets has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (6 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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8412396d0e814209df664b356a8d1a316dc1f21f92b3a89d4f79ee9073460fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::render_module (cognitive 23): EsmLibraryPlugin::render_module has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), match/switch 1 (4 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":"crates/rspack_plugin_esm_library/src/render.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"692e741316fc6a4d8d9c1a406930a2f073394d2a598dd74e8e26e54d07453cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"ESMImportSpecifierDependencyTemplate::render (cognitive 23): ESMImportSpecifierDependencyTemplate::render has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4846dffa60aa7212f2a20a30ca42a3a1f0d3c0eae0efb0fbcf87c41f50f603e"}},{"ruleId":"D2","level":"warning","message":{"text":"AMDDefineDependencyParserPlugin::process_array (cognitive 23): AMDDefineDependencyParserPlugin::process_array has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2273f6cd38ed808429ea3e82c30e086a1723414e71df9e5c36d97e98618d27ef"}},{"ruleId":"D2","level":"warning","message":{"text":"BasicEvaluatedExpression::as_string (cognitive 23): BasicEvaluatedExpression::as_string has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 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":"crates/rspack_plugin_javascript/src/utils/eval/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dbf3610ea56d05fa5f9952b62638a3044cf9907b5409be798abf8dc3d1a38c"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::build_plugin_drive (cognitive 23): JavascriptParser::build_plugin_drive has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 8 (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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10ad6ea969e582ca9df88a5b015924ad45101e40db990198cc5cad68c6002d1"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsumeSharedRuntimeModule::generate (cognitive 23): ConsumeSharedRuntimeModule::generate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 4 (6 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":"crates/rspack_plugin_mf/src/sharing/consume_shared_runtime_module.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"444d5f2fe229e2420b5e471ab1270c65c17113190908193d8aa6fa1b4d1e4d70"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_mf::manifest::asset::module_source_path (cognitive 23): rspack_plugin_mf::manifest::asset::module_source_path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 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":"crates/rspack_plugin_mf/src/manifest/asset.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"de463aae02c0e365071829a69e7b4b3531a060f74e6dbbb902196033346f75d2"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgressPlugin::default_handler (cognitive 23): ProgressPlugin::default_handler has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 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":"crates/rspack_plugin_progress/src/lib.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cf81a6322c94e6696fa1ea72ede9ccc7e06c40339379917a027b604737e35a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetData::compute_new_source (cognitive 23): AssetData::compute_new_source has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (5 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":"crates/rspack_plugin_real_content_hash/src/lib.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"769a09893e20531d63046abb170e92073ab237fac445b67b1f837baab54240cb"}},{"ruleId":"D2","level":"warning","message":{"text":"RscEntryModule::build (cognitive 23): RscEntryModule::build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (8 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":"crates/rspack_plugin_rsc/src/rsc_entry_module.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a86f05043b81716c0793170a81a8ed86ef10666437ccfb01428939f922eeff1"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_runtime::runtime_plugin::runtime_requirements_in_tree (cognitive 23): rspack_plugin_runtime::runtime_plugin::runtime_requirements_in_tree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, 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":"crates/rspack_plugin_runtime/src/runtime_plugin.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ff943c814e8287692eed93d1d645fba17159a9ff1d7a5cf109c7df564abfdd"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_watcher::ignored::glob_to_regexp (cognitive 23): rspack_watcher::ignored::glob_to_regexp has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, loops 2 (4 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":"crates/rspack_watcher/src/ignored.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2eddb6a54ce5fdb829b5f0ee21c121ceab46ca7c58bfef6b0b727798acfffc"}},{"ruleId":"D2","level":"warning","message":{"text":"SubresourceIntegrityPlugin.apply (cognitive 23): SubresourceIntegrityPlugin.apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 268, bindingHtmlHooks, a function literal at line 296). 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":"packages/rspack/src/builtin-plugin/SubresourceIntegrityPlugin.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ac8dde098280422b48fe25982893b922c176776cd8b40f104e29e14fbbd808"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::lex_local_keyframes_decl (cognitive 22): LexDependencies::lex_local_keyframes_decl 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"921908369045d1c42d98f09f87266be3bbb82538a6a14d9bde46c774e622f129"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::handle_right_parenthesis (cognitive 22): LexDependencies::handle_right_parenthesis has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":4049}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ca83c5206f66dfb67acac2af4ca1f8ab86892aab5818548bbf60a5b20748af"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::handle_left_curly_bracket (cognitive 22): LexDependencies::handle_left_curly_bracket has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":4398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbc48f6ebae0a093720226f7d087ce452b96a15639a81c542ba7ac8d1241c50"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStream::fast_forward_selector_if_buffer_empty (cognitive 22): TokenStream::fast_forward_selector_if_buffer_empty has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05404f11acdf11f466afe3ec6e7f7dc0db4fc1f6a288ad8bf3c9498151521ba"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack::builder::target::get_target_properties (cognitive 22): rspack::builder::target::get_target_properties has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 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":"crates/rspack/src/builder/target.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1869d4ce346ace0c58b9d3512bcccbcacc51a0b6ebd9d881c5ee25554fc8ae42"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::process_block (cognitive 22): CodeSplitter::process_block has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), boolean chains 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7040b13db30d5e832255d67d7736a52f01fc4b7f108f0eaac6b17d1f95c730b"}},{"ruleId":"D2","level":"warning","message":{"text":"FixIssuers::try_set_first_incoming (cognitive 22): FixIssuers::try_set_first_incoming has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (6 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":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/fix_issuers.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"950ae58f91b635b51dd63a25f0615f5599cb0f0a3a23e65e33507aaed3819038"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcatenatedModule::is_missing_star_export (cognitive 22): ConcatenatedModule::is_missing_star_export has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 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":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"63349087579b831bbf4c08bd013faa2653ea4faf08aab3678011947c05240385"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::context_module_factory::alternative_requests (cognitive 22): rspack_core::context_module_factory::alternative_requests has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 6 (9 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":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"3268eb82956c208904bbccbf59969c92468f7293c4f8a0b34c002b0e9b69baf0"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::stats::utils::get_chunk_child_ids_by_order (cognitive 22): rspack_core::stats::utils::get_chunk_child_ids_by_order has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 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":"crates/rspack_core/src/stats/utils.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"181e73994a94641c3a97528148436e7c9b8b9040b7c0c50a2e7d2769e1dda7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::utils::extract_source_map::extract_source_map (cognitive 22): rspack_core::utils::extract_source_map::extract_source_map has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/utils/extract_source_map.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9fe6a51c1d7f8820abec5dd8deeef614061c09205ff012eabe3dd7e3ecb828"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_ids::occurrence_chunk_ids_plugin::chunk_ids (cognitive 22): rspack_ids::occurrence_chunk_ids_plugin::chunk_ids has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (7 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":"crates/rspack_ids/src/occurrence_chunk_ids_plugin.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaba62b9df9311d9aa149bc8a7990d4f293408e02b3bdd635751230566c868a"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_css::css_syntax::decode_css_escapes (cognitive 22): rspack_plugin_css::css_syntax::decode_css_escapes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 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":"crates/rspack_plugin_css/src/css_syntax.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6339f734b897479039b3b05c3c8f04d228c50b09bfeea401263cd8401346e291"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_css::css_syntax::parse_escape (cognitive 22): rspack_plugin_css::css_syntax::parse_escape has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (3 pts), boolean chains 2, 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":"crates/rspack_plugin_css/src/css_syntax.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2b3f74137d55895b80b8c63468bc758c73add5359365f4981d0368abb2f3d8"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_esm_library::optimize_chunks::ensure_entry_exports (cognitive 22): rspack_plugin_esm_library::optimize_chunks::ensure_entry_exports has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 4 (9 pts) (nesting depth added 11). 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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"da388b05bccad6b536a7a5b4f68b6e9744a2005a7a9cbdcc3e64034901396ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"CssLoadingRuntimeModule::generate (cognitive 22): CssLoadingRuntimeModule::generate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4, 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":"crates/rspack_plugin_extract_css/src/runtime.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dc85dba9c588d80d7bb5fe3ac8b0ecda5ffa37538f3d5ffb7a4d9272336d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonJsExportsDependencyTemplate::render (cognitive 22): CommonJsExportsDependencyTemplate::render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (22 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":"crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_exports_dependency.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41c4888dd394b3ebd4d69c6c9badb15d91bfc8cfd115827796c1ee60321425f"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeStuffPlugin::identifier (cognitive 22): NodeStuffPlugin::identifier has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 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":"crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4edd46b51248742ee4a98ffb8dfd01ae81e597b69cb81fd6e45beeb3b217a30"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleConcatenationPlugin::try_to_add (cognitive 22): ModuleConcatenationPlugin::try_to_add has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 2, boolean chains 1, 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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f7e5d232ca042e974b16aafa2cd27e38c6574191bedf15174b7c82e8c1d229"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::walk_if_statement (cognitive 22): JavascriptParser::walk_if_statement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (21 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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"86da6efffc9bca7caf1c3e5297789921e1d651311b43a4c92856bc150c1b3aa5"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::plugin::side_effects_flag_plugin::can_optimize_connection (cognitive 22): rspack_plugin_javascript::plugin::side_effects_flag_plugin::can_optimize_connection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, 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":"crates/rspack_plugin_javascript/src/plugin/side_effects_flag_plugin.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b20cee6cd597498ad3f34cad3b88c8ae15586069512b404788abb7d4497e17"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rsc::client_plugin::record_chunk_group (cognitive 22): rspack_plugin_rsc::client_plugin::record_chunk_group 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":"crates/rspack_plugin_rsc/src/client_plugin.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1b57a73fd9f71014167a75b56356fd7ecd19bbbf7c217ae82164a8c7726a24"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rsc::server_plugin::group_client_entries_by_owner (cognitive 22): rspack_plugin_rsc::server_plugin::group_client_entries_by_owner 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":"crates/rspack_plugin_rsc/src/server_plugin.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d621ea49ab35d9caa1e1811880a7af82be2a806cda61367f7cd1d653b0a834e2"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rslib::plugin::render (cognitive 22): rspack_plugin_rslib::plugin::render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (9 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":"crates/rspack_plugin_rslib/src/plugin.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca7e1f793a028178a2407351f393b8b32bb132439ea165c9693e02240a22ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolveOptions::fmt (cognitive 22): ResolveOptions::fmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 22. 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":"crates/rspack_resolver/src/options.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ca9a305c076fbe88c68198656d567935049fa082b870518bbda39ac8b17bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"loadLoader.loadLoader (cognitive 22): loadLoader.loadLoader has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 3 (6 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":"packages/rspack/src/loader-runner/loadLoader.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1834cfb1a7f3c9149f7126a9bb7d95d4c94699c7f5059c10c34d06d58d84d69c"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.runSyncOrAsync (cognitive 22): utils.runSyncOrAsync has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, error handling 2 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 4 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":"packages/rspack/src/loader-runner/utils.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"716a05d81baf9f6423d55b2a013a601e74fa954e97c0a492eac197dc1bfee859"}},{"ruleId":"D2","level":"warning","message":{"text":"cleverMerge.serializeObject (cognitive 22): cleverMerge.serializeObject has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (8 pts), boolean chains 3 (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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5440e7ebd73bc8b3c4738ccb3c48618730b1265347561b4e840cea46f09713bb"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::compilation::runtime_requirements::runtime_requirements_pass_impl (cognitive 21): rspack_core::compilation::runtime_requirements::runtime_requirements_pass_impl has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (8 pts), match/switch 3 (6 pts), if/else 5, 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":"crates/rspack_core/src/compilation/runtime_requirements/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"874e2753e56153b63834463772ee486c097ef4fb1d12a86bd8694528bc708074"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::context_module_factory::visit_dirs (cognitive 21): rspack_core::context_module_factory::visit_dirs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, 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":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bce168ccab05da9366c1516aff8df646d4237f3e0fca578c65bb7b9cdf6fbea"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::utils::extract_source_map::trailing_source_mapping_url_range (cognitive 21): rspack_core::utils::extract_source_map::trailing_source_mapping_url_range has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/utils/extract_source_map.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c581ec555409583ed41fddd11294c05f9bd9ab6f04a052774e7ea17743e7ce"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_loader_runner::runner::run_loaders_impl (cognitive 21): rspack_loader_runner::runner::run_loaders_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_loader_runner/src/runner.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d31e7388f437c04513cd1032eef94fa8c04b93ad2e62a7d1d155ec66a2db71"}},{"ruleId":"D2","level":"warning","message":{"text":"CssModuleParser::ensure_local_definition (cognitive 21): CssModuleParser::ensure_local_definition has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3, 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":"crates/rspack_plugin_css/src/parser_and_generator/parser.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e06c9d0ba3674b3b5918c3b0bae0b547df9931410a1f0b392e3c8fe1855607"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_externals::plugin::factorize (cognitive 21): rspack_plugin_externals::plugin::factorize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 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":"crates/rspack_plugin_externals/src/plugin.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fe206af69f889e3544133c5de05bdaa1ce47fe9529ccf9aea3aa1aae5207a0"}},{"ruleId":"D2","level":"warning","message":{"text":"InnerGraphParserPlugin::block_pre_module_declaration (cognitive 21): InnerGraphParserPlugin::block_pre_module_declaration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbea3beb0f35abf3c603129e553cbdd61baaa858bb156bd42c4640bc1da8972"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::const::logic_expr::expression_logic_operator (cognitive 21): rspack_plugin_javascript::parser_plugin::const::logic_expr::expression_logic_operator has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 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":"crates/rspack_plugin_javascript/src/parser_plugin/const/logic_expr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f386c166e563cd1a281521eb1d5fe662f85e623ceaac21744cfff7d3a8de2d8"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::collect_defined_configured_side_effects_free (cognitive 21): rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::collect_defined_configured_side_effects_free has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d407f7ec26f924dfb119c63d37d1291feb62ffe3fe9f1bd7ca8c0b4ffb7f0f54"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetData::new (cognitive 21): AssetData::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_real_content_hash/src/lib.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed68234bff3c2741752992cf193c672f8c81bd95ff23be7c4bfd2a1adfe48899"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rsc::loaders::action_entry_loader::parse_action_entries (cognitive 21): rspack_plugin_rsc::loaders::action_entry_loader::parse_action_entries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (8 pts), loops 2 (5 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":"crates/rspack_plugin_rsc/src/loaders/action_entry_loader.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea917f531321873ef98d3f737e97b251fe9995afcd3b3514a82185e190d96eb"}},{"ruleId":"D2","level":"warning","message":{"text":"RstestPlugin::resolve_mock_request (cognitive 21): RstestPlugin::resolve_mock_request has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, match/switch 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":"crates/rspack_plugin_rstest/src/plugin.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00c013edca5212a17ab88418e30fbf4a1e18c537f076a2f56e562f0eb719724"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolverGeneric::package_imports_exports_resolve (cognitive 21): ResolverGeneric::package_imports_exports_resolve has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, 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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a676bbee67e2a24dd4898be41e5cebb27b6c6858b6d260fdb4d04744c77757"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportPlugin::transform (cognitive 21): ImportPlugin::transform has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 4 (7 pts) (nesting depth added 5). 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":"crates/swc_plugin_import/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"374622dc15c65d79f7eef93b75759eb53370ed5acc19efa579a1a4bf2c20c0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"RspackCLI.buildConfig::internalBuildConfig (cognitive 21): RspackCLI.buildConfig::internalBuildConfig has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 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":"packages/rspack-cli/src/cli.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"10921621551669f5777a0124a250b602c34ab2b373151ddbc7a3bb5161233a56"}},{"ruleId":"D2","level":"warning","message":{"text":"loader.pitch::handleExports (cognitive 21): loader.pitch::handleExports has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1 (2 pts), ternaries 2, error handling 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":"packages/rspack/src/builtin-plugin/css-extract/loader.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4737f2fc443445342d4cfdb27432182c41161acf4e68eb46ca92d0040237fd"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::process_chunk_groups_for_combining (cognitive 20): CodeSplitter::process_chunk_groups_for_combining has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (5 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd5e8c8a699a732bc3eb1c9a7e53878eef3787c403c4c39d195355243d44aea"}},{"ruleId":"D2","level":"warning","message":{"text":"Compilation::par_rename_assets (cognitive 20): Compilation::par_rename_assets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47c88f7435130e0625df44c6b7c212df44fa08bdf544267884567edfaf7b3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextModule::get_glob_source (cognitive 20): ContextModule::get_glob_source has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), 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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b00e3e1adaa4376262b6ce50e9082e20e6438d84312e82fc4e799856aad1ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextModule::get_source_string (cognitive 20): ContextModule::get_source_string has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), 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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1c208defaf4280a67ae5b27f07fce7fdf44a00c1bbd044b11b709d20933560"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextModuleFactory::resolve (cognitive 20): ContextModuleFactory::resolve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (6 pts), loops 2 (4 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":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"66efe0f80235b09e50a65f52b397bb2ab6ad1df477ad5ff9bf89f45eec59d429"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalModule::build (cognitive 20): ExternalModule::build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (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":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bad5b785483541014ecadf505e5056c8eafdb89ee3399fae679c6db45b47de"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::compilation::build_module_graph::graph_updater::expand_rebuild_modules (cognitive 20): rspack_core::compilation::build_module_graph::graph_updater::expand_rebuild_modules has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"138b72d26886001a312aa3957628b65e93fb4ea0d2bcf2d8f9b27722325e2096"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::new_cache::loader_cache::create_loader_cache (cognitive 20): rspack_core::new_cache::loader_cache::create_loader_cache has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), match/switch 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":"crates/rspack_core/src/new_cache/loader_cache.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2e363f1325485950c654d5fb7dc0596011e6b5b6dcd2f7c5e441de0db678eb"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::resolver::resolver_impl::map_rspack_resolver_error (cognitive 20): rspack_core::resolver::resolver_impl::map_rspack_resolver_error has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 12). Of this number, 10 points are the body\u0027s own statements and 10 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":"crates/rspack_core/src/resolver/resolver_impl.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdcfac6af51f81c4fb30539a35716ef238c56235516dbaf35faf64927c7f0fb"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphicalReportHandler::render_context (cognitive 20): GraphicalReportHandler::render_context has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (6 pts), boolean chains 3 (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":"crates/rspack_error/src/displayer/renderer/graphical.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"491cc57016a978a0f0b737d2205a5655de78c564f87a8f787164ae1133bc6f27"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_loader_runner::chain::plan_loader_chains (cognitive 20): rspack_loader_runner::chain::plan_loader_chains has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (9 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":"crates/rspack_loader_runner/src/chain.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"87471e6a4a1ef16785ba7d6ab8b5716299bb12b622871a8f40863ab9cd702999"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMapDevToolPlugin::use_new_cache (cognitive 20): SourceMapDevToolPlugin::use_new_cache has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed066db87ce0bad538b36426cc472ff548e37f8fbf075a99cdbad44911abb6f"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::get_external_import_source_and_binding (cognitive 20): EsmLibraryPlugin::get_external_import_source_and_binding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"3347cfec10341453e8f34c4c44c79b38d142d2d28e4a61be4a34bc98f9a571a5"}},{"ruleId":"D2","level":"warning","message":{"text":"RequireEnsureDependenciesBlockParserPlugin::call (cognitive 20): RequireEnsureDependenciesBlockParserPlugin::call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3 (4 pts), boolean chains 2, loops 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":"crates/rspack_plugin_javascript/src/parser_plugin/require_ensure_dependencies_block_parse_plugin.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"407fef12d8bd0ca08447c56d88b5ac45d0c45798586867612694c098b9774633"}},{"ruleId":"D2","level":"warning","message":{"text":"URLPlugin::new_expression (cognitive 20): URLPlugin::new_expression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 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":"crates/rspack_plugin_javascript/src/parser_plugin/url_plugin.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f84da79c67bba8a6813e1e3adc47e5fb45efbd465915ecd150d7b88018aed7"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleConcatenationPlugin::get_imports (cognitive 20): ModuleConcatenationPlugin::get_imports has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ddc0f68d442cd8495c05e4c955980cb365d8579d2675d9f3fcc6d0bacddf19"}},{"ruleId":"D2","level":"warning","message":{"text":"SideEffectsFlagPlugin::get_owning_side_effects (cognitive 20): SideEffectsFlagPlugin::get_owning_side_effects has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 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":"crates/rspack_plugin_javascript/src/plugin/side_effects_flag_plugin.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"208b45e5cbd5b04d225b2c956b7cb3d26002cacb9c6dc5f4e7f015f8e070553a"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::dependency::branch_guard::resolve_esm_imported_in_operator_guard (cognitive 20): rspack_plugin_javascript::dependency::branch_guard::resolve_esm_imported_in_operator_guard has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 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":"crates/rspack_plugin_javascript/src/dependency/branch_guard.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d5f9214f887407a1d4107708787780191e02d7aceb57eea2adc8698c6df17a"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_new_expr::eval_new_expression (cognitive 20): rspack_plugin_javascript::utils::eval::eval_new_expr::eval_new_expression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 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":"crates/rspack_plugin_javascript/src/utils/eval/eval_new_expr.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c68accb6bcebba8d766655b574e627d9dbe7a7ca574f8f6356b1aad6042cfa8"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_module_replacement::context_replacement::cmf_after_resolve (cognitive 20): rspack_plugin_module_replacement::context_replacement::cmf_after_resolve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_module_replacement/src/context_replacement.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f0ec1ac2ab10e98f260d18fb37357c1e3f2cf2c73125b51a78b29837305798"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_sri::manifest::available_chunks (cognitive 20): rspack_plugin_sri::manifest::available_chunks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), match/switch 1 (4 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":"crates/rspack_plugin_sri/src/manifest.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"839797ee860c46f2d2c7b0270ffb86a9cd2df86cf8a1bd82843a454597fcc2e0"}},{"ruleId":"D2","level":"warning","message":{"text":"CachedPathImpl::package_json (cognitive 20): CachedPathImpl::package_json has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 4 (6 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":"crates/rspack_resolver/src/cache.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"789e2e6670f1dc1ccae6acf5be548fae7a7b5640e261383c41151b2afd418ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolverGeneric::load_as_directory (cognitive 20): ResolverGeneric::load_as_directory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 12). 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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"247f4e69dc4a052772ca5a92f52dfa02002f7ca963825357a807c7a4300f4de3"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack.rspack (cognitive 20): rspack.rspack has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (2 pts) (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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":"packages/rspack/src/rspack.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"26da51b6d58dcc8032b4b9ae7a0f802b132a84aadb05a34121e06c3292b944cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Modules::visit_item_mod (cognitive 19): Modules::visit_item_mod has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 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":"crates/rspack_allocative_driver/src/source_tree.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7043038fbaf31845ae9e5a9a99f9732d018fc51beb5ca1813c35bd8e3e907e57"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeRequirementsDependencyTemplate::render (cognitive 19): RuntimeRequirementsDependencyTemplate::render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 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":"crates/rspack_core/src/dependency/runtime_requirements_dependency.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fe3c80875de8599961f11e7296c52ee179b585d85fc8d7d6674727c8c77023"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheContext::load_snapshot (cognitive 19): CacheContext::load_snapshot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/context.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eefc1767b205ac926b6862a3527a10cd7450573941f053d99f7b9c26524e62c"}},{"ruleId":"D2","level":"warning","message":{"text":"FileCacheStrategy::after_all_stored_impl (cognitive 19): FileCacheStrategy::after_all_stored_impl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/new_cache/file_cache_strategy.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25852dbaea139d31ca00ea3f3db81b43e877eb6e3146a295c1170dc0c8fa311"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::compilation::build_chunk_graph::code_splitter::prepare_module_connection_map (cognitive 19): rspack_core::compilation::build_chunk_graph::code_splitter::prepare_module_connection_map has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba9b6a77b9cfb5a159aecc56bd06f7f36ad11b3bf29832d8ebe3456e54adf31"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::exports::referenced_export::collect_referenced_export_items (cognitive 19): rspack_core::exports::referenced_export::collect_referenced_export_items has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/rspack_core/src/exports/referenced_export.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4aa08a35125d9552e528d14138c28f4cbe105e9055042a73274e853ecdc39d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::utils::fs_trim::trim_dir (cognitive 19): rspack_core::utils::fs_trim::trim_dir has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/rspack_core/src/utils/fs_trim.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff21bcbe975dc704bd3e7667c2f21161279d137116f67a655393a7f2a515b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerActions::visit_mut_function (cognitive 19): ServerActions::visit_mut_function has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3 (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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c08a213bbe6dc8a5ea27a07a525961d907636f264c6b60d3425d9486a7ff338"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectiveVisitor::visit_stmt (cognitive 19): DirectiveVisitor::visit_stmt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 1 (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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a3f57de631102765879c8c8728503aec0aae2bc9b5e6c7c0e5483f044f4dad"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_loader_swc::rsc_transforms::server_actions::detect_similar_strings (cognitive 19): rspack_loader_swc::rsc_transforms::server_actions::detect_similar_strings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"216b06ba4c4ab12c3f93510607002586c6ab8cde4001949108df83dacdb6b395"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmLibraryPlugin::resolve_re_export_star_from_unknown (cognitive 19): EsmLibraryPlugin::resolve_re_export_star_from_unknown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2b648e9dc8079556d539f2f34bccfd28428b14785d46ca55bd633df57959d4"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonJsImportsParserPlugin::require_handler (cognitive 19): CommonJsImportsParserPlugin::require_handler has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, 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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb5885af9232686e515201b4f791d7c40163a36e9142d94773a7250f1f9992b"}},{"ruleId":"D2","level":"warning","message":{"text":"WalkData::setup_record (cognitive 19): WalkData::setup_record has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, loops 4 (5 pts) (nesting depth added 1). None of this is in the body itself: all 19 points belong to 5 function items inside it that branch (apply_define, walk_code, apply_define_key, \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":"crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/walk_data.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc1293dec5af1d9a527f48caa0bda474fdf2e1342d9a527d94c190747716a24"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::_walk_iife (cognitive 19): JavascriptParser::_walk_iife has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 2, match/switch 2 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 5 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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f89e3a18844fd7343f9e3d3961289d82c5697a1c809322a7cb94c795b90f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::side_effects_analysis::class_has_side_effects (cognitive 19): rspack_plugin_javascript::parser_plugin::side_effects_analysis::class_has_side_effects has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, 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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_analysis.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"738183081c7dcc1b7933ae2c679853121e115b04df5f187a398f84b2600d0362"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_strict_equality_comparison (cognitive 19): rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_strict_equality_comparison has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9297d8ab6f531021e6b8abd640356f8a6928568be1cf0ac3c872d4539e58a0"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_mf::container::container_reference_plugin::factorize (cognitive 19): rspack_plugin_mf::container::container_reference_plugin::factorize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, loops 1 (2 pts) (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":"crates/rspack_plugin_mf/src/container/container_reference_plugin.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"126fcfe556efe111e6be1f5097f4943392a13674dd4104da61d503be35ed4f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rslib::url_external::cutout_url_externals (cognitive 19): rspack_plugin_rslib::url_external::cutout_url_externals has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 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":"crates/rspack_plugin_rslib/src/url_external.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba1c08e7e7ec887ef9f43ead6369b7fb845442dd7301259018da9dd69fbc08a"}},{"ruleId":"D2","level":"warning","message":{"text":"RstestParserPlugin::load_mock (cognitive 19): RstestParserPlugin::load_mock has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff69f657eb9aa4203cde5bc4e8dfb8a55683e71e69c5df4c46b9b082d5c7979a"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonpChunkLoadingRuntimeModule::generate (cognitive 19): JsonpChunkLoadingRuntimeModule::generate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5 (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":"crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dfb49b3d90cf50bf7cf6f344f6e92621bf7a90442add92661ea57dd2124764"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_runtime::helpers::get_all_chunks::add_chunks (cognitive 19): rspack_plugin_runtime::helpers::get_all_chunks::add_chunks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 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":"crates/rspack_plugin_runtime/src/helpers.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cdc36f5b5aee06ef9186423fb334e53702e909023fa58aa3bd15218a0a5a43"}},{"ruleId":"D2","level":"warning","message":{"text":"Algo::try_compile_to_end_with_fast_path (cognitive 19): Algo::try_compile_to_end_with_fast_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (7 pts), match/switch 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":"crates/rspack_regex/src/algo.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cd6fc468fffdae9f8822c9dbb05501186da1b897ed7097e532b18dd91d14e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Bucket::need_update_packs (cognitive 19): Bucket::need_update_packs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 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":"crates/rspack_storage/src/filesystem/db/bucket/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7d7dc107ebc86ee65ac3959936d1751f47b5b27d6068f7ed494a94db31dbde"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::wait_for_execute (cognitive 19): Executor::wait_for_execute has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (5 pts), match/switch 1 (4 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":"crates/rspack_watcher/src/executor.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ff033a01813cb22a15ccc8cd639322e0fc5ef14b870270d5c95dbbb1152b46"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_watcher::executor::create_execute_aggregate_task (cognitive 19): rspack_watcher::executor::create_execute_aggregate_task has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 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":"crates/rspack_watcher/src/executor.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0714c325d7bf7926c96690a4ac0f6909e4fa51ffddff573913369d527745defb"}},{"ruleId":"D2","level":"warning","message":{"text":"build.runBuild (cognitive 19): build.runBuild has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 3). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (errorHandler, errorHandler::getStatsOptions, a function literal at line 59, \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":"packages/rspack-cli/src/commands/build.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba80ebebdd7b2eeadf9cc6154731182da6aa4ae47b3bd272b5df7962dd28e12a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.getSwcLoaderOptions (cognitive 19): index.getSwcLoaderOptions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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":"packages/rspack/src/builtin-loader/swc/index.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"455f95348f2848405d784257eb6735db4d7585d0a694d7a4e3ba9bfa3f8ef769"}},{"ruleId":"D2","level":"warning","message":{"text":"findBaseCommit (cognitive 19): findBaseCommit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 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":".github/actions/binary-limit/binary-limit-script.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"16918b7435c21ed027efea99dfc48a1011df8c554081d5b85295158a88dc4482"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::classify_property (cognitive 18): LexDependencies::classify_property has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (18 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd281c5e88601d73f59279e102f46da7ecedfaadd867f10e4f196ebe2000a06"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::handle_pseudo_class (cognitive 18): LexDependencies::handle_pseudo_class has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"3087fe034ec579dffefa260b0a980ef62b075843d2d8d72da49ce3344ae6ab0b"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockItemCandidates::observe (cognitive 18): BlockItemCandidates::observe has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, match/switch 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css-module-lexer/src/parser.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1579c13b3915335381b52abe6084b525768473071472a00f16ebec5c9c54d3"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::process_outdated_chunk_group_info (cognitive 18): CodeSplitter::process_outdated_chunk_group_info 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":2406}}}],"partialFingerprints":{"codehealthFindingId/v1":"7427855014c1f881eb4296aef9f3e5eb2fefd620ea54f783c5cdfdf1296cc039"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportsInfoData::set_unknown_exports_provided (cognitive 18): ExportsInfoData::set_unknown_exports_provided has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 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":"crates/rspack_core/src/exports/exports_info_setter.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0f3a4ad33672d2bef38a2f85edc6f1b20c7dee17250ed7a485b93d4246da75"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalModule::code_generation (cognitive 18): ExternalModule::code_generation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (17 pts), 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":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b1ae0bb35792e49818f55ff49d0add52111c634a474022b15eedbf38b41891"}},{"ruleId":"D2","level":"warning","message":{"text":"RspackLoaderRunnerPlugin::process_resource (cognitive 18): RspackLoaderRunnerPlugin::process_resource has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 4 (8 pts) (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":"crates/rspack_core/src/loader/rspack_loader.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e37af1aa510132740acf24677db38028800d93ef965f534411e79c8cf56dd66"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleGraph::revoke_dependency (cognitive 18): ModuleGraph::revoke_dependency has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 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":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7147d096fccaadf4a90ebeb55c19a367e054cdaed51cc8ff1ecdbb8172d3f662"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::dependency::create_referenced_exports_by_referenced_specifiers (cognitive 18): rspack_core::dependency::create_referenced_exports_by_referenced_specifiers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 3, match/switch 1 (3 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":"crates/rspack_core/src/dependency/mod.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe823a57581bed0d89aba51768cf93e6b6df62bcd71436881bf095864a32d03"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::utils::extract_source_map::fetch_from_url (cognitive 18): rspack_core::utils::extract_source_map::fetch_from_url has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 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":"crates/rspack_core/src/utils/extract_source_map.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1347fd5376d2cbdffea30052e596637dbcaf231d3c65b545617dbde99dd7c8"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::utils::runtime::get_entry_runtime (cognitive 18): rspack_core::utils::runtime::get_entry_runtime has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/utils/runtime.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"38028f2015e9fe906b7660f9dc8693a6e0f9826dd1009bd74f1aa785f258433e"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_ids::sync_module_ids_plugin::revive_modules (cognitive 18): rspack_ids::sync_module_ids_plugin::revive_modules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, 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":"crates/rspack_ids/src/sync_module_ids_plugin.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d94df8bbd768efe216d10f9c7cb78f0d5443918988594c82076b061961f0ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerActions::visit_mut_arrow_expr (cognitive 18): ServerActions::visit_mut_arrow_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). 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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"942186547c7f13bcc4d4bcd70544ab6d91a51be4fbaf902c63ec5b99b9a9332a"}},{"ruleId":"D2","level":"warning","message":{"text":"CssModuleGenerator::render_css_dependencies (cognitive 18): CssModuleGenerator::render_css_dependencies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (7 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":"crates/rspack_plugin_css/src/parser_and_generator/generator.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f226656c74379791e4c72d40bb41f9dd25803f8c2f79e17b3a04ddf66a6589"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_dynamic_entry::make (cognitive 18): rspack_plugin_dynamic_entry::make has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 9). 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":"crates/rspack_plugin_dynamic_entry/src/lib.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8502b492a9fd9465273da81a1efa20d4918f9264931655c1006162723a0e4a79"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonJsImportsParserPlugin::finish (cognitive 18): CommonJsImportsParserPlugin::finish has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, match/switch 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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d0eda02bf57713e1a7e14b5cbd4b4ed704b6a6235cf51f63a083a8516191ed"}},{"ruleId":"D2","level":"warning","message":{"text":"RequireContextDependencyParserPlugin::call (cognitive 18): RequireContextDependencyParserPlugin::call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (18 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":"crates/rspack_plugin_javascript/src/parser_plugin/require_context_dependency_parser_plugin.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68a58e786dbf9a04942ef384655a26989f17c62d696289b041f659cb54b03b6"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::plugin::flag_dependency_usage_plugin::collect_active_dependencies (cognitive 18): rspack_plugin_javascript::plugin::flag_dependency_usage_plugin::collect_active_dependencies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), match/switch 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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4c0faf8e63bd802167cbc1f9d386d06f05ebbdf33fde6e6a0be70b1015192b"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::plugin::inline_exports_plugin::optimize_dependencies (cognitive 18): rspack_plugin_javascript::plugin::inline_exports_plugin::optimize_dependencies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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":"crates/rspack_plugin_javascript/src/plugin/inline_exports_plugin.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f654bdce5263b84158e74610dab4e95ad0c1c9191e63ac0ce253e5612934ceb3"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::runtime_context::render_chunk_runtime_modules (cognitive 18): rspack_plugin_javascript::runtime_context::render_chunk_runtime_modules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb507b12e69d9b80591cfaa1d1ab1c98c6f21c7e3404122814a6633f60912923"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_library::assign_library_plugin::render_startup (cognitive 18): rspack_plugin_library::assign_library_plugin::render_startup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), 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":"crates/rspack_plugin_library/src/assign_library_plugin.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"76865bd2bf4252dec68d2d89a9e82e91f9eea3df64b139937a2ccb468cb71569"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rsc::component_info::add_client_import (cognitive 18): rspack_plugin_rsc::component_info::add_client_import has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (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":"crates/rspack_plugin_rsc/src/component_info.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"816e67a99e00316b3fd52b0c21739c8814e4fe109c3ecb1df782f9b9fec7141f"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_runtime::helpers::generate_entry_startup (cognitive 18): rspack_plugin_runtime::helpers::generate_entry_startup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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":"crates/rspack_plugin_runtime/src/helpers.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c928762197f6c61890900b8564a36e027e3badc7354292a62b8ea7c66148cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitChunksPlugin::check_min_size_reduction_for_module_chunks (cognitive 18): SplitChunksPlugin::check_min_size_reduction_for_module_chunks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), match/switch 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":"crates/rspack_plugin_split_chunks/src/plugin/min_size.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5884616a872d0a171a77fd1e44e6e2ec1c1b42e40ccf7afcd1b3a0c48ed9b669"}},{"ruleId":"D2","level":"warning","message":{"text":"Combinator::prepare_direct_groups (cognitive 18): Combinator::prepare_direct_groups 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":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3996aa61bfe1644845bb7396d2fd52ca9e4407b30754bb3c1ef790e11875b0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.mkdirp (cognitive 18): fs.mkdirp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (18 pts) (nesting depth added 11). None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 669, 682, 677). 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":"packages/rspack/src/util/fs.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c5dd4e25936754620626e7be58255d53cbc13cabc11208ab0a752dde28d5dc"}},{"ruleId":"D2","level":"warning","message":{"text":"LexDependencies::handle_recovery_boundary (cognitive 17): LexDependencies::handle_recovery_boundary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 5, loops 1 (3 pts), match/switch 2 (3 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3758}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b9520c46d74ab8be994405c190ead158eda454a686c34a8651d7599bf9c276"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizationOptionsBuilder::build (cognitive 17): OptimizationOptionsBuilder::build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, match/switch 2, 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":3494}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f9df7829f253069ef2f80564a3cc050a257ec737ae05198ae8e03d3c146358"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_allocative_derive::derive_allocative::uses_enum_reflection (cognitive 17): rspack_allocative_derive::derive_allocative::uses_enum_reflection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_allocative_derive/src/derive_allocative.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9775e690687998fd6452f776d43065acb193a100f640a2dc064280a8627bdb8"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystemDependencies::values (cognitive 17): FileSystemDependencies::values has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/compilation/dependencies.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c427e502de5944974aba67a4e1ae1d7b5784ed9175c712468bc222e2365ecaed"}},{"ruleId":"D2","level":"warning","message":{"text":"RawSplitChunksOptions::normalize (cognitive 17): RawSplitChunksOptions::normalize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 1, 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":"crates/rspack_binding_api/src/raw_options/raw_split_chunks/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d61bf87578f1cce9619a1aa1bc37be0467ba375bd2dad619e2898ff3fcbcc8d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_binding_api::logging::run_dispatcher (cognitive 17): rspack_binding_api::logging::run_dispatcher has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 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":"crates/rspack_binding_api/src/logging.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62628d6c2f4ca2a55342a8ebdf8c0ba3778dfdf6014df06f38a6af2f7971265"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleTracker::finish_module (cognitive 17): ModuleTracker::finish_module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 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":"crates/rspack_core/src/compilation/build_module_graph/module_executor/module_tracker.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c273d4462d7000391767f355a893662280de1fa66533efd2c8000e70c71a2db9"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextModuleFactory::after_resolve (cognitive 17): ContextModuleFactory::after_resolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 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":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"996f411fa969d1649b59f1233d74d105398c0393edaf4cb4bdd94c96765e0b57"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportInfoData::set_used (cognitive 17): ExportInfoData::set_used has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (7 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":"crates/rspack_core/src/exports/export_info_setter.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d218e6bfe39d6526df2796b07e309e745cc888c94ea7ca77796ef519e0f479"}},{"ruleId":"D2","level":"warning","message":{"text":"OverlayIter::next (cognitive 17): OverlayIter::next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (5 pts), 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":"crates/rspack_core/src/module_graph/rollback/overlay_map.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"51511c4edc6654e65b137c8217f53d5aafd4981f2cd584e04e743ffc17a134b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::exports::target::find_target (cognitive 17): rspack_core::exports::target::find_target has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 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":"crates/rspack_core/src/exports/target.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fc0f7ee0ee828e8a388f3bb7394cba0da19222ed0e388d42fc99360cfc7619"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::options::output::get_undo_path (cognitive 17): rspack_core::options::output::get_undo_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 1 (4 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":"crates/rspack_core/src/options/output.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3af4d9fe620da22e1f0e2cea52c50b201803b6ce461545f78628e2380cd042"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFileSystem::read_dir_sync (cognitive 17): NativeFileSystem::read_dir_sync has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 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":"crates/rspack_fs/src/native_fs.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2de2c0c223bed826add86fde2bce3875584f70916182d68e80bf9a1423888ad"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_loader_runner::scheme::get_scheme (cognitive 17): rspack_loader_runner::scheme::get_scheme has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), loops 1 (nesting depth added 2). 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":"crates/rspack_loader_runner/src/scheme.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca8f152ecb4822d09fde83450361866ae33d61d2bde59e9de373c0cdc914976"}},{"ruleId":"D2","level":"warning","message":{"text":"CssPlugin::render_ordered_css_sources (cognitive 17): CssPlugin::render_ordered_css_sources has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 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":"crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba118eaa892e10a3f740d3f3e1b0ccc65b57ce259b64557c79e54c190b69bb26"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_devtool::eval_dev_tool_module_plugin::encode_uri (cognitive 17): rspack_plugin_devtool::eval_dev_tool_module_plugin::encode_uri has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 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":"crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"609575823678d8008abe5346806071fcf19f4876c7d21d5a45d2a18da9096d73"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonJsImportsParserPlugin::declarator (cognitive 17): CommonJsImportsParserPlugin::declarator 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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dd63d5b991b8ef580a1d20ed6534edc0b4f53a63468916a472086dbc52cd08"}},{"ruleId":"D2","level":"warning","message":{"text":"JsPlugin::render_rspack_require (cognitive 17): JsPlugin::render_rspack_require has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (17 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":"crates/rspack_plugin_javascript/src/plugin/runtime_context.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece8b7c0aa7ea891bdbdb7a04cf13501df0d967e908bf9225cfeae02e01c6648"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::extract_member_expression_chain_raw (cognitive 17): JavascriptParser::extract_member_expression_chain_raw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2dcce34de0cb8c6197ea109326f3e6d519d017fedcea17a09b7a1b5b6eb7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"JavascriptParser::enter_assignment_target_pattern (cognitive 17): JavascriptParser::enter_assignment_target_pattern has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"392833926ab60a357e7489ac1c9c18a1e1a84a25e51513838ae9d7b6721bfe90"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::resolve_explicit_side_effects_free_callee (cognitive 17): rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::resolve_explicit_side_effects_free_callee has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce513b36c77cbae550d5495bab632f9313d52036bcaaa35fdf9bd4f7051a655"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::worker_plugin::handle_worker (cognitive 17): rspack_plugin_javascript::parser_plugin::worker_plugin::handle_worker has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 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":"crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0ab46f44c2daa20652d38675adba7b01f35b5f1a32184208bea7fd019f9214"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_abstract_equality_comparison (cognitive 17): rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_abstract_equality_comparison has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"442a9e76777c7a0fb5f9abb083680c2ab6f81bad53d83795e7bd4c497d2d03c9"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_call_expr::eval_call_expression (cognitive 17): rspack_plugin_javascript::utils::eval::eval_call_expr::eval_call_expression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 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":"crates/rspack_plugin_javascript/src/utils/eval/eval_call_expr.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"46828108c0a410ec5e9e03c72c2c62060e2ab3c2a80c2d90f3b71210cda61538"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_unary_expr::eval_typeof (cognitive 17): rspack_plugin_javascript::utils::eval::eval_unary_expr::eval_typeof has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, 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":"crates/rspack_plugin_javascript/src/utils/eval/eval_unary_expr.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9107f22b623bf5aea31f2c834fa75284b1ce1a78fda585a4b3ee98127f4f9da"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rsc::client_plugin::collect_server_entry_css_files (cognitive 17): rspack_plugin_rsc::client_plugin::collect_server_entry_css_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"crates/rspack_plugin_rsc/src/client_plugin.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"745aef55fea0d203893afb31ccbcc7f93c30d02d2e389f45ca8fdbee2cf26edb"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_split_chunks::plugin::module_group::process_name_requests (cognitive 17): rspack_plugin_split_chunks::plugin::module_group::process_name_requests has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 1 (4 pts), boolean chains 2 (nesting depth added 9). 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":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"e424b4a81fb49c878882a80d9ff562fc4daa3a35e434d4d569d505de96c35eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_sri::html::process_tag (cognitive 17): rspack_plugin_sri::html::process_tag has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, 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":"crates/rspack_plugin_sri/src/html.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d970e34e2e66ec45058236dc2d0139acd474a14266e922df4b959387c2f8d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolverGeneric::package_resolve_in_dir (cognitive 17): ResolverGeneric::package_resolve_in_dir has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cc6d3b980654e021d7ea99ed454eebb5e2704bb2a42b16768535dd2decdd29"}},{"ruleId":"D2","level":"warning","message":{"text":"PathManager::set_context_entry (cognitive 17): PathManager::set_context_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"92318ac63c68ab0952fefb3dbfcb51a64f3536d9aa5de25c0273c97912d779fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::scan (cognitive 17): Scanner::scan 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":"crates/rspack_watcher/src/scanner.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b96b6766ac8da52a686735efaf70e1dc465b3889174d8045acf180bc84bc860"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_watcher::executor::create_execute_task (cognitive 17): rspack_watcher::executor::create_execute_task has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 2 (6 pts), loops 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":"crates/rspack_watcher/src/executor.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec0bb4dd9594ab1e0758886be51badb0906631da8f205a9851f16f67fb7630f"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack.wasi-browser.__attachCleanupErrors (cognitive 17): rspack.wasi-browser.__attachCleanupErrors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, error handling 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":"crates/node_binding/rspack.wasi-browser.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"096412668d0d1186b08c7e0a53d2c82326f6ba3c533c9d6789b48d8172c0f41b"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack.wasi-browser.__drainWasmEnvCleanup (cognitive 17): rspack.wasi-browser.__drainWasmEnvCleanup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 2 (4 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 5). Of this number, 9 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":"crates/node_binding/rspack.wasi-browser.js"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5490d3c479629a7c7ca8b35a6e8ebafe15ef18620d8d8accfc0bb4e7310a64"}},{"ruleId":"D2","level":"warning","message":{"text":"ContainerReferencePlugin.raw (cognitive 17): ContainerReferencePlugin.raw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (4 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":"packages/rspack/src/container/ContainerReferencePlugin.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a63f9cd1171d21d272a30bfc6259ba740881dc052aa332e598329f565942d0"}},{"ruleId":"D2","level":"warning","message":{"text":"check (cognitive 17): check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (5 pts), error handling 1 (nesting depth added 7). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 18, 47). 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":"packages/rspack/hot/dev-server.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8ba2355687fbdc9740dca999d40e9395582d3bbabc17e9cdfad23820c33c88"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::fast_forward (cognitive 16): Lexer::fast_forward has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (3 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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d90552d3ce06c7176c600da5d1d9e7bebfc2dbb26d882869f4fd2a9c78de92"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclarationCandidate::advance (cognitive 16): DeclarationCandidate::advance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, 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":"crates/css-module-lexer/src/parser.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"760405e909cbd9e9403904d432f0f2006456091cdc3230ef51803ce5093f2b50"}},{"ruleId":"D2","level":"warning","message":{"text":"Chunk::update_hash (cognitive 16): Chunk::update_hash has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d71cf45ba4666f49928f5e2f9b68a59152eed3856f7859ec9824e6c48388dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkGraph::get_chunk_entry_dependent_chunks_iterable (cognitive 16): ChunkGraph::get_chunk_entry_dependent_chunks_iterable has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 2 (7 pts), boolean chains 1 (nesting depth added 10). 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":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff21218aa8403a06c9f01b08aece121073c9ff38272d4d2c1d0b169df94ee717"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkGraph::can_chunks_be_integrated (cognitive 16): ChunkGraph::can_chunks_be_integrated has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"9306245f48ce095b0593cdb083863abffe10a38f3d75865d93fbb530feae796e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSplitter::process_chunk_groups_for_adding (cognitive 16): CodeSplitter::process_chunk_groups_for_adding has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 6 (7 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc094b141bf701da22abfbb2b97490fd766d9e224bd67fc6437910ecf0c4cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleSetLogicalConditions::try_match_sync (cognitive 16): RuleSetLogicalConditions::try_match_sync has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (5 pts), loops 2 (4 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":"crates/rspack_core/src/options/module.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b40fc53d0c4ee796e9231fee7d6f6f73ec734e9b93f67faa29f0a578cf89ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::compilation::create_module_assets::create_module_assets (cognitive 16): rspack_core::compilation::create_module_assets::create_module_assets has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (4 pts) (nesting depth added 8). 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":"crates/rspack_core/src/compilation/create_module_assets/mod.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b7b88909524b208079113625b6794eb47af86f90bfd4cf3f71df0b964401d0"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::external_module::resolve_external_type (cognitive 16): rspack_core::external_module::resolve_external_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (4 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":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5466d6e4568c8ecd861f66ee6986d29eeb3e5928b0da1c1766bcf0d07a08900"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_core::incremental::mutations::compute_affected_modules_with_module_graph (cognitive 16): rspack_core::incremental::mutations::compute_affected_modules_with_module_graph has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 4 (6 pts), loops 3 (nesting depth added 6). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/incremental/mutations.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5979a48280c30fbb28476a185294127ebff4912f76bd344608f6db346b8a25"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::get_value (cognitive 16): Context::get_value has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 3 (4 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":"crates/rspack_dojang/src/context.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea276e6998f21ba9b9c82cf644325942d8df517bbaa6d716938236a550c59717"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphicalReportHandler::render_causes (cognitive 16): GraphicalReportHandler::render_causes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts) (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":"crates/rspack_error/src/displayer/renderer/graphical.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c00e66be35b9b4499d88dc18d3d0aa71bc12f0d3c2e1f02c99afc038180cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphicalReportHandler::render_single_line_highlights (cognitive 16): GraphicalReportHandler::render_single_line_highlights has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (8 pts) (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":"crates/rspack_error/src/displayer/renderer/graphical.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7baf9addb4cfbd4cd0b5f071ffad655976d1470955264ca5d137f9981ffa81"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_ids::id_helpers::assign_ascending_chunk_ids (cognitive 16): rspack_ids::id_helpers::assign_ascending_chunk_ids has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (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":"crates/rspack_ids/src/id_helpers.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf59de1b5449e3b75ab71649edf5b1720e417f3e86e9e96399517f665694205"}},{"ruleId":"D2","level":"warning","message":{"text":"RealDependencyLocation::from_byte_location (cognitive 16): RealDependencyLocation::from_byte_location has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 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":"crates/rspack_location/src/lib.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4196795816e891ca8ee8c423b19c55bce2df03e9c9c2c3c4fac9f4d3af408089"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_circular_dependencies::circular_dependency_rspack_plugin::optimize_modules (cognitive 16): rspack_plugin_circular_dependencies::circular_dependency_rspack_plugin::optimize_modules has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 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":"crates/rspack_plugin_circular_dependencies/src/circular_dependency_rspack_plugin.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c929779b9864423a9b8496056d95474f48a851cad2c1873fe6d85c9707bdbc01"}},{"ruleId":"D2","level":"warning","message":{"text":"CssModuleParser::handle_dependency (cognitive 16): CssModuleParser::handle_dependency has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, match/switch 1 (nesting depth added 4). 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":"crates/rspack_plugin_css/src/parser_and_generator/parser.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4b2d37124e6c44151f8ce080380204b227afe61a5e7668f2d7dc8a750238d5"}},{"ruleId":"D2","level":"warning","message":{"text":"AMDRequireDependenciesBlockParserPlugin::process_array (cognitive 16): AMDRequireDependenciesBlockParserPlugin::process_array 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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f4a253478509d9258a7ac026155aba5b6003c5cfeb27b68c2ab9a3fd02ef63"}},{"ruleId":"D2","level":"warning","message":{"text":"FlagDependencyUsagePluginProxy::process_module (cognitive 16): FlagDependencyUsagePluginProxy::process_module 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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e40916064ae1b9f58de5856cc3806cadc6a89faa898b67a654ee78965de6f4"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::common_js_imports_parse_plugin::has_invalid_or_encoded_separator (cognitive 16): rspack_plugin_javascript::parser_plugin::common_js_imports_parse_plugin::has_invalid_or_encoded_separator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, 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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fac9cbec20d737f6737cba90c3c05cfde7c25830f48acf4060ae353ee14129d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::common_js_imports_parse_plugin::evaluate_create_require_argument (cognitive 16): rspack_plugin_javascript::parser_plugin::common_js_imports_parse_plugin::evaluate_create_require_argument has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5 (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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b6c182abcba5fd022b8d09f90e8725d0323111041c24b74c2fc28162b3db55"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::common_js_imports_parse_plugin::walk_unsupported_create_require_resolve (cognitive 16): rspack_plugin_javascript::parser_plugin::common_js_imports_parse_plugin::walk_unsupported_create_require_resolve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"029a195e4cdb3dbea3e0463135e400f2d377506b1f990711e1aef690bac7562d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::is_pure_expression (cognitive 16): rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::is_pure_expression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7a10f17a6c32d2327ca81258085fa4f3d5e82e2c0fe01edb47df3862ecda24"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::parser_plugin::worker_plugin::add_dependencies (cognitive 16): rspack_plugin_javascript::parser_plugin::worker_plugin::add_dependencies has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, match/switch 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":"crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e458d4979d94b6f167e8838d1650592b3e2a196fdf5fe2872bf66376191456"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_javascript::utils::eval::eval_cond_expr::eval_cond_expression (cognitive 16): rspack_plugin_javascript::utils::eval::eval_cond_expr::eval_cond_expression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/utils/eval/eval_cond_expr.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3fe44f286b10dca5df5041d96f931b06203c5346bd9ad7e84056f4834e8abd"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_library::export_property_library_plugin::finish_modules (cognitive 16): rspack_plugin_library::export_property_library_plugin::finish_modules has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), 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":"crates/rspack_plugin_library/src/export_property_library_plugin.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af4624d2e07ad431c6b91cd6fc9187f34f9b4795cd2d593fc3659cf541ceb6c"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_library::module_library_plugin::render_startup (cognitive 16): rspack_plugin_library::module_library_plugin::render_startup has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, 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":"crates/rspack_plugin_library/src/module_library_plugin.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeca0d8bab0db124e5e776e792bb55efe5e2b1350a0bc6d9b63332be27c272d"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_rsdoctor::module_graph::get_esm_export_imported_specifier_target_exports (cognitive 16): rspack_plugin_rsdoctor::module_graph::get_esm_export_imported_specifier_target_exports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (3 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":"crates/rspack_plugin_rsdoctor/src/module_graph.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"01941e3c07de199d992d40d03fa2f378b0fefd6598d53ab29812f53d867b764f"}},{"ruleId":"D2","level":"warning","message":{"text":"Group::pop_nodes (cognitive 16): Group::pop_nodes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (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":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44f37389944ad3e670a8d7d4880d9df740f89150f38b25d25759bbb92db9f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_plugin_split_chunks::plugin::max_size::remove_problematic_nodes (cognitive 16): rspack_plugin_split_chunks::plugin::max_size::remove_problematic_nodes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (3 pts), boolean chains 2 (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":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b8b7dfd24231c1c290fdbc63edd63e362f3f2cd7e5e1db1abb3612f73c1fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncWasmParserAndGenerator::generate (cognitive 16): AsyncWasmParserAndGenerator::generate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), 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":"crates/rspack_plugin_wasm/src/parser_and_generator.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8b159b625f1e59961e886c31e4cdc8ce8c027a8f1b257d4e082759eedbd3bb"}},{"ruleId":"D2","level":"warning","message":{"text":"rspack_util::location::byte_line_column_to_offset (cognitive 16): rspack_util::location::byte_line_column_to_offset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 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":"crates/rspack_util/src/location.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b06b31a43a441d00daa8d5a716683e2901324cc5ceee350c4344b29b6a1de9"}},{"ruleId":"D2","level":"warning","message":{"text":"Watching.#go (cognitive 16): Watching.#go has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 343, run, a function literal at line 332, \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":"packages/rspack/src/Watching.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb33bed3c2990cd05b6d5629ef314a559f039d5d13ac723fc6418c1773af866b"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.run (cognitive 16): Compiler.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (16 pts) (nesting depth added 3). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 8 function items inside it that branch (finalCallback, onCompiled, a function literal at line 604, \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":"packages/rspack/src/Compiler.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c160ce453e32f784ccb6052ab0305e7e09a72344d80f73f7745a74846aabfb"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleFederationPlugin.getRemoteInfos (cognitive 16): ModuleFederationPlugin.getRemoteInfos has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (nesting depth added 3). Of this number, 9 points are the body\u0027s own statements and 7 belong to 5 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":"packages/rspack/src/container/ModuleFederationPlugin.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"30574b318c1d27c3cbd29c6eeac4b8a6d11fdfdc0ce231e69a84492870d06c20"}},{"ruleId":"D2","level":"warning","message":{"text":"CssExtractRspackPlugin.normalizeOptions (cognitive 16): CssExtractRspackPlugin.normalizeOptions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 4 (5 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":"packages/rspack/src/builtin-plugin/css-extract/index.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89b1c563ab82c68ae418d561a778110eaa2e944e5d1e2d0ec42121c65ccab72"}},{"ruleId":"D2","level":"warning","message":{"text":"SubresourceIntegrityPlugin.processTag (cognitive 16): SubresourceIntegrityPlugin.processTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 1 (2 pts), error handling 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":"packages/rspack/src/builtin-plugin/SubresourceIntegrityPlugin.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9e7034178b3ce972634890896b4e401346d24bc6152d8b8c15bb961becc40d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JavascriptParser: TooManyMethods \u2014 230 methods, declared across 9 files: parser/walk.rs (100), parser/mod.rs (82), parser/walk_pre.rs (25), parser/walk_block_pre.rs (8), \u002B5 more file(s). The bar is 30 methods; this is 200 over it, 7.67\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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf87e9f9b5b584c1c0c498872ae2882c268809cd6214229a740d00f8592d80d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.runLoaders: FunctionTooLong \u2014 runLoaders runs 720 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 620 over it, 7.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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3096d105a2ce2440cb6d72b04bad8d22a15886463f4b779164ec674d62729f98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dependencies.rs: FileTooLong \u2014 3351 significant 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: LexDependencies (3 blocks, 1439-4712). The bar is 500 significant lines; this is 2851 over it, 6.70\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c5475887e5f0ec6bde9006b4486f5929e3f56f8e17df7615fafbc11200553c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LexDependencies: ClassTooLong \u2014 2422 significant 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, 3 blocks, lines 1439-4712. The bar is 400 significant lines; this is 2022 over it, 6.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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a754e6a5d9995c3cb0802755c0d9c79915d4aea0165841b966a13c5d483b915c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConcatenatedModule.code_generation: MethodTooLong \u2014 code_generation runs 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 470 over it, 5.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8adab46d628aff5fc288cced6803e00d2bc92f3b6d8056cb7dfeab33c6444e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_hmr::generate_hot_update: FunctionTooLong \u2014 rspack_plugin_hmr::generate_hot_update runs 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) in one body. The bar is 100 significant lines; this is 462 over it, 5.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_hmr/src/lib.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"168a81ec6ec1cc85304f6ff6b15ebe41d789c02c43a2dde008fa6f9e15691ec4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleConcatenationPlugin.optimize_chunk_modules_impl: MethodTooLong \u2014 optimize_chunk_modules_impl runs 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) in one body. The bar is 100 significant lines; this is 415 over it, 5.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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d84a52f41299a5f08b292b11e96002bfa784e9ecb602e14dd0a9c38d358f22"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BuiltinPlugin.append_to: MethodTooLong \u2014 append_to runs 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 414 over it, 5.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":"crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"2283477a4da56396fe6537e2d75ac4719c4f4d0c255fda0d85938ebb7ae2e38c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EsmLibraryPlugin.link_imports_and_exports: MethodTooLong \u2014 link_imports_and_exports runs 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 402 over it, 5.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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d9bf4a5a6cf4042c24304400cb2e32ebe0d829779aac6c03bca3c5c5c6afd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_mf::manifest::process_assets: FunctionTooLong \u2014 rspack_plugin_mf::manifest::process_assets runs 487 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 387 over it, 4.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":"crates/rspack_plugin_mf/src/manifest/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"be06e345e33b4b5b59c6a21d807f911a6be4acf5d60f2d1213a005a71fc82280"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/mod.rs: FileTooLong \u2014 2316 significant 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 1816 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec51272b9ed32d430df069f3294798a7bb47c14566ff223fe3cbb780db97943c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EsmLibraryPlugin.render_chunk: MethodTooLong \u2014 render_chunk runs 445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 345 over it, 4.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":"crates/rspack_plugin_esm_library/src/render.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da22651cf6dd8acd2b001cd4a5a624719cbea1b66cdd02618876185b073ed5a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CodeSplitter: ClassTooLong \u2014 1777 significant 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 377-2936. The bar is 400 significant lines; this is 1377 over it, 4.44\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae893e4716b15610e8d093acb0a6e88b45b94e422679078a209a26c7d73930b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_chunk_graph/code_splitter.rs: FileTooLong \u2014 2195 significant 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: CodeSplitter (2 blocks, 377-2936). The bar is 500 significant lines; this is 1695 over it, 4.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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a9fec668120b8ec6c93d08f68a2180bf2ad51b1d427c0d98acb08ab2c8f691"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/link.rs: FileTooLong \u2014 2179 significant 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: EsmLibraryPlugin (78-3154). The bar is 500 significant lines; this is 1679 over it, 4.36\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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7eeec2778c7c92ee9b8d977bb8c305bcae787783bb0033a502d1164d90c99c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser_plugin/common_js_imports_parse_plugin.rs: FileTooLong \u2014 2151 significant 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 66 free functions. The bar is 500 significant lines; this is 1651 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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5623addc3bc6685a8e63c9c152c1512fa29c1a99e2a0098eb1f969818e83188"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/concatenated_module.rs: FileTooLong \u2014 2075 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: ConcatenatedModule (7 blocks, 509-2811). The bar is 500 significant lines; this is 1575 over it, 4.15\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":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"399d5858448e4b9469917c47c7758cfc444fabf66ce4fd6d808f66a0485dc340"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SplitChunksPlugin.inner_impl: MethodTooLong \u2014 inner_impl runs 399 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 299 over it, 3.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2b5dd59c0bac6c777cddf60c1540af556735bdd7a32880c3c8dc046e8648aa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConcatenatedModule: ClassTooLong \u2014 1590 significant 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, 7 blocks, lines 509-2811. The bar is 400 significant lines; this is 1190 over it, 3.98\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":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"39434186649a0965988bd0a1fd200a4979b83591a57ca32a5dc852eb88b0d6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OutputOptionsBuilder.build: MethodTooLong \u2014 build runs 395 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f09d90f724259eeeb012ea7a9936da126c217bceca82ec28d17bd089056f732"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NormalModuleFactory.resolve_normal_module: MethodTooLong \u2014 resolve_normal_module runs 388 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 288 over it, 3.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"73783e6b04be15e90abaac091bd3127477d5f1e985fb0fb9162c1da64cb1bfa8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServerActions.visit_mut_module_items: MethodTooLong \u2014 visit_mut_module_items runs 354 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 254 over it, 3.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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b1f342ae9bd253f6bb9b5789db2b8a01aec32ab57b13641203da091aadc952"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ResolverGeneric: ClassTooLong \u2014 1405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 58 methods, 5 blocks, lines 135-2403. The bar is 400 significant lines; this is 1005 over it, 3.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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b3b74c5cb4d28d5a887d4eb00c417fb8d25a31488ac155fe5d6ff244e884be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExternalModule.get_source: MethodTooLong \u2014 get_source runs 340 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 240 over it, 3.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":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"d811c6b9beb14dd0501a8f17e2a625fd68e06762233b69b5d4c68a834cf2bea1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_core::compilation::create_hash::create_hash: FunctionTooLong \u2014 rspack_core::compilation::create_hash::create_hash runs 334 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 234 over it, 3.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":"crates/rspack_core/src/compilation/create_hash/mod.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"442dbe4b951bedca3b58abe706de19a0b261c7703e5019b9a436fbf01456e99f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rsc_transforms/server_actions.rs: FileTooLong \u2014 1654 significant 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: ServerActions (3 blocks, 147-1962). The bar is 500 significant lines; this is 1154 over it, 3.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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"875ac45750dec31440b31388f9b4a591f826fa77877a4b1dda3981e543fe4cdf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stats.get_module: MethodTooLong \u2014 get_module runs 329 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 229 over it, 3.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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2a64dfe6aee86d13ea5a7166183f28bd5aa78aaf31540205ef58ca603018b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/walk.rs: FileTooLong \u2014 1628 significant 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 98% of them inside a single declaration: JavascriptParser (37-2383). The bar is 500 significant lines; this is 1128 over it, 3.26\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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bac4f474a7751606510b1eee228d88c5fcfc9b23381671abc86428e0d12a416"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/module_concatenation_plugin.rs: FileTooLong \u2014 1595 significant 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 1095 over it, 3.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f50a9ee05521a3b8b6c8d16bc9ff494481b56c71065755195ee68c9ca4fd16e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/interceptor.rs: FileTooLong \u2014 1591 significant 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 1091 over it, 3.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":"crates/rspack_binding_api/src/plugins/interceptor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"373fb3c79bf57af8c8a30e770ceaeceb920abb352cb7caf8b472704d89bad5d5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Stats: ClassTooLong \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), 41 methods, 4 blocks, lines 125-1779. The bar is 400 significant lines; this is 872 over it, 3.18\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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0163c3f3501e9b28e9f6d1fd35456cb492a19cb0f962237881fac50b8c4f08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompilerOptionsBuilder.build: MethodTooLong \u2014 build runs 308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 208 over it, 3.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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a662544646b715aa36cd33a3f407275fafbbdc06ad9986ee7479dd2bac6566"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ESMExportImportedSpecifierDependency: ClassTooLong \u2014 1210 significant 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 52-1694. The bar is 400 significant lines; this is 810 over it, 3.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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"022850dfea6252828386871cabc96b07984b08ee488ccdec90ab3b87ec2c4e2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EsmLibraryPlugin.link: MethodTooLong \u2014 link runs 296 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 196 over it, 2.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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c681ffcbdd8ab9452320ac10ec62be16c8120839b121e9910823d3c28271bee6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SplitChunksPlugin.prepare_module_group_map: MethodTooLong \u2014 prepare_module_group_map runs 293 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc98f19a4388b321b30ed4b3fa3ba0981db210aa663dd90b1b6330dbeec9a4af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1457 significant 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 96% of them inside a single declaration: ResolverGeneric (5 blocks, 135-2403). The bar is 500 significant lines; this is 957 over it, 2.91\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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6ea1c9c5332c092dbf36cf5af3f03ab47e5845f1b289d01e3ba604af1d6f54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime_template.rs: FileTooLong \u2014 1407 significant 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 907 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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a515ed31b1bf402965bec4f8635e806c25c8dc7b28d381e5e7aec097c90deb72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_core::compilation::runtime_requirements::process_chunks_runtime_requirements: FunctionTooLong \u2014 rspack_core::compilation::runtime_requirements::process_chunks_runtime_requirements 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":"crates/rspack_core/src/compilation/runtime_requirements/mod.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"1643b9e01c5ea3133da7abd2ccd94501b206746dc5683d2d422b2bc4ef44d2c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_runtime::runtime_plugin::runtime_requirements_in_tree: FunctionTooLong \u2014 rspack_plugin_runtime::runtime_plugin::runtime_requirements_in_tree 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":"crates/rspack_plugin_runtime/src/runtime_plugin.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89f3c63a2256927c91e6cd04292bbb5a8a76eb92e8467241977caf2dfbc2085"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: esm/esm_export_imported_specifier_dependency.rs: FileTooLong \u2014 1404 significant 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 86% of them inside a single declaration: ESMExportImportedSpecifierDependency (6 blocks, 52-1694). The bar is 500 significant lines; this is 904 over it, 2.81\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68292ca6815cdce1556127022fcb4ae8b3d410b5c441aa3e1fc3a4b7910757a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stats/mod.rs: FileTooLong \u2014 1399 significant 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 91% of them inside a single declaration: Stats (4 blocks, 125-1779). The bar is 500 significant lines; this is 899 over it, 2.80\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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cc833668ca7085dfa1358273bb0ed667a8f26e24729ede2266fc89b0ae954f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_javascript::plugin::impl_plugin_for_js_plugin::compilation: FunctionTooLong \u2014 rspack_plugin_javascript::plugin::impl_plugin_for_js_plugin::compilation runs 278 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 178 over it, 2.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":"crates/rspack_plugin_javascript/src/plugin/impl_plugin_for_js_plugin.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"193cfb3a6ca7d8c26e6979b6ef6450cc6290cdea5c620c9ebc40c5dd0f14a7e8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ServerActions: ClassTooLong \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), 11 methods, 3 blocks, lines 147-1962. The bar is 400 significant lines; this is 704 over it, 2.76\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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"509166bdb4d7a9c09f0620b52a9d6f9ac845496fd736a378d5ffc501de0229b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/mod.rs: FileTooLong \u2014 1356 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: JavascriptParser (3 blocks, 472-1914). The bar is 500 significant lines; this is 856 over it, 2.71\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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"942be047ec2ffadf7dab283bb6c052142dc40149df968063cc75291e5e769743"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExecuteTask.main_run: MethodTooLong \u2014 main_run runs 268 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 168 over it, 2.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":"crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"69505acc0b1fdd06c8d24bb3967f2667ee12da93ea752b98cbbb787901197f63"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack::builder::browserslist_target::resolve: FunctionTooLong \u2014 rspack::builder::browserslist_target::resolve runs 267 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 167 over it, 2.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/browserslist_target.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7966575ccc5521e34569775eb688eda0c9987a6f7ed884b1f43137a607f7a763"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodeSplitter.make_chunk_group: MethodTooLong \u2014 make_chunk_group runs 264 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 164 over it, 2.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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"015cfef19e22a7c87150cbf0234fb3a1d49c98149ac1d0e7eb43d8a1caf14631"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JavascriptParser: ClassTooLong \u2014 1046 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 230 methods, 3 blocks, lines 472-1914. The bar is 400 significant lines; this is 646 over it, 2.62\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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"062eb19e62e694a507585fa367344f8ec2fa69252791ca256ed1c70408dc0911"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LexDependencies.lex_streaming_inner: MethodTooLong \u2014 lex_streaming_inner 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ba1fe14c35a10be6967f73abbf7d936f89dcfb9f76fb245b07125c17100d6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ESMExportImportedSpecifierDependency.add_export_fragments: MethodTooLong \u2014 add_export_fragments runs 260 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 160 over it, 2.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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68c3563bfd448ed1714f67cf3679efec865feef4c7a857a0db9e1d4b59a0e3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RspackOptionsApply.process: MethodTooLong \u2014 process runs 260 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 160 over it, 2.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":"packages/rspack/src/rspackOptionsApply.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3d80f3fdabb1f2104e837bc6b35dd7a3c1a396e1849fec8d5a1257c1f1d6eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context_module.rs: FileTooLong \u2014 1293 significant 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 793 over it, 2.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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c377272d7fe2164176ed094325fde56bc964f14ec4d0cbe14915cfb1fd4c413"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BasicEvaluatedExpression: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/utils/eval/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"468e6015bbd0d546aa956149ea6fbcc5b0580ea1e7de736eaa211c922045a308"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: options/module.rs: FileTooLong \u2014 1260 significant 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 760 over it, 2.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":"crates/rspack_core/src/options/module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b860e0b4e7f986c5e5e64dac2c5ab8d3e857915025a66e1797abf881bcc4555"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_swc_js_minimizer::process_assets: FunctionTooLong \u2014 rspack_plugin_swc_js_minimizer::process_assets runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 151 over it, 2.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":"crates/rspack_plugin_swc_js_minimizer/src/lib.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e7d370b4206ae9877d9d6b143387562e3d17689e86307d402ac6ee232f80cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChunkGraph: TooManyMethods \u2014 73 methods, declared across 3 files: chunk_graph/chunk_graph_chunk.rs (48), chunk_graph/chunk_graph_module.rs (24), chunk_graph/mod.rs (1). The bar is 30 methods; this is 43 over it, 2.43\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":"crates/rspack_core/src/chunk_graph/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0a895070c035568bb2e6a4f529cadffb0a2cd501aa0eb397b532a77018ce4f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Compilation: TooManyFields \u2014 73 stored fields beside 60 methods. The bar is 30 stored fields; this is 43 over it, 2.43\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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b3d593d74627368af7e241f7dc08a0221ed377655ed4cb61df0358c0564766"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConcatenatedModule.get_final_binding: MethodTooLong \u2014 get_final_binding runs 242 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19a8fe23be57dc944d1ef85baedd46253f6a606d9575954598155386cb3eafc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ModuleGraph: TooManyMethods \u2014 72 methods. The bar is 30 methods; this is 42 over it, 2.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":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"425f0317b537e6608cdc19cad287978376e88677a6082b47443f589994ec394e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImportParserPlugin.import_call: MethodTooLong \u2014 import_call runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 139 over it, 2.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":"crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c005a52b291878dc979e373d9f03d3c8213b89a80a3bd25890b33ba4c65114"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CommonJsImportsParserPlugin: ClassTooLong \u2014 951 significant 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 1600-2855. The bar is 400 significant lines; this is 551 over it, 2.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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebf4faa8316f1e1bb2998df2121bd18c55c88e4a3a3f07bdc04f10764ae72a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compilation/mod.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), about 71% of them inside a single declaration: Compilation (2 blocks, 213-1355). The bar is 500 significant lines; this is 680 over it, 2.36\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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a42c2ed18e4c4f4639c35b3da9c0dcb68c33fd08c566777d7a9075cffbb492f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_css_chunking::optimize_chunks: FunctionTooLong \u2014 rspack_plugin_css_chunking::optimize_chunks runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.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":"crates/rspack_plugin_css_chunking/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e083ca27bf88aeb3446a39feaad3cdf2ce082b7f02bac99e5cd2ce9cd01669bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/mod.rs: FileTooLong \u2014 1162 significant 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 662 over it, 2.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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d876e875867789d3f8842c582b53aa0783596c4cc4a2cb3bc642f7420bc9927d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EsmLibraryPlugin.link_entry_module_exports: MethodTooLong \u2014 link_entry_module_exports runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"472ecb7d8142eccface38a4628c63ba4e5ab12117c17119a9740d5bf4f766557"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LexDependencies: 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f28b6415eb8bca13e90b0b5332b678311e9a1570a92d910c55db4b4442e2b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/module_group.rs: FileTooLong \u2014 1132 significant 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 632 over it, 2.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":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42209a95ca7e74015e63f4af9f6cdaf4c179bd496df12f84372e67ea07ae8fe"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModuleConcatenationPlugin: ClassTooLong \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), 9 methods, 3 blocks, lines 439-1782. The bar is 400 significant lines; this is 490 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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f83a6063c8d58aecc9c8994a02c2c4b951d0d817aac40f0b89b7a2764858dc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RstestParserPlugin: ClassTooLong \u2014 889 significant 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 144-1438. The bar is 400 significant lines; this is 489 over it, 2.22\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":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb84eaa5add7c54880612e9e6d415f84bd12c3ddd8d6ec3fb4294cbfe3f6a767"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EsmLibraryPlugin.deconflict_symbols: MethodTooLong \u2014 deconflict_symbols runs 219 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 119 over it, 2.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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abe7d497dcc2c4e5865fcba5d52eb8ecd5d7e22814e723d3e83f5b27b437c05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_core::options::resolve::clever_merge::_merge_resolve: FunctionTooLong \u2014 rspack_core::options::resolve::clever_merge::_merge_resolve runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.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":"crates/rspack_core/src/options/resolve/clever_merge.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e41afdfa2271a2b6277fa2ee65d8ca5c789bb32f82a3850a77dbd088250546"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CommunityCompatibleTable.CommunityPluginCompatibleTable: FunctionTooLong \u2014 CommunityPluginCompatibleTable runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.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":"website/components/CommunityCompatibleTable.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4afcd1164e13cd9d3659a63121469ce8d7b702d442c7a08fb738aff253f35e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser_plugin/side_effects_parser_plugin.rs: FileTooLong \u2014 1077 significant 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 577 over it, 2.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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"178d954b6181af63a641d19052f2ad3b5f89620a21c4e357ad9c2aed53a31cd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/external_module.rs: FileTooLong \u2014 1072 significant 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 61% of them inside a single declaration: ExternalModule (5 blocks, 537-1438). The bar is 500 significant lines; this is 572 over it, 2.14\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":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d308f9e5dbf0c11b9fd7b599f40fcf8e9f8d478c7bb3ed2348eef3e95026d46"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssetParserAndGenerator.generate: MethodTooLong \u2014 generate runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.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":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d56d8eab951db05241a72c9c81f34d6f8d564ec0d6fa383852c2a698ae5097"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Compilation: ClassTooLong \u2014 835 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 60 methods, 2 blocks, lines 213-1355. The bar is 400 significant lines; this is 435 over it, 2.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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0971e170dcd9bb6fc0d804b0863306bd94971b8dde77165d1351c28261cb116d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChunkManifest.new: MethodTooLong \u2014 new 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":"crates/rspack_plugin_sri/src/manifest.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faf1ddaab57e0344003eb67a9b6ef9f8fbac0ac812d8f3f31de19fc5a8fdc21"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Compilation: TooManyMethods \u2014 60 methods, declared across 2 files: compilation/mod.rs (57), compilation/run_passes.rs (3). The bar is 30 methods; this is 30 over it, 2.00\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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"41193ec61f2771f3fb0232f8d29b2bee3c5f993cd3e51fe35985822963203bfd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CssModuleGenerator: ClassTooLong \u2014 800 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 3 blocks, lines 81-1145. The bar is 400 significant lines; this is 400 over it, 2.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":"crates/rspack_plugin_css/src/parser_and_generator/generator.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"278ffc6601d652f6472e9e1be075ee2358302cd3a1601ed6bae8f19b6cde0c31"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CopyRspackPlugin.run_pattern: MethodTooLong \u2014 run_pattern 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc48847d25b7b1a09db9d7aeb97ead93d0ac92dfe9fc94825d0be0b9eb0b8e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser_plugin.rs: FileTooLong \u2014 995 significant 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 89% of them inside a single declaration: RstestParserPlugin (3 blocks, 144-1438). The bar is 500 significant lines; this is 495 over it, 1.99\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":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c3aeb4f405c2575b8b21aacc9113453ee093198c8765521644e426f2df14c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SplitChunksPlugin.ensure_max_size_fit: MethodTooLong \u2014 ensure_max_size_fit runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"34de57d7a507f5137ee1ddac16a49ddae69ce7cd040ced22901daa7cb7a5933a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Chunk: 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":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"217ee1b6ef3be8d621a1afebdbe8ec98afa0bb22cd8de997f923bf1a1b57ffa3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack::builder::target::get_target_properties: FunctionTooLong \u2014 rspack::builder::target::get_target_properties 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":"crates/rspack/src/builder/target.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2e3f68e6e048f5c3de4840179b21f6811f34358e1e5abcb3d248e26b7f0276"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser_and_generator/generator.rs: FileTooLong \u2014 967 significant 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 83% of them inside a single declaration: CssModuleGenerator (3 blocks, 81-1145). The bar is 500 significant lines; this is 467 over it, 1.93\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":"crates/rspack_plugin_css/src/parser_and_generator/generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62123674af61a2dea229d6224a65a917e37920a090899116a85744e0811c4ea1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsCompilation: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.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":"crates/rspack_binding_api/src/compilation/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29f4aa324c623c7d77245bedacbffcfa8c347d6480a36dc9b71c4f2f9d46bec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ResolverGeneric: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd632d4b594b0e8188c2f0835627dbe4390a7014f8070d8d0ffc9b30287d00c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EsmLibraryPlugin.get_binding: MethodTooLong \u2014 get_binding 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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":2909}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32e692eadb214e23f19808612c5a7471fabae5ea06af2131f8d0e6ee46a732e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/source_map_dev_tool_plugin.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), about 69% of them inside a single declaration: SourceMapDevToolPlugin (3 blocks, 298-1349). The bar is 500 significant lines; this is 455 over it, 1.91\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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f24e3660b4ed57d94ae6d1ea08f850f5db3bfa82f42ff786045de6fab1eb8e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleChunkLoadingRuntimeModule.generate: MethodTooLong \u2014 generate runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ff6d00fe5b67fba70eb39c634a2311f5c1bb5b8adb97b587b56a1e24031f8c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OptimizationOptionsBuilder.build: MethodTooLong \u2014 build runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":3494}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e1d5c6b8c4fd6cdd4415e6260e442cc9bf222e37872b400dd91e7bb7a322a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JsCompilation: ClassTooLong \u2014 748 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 58 methods, 3 blocks, lines 49-1124. The bar is 400 significant lines; this is 348 over it, 1.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":"crates/rspack_binding_api/src/compilation/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"055e269029567f579d5725f4418fd123e99a5bc1da3a25310c53c2bebb8ede9f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CssLoadingRuntimeModule.generate: MethodTooLong \u2014 generate 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":"crates/rspack_plugin_css/src/runtime/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fcf82742900be03f0aac4007cc9007e6d40df69d4432e9fd21037635b10cc9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExportInfoData: TooManyMethods \u2014 56 methods, declared across 3 files: exports/export_info.rs (35), exports/export_info_getter.rs (12), exports/export_info_setter.rs (9). The bar is 30 methods; this is 26 over it, 1.87\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":"crates/rspack_core/src/exports/export_info.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f5658706f8a3446b252fe481014e83eb5884a2c7616da274d1b25122f82760"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsHooksAdapterPlugin.from_js_hooks: MethodTooLong \u2014 from_js_hooks 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":"crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cadfd9b5a9d3d8e69b6d04b2ab44b1ba3986cbeef60a4f6342eacb28189fb1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/stats.rs: FileTooLong \u2014 924 significant 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 424 over it, 1.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":"crates/rspack_binding_api/src/stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d5d990e564f4879678efe877142167a527741d4c5c3826cb38bf9f971caaae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: raw_module/mod.rs: FileTooLong \u2014 919 significant 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 419 over it, 1.84\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":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae1758bd488250a7ce7b3e17866410156b81660f519c1b62da96c225d6b1817"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModuleGraph: ClassTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 72 methods, 3 blocks, lines 162-1214. The bar is 400 significant lines; this is 335 over it, 1.84\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":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"04484d93681bf59f6e3c55561e3a9ddd5974a4d6b009ed1e4de98304749f9c65"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: JsHooksAdapterPlugin: TooManyFields \u2014 55 stored fields beside 2 methods. The bar is 30 stored fields; this is 25 over it, 1.83\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":"crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a9f4e9892059e4274029917a9670191004dc47ede68b9efb053f285ec2c64f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_javascript::runtime::render_module: FunctionTooLong \u2014 rspack_plugin_javascript::runtime::render_module 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":"crates/rspack_plugin_javascript/src/runtime.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecba057dc18032a5974ee90a31f7a0b7b776122062e317de180bcaef6db82d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GetChunkFilenameRuntimeModule.generate: MethodTooLong \u2014 generate runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.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":"crates/rspack_plugin_runtime/src/runtime_module/get_chunk_filename.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ccf13a067bc6d069809cd7c4a887bb2a65e949fbcd375ea3a2c5672ab3448a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: loader-runner/index.ts: FileTooLong \u2014 901 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: runLoaders (248-1258). The bar is 500 significant lines; this is 401 over it, 1.80\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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0191aa2b916b6929ff61554b53a0334ac6f239001838512240190d9b8177ba5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_runtime::module_chunk_format::render_chunk: FunctionTooLong \u2014 rspack_plugin_runtime::module_chunk_format::render_chunk runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.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":"crates/rspack_plugin_runtime/src/module_chunk_format.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebb54e6e1527db30f85fb49633810d4597f47839e61e4483aefdfbb9e9aac9d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RegisterJsTaps: TooManyFields \u2014 54 stored fields. The bar is 30 stored fields; this is 24 over it, 1.80\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":"crates/rspack_binding_api/src/plugins/interceptor.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8592dd6d491c8e43377914a8f99563448def1c75f2a3ad50fdd8886dee49fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/normal_module_factory.rs: FileTooLong \u2014 897 significant 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: NormalModuleFactory (3 blocks, 345-1304). The bar is 500 significant lines; this is 397 over it, 1.79\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":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9665fda6050becc943d135ad72fbf502e0eb1add4c1901f7b84b0d6debfad3de"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_real_content_hash::inner_impl: FunctionTooLong \u2014 rspack_plugin_real_content_hash::inner_impl 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":"crates/rspack_plugin_real_content_hash/src/lib.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d97fc68255657c7b8d2fe56188df2fb4b9aa2f4892162642557c1bc3f8e24d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/Compilation.ts: FileTooLong \u2014 893 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: Compilation (283-1228). The bar is 500 significant lines; this is 393 over it, 1.79\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":"packages/rspack/src/Compilation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63d9dc38c38b6426ab2320cfeb9314f3319302ec26c8151c9e4dc5f94186f7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LexDependencies.lex_composes: MethodTooLong \u2014 lex_composes runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f843b6b2595d51b22fa5e63148c61351fbab438e3296fcaa9939175d1bdd24a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConcatenationBindingResolver.resolve_inner: MethodTooLong \u2014 resolve_inner runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.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":"crates/rspack_core/src/concatenation_backend.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"12af77429d4e338ebd57461a07313371f4abb035a9aede62876a593ac52dadcb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: JavascriptParser: TooManyFields \u2014 53 stored fields beside 230 methods. The bar is 30 stored fields; this is 23 over it, 1.77\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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"772a37bd2e0e9ecdbbc5e0f1233c9ba1109305d252c1ea4f0d67ecc2d2d89041"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsHooksAdapterPlugin.apply: MethodTooLong \u2014 apply runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa03808de1b1f685667cd12c081d60b8e19852b83debbfd2daf48ec9b380f08"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_javascript::runtime_context::render_runtime_chunk_runtime_modules_sync: FunctionTooLong \u2014 rspack_plugin_javascript::runtime_context::render_runtime_chunk_runtime_modules_sync 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":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c28e24146ec63e2f6f9c1ca32a763c1cc050a068ad32087ccb654c6b769b43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RuntimeGlobals.renderRuntimeGlobals: FunctionTooLong \u2014 renderRuntimeGlobals runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/rspack/src/RuntimeGlobals.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2b74bb04b79de16d9c0753e9039edbb6de5eac38c4e3acbd788caee6cb3bfa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodeSplitter.split: MethodTooLong \u2014 split 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1e8e898460ccd7c53a15b79af67d9cd86a5727475633860e9c989f90b58e87"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OutputOptionsBuilder: ClassTooLong \u2014 690 significant 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, 4 blocks, lines 2175-3249. The bar is 400 significant lines; this is 290 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2521bcf710747c00bab5846652c3908c3a6e45e47fe706f90403fd13c946899a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compilation/mod.rs: FileTooLong \u2014 862 significant 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: JsCompilation (3 blocks, 49-1124). The bar is 500 significant lines; this is 362 over it, 1.72\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":"crates/rspack_binding_api/src/compilation/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1562f35bb5c7769d15788b4818ed7e29a8f494ee837f14bf3491c862eccadcd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_get_linking_error: FunctionTooLong \u2014 rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_get_linking_error runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8411d83501235dc17480db71ad93a5d3b8ae87d02cf0d0496f8e6ad115835c52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack::builder::default_rules: FunctionTooLong \u2014 rspack::builder::default_rules runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"be53448d249d830a579a43a07ae79ecd6864e1bd8d8d38391905067133bb4def"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SwcLoader.loader_impl: MethodTooLong \u2014 loader_impl runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_loader_swc/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c4ab7037588e570d159e7759e9dc3701b03046efc6fc493ca938caf3b67c6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_esm_library::preserve_modules::preserve_modules: FunctionTooLong \u2014 rspack_plugin_esm_library::preserve_modules::preserve_modules 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":"crates/rspack_plugin_esm_library/src/preserve_modules.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"860e7968f33e934704c9e19a36560cbc3ca840c919b69d48172df8f59ce3a125"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NormalModule.build: MethodTooLong \u2014 build runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/normal_module.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4e927d698730ac7a4026b0c1fbf2f7eb840eb8bfd26c87a992eba92bad4030"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RscServerPlugin.create_client_entries: MethodTooLong \u2014 create_client_entries runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rsc/src/server_plugin.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcff8d2f8d903466e1e66097dfd3cb2e7b50b895b1d248b409eab2e947491d18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AMDDefineDependencyParserPlugin.process_call_define: MethodTooLong \u2014 process_call_define 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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"de64e679853aa4eca74a9bb354d40b07cfffda21d7a78d92e188acfb5fecdf04"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonpChunkLoadingRuntimeModule.generate: MethodTooLong \u2014 generate 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":"crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3191d5994f637a32f8d0bbb82f676447822b7469e631a443f8f4f5dfdc8da1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 829 significant 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 329 over it, 1.66\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":"crates/rspack_plugin_hmr/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdb51f15a147ef12bb1d4e3b677136edcab3fd3a60a6e4ece31244de23d6e81"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Compiler: ClassTooLong \u2014 663 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 263 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":"packages/rspack/src/Compiler.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd873550a67d0de3242e94502440f205b9bd96abf892a1b8fe93b00529914068"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SourceMapDevToolPlugin: ClassTooLong \u2014 663 significant 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, 3 blocks, lines 298-1349. The bar is 400 significant lines; this is 263 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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a724011abf85b1dd23bb6fc03030fa1713157d44d0d019df1c7a01c65303353a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExternalModule: ClassTooLong \u2014 658 significant 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, 5 blocks, lines 537-1438. The bar is 400 significant lines; this is 258 over it, 1.65\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":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b952f7aa5ec7f3577240538e6bfbe6ba47c7fa597034009867f914640a4ca7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: module_graph/mod.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), about 90% of them inside a single declaration: ModuleGraph (3 blocks, 162-1214). The bar is 500 significant lines; this is 319 over it, 1.64\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":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"929a28665c2fb2c354274d36a0c7d7e3e2aca6bff34f3c5c9ca172864f07331a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodeSplitter.update_with_compilation: MethodTooLong \u2014 update_with_compilation 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":"crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0cc25960da819351c49aa9fe1538b8999d1282a4c79d319bff581e9ce82f1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LightningCssLoader.loader_impl: MethodTooLong \u2014 loader_impl 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":"crates/rspack_loader_lightningcss/src/lib.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"923c2868c12145a18f21430dd4a57ab4b6483e238f1ce4db694c9c552849d3b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_esm_library::split_chunks::split: FunctionTooLong \u2014 rspack_plugin_esm_library::split_chunks::split 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":"crates/rspack_plugin_esm_library/src/split_chunks.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"9615eea66f1fcf9e75028aa7161f0d2586c7d4b20e6916f286e803082478fcb0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContextModuleFactory.resolve: MethodTooLong \u2014 resolve 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":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27019143950327241f2ce3af6ba9681b543eaa069e4d69ab363298ffda96995"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FlagDependencyUsagePluginProxy.apply: MethodTooLong \u2014 apply 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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa7f384a5620583df6c2208e5d7412b46fee8a1493833f09644dc5ca0105c47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_javascript::plugin::side_effects_flag_plugin::optimize_dependencies: FunctionTooLong \u2014 rspack_plugin_javascript::plugin::side_effects_flag_plugin::optimize_dependencies 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":"crates/rspack_plugin_javascript/src/plugin/side_effects_flag_plugin.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"961d70a2bc75f8de4cbcfe82478da06f0bd4db7ef07a1989153c68726f3f078b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OutputOptionsBuilder: 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5ae3cb4650ae4e4ef90682ab9d649d755896c05e4753c64941d43141cfcf92"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Diagnostics.createDiagnosticArray: FunctionTooLong \u2014 createDiagnosticArray runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/rspack/src/Diagnostics.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b746b16f40cb2020d8aa24522db7bbb083b002e63b869a319e5d882ba606e8d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stats.get_chunks: MethodTooLong \u2014 get_chunks 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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ba9f43c4e41e8919a7a79abda466f1988a80bda84ca8fb0e6ec5b159925e46"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NormalModule: ClassTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 8 blocks, lines 97-1000. The bar is 400 significant lines; this is 234 over it, 1.59\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":"crates/rspack_core/src/normal_module.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df922794c390debf6a3365a924ce5fdc05be6a8cb7b1838c29e0d1852d4ee2e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InnerGraphParserPlugin: ClassTooLong \u2014 633 significant 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, 3 blocks, lines 49-990. The bar is 400 significant lines; this is 233 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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa99db128831a6f919ce3e1d36918b5b80816519e01f5b7dc0c9e239223c3bc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/module.rs: FileTooLong \u2014 791 significant 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 291 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":"crates/rspack_core/src/module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52e266d2725fa8f22b133cf7c530e412e8ebad26dc81f8d369e8ff0b67e2f6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_binding/rspack.wasi-browser.js: FileTooLong \u2014 790 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 290 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":"crates/node_binding/rspack.wasi-browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"524c76e550f41e4a998125bce75645d00d4a02792f7b052fb898cef2c1e3fb3b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InitializeEvaluating.evaluate_call_expression_member: MethodTooLong \u2014 evaluate_call_expression_member 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":"crates/rspack_plugin_javascript/src/parser_plugin/initialize_evaluating.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2611728f19c541fc8dcf2cc0f33ee7c388b21665853d50f915df8fb9462e6f62"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Chunk: ClassTooLong \u2014 631 significant 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 96-1036. The bar is 400 significant lines; this is 231 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":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"11671a7332ca799f335d295226153fa87dc0a2958f9b598be6baf059cc233fd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chunk_graph/chunk_graph_chunk.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 91% of them inside a single declaration: ChunkGraph (116-1139). 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":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc150a901152311d7f8f13e1c2450a0b357e12fb5fcb743f543fc34cd85aeac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: OutputOptionsBuilder: TooManyFields \u2014 47 stored fields beside 48 methods. The bar is 30 stored fields; this is 17 over it, 1.57\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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb270e273a4271459b989753629de5757ef718cd2a6cab3fe87ba1b1631c671"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: raw_builtins/mod.rs: FileTooLong \u2014 781 significant 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: BuiltinPlugin (2 blocks, 302-995). The bar is 500 significant lines; this is 281 over it, 1.56\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":"crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b448f8f0b345b5d653b58b9982443dd5546b2da8611cd8814166a96edc6d32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/Compiler.ts: FileTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: Compiler (142-1227). The bar is 500 significant lines; this is 280 over it, 1.56\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":"packages/rspack/src/Compiler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3624dcc8494e99692227fba6336f2943bd5636b969a3d201b1f85a72068bb0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JavaScriptParserAndGenerator.parse: MethodTooLong \u2014 parse 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":"crates/rspack_plugin_javascript/src/parser_and_generator/mod.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a9ad2d811a3ff47def6be69acdf6d832786174e73b3d9536432c0fcb13d46d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_ids::named_chunk_ids_plugin::assign_named_chunk_ids: FunctionTooLong \u2014 rspack_ids::named_chunk_ids_plugin::assign_named_chunk_ids 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":"crates/rspack_ids/src/named_chunk_ids_plugin.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b5bdd1968f56fd8c392cf9ea8c6abe960bf2235cbfef3dbf535df858c78a2a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FileSystemInfo: ClassTooLong \u2014 614 significant 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 116-1001. The bar is 400 significant lines; this is 214 over it, 1.54\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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b172268a73a000cd49d5c679da4fcbb075f6a6f6cf264e9cf6c7b4bb93e88d3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JavaScriptParserPluginDrive: ClassTooLong \u2014 612 significant 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 26-954. The bar is 400 significant lines; this is 212 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/drive.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20fcee8b4a19bc11ef84e5a3d4d4503d2b88d51f92eaa470478c4754ac32434"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/runtime_context.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). The bar is 500 significant lines; this is 261 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":"crates/rspack_plugin_javascript/src/plugin/runtime_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2fb74a366000032510acc8232bffc61ba7a8ad7ffe926f5c2102347c67f747"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RawSplitChunksOptions.normalize: MethodTooLong \u2014 normalize 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":"crates/rspack_binding_api/src/raw_options/raw_split_chunks/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5ca989f59b53c799356aaafb29fb0a1ae60ba6bc77dc9fcbced870adb051bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_javascript::visitors::dependency::context_dependency_helper::create_context_dependency: FunctionTooLong \u2014 rspack_plugin_javascript::visitors::dependency::context_dependency_helper::create_context_dependency 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":"crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"662ba99575f3bae8f0ebfd542f4fa87c8600818b7279dadfe3f88f1022347dda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snapshot/file_system_info.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), about 81% of them inside a single declaration: FileSystemInfo (3 blocks, 116-1001). The bar is 500 significant lines; this is 257 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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b35e9e54668fb6582401234f7e7a96cba86fecead90bb22f907ab73394a3d93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser_plugin/import_parser_plugin.rs: FileTooLong \u2014 745 significant 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 245 over it, 1.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":"crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29fcb0507ba867adc64c11d6b6bccec0622496cf37b7ab32a0c37a3a5771d35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_devtool::eval_source_map_dev_tool_plugin::render_module_content: FunctionTooLong \u2014 rspack_plugin_devtool::eval_source_map_dev_tool_plugin::render_module_content runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29c4c503fc705cbdaaab348b770f1e4b418c57552874561992a444329be66cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceMapDevToolPlugin.create_mapped_asset: MethodTooLong \u2014 create_mapped_asset runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9e7faafd442483fa6be7075842a73076ea5c6c952e3fbdf9f4b7c65254d844"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginCssExtract.sort_modules: MethodTooLong \u2014 sort_modules runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/rspack_plugin_extract_css/src/plugin.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0540ab0dcbee24153b3962c0f4b469b8b60aa153c876b06d6e1aa57aff4c5b42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser_plugin/api_plugin.rs: FileTooLong \u2014 742 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 242 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/api_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d298429f36a0bc5ec5c7d25bf449a2a3e0287553edbaeebc1af6367c21345053"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LoaderContext: TooManyMethods \u2014 44 methods, declared across 2 files: src/context.rs (42), src/runner.rs (2). The bar is 30 methods; this is 14 over it, 1.47\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":"crates/rspack_loader_runner/src/context.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c7751fe7057d635bb6f0c99e1eba7f82bd50e157d601161932c9874265bf67"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RawOutputOptions: TooManyFields \u2014 44 stored fields. The bar is 30 stored fields; this is 14 over it, 1.47\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":"crates/rspack_binding_api/src/raw_options/raw_output.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b89285efdde08f4e04237c29650fabf02bc9d772ba844de8d6eab9e6210bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleGroup.update_candidate: MethodTooLong \u2014 update_candidate 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":"crates/rspack_plugin_split_chunks/src/module_group.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3684f25a70bc9a54b4f5180a60ed87f23939986321c435f542ea7088c47d1269"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AssetParserAndGenerator: ClassTooLong \u2014 579 significant 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 71-878. The bar is 400 significant lines; this is 179 over it, 1.45\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":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06af1fc66c16eb3fdd4e13727ad2d56af2ef3d9ebf00e8653202b851c70761e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 721 significant 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: AssetParserAndGenerator (3 blocks, 71-878). The bar is 500 significant lines; this is 221 over it, 1.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":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1409a1176eba53dddbca437a848418a350dd92634baaf5e2c5495ff816640f39"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LexDependencies.lex_value_at_rule: MethodTooLong \u2014 lex_value_at_rule 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e705511f19604476ac0eb81bf588100c5be8093ed11409c91925a16f016778a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodeSplitter.set_entry_runtime_and_depend_on: MethodTooLong \u2014 set_entry_runtime_and_depend_on 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"1496724a88e1ea79f2c980d3d4cffa2f62aa5b63dab47682d603051dd2220cdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/concatenation_backend.rs: FileTooLong \u2014 708 significant 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 208 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":"crates/rspack_core/src/concatenation_backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7836b4ceaaf529d20e9b107a8fe9dfdd8b7cf962709ab3a7748b42e7cffd4999"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/normal_module.rs: FileTooLong \u2014 708 significant 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 90% of them inside a single declaration: NormalModule (8 blocks, 97-1000). The bar is 500 significant lines; this is 208 over it, 1.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":"crates/rspack_core/src/normal_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11425ddd77ef76eb506b38b1364107c6b15f180f57b74bb7e43296c22de05876"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleConcatenationPlugin.try_to_add: MethodTooLong \u2014 try_to_add 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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9a7042d6d572a54406d910a9fe1430af5992aa155a4957bfe1b4f354884ca6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_core::utils::compile_boolean_matcher::items_to_regexp: FunctionTooLong \u2014 rspack_core::utils::compile_boolean_matcher::items_to_regexp 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":"crates/rspack_core/src/utils/compile_boolean_matcher.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1161e3844d1200ebd605ecd13366d9c6473fd38b3d49c6c98d3eda649d6e791d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: OutputOptions: TooManyFields \u2014 42 stored fields. 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":"crates/rspack_core/src/options/output.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d707da915e2b609571fb90b591d9ba69df1bcb88be362952f7258aca97ad9d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/chunk.rs: FileTooLong \u2014 695 significant 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 91% of them inside a single declaration: Chunk (3 blocks, 96-1036). The bar is 500 significant lines; this is 195 over it, 1.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":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f34159f06428d73e86342b13daa23187eb29e3a48d558ccca332b1c79677cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodeSplitter.prepare_entry_input: MethodTooLong \u2014 prepare_entry_input 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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"613e2923753ce6b9738f11d313d18c342aeb970608786f11e7a25a7a513a68e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \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). The bar is 500 significant lines; this is 193 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33ba81acc7db6d32168a067a7a0c11b6e25e9d78b27eaecb368cde85cb76528"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser_plugin/import_meta_plugin.rs: FileTooLong \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), about 61% of them inside a single declaration: ImportMetaPlugin (2 blocks, 309-934). The bar is 500 significant lines; this is 193 over it, 1.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":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e97bcc1e2d515041aa3bf07e41cdf9ff0fcd5a2eadb76450f76b0e61a8404f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_macros::runtime_module::impl_runtime_module: FunctionTooLong \u2014 rspack_macros::runtime_module::impl_runtime_module 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":"crates/rspack_macros/src/runtime_module.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4cdcc0dc20ca40b1f982d11c657440f1d368449fdbde87b8148160afe33397"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceMapDevToolPlugin.collect_tasks: MethodTooLong \u2014 collect_tasks 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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f708694af872a687a9735a6a57831453c6280d8274be527616e35893f6a676"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_split_chunks::plugin::intersections::collect_intersections: FunctionTooLong \u2014 rspack_plugin_split_chunks::plugin::intersections::collect_intersections 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":"crates/rspack_plugin_split_chunks/src/plugin/intersections.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5d6af938501286da18c48035593e3ba8bfd4ed8fb7cfb719c2b4520f7f532a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/module_graph.rs: FileTooLong \u2014 687 significant 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 187 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":"crates/rspack_plugin_rsdoctor/src/module_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b9a5ebd0ff6c6e903af65deed52f7a3c9ed35ce88690f9b0b8216448c46bbc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BuilderContext.take_plugins: MethodTooLong \u2014 take_plugins 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":"crates/rspack/src/builder/builder_context.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1fd4a4bfa7d702218372193027bfddd8070f77f5bf6bb0772b80fd3c9b4657"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsCompiler.new: MethodTooLong \u2014 new 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":"crates/rspack_binding_api/src/lib.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2ef1058c5503be55037e34ed6d5fe0c166be87629e5637b5267b8ca5bc1a71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodeSplitter.invalidate_chunk_group: MethodTooLong \u2014 invalidate_chunk_group 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":"crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b15127f9693301aff48a9eb6c5436a5b0c366ea654106d777bae9b1fa05cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Stats: 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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"354ded537fbdc9f9357ff3292f32066e7b9ff79c5f7cb6630477e93775588d60"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CssModuleGenerator: 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":"crates/rspack_plugin_css/src/parser_and_generator/generator.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"690fddf4070632a0087de941fd53a7eee43bdcb34f4adb505af1ba47a1f701e1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphicalReportHandler: ClassTooLong \u2014 542 significant 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 30-795. The bar is 400 significant lines; this is 142 over it, 1.36\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":"crates/rspack_error/src/displayer/renderer/graphical.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82dd5048e76bc1325c6d51487edb4fcdb05b9fcdda9d5e328098d8c2e13ddd8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JsHooksAdapterPlugin: ClassTooLong \u2014 542 significant 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, 4 blocks, lines 20-769. The bar is 400 significant lines; this is 142 over it, 1.36\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":"crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adf4e22097ae7a14f45bb038c9dbb14f1c2e164e9bfb3b1e581a71bba1fe655"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CopyRspackPlugin.analyze_every_entry: MethodTooLong \u2014 analyze_every_entry 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e85c9ec698467823a6f79ab403e1ce537ec1166b10af6d663c1190b4067aa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plugin.rs: FileTooLong \u2014 671 significant 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 171 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":"crates/rspack_plugin_esm_library/src/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a521a2352bb7bd184c7113ba85ff9d256808c9c4d0006b4786d3680cf9bc33ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inner_graph/plugin.rs: FileTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: InnerGraphParserPlugin (3 blocks, 49-990). The bar is 500 significant lines; this is 170 over it, 1.34\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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e1dac7d626343ef12b64348cc13166a63abed419259c2d1744af087be88ef2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NormalModuleFactory: ClassTooLong \u2014 534 significant 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, 3 blocks, lines 345-1304. The bar is 400 significant lines; this is 134 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":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7cf3ab8b6889fc823251579e6297c7218c175f219c3574cf70c85f32903e27"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CodeSplitter: TooManyFields \u2014 40 stored fields beside 39 methods. The bar is 30 stored fields; this is 10 over it, 1.33\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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e342684a3d91ad677ba4dcffe70381a693c12c4d4adc70ff97017147bfbab6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/paths.rs: FileTooLong \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), about 76% of them inside a single declaration: PathManager (3 blocks, 280-1171). The bar is 500 significant lines; this is 164 over it, 1.33\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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a583f6fac28d6faa01a32f6d83cf5aa85e0fa753cd3edb8b32d040c8f9ef0d0f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WalkData.setup_record: MethodTooLong \u2014 setup_record 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":"crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/walk_data.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3bcd4c3e53dcfbd5a5c93c7103b95d75c98d96f1caf002970202f5c323522a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/js_hooks_plugin.rs: FileTooLong \u2014 657 significant 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: JsHooksAdapterPlugin (4 blocks, 20-769). The bar is 500 significant lines; this is 157 over it, 1.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":"crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfcc9544f81abfd9a326355764560191aeaad4918dc2e3e9659bfef67a82414"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_core::resolver::resolve_for_error_hints: FunctionTooLong \u2014 rspack_core::resolver::resolve_for_error_hints runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/resolver/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1346219207c41819414008f0dbde62fcd730106d68d856408e5b810e3fc2519a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stats.get_assets: MethodTooLong \u2014 get_assets runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded6165f39e5fa37bf11c6c8eaa32fb9e8e11dda8273ffee333e33454f9f2136"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginCssExtract.render_content_asset: MethodTooLong \u2014 render_content_asset runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_extract_css/src/plugin.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaefe40de7b4c58dcab0750984c15a10706d5976a6b95c54a4bb94b12e03260"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultiCompiler.#runGraph: MethodTooLong \u2014 #runGraph 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":"packages/rspack/src/MultiCompiler.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc34f0038d48ce9307f9e3310fc071d9458ac79cf88ba261c7f804edb5ffebb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/graphical.rs: FileTooLong \u2014 652 significant 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 83% of them inside a single declaration: GraphicalReportHandler (5 blocks, 30-795). The bar is 500 significant lines; this is 152 over it, 1.30\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":"crates/rspack_error/src/displayer/renderer/graphical.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52cc1ce32ba0037f49d8ed0afdf7a9a8dd026c1d66772699d60e08193baec2b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodeSplitter: TooManyMethods \u2014 39 methods, declared across 2 files: build_chunk_graph/code_splitter.rs (30), build_chunk_graph/incremental.rs (9). The bar is 30 methods; this is 9 over it, 1.30\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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5853883d28d8836d4bef9c16b5490637e344eebd99e0acf4ef3495b5df44d8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_core::compilation::code_generation::code_generation_modules: FunctionTooLong \u2014 rspack_core::compilation::code_generation::code_generation_modules 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":"crates/rspack_core/src/compilation/code_generation/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"be95609b9925b7a092e5e3bbfc32f6973e5afa48ce330b4eb92a57442b2591fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ESMExportExpressionDependencyTemplate.render: MethodTooLong \u2014 render 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_expression_dependency.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"779578255695386c89e6b5f6161b3f12b7fdf86238bb85162be30050973d4adf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CompilationHooks: TooManyFields \u2014 39 stored fields. The bar is 30 stored fields; this is 9 over it, 1.30\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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e55f5d446d80fbb913d440b6f96e1fb0f053b445e0a4eefed3bf637c5445a5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BuiltinPlugin: ClassTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 2 blocks, lines 302-995. The bar is 400 significant lines; this is 119 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":"crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce4e343334de533d915bcf2c16afb781fe51b6a62a41dbf0fb5e35980701aab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_copy::process_assets: FunctionTooLong \u2014 rspack_plugin_copy::process_assets 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5b2a3bcea7fa48f4135c3865baa189d104e6c95dda6309919cf7675e01744a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_rstest::import_dependency::module_namespace_promise_rstest: FunctionTooLong \u2014 rspack_plugin_rstest::import_dependency::module_namespace_promise_rstest 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":"crates/rspack_plugin_rstest/src/import_dependency.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c4eb62a236cb3e94efda36eadc38a11d1cc11d1d96bdbc2fe41a10e7453efa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServeCommand.apply: MethodTooLong \u2014 apply 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":"packages/rspack-cli/src/commands/serve.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38c526039db9429b4b0bdf04535f9b93af5cd2eff93d384a706d47467e5fdbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SplitChunksPlugin.toRawSplitChunksOptions: FunctionTooLong \u2014 toRawSplitChunksOptions 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":"packages/rspack/src/builtin-plugin/SplitChunksPlugin.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4130db01355b1f97e4c4feabdaf59207436a15de6817945f928f09633ec6ed7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: loader.pitch: FunctionTooLong \u2014 pitch 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":"packages/rspack/src/builtin-plugin/css-extract/loader.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c6615ba19cddeb9ebd35e14c90802b55bb300a6b33e25f17a5b3d8b8d69ea5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser_plugin/drive.rs: FileTooLong \u2014 641 significant 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 95% of them inside a single declaration: JavaScriptParserPluginDrive (3 blocks, 26-954). The bar is 500 significant lines; this is 141 over it, 1.28\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":"crates/rspack_plugin_javascript/src/parser_plugin/drive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab311806a667c12b38682e7f4d007e4756eea5607f7831305ceba635083ad214"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LexDependencies.handle_ident: MethodTooLong \u2014 handle_ident 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"11979a5247a337de5b1cbbd3b64afcef77735ec5e096b3b5deccb069b18c0208"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plugin.rs: FileTooLong \u2014 637 significant 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 137 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":"crates/rspack_plugin_rstest/src/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac48fe46a8df1094bec7ac9ce47d4749129c5f29ea553bd562d6bedc77a5112"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EsmLibraryPlugin: TooManyMethods \u2014 38 methods, declared across 3 files: src/link.rs (30), src/render.rs (6), src/plugin.rs (2). The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/plugin.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ce3bdee55fd6837fbe6af7918aa29a768aeabd66f240e07736d08c4cf09dd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/init_fragment.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":"crates/rspack_core/src/init_fragment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a644ebe1d47d3f262379c5e075326d65ba1c6765916474c29676ed55113b93a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_core::compilation::create_chunk_assets::create_chunk_assets: FunctionTooLong \u2014 rspack_core::compilation::create_chunk_assets::create_chunk_assets 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":"crates/rspack_core/src/compilation/create_chunk_assets/mod.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"174da3f6e2a4f91ef7006dd73cfa47171e5fa255db82ce50cba33824a50e5bbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_javascript::parser_plugin::side_effects_analysis::may_have_side_effects: FunctionTooLong \u2014 rspack_plugin_javascript::parser_plugin::side_effects_analysis::may_have_side_effects 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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_analysis.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3497c0b8815d329d08ba9d84ace76fd3262db9dc7485a9ff6b6b8552fc54e241"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConsumeSharedRuntimeModule.generate: MethodTooLong \u2014 generate 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":"crates/rspack_plugin_mf/src/sharing/consume_shared_runtime_module.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cd73d34fc0278ebcdd3f94a33ed5ae2e4b18abba25b819d01489278082c5df"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PathManager: ClassTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 3 blocks, lines 280-1171. The bar is 400 significant lines; this is 103 over it, 1.26\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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0df2468ab35d88052109f543a8b0d4ba7b22810b3ef5048f2c6cdb660bd8adb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_mf::sharing::shared_used_exports_optimizer_plugin::optimize_dependencies: FunctionTooLong \u2014 rspack_plugin_mf::sharing::shared_used_exports_optimizer_plugin::optimize_dependencies 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":"crates/rspack_plugin_mf/src/sharing/shared_used_exports_optimizer_plugin.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc89a0dcf6edb323a2b3f0dc4fca44276984e25a2222548c2dd1e82670943fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: esm/esm_import_specifier_dependency.rs: FileTooLong \u2014 621 significant 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 121 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba12879c87381e09e9d1328b6a9f2c235c2b8294df32c943e3bf2411debc001a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EsmLibraryPlugin.mark_modules: MethodTooLong \u2014 mark_modules 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":"crates/rspack_plugin_esm_library/src/plugin.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bce03ed3d6b75ce6a1506055ac104e8e12382c9b25808ee5537add8afa17ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Compilation: 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":"packages/rspack/src/Compilation.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26bbfbc06ca413a0f33a518fea16068c162e6bd0010a6f28b6d03aea99c3d80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/flag_dependency_usage_plugin.rs: FileTooLong \u2014 616 significant 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: FlagDependencyUsagePluginProxy (2 blocks, 39-584). The bar is 500 significant lines; this is 116 over it, 1.23\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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"529728fdbe60991ea52aa80b46612bc0ba1dd909885eaa7c4dfe594d1b442cf8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compilation.constructor: MethodTooLong \u2014 constructor runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/rspack/src/Compilation.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cf3dd2ebd24424bea0532a75c9df2793545e715f6ad537b45093b66cdc6fac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_loader_swc::rsc_transforms::react_server_components::collect_top_level_directives_and_imports: FunctionTooLong \u2014 rspack_loader_swc::rsc_transforms::react_server_components::collect_top_level_directives_and_imports 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":"crates/rspack_loader_swc/src/rsc_transforms/react_server_components.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"34927c4896ed73dfffdc43650cd01458f895576b068ac79b8d1f274c55dd2867"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_rslib::isolated_dts::complete_isolated_dts_outputs: FunctionTooLong \u2014 rspack_plugin_rslib::isolated_dts::complete_isolated_dts_outputs 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":"crates/rspack_plugin_rslib/src/isolated_dts.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0eb701dd97b4321e7f44088c771e53ac3da4a6b96947b6f59d96b7a4daed3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: manifest/mod.rs: FileTooLong \u2014 607 significant 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 107 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":"crates/rspack_plugin_mf/src/manifest/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2b1be1e62c1c071774ab78fddaa8f52388bb2eff841007a05de44129f58f55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_apply: FunctionTooLong \u2014 rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_apply 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05e335355275c53f225d9f5169240afdbb7992a6af94ebf4933a5991f02b45c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/optimize_chunks.rs: FileTooLong \u2014 604 significant 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 104 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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7819f344e9933eb2bf103ac3f30571c851c15711d638ed9d2289fef25f553e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScopeInfoDB: TooManyMethods \u2014 36 methods, declared across 2 files: visitors/scope_info.rs (21), scope_info/semantic.rs (15). The bar is 30 methods; this is 6 over it, 1.20\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":"crates/rspack_plugin_javascript/src/visitors/scope_info.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2155a0937dd48c9d1670cb3c2dd09bb0dc3914b91d3b4ae830a0d2786327d663"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_add: FunctionTooLong \u2014 rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_add runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9080a6e7e2f5985a5525ec692c0f5fb6592a4e168387c9b27b0417e1fb62c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: smartGrouping.smartGrouping: FunctionTooLong \u2014 smartGrouping 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":"packages/rspack/src/util/smartGrouping.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfeeac2226c95c802e16e59f5a5bef05cd8014da1fffe55042e18d684daaa2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/fs.ts: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/util/fs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a52a75772fc6376a549b7f13db5377aab9700d54f56aae261493c3be53cb77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_ids::named_module_ids_plugin::assign_named_module_ids: FunctionTooLong \u2014 rspack_ids::named_module_ids_plugin::assign_named_module_ids 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":"crates/rspack_ids/src/named_module_ids_plugin.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c8c8a91143b6d46a4369a4f45667e27333c030bd47403b5a2b6f6183bc27ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EsmLibraryPlugin.analyze_module: MethodTooLong \u2014 analyze_module 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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc4e1f3c28077e5693c6ee4130f1a692f848248b18d32f13e68a92414601b3f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExternalsPlugin.handle_external: MethodTooLong \u2014 handle_external 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":"crates/rspack_plugin_externals/src/plugin.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb816c20efea5bfabc914c88e1fbce1d5df70125e21a48bda16d345fde03f9df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: options/filename.rs: FileTooLong \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). The bar is 500 significant lines; this is 87 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":"crates/rspack_core/src/options/filename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8012e3bcd9c9f3c45ed6051f7dd6b643168a60c44b35f54c76fa81aa01d1efff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ModuleCodeTemplate: 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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ca87a6eccd375d58e4bff66b56a64c2b12a6513c8dfb0697e25332af591e5c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PathManager: 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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8863751299ac0af38f0d6214e412f7e70f6ab8b0faf4523d5c211e1a4931c0ce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StatsModule: 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":"crates/rspack_core/src/stats/struct.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a19200b7ffcf748b8680d8e877f8a5f3f61ccb0923b58aa505e684c7c9d72b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/impl_plugin_for_js_plugin.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":"crates/rspack_plugin_javascript/src/plugin/impl_plugin_for_js_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab416eebfc70902fe0bd176234755c3f949d754221322cec0e170b55d2ba8ad2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleConcatenationPlugin.compute_incoming_modules: MethodTooLong \u2014 compute_incoming_modules 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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"3727747f670eb7d96636757ddde39fea587e92c4f4351f3f93d8a910dd480817"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/render.rs: FileTooLong \u2014 579 significant 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 90% of them inside a single declaration: EsmLibraryPlugin (86-848). The bar is 500 significant lines; this is 79 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"845af8a4b0a4a1ba2cbe79f119b7a4410d6aa9647db12ddc7822c7a45c945ff3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImportPlugin.visit_mut_module: MethodTooLong \u2014 visit_mut_module 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":"crates/swc_plugin_import/src/lib.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33f5d9979a7f9b4f5adad6f94c52b28d5ad3671cf2da8e820b7cf6cf858ba35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/magic_comment.rs: FileTooLong \u2014 574 significant 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 74 over it, 1.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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab53704180f61303cbb88e5b36ea38a2e37925dd317a5013283f82dc3a70304"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_chunk_graph/incremental.rs: FileTooLong \u2014 571 significant 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 90% of them inside a single declaration: CodeSplitter (60-842). The bar is 500 significant lines; this is 71 over it, 1.14\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":"crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcab89ab3423a6abe086965348e458f7ec68be5386f3510dd46b50bbe208ff3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_mf::container::hoist_container_references_plugin::optimize_chunks: FunctionTooLong \u2014 rspack_plugin_mf::container::hoist_container_references_plugin::optimize_chunks 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":"crates/rspack_plugin_mf/src/container/hoist_container_references_plugin.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3b70026ed1253727b0c2b6e409260215e79b223652282d0c31339d99aea76a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExportsInfoData: TooManyMethods \u2014 34 methods, declared across 4 files: exports/exports_info_getter.rs (13), exports/exports_info.rs (10), exports/exports_info_setter.rs (9), exports/export_info.rs (2). The bar is 30 methods; this is 4 over it, 1.13\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":"crates/rspack_core/src/exports/exports_info.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49fad2ea0b0c0c05f5d0751dea45e160e60d103111ed24296491a186f88763b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_core::resolver::resolver_impl::to_rspack_resolver_options: FunctionTooLong \u2014 rspack_core::resolver::resolver_impl::to_rspack_resolver_options 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":"crates/rspack_core/src/resolver/resolver_impl.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d85d38410f2dc24dadeda8144d2b5ec2eb5b52076e5b8c5adfebdcb67e3167"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FlagDependencyUsagePluginProxy.process_referenced_module: MethodTooLong \u2014 process_referenced_module 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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"47993b00d33b7333af4d07c51c4d6e030590b845baf073877f0bb231d700b3ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server_plugin.rs: FileTooLong \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). The bar is 500 significant lines; this is 61 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":"crates/rspack_plugin_rsc/src/server_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"173f847254a02eab6c82d072437354375dec75a9e761d7bb3cfb5fa3c2b9920b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/mod.rs: FileTooLong \u2014 560 significant 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: BasicEvaluatedExpression (3 blocks, 143-738). The bar is 500 significant lines; this is 60 over it, 1.12\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":"crates/rspack_plugin_javascript/src/utils/eval/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"186447894f60265d8ccb854cf52c090537aefe750a14cb28b8ac4d6d067fcc14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_core::utils::find_graph_roots::find_graph_roots: FunctionTooLong \u2014 rspack_core::utils::find_graph_roots::find_graph_roots 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":"crates/rspack_core/src/utils/find_graph_roots.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c084984a98f69c15ad7c3b301bd44835af0912b4e3d981964dee4f8cf61452"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_macros::string_enum::expand: FunctionTooLong \u2014 rspack_macros::string_enum::expand 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":"crates/rspack_macros/src/string_enum.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85510e7bf5d676dcac1fd1abd93f16176aa3139f4b401aea41b7e02d8ca470f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SplitChunksPlugin: 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), 20 methods, 4 blocks, lines 49-693. 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":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"94244e436d645af5f0eed9c5b9759c6e642374194ec11aabca326b037c961e9f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Compiler: ClassTooLong \u2014 445 significant 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, 2 blocks, lines 101-687. The bar is 400 significant lines; this is 45 over it, 1.11\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":"crates/rspack_core/src/compiler/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29d6b454e7880f758624edd247b9111cf3019e03df93a8e7882ab03e39792da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleOptionsBuilder.build: MethodTooLong \u2014 build 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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5d729f1d2e5bed3ae7637aa1c37eecb24ec9d00cd10bc651ad22a973fd754a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CompilerOptionsBuilder: ClassTooLong \u2014 442 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 3 blocks, lines 597-1354. The bar is 400 significant lines; this is 42 over it, 1.11\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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5725ccefadbe6264764ba9a1d2029cb0fd44275c8e1dc3c2e00a2cfe563125"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ESMExportImportedSpecifierDependency.get_mode_inner: MethodTooLong \u2014 get_mode_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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab3f806f27631fd94c65a72cf73019da315896400c52d3f6bb5b6ef09d6db99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_limit_chunk_count::plan_merges: FunctionTooLong \u2014 rspack_plugin_limit_chunk_count::plan_merges 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":"crates/rspack_plugin_limit_chunk_count/src/lib.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"475d7e32fc6c9f2676073357e7d43ec0f1004ab51ae572a2d8afe47cca29654c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plugin.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 49 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":"crates/rspack_plugin_extract_css/src/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb304a8611ffcce2ef13e13ccde638146ac88c17d83a743d88c0de5f5ce4d0e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsHooksAdapterPlugin.clear_cache: MethodTooLong \u2014 clear_cache 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":"crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabd0147f8d34d1498753891e5fadd3f31b00d433ecedb952907a9855bbdea21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compilation.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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fdfbafb3257d271d01ad1c9cc3ca7bce624d4d5665bf2e036d9bd27bfbfae1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServerActions.maybe_hoist_and_create_proxy_for_server_action_arrow_expr: MethodTooLong \u2014 maybe_hoist_and_create_proxy_for_server_action_arrow_expr 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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fc7badb828fb141515820d6bf4b6ed2b930628f12da6c0525d4e589f9a0fa9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ESMExportImportedSpecifierDependency.get_star_reexports: MethodTooLong \u2014 get_star_reexports 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7e6da174c918387c2a7fd041ef974aa2bc9fae2162d659d45d362fa28b6fe3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RstestParserPlugin.handle_rstest_method_call: MethodTooLong \u2014 handle_rstest_method_call 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":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e8f352189f73bade21de69b88240cba2abc9285462f794913df600b16369cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/module_group.rs: FileTooLong \u2014 542 significant 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: ModuleGroup (2 blocks, 134-749). The bar is 500 significant lines; this is 42 over it, 1.08\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":"crates/rspack_plugin_split_chunks/src/module_group.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de1174ea9c83b98887fd6f112353755f76e5c501d80966a2c9b5830365166f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ESMExportImportedSpecifierDependency.get_conflicting_star_exports_errors: MethodTooLong \u2014 get_conflicting_star_exports_errors 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dec3ec756ce9471594cca7b81c382b18b18914880606afed426c82a7b0dfbc9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ESMExportImportedSpecifierDependency.get_exports: MethodTooLong \u2014 get_exports 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51995fa209e52b120ca5ea8717cbb986940c752f2f58087254abf49f2fb7e34"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_lightning_css_minimizer::process_assets: FunctionTooLong \u2014 rspack_plugin_lightning_css_minimizer::process_assets 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":"crates/rspack_plugin_lightning_css_minimizer/src/lib.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb572befec47107086f68efdf949d535cd89626d1e6bfaa2a3945a4fc1e0b6a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExternalsPlugin.#getRawExternalItem: MethodTooLong \u2014 #getRawExternalItem runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/builtin-plugin/ExternalsPlugin.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27e3f6303b7725ea6a8f72e2a475bfa84bce85d5d098b4294a826a50b3fc5c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: esm/esm_import_dependency.rs: FileTooLong \u2014 538 significant 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 38 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6f3b42379db211ed1cadd828b37fab877370cfee3d761ee7071bbdc325f078"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/flag_dependency_exports_plugin.rs: FileTooLong \u2014 538 significant 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 38 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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3d4d1f69ee3fc9f74299676acad2340a9e3953e3bf88b111642345c3fbf171"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/side_effects_flag_plugin.rs: FileTooLong \u2014 538 significant 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 38 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":"crates/rspack_plugin_javascript/src/plugin/side_effects_flag_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3010ad4052425ea995f5af29658c889116645820bf5d26032fdef7fd9989cb21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 538 significant 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 38 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":"linting/rspack_collection_hasher/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"818ac252390509daec8f3864965b72f1fb530c845623ac917aa2aed591667575"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_ids::named_chunk_ids_plugin::chunk_ids: FunctionTooLong \u2014 rspack_ids::named_chunk_ids_plugin::chunk_ids 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":"crates/rspack_ids/src/named_chunk_ids_plugin.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"039d006c2cd69dda9b778596d9eefdd7c0d1a0ea625a5b72d175fc91c6d5e6be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_macros::ast_object::expand_ast_object_derive: FunctionTooLong \u2014 rspack_macros::ast_object::expand_ast_object_derive 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":"crates/rspack_macros/src/ast_object.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee68c14a943c5bcfa2f33cccd1cf0c6fdbecd91d1daf768a59acd8bc7ffb718"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleFilenameHelpers.create_module_filename_template_fn_ctx: MethodTooLong \u2014 create_module_filename_template_fn_ctx 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":"crates/rspack_plugin_devtool/src/module_filename_helpers.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89fec67780a7b4e3d4f7495cce68dad230cf08cfe4d9476447f286d791ef04f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_rsdoctor::plugin::optimize_chunk_modules: FunctionTooLong \u2014 rspack_plugin_rsdoctor::plugin::optimize_chunk_modules 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":"crates/rspack_plugin_rsdoctor/src/plugin.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"319e4841d9afc450552f00105cea01f7bdd4f36c96d3bad65f656f189deae1ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compiler.constructor: MethodTooLong \u2014 constructor runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/Compiler.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0036d9253bb4edf92e78362780f1521cfe12365dc6a56b1fc4574259817daec7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CompilerBuilder: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fe1934725aa1794a66a0829bb19eaaa9492faa06c55606a48568a46f2f1d9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RuntimeTemplate: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/RuntimeTemplate.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"13084792470f411d12b0a596712e1c6cf67c67d7991849f207e76cd252db616d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: loader-runner/worker.ts: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded), about 67% of them inside a single declaration: loaderImpl (70-586). The bar is 500 significant lines; this is 33 over it, 1.07\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":"packages/rspack/src/loader-runner/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f18941fa9c9160bb665efbc98b84d7aaec93be8b48255981faf1a94fe2f86bc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ImportMetaPlugin: ClassTooLong \u2014 426 significant 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, 2 blocks, lines 309-934. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"302699a9272917cc401d7e5c72fed8f6972fe9765532a21b03e20cdbfd984186"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: build.build: FunctionTooLong \u2014 build 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":"crates/node_binding/scripts/build.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf73bc5b9083f95886bee3a590a287489a5a9f98456a44108aa31479224c9d1b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModuleRule.try_from: MethodTooLong \u2014 try_from 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":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faa444ee987e3c000b4a3ef08b9a77e02b43c366951043c8933d67d7b770689"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rspack_plugin_javascript::runtime::render_runtime_module_sources: FunctionTooLong \u2014 rspack_plugin_javascript::runtime::render_runtime_module_sources 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":"crates/rspack_plugin_javascript/src/runtime.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee406b8a24180f640acdd1b4e8fcacfae601aa81de539871bf7bebcd7678a7dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/mod.rs: FileTooLong \u2014 529 significant 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 84% of them inside a single declaration: Compiler (2 blocks, 101-687). The bar is 500 significant lines; this is 29 over it, 1.06\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":"crates/rspack_core/src/compiler/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0939e9e5dfc812055563e9a78f38bc163051ec3c925c137eabbf028b15ac757b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context_module_factory.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":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06181b2cdcfbe1ce13d1d4f39cad85dddce97cba75af6f226f7493c919b43225"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.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":"crates/rspack_dojang/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb8d66f93f6e040344842d2d827f7354d0c678af8575bff6b963e17e6bd0512"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JavaScriptCompiler.minify: MethodTooLong \u2014 minify 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":"crates/rspack_javascript_compiler/src/compiler/minify.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b54b44e1a7e48b1177293327b049e1a1bd199724517afe6a7571ada53437e69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReadFileChunkLoadingRuntimeModule.generate: MethodTooLong \u2014 generate 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":"crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f501f6899716effb4754ad125928644ad6ef97b88b891021b437d875da3de412"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client_plugin.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). The bar is 500 significant lines; this is 24 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":"crates/rspack_plugin_rsc/src/client_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84b247cb26f08dd177c7fa48ce763738f4785c2fe3034f1ee7e4d620682f87e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser_plugin/worker_plugin.rs: FileTooLong \u2014 522 significant 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 22 over it, 1.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":"crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26382a970452ebeb2f8416b818d428f21acfb2170253bc41912a293ac0606a0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/id_helpers.rs: FileTooLong \u2014 519 significant 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 19 over it, 1.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":"crates/rspack_ids/src/id_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99cb6c87374e5e5c8eba60d9efb3dfa6fc8627b3a6ee5010e339da88a2ad95c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime_context.rs: FileTooLong \u2014 519 significant 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 19 over it, 1.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":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53a400652fb8d1387fc880e42f63b0bb807d63a2b13d27151c7b548bccb2c55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 517 significant 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 17 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":"crates/rspack_binding_api/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18de2a75c45a578ff97ea548fb2fdc7b263354afbc8ad7b66bcdb4872287b9f3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NormalModule: TooManyFields \u2014 31 stored fields beside 21 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":"crates/rspack_core/src/normal_module.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddd5d5f1a886cd7aeae6a72a6f1a9bb36732ded793a60b94a7e97f51e93a58f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: JavascriptParserOptions: TooManyFields \u2014 31 stored fields beside 3 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":"crates/rspack_core/src/options/module.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"255577fc0bd862a9efc79869d3f753fd349898f8e09c81e08afeaf6b69d17cf0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RawJavascriptParserOptions: 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":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b87124b4538529067f47503fcda4bdcd4e4dafaf47cf4259fdbf89aad9108a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_requirements/mod.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":"crates/rspack_core/src/compilation/runtime_requirements/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1c9bf964f1afbf84a6deaa92fd017335a0a092f2ed08758276debe5e051017"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/max_size.rs: FileTooLong \u2014 508 significant 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 8 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":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"725f69ca20bfed76895ff328d7ce9450f3df2e783d8017afe24d0361e5cea364"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/eval_binary_expr.rs: FileTooLong \u2014 506 significant 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 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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17255bcbbd8d6ba855ccd23c92b085f59d257f4bf48f282cf91eca892528e48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plugin.rs: FileTooLong \u2014 506 significant 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 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":"crates/rspack_plugin_rsdoctor/src/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5ef25743c5268e5723921b0fdfd54915a88d8c0fb3e5d4d02f225978124b4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RstestParserPlugin.load_mock: MethodTooLong \u2014 load_mock 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":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb81c7920dcfa6b9ac7eb19550e31e3cfe5e7bdf4258b9f94ff71112f1e9d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (80 shared lines): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:381-539 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:546-682 \u2014 These two members are variants of one another: 80 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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70e782cdff0074194a6660922541bf74475d6721a03fd7bbcc48ac4685a9ca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (79 shared lines): crates/rspack_core/src/stats/mod.rs:966-1047 | crates/rspack_core/src/stats/mod.rs:1049-1132 \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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"da802f2fe4cdfdc8ff90cfeb4dfa27ea4b560820049853bab85a5ff5f313add1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (73 shared lines): crates/rspack_binding_api/src/compilation/mod.rs:908-1002 | crates/rspack_binding_api/src/compilation/mod.rs:1012-1105 \u2014 These two members are variants of one another: 73 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":"crates/rspack_binding_api/src/compilation/mod.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f7c1ac7ad3650090afe3c35d07a73188d31e971d26400bd974cebdf82e2161"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (69 shared lines): crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:251-391 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:262-393 \u2014 These two members are variants of one another: 69 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":"crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9d06b1f81d888063a2c89c57fa967bfc61729ec16713663f00b2dc67a225d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (63 shared lines): crates/css-module-lexer/src/dependencies.rs:2845-2957 | crates/css-module-lexer/src/dependencies.rs:3044-3168 \u2014 These two members are variants of one another: 63 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4fbb0533f3122d003c89eed5a96cf89a928a933a556e3224928e1164f1afe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:542-602 | crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:609-666 \u2014 These two members are variants of one another: 44 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":"crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"603926cda204e660ae36460e5dfeeb267e0d50657474120e80d1ef1a654cddaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:285-346 | crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:360-415 \u2014 These two members are variants of one another: 41 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1417c4a69a9dade6430ae88ada59970fa78d15637d6bfe896110fca5e59e9795"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/rspack_plugin_library/src/amd_library_plugin.rs:94-170 | crates/rspack_plugin_library/src/assign_library_plugin.rs:149-186 | crates/rspack_plugin_library/src/jsonp_library_plugin.rs:77-109 | crates/rspack_plugin_library/src/umd_library_plugin.rs:377-396 | crates/rspack_plugin_runtime/src/runtime_module/auto_public_path.rs:42-79 | crates/rspack_plugin_runtime/src/runtime_module/utils.rs:113-142 \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":"crates/rspack_plugin_library/src/amd_library_plugin.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83fc60e70c549c8d44416423f67daa2a7286a1c56ff6e55e5cbe41221a2bd00"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs:150-184 | crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:183-230 | crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs:182-224 | crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:177-213 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:184-220 \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":"crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bbb71621f4373702cd75e7507a91ea464db1d5f6afc4b3f7db115747637c8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/rspack_binding_api/src/async_dependency_block.rs:144-173 | crates/rspack_binding_api/src/chunk.rs:380-409 | crates/rspack_binding_api/src/chunk_group.rs:223-252 | crates/rspack_binding_api/src/module_graph_connection.rs:224-254 \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":"crates/rspack_binding_api/src/async_dependency_block.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d78a88e234d2ad7a1280839ae45e43516be65a0c8a536c6ded10dd62360e302"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/rspack_binding_api/src/chunk.rs:95-104 | crates/rspack_binding_api/src/chunk.rs:129-139 | crates/rspack_binding_api/src/chunk.rs:142-151 | crates/rspack_binding_api/src/chunk.rs:207-216 \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":"crates/rspack_binding_api/src/chunk.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1296baa623c68b579a1e4b4a0365965e0543369775d50294756ef4181f1a5fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/rspack_plugin_esm_library/src/optimize_chunks.rs:27-264 | crates/rspack_plugin_esm_library/src/optimize_chunks.rs:569-801 | crates/rspack_plugin_rslib/src/dyn_import_external.rs:135-191 | crates/rspack_plugin_rslib/src/worker_external.rs:30-70 \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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2627746c97c0f1edbaa887453ff398e7b4eebe34fda94fb0200caf82364e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs:285-343 | crates/rspack_plugin_javascript/src/dependency/esm/import_dependency.rs:134-161 | crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs:117-144 | crates/rspack_plugin_javascript/src/dependency/esm/import_weak_dependency.rs:106-133 \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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"96126147b3b530aeb26ebae8deb46f263a626ab3f55b2f5adede0b80893bd2b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:171-244 | crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:298-344 | crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:354-421 | crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:431-492 \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":"crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87aac163ebe7f170fc631f95fe144e7f3f81a15b3404f600e971bb7a39c399f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/rspack_plugin_library/src/amd_library_plugin.rs:79-85 | crates/rspack_plugin_library/src/jsonp_library_plugin.rs:62-68 | crates/rspack_plugin_library/src/system_library_plugin.rs:67-73 | crates/rspack_plugin_library/src/umd_library_plugin.rs:87-93 \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":"crates/rspack_plugin_library/src/amd_library_plugin.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc3621be89a4d605e10bade94066ca6f9f953b24eb66ac40d6607efdaefc69f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): crates/rspack_plugin_library/src/assign_library_plugin.rs:449-503 | crates/rspack_plugin_library/src/export_property_library_plugin.rs:120-178 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_library/src/assign_library_plugin.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a5cb54fbd5531b3dcfa3e55d3631d948c6dd2a6c0e79f7174b4ca3140f34f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/css-module-lexer/src/dependencies.rs:2349-2424 | crates/css-module-lexer/src/dependencies.rs:2678-2740 \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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c377924b26caaa7934e4ac411e96ff86171c4d012c21790d41f6df956e7ceb29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:391-446 | crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:455-510 \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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"4348c60227efdcdc055d9cd8afdb219c30d60b3d2a29fe03b1872becf158e8af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs:544-626 | crates/rspack_plugin_extract_css/src/plugin.rs:677-746 \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":"crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bbaefbea5e699ea7b324d7aaddcd2e5beec5246a5b651af67b0335fdcaaacb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:200-244 | crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:251-295 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7861be6476e9cee472fc08da02937de21e222f8cd068cc007bbabecf29444e36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:124-170 | crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:66-103 \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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e50c750961b844577c36d293e367aea03ae55065f52dcbf9cfe870e13fc694"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:178-229 | crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:111-157 \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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f683a815caa1be12b0a87633c9d9f7d34dee94e4b3be1740c540b8c1eb2ca023"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/rspack_core/src/legacy_cache/persistent/snapshot/strategy/hash_helper.rs:112-156 | crates/rspack_core/src/legacy_cache/persistent/snapshot/strategy/hash_helper.rs:163-225 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/snapshot/strategy/hash_helper.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e34bb07fbe69861e0c3fbc314d3b317bd68cb854ddd4d09a94ccadc7e0e7060"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/rspack_core/src/chunk.rs:887-953 | crates/rspack_core/src/stats/utils.rs:191-241 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed12f085e3a273a8d7a39a08ef8fa49f788dce32ec3dfddeb7a8ba2a2a3cd4f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): crates/rspack_dojang/src/eval.rs:279-337 | crates/rspack_dojang/src/eval.rs:339-407 \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":"crates/rspack_dojang/src/eval.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5442dd02969460de815e0a4b3856405f0309ac63d070c9b578084ea6f16f8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/rspack_plugin_externals/src/http_externals_plugin.rs:48-84 | crates/rspack_plugin_externals/src/http_externals_plugin.rs:86-122 \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":"crates/rspack_plugin_externals/src/http_externals_plugin.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b7aea82f3e547d24bee5df0b02d7d1b9a7576aa3a4b0089b6fa113b630c092"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): crates/rspack_plugin_runtime/src/import_scripts_chunk_loading.rs:49-109 | crates/rspack_plugin_runtime/src/jsonp_chunk_loading.rs:48-109 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_runtime/src/import_scripts_chunk_loading.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc9d899de8b85e65f994d882cb7252ed77075172cfa37bac5b5a617534f0c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/rspack_core/src/context_module.rs:1012-1074 | crates/rspack_core/src/context_module.rs:1080-1152 \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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ad16fbb1626f3baac51ec6dd2916bd35139dd76f635563e5257abeddf79eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:1646-1686 | crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs:387-419 \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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f1e3f3bf854f06939eb12eaffc486ea6ee8245d7ba144cda52ab9ed6fa6d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/rspack_plugin_rstest/src/parser_plugin.rs:1294-1327 | crates/rspack_plugin_rstest/src/parser_plugin.rs:1334-1377 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4442e45372cde413d368f233c7cd8491f259630e55986a13780825c6c954c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/rspack_plugin_esm_library/src/link.rs:81-120 | crates/rspack_plugin_esm_library/src/link.rs:146-186 \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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"900192b8c87f86d5727d050ca1d1818bf7ba6b71004e45367a8532b5edae6a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/rspack_hash/src/lib.rs:461-497 | crates/rspack_hash/src/lib.rs:499-532 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_hash/src/lib.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9098a2c08275839c74ebe23ab3ae1f62c21f68cd169f2392693f90a8346b52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/rspack_plugin_runtime/src/runtime_module/get_chunk_update_filename.rs:55-100 | crates/rspack_plugin_runtime/src/runtime_module/get_main_filename.rs:60-106 \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":"crates/rspack_plugin_runtime/src/runtime_module/get_chunk_update_filename.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0bdbcbc0902795a6dad07ebeaf70e483c2a7857d8d77f7bf6cdc2202294a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/rspack_allocative/src/impls/rspack.rs:50-70 | crates/rspack_allocative/src/impls/rspack.rs:175-196 \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":"crates/rspack_allocative/src/impls/rspack.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d93230235cc1184ad4f80567b9013921baa6d76add013a1b5a09c106160d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:224-293 | crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:738-797 \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":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"050cf150320dd17b740081ca735f163b37888a58fbb4a9aa6ab7fcb1fbd64a19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/rspack_ids/src/id_helpers.rs:473-514 | crates/rspack_ids/src/id_helpers.rs:540-580 \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":"crates/rspack_ids/src/id_helpers.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bcf0d34213f3f8b4e07c21c0f40116166eff56697a4c9763e4b22ad7ba2ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:746-779 | crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:841-878 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"57738334797da93b8e0e68ec1b3396885effb1feb2bd4df2ee9b6567a6f26295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/css-module-lexer/src/dependencies.rs:4323-4356 | crates/css-module-lexer/src/dependencies.rs:4364-4396 \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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95bfc77d7030bbe97559934637b3b47c828f01c3ec839092fe5cfc3d8b0b35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 17\u002B corresponding lines): crates/rspack_dojang/src/context.rs:672-688 | crates/rspack_dojang/src/context.rs:690-706 | crates/rspack_dojang/src/context.rs:708-724 | crates/rspack_dojang/src/context.rs:726-742 | crates/rspack_dojang/src/context.rs:744-761 | crates/rspack_dojang/src/context.rs:763-780 | crates/rspack_dojang/src/context.rs:782-800 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_dojang/src/context.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dd77204b3c27c4ec05dbe32662494e123ef035c4fc707d6714144ca4a59894"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/rspack_napi/src/threadsafe_function.rs:169-190 | crates/rspack_napi/src/threadsafe_function.rs:212-235 \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":"crates/rspack_napi/src/threadsafe_function.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67f7218fef649778ea03ce32922c53361256103c20e83de4065b09353e59665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/rspack_plugin_rsdoctor/src/plugin.rs:537-567 | crates/rspack_plugin_rsdoctor/src/plugin.rs:574-611 \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":"crates/rspack_plugin_rsdoctor/src/plugin.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcd6c360676f4ca910f0f82e5aa42b1a90ff0f9d4f4a721adb56784131acdb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rspack_ids/src/id_helpers.rs:42-73 | crates/rspack_ids/src/id_helpers.rs:79-105 \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":"crates/rspack_ids/src/id_helpers.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2346714ef882816cbd9bb7785e6992ec28788179fbdc82690761bc116070ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/rspack_binding_api/src/module_graph.rs:195-214 | crates/rspack_binding_api/src/module_graph.rs:224-243 | crates/rspack_binding_api/src/module_graph.rs:253-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 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":"crates/rspack_binding_api/src/module_graph.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"12aad4358ef99da2f76a23841435562c6f99c845addb7f0840d3380f02f5e1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/rspack_core/src/options/module.rs:1340-1373 | crates/rspack_core/src/options/module.rs:1395-1416 \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":"crates/rspack_core/src/options/module.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d008940e4af6e8829cfea12dc848964203d73a25670c959c6c0afe235b7ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:236-260 | crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:165-189 | crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs:59-81 \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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5bbc8eafcfa50bf0e1c4beeb0acdaf003dcbe0eb5f1651d7caec8d1ced72d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 39\u002B corresponding lines): crates/rspack_core/src/chunk.rs:411-450 | crates/rspack_core/src/chunk.rs:455-495 | crates/rspack_core/src/chunk.rs:500-538 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 39 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":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8db125a64f0bb4391c82c0319e602de1cd24989edd1cb4602d14b61f15c091d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/rspack_plugin_split_chunks/src/plugin/bitmap.rs:48-69 | crates/rspack_plugin_split_chunks/src/plugin/bitmap.rs:78-97 \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":"crates/rspack_plugin_split_chunks/src/plugin/bitmap.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1047904517e54ca1fcc373dfece44f2287cb68ee64378117c0c46c66afd73a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rspack_core/src/resolver/resolver_impl.rs:194-207 | crates/rspack_core/src/resolver/resolver_impl.rs:216-239 \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":"crates/rspack_core/src/resolver/resolver_impl.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec894102ddfe521d9c1b25dda811f4a7e2e3bc630c2f403450e281ba1f40e2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rspack_plugin_mf/src/sharing/consume_shared_module.rs:209-226 | crates/rspack_plugin_mf/src/sharing/provide_shared_module.rs:167-182 \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":"crates/rspack_plugin_mf/src/sharing/consume_shared_module.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4b5cb6df0c75a5a4bf7ce27cb3eeaed77e879186add13401ed3d3c8c4b9d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rspack_fs/src/native_fs.rs:311-337 | crates/rspack_resolver/src/file_system.rs:251-282 \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":"crates/rspack_fs/src/native_fs.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"5225fa245e4a4b94c3be3365d73e3442095332e15be1b0d824ef3d2b9587be6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:466-492 | crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:498-528 \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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"780a5af4c460f8d991dd183d552dcaf177ab61ce2c476f9c1c7d078f2a76fb52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:913-948 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:980-1016 \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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d8d78029eb5cbd7dca49d6b8ba87c26cb6912b567c1b66239babaf14a07571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rspack_core/src/runtime.rs:270-284 | crates/rspack_core/src/runtime.rs:290-303 \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":"crates/rspack_core/src/runtime.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4033f9e21c986e8c91443da7a1bd5d8157d132749917088f35c034997c27b887"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rspack_plugin_mf/src/container/container_entry_module.rs:56-86 | crates/rspack_plugin_mf/src/container/container_entry_module.rs:93-119 \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":"crates/rspack_plugin_mf/src/container/container_entry_module.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"412c44b48f3cde9bc60d82126e4fda373bc0eaf36ab7d061b55f2868bac9146e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:1512-1552 | crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:1554-1591 \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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"34adfc219afd2672f34441861421b11c1ea2068b2d3353fce9bd4c5136c6619c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs:199-228 | crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs:235-262 \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":"crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"932a83bb4cf63ff034d71bd91c1bb6488e8b7d5a1c584f5370e36abb2a092b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:2252-2282 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:2290-2311 \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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cd6097469b91c77400db05362d79f9b0359f0a7e165cd616f5e18beb3cf0d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/rspack_core/src/context_module.rs:1158-1197 | crates/rspack_core/src/context_module.rs:1268-1301 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0227dd19bf474b52f7ddbd5140ce251593b205153a7737a8a34e63b9828c5316"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/rspack_dojang/src/context.rs:802-812 | crates/rspack_dojang/src/context.rs:814-824 | crates/rspack_dojang/src/context.rs:826-836 \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":"crates/rspack_dojang/src/context.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"6080a62d9cce0367ef52c6eb4845b6aaf344b397043342aac22514065902d248"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rspack_util/src/identifier.rs:199-224 | crates/rspack_util/src/identifier.rs:226-243 \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":"crates/rspack_util/src/identifier.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6177c93630684ce913ff3f868badcc4b8fe59c5fa8c606bdb5ecf25e45d77a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rspack_loader_swc/src/rsc_transforms/react_server_components.rs:143-169 | crates/rspack_loader_swc/src/rsc_transforms/react_server_components.rs:171-197 \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":"crates/rspack_loader_swc/src/rsc_transforms/react_server_components.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe22a194c32a92996759d22b20c00dbe29b2563395b928072cfadca787ba351a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/rspack_macros/src/rspack_hash.rs:77-97 | crates/rspack_macros/src/rspack_hash.rs:99-123 \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":"crates/rspack_macros/src/rspack_hash.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fb9175148e7a2ba45f5af3817f88808c6d0442b4508c359a0dde06dd174022"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/rspack_binding_api/src/lib.rs:188-211 | crates/rspack_binding_api/src/lib.rs:216-239 \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":"crates/rspack_binding_api/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"757976e5af57a338b8db7e84c76357bd33f8c3d2f6995770f8cad64797831ec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rspack_plugin_sri/src/runtime.rs:244-270 | crates/rspack_plugin_sri/src/runtime.rs:277-308 \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":"crates/rspack_plugin_sri/src/runtime.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f686b9d410869048a673754baddd403bfc6af15d22df2c4904f055f74fd322e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/rspack_core/src/normal_module_factory.rs:48-72 | crates/rspack_core/src/normal_module_factory.rs:76-100 \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":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dab5a815d82ba9eac9baa231cb8f75e6150f7f4ed3e0bab1b07bb9562fcbeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs:191-216 | crates/rspack_plugin_javascript/src/dependency/esm/import_weak_dependency.rs:184-209 \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":"crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34417ca5a25a7fec8eab1103653455d1dd36eceb1ddad982205a44bcd0707e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rspack_core/src/utils/mod.rs:199-215 | crates/rspack_core/src/utils/mod.rs:222-238 \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":"crates/rspack_core/src/utils/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dfa85852ceeddc4d43bebd66e23bb6a296521742bc8dbc1cbde80256bc15ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs:82-109 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs:115-136 \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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb15020eb87797417676b2c7aaa4671a1bdecbcceb177db8b5b81f9e80882deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/rspack_core/src/context_module.rs:1423-1453 | crates/rspack_core/src/normal_module.rs:428-458 \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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f41c8e1a9366884a4ac25483f506f368f2556a18234b79acb6b1f41f7612a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/rspack_core/src/utils/mod.rs:146-165 | crates/rspack_core/src/utils/mod.rs:173-197 \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":"crates/rspack_core/src/utils/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"104542f1f7abe0f35d6b9cc15fc6410988cada0404bd6d0fa40d6ae1298f3755"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:2055-2077 | crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs:397-413 \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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf0a731ba4433d455cf6aba89fa2fd013fa6809ee6bfd552f4564438c3ae593"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/rspack_util/src/time.rs:27-49 | crates/rspack_watcher/src/time.rs:24-45 \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":"crates/rspack_util/src/time.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0884f1ba9763b140879e033746b3a26a71b7f78219b6e2709d6692b57fa61b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/rspack_loader_swc/src/rsc_transforms/to_server_entry.rs:7-43 | crates/rspack_loader_swc/src/rsc_transforms/to_server_entry.rs:45-83 \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":"crates/rspack_loader_swc/src/rsc_transforms/to_server_entry.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa07d49f94ea0ba753d1e8393cb2c6af4238f3e9386a10eaf9996df009860e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/rspack_core/src/external_module.rs:198-226 | crates/rspack_plugin_javascript/src/plugin/api_plugin.rs:42-75 \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":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a1a653f3c80a8ef318d5d70ae46107c92285af52b51b0d3c6cb1c684f4b610"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/rspack_plugin_mf/src/container/remote_module.rs:54-82 | crates/rspack_plugin_mf/src/sharing/provide_shared_module.rs:62-92 \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":"crates/rspack_plugin_mf/src/container/remote_module.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f4261a943109593276a801b693c614cf54a572d49abe6550869e284897af29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/rspack_plugin_devtool/src/module_filename_helpers.rs:378-396 | crates/rspack_plugin_devtool/src/module_filename_helpers.rs:469-490 \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":"crates/rspack_plugin_devtool/src/module_filename_helpers.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4fe693b594840b9448ac308918284a727ae41eb49c3823e439f997cc73d018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:425-447 | crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:456-486 | crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:495-525 \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":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"233b31941a27d9e63684efec8c1043c49a4b3e2af9c54106a818124a868235cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/initialize_evaluating.rs:293-314 | crates/rspack_plugin_javascript/src/parser_plugin/initialize_evaluating.rs:317-333 \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":"crates/rspack_plugin_javascript/src/parser_plugin/initialize_evaluating.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7657220e7f26dd8b8d05920e9adafd8acd09a293d9d5e6c3ad6e9c40c2e3fc53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/rspack_plugin_swc_js_minimizer/src/lib.rs:75-100 | crates/rspack_plugin_swc_js_minimizer/src/lib.rs:104-127 \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":"crates/rspack_plugin_swc_js_minimizer/src/lib.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"589e414db430915881e97f541f11389a656a2e6cb834995ea559d26b1d88da72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/rspack_resolver/src/lib.rs:167-184 | crates/rspack_resolver/src/lib.rs:188-205 | crates/rspack_resolver/src/lib.rs:209-226 \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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b2f4669d97ff06dbfa16dcaaf4325206c1a8500291203e2b8245641b4d2bd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_plugin_javascript/src/magic_comment.rs:421-432 | crates/rspack_plugin_javascript/src/visitors/dependency/util.rs:48-64 \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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54e4026d6b5aea752fc64decb3ce7208352893d3ad1da312a09e4993dfbd754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rspack_plugin_rstest/src/parser_plugin.rs:353-373 | crates/rspack_plugin_rstest/src/plugin.rs:227-242 \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":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a088001e550a516c9fb4d799173a8bc7a710df420089f13e2455da86949b97fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rspack_binding_api/src/lib.rs:466-483 | crates/rspack_binding_api/src/lib.rs:496-519 \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":"crates/rspack_binding_api/src/lib.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"0961424806ad700dd66dfcd1aecaf423f68fa1fe9dc6e10bf0586d4724dc748b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rspack_core/src/glob_utils.rs:150-168 | crates/rspack_core/src/glob_utils.rs:175-192 \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":"crates/rspack_core/src/glob_utils.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d862cd2e6423ee7f2773c7f2001e154c50217bd844649e211940e96de4b58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/import_meta_path.rs:227-246 | crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.rs:84-103 \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":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_path.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7916ac2670cb2d598471fa9bfcc5b49d4b48de0b46e9512527e588b7584871f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rspack_plugin_runtime/src/runtime_module/utils.rs:48-63 | crates/rspack_plugin_runtime/src/runtime_module/utils.rs:255-269 \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":"crates/rspack_plugin_runtime/src/runtime_module/utils.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f05f605139429af2be92d7c8b750e6e78abfd614b6c2fadcc87d038455999b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rspack_binding_api/src/compilation/dependencies.rs:102-115 | crates/rspack_binding_api/src/compilation/dependencies.rs:118-130 \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":"crates/rspack_binding_api/src/compilation/dependencies.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c280c29233f785148cf01fe3732b7643644bcd6b933341dff4399163a553fd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rspack_core/src/compilation/mod.rs:996-1010 | crates/rspack_core/src/compilation/mod.rs:1022-1036 \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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9be3653829e1085682444c93db5b586408bbef2439d91e39fa691d9856b81c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): linting/rspack_collection_hasher/src/lib.rs:453-471 | linting/rspack_collection_hasher/src/lib.rs:473-504 \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":"linting/rspack_collection_hasher/src/lib.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5551458fc406e4056e2c8b2c885d11ddedd02943b746df844e02256a9a8c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/rspack_binding_api/src/compilation/code_generation_results.rs:110-122 | crates/rspack_binding_api/src/exports_info.rs:40-53 | crates/rspack_binding_api/src/exports_info.rs:56-69 | crates/rspack_binding_api/src/exports_info.rs:72-85 \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":"crates/rspack_binding_api/src/compilation/code_generation_results.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"72712930466f6a7109c1ba85b8338457fe7e266552bcde70fb4c9ae48b41c24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:632-651 | crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:653-667 | crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:672-694 \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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03815a0e0f24d8aee7d17d6f2575971541623b44056627f0bb1eaad3e89fdf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/rspack_core/src/compiler/mod.rs:256-279 | crates/rspack_core/src/compiler/rebuild.rs:23-50 \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":"crates/rspack_core/src/compiler/mod.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae421618d4422d6e9179024b38f28166d579388b255b0d28a4fd3773fb6ed142"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rspack_plugin_css/src/runtime/mod.rs:125-140 | crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:145-160 \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":"crates/rspack_plugin_css/src/runtime/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b440d26b48a0050869ea8a738a33bdc828291e568c3b8c9b084dcd0f47ab460"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs:422-451 | crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs:481-501 \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":"crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcb372e75c4b010589e77adbd6812d53b243838b17b1e061c0e75539617c021"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/rspack_plugin_javascript/src/utils/mangle_exports.rs:7-35 | crates/rspack_plugin_javascript/src/utils/mangle_exports.rs:37-71 \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":"crates/rspack_plugin_javascript/src/utils/mangle_exports.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbde24d5ca158a5ffd25596c143754b1046b2df99fa7ecff6f360884ecf83251"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rspack_core/src/module_graph/mod.rs:211-226 | crates/rspack_core/src/module_graph/mod.rs:236-260 \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":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd26093fe89653cea896858460802d024a7e50f49e3a23a97cd9aab8694f172"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/rspack_resolver/src/file_system.rs:150-163 | crates/rspack_resolver/src/file_system.rs:165-178 | crates/rspack_resolver/src/file_system.rs:180-199 \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":"crates/rspack_resolver/src/file_system.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"01259e6852070537840f18792570d3f04ec3315f703afa45c5d4de1ab58a6939"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_binding_api/src/filename.rs:48-58 | crates/rspack_binding_api/src/filename.rs:62-72 \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":"crates/rspack_binding_api/src/filename.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58181b8a40e9d2c6c67b8bd00dfdf595adf33ee6f93e3a66637801908e1bf86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/rspack_plugin_rslib/src/dyn_import_external.rs:251-266 | crates/rspack_plugin_rslib/src/url_external.rs:99-125 | crates/rspack_plugin_rslib/src/worker_external.rs:93-118 \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":"crates/rspack_plugin_rslib/src/dyn_import_external.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff2d263f747238cb3b0e51f315c0f92cf9280ec1eb2ec0c87ecd4409d10b794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/rspack_fs/src/native_fs.rs:157-169 | crates/rspack_fs/src/native_fs.rs:171-182 | crates/rspack_fs/src/native_fs.rs:221-233 \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":"crates/rspack_fs/src/native_fs.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f25c8eac613b1ad711dadcfde1dacd9b49e849e46cce2ca6ada6a45c04459b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/rspack_binding_api/src/module.rs:456-475 | crates/rspack_binding_api/src/module.rs:477-495 \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":"crates/rspack_binding_api/src/module.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67862f0dbffbe604f10dd8ca9f3c10e5b27f8b776f12df71fc756c938c91a45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/css-module-lexer/src/lexer.rs:2392-2415 | crates/css-module-lexer/src/lexer.rs:2499-2522 \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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b1b1a8368d4379eb7a9c42b5df48d513e5a9d43cfb466f6984b4a4fda15b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rspack_binding_api/src/fs_node/write.rs:313-327 | crates/rspack_binding_api/src/fs_node/write.rs:412-426 \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":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62e9cd86bb8a06b78a7807643b64659150e7b4266f8810636c68e7baf6b0db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs:1096-1115 | crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs:1199-1218 \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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a282f37d2166ba603711c17de26f36fe7b9ced5a328f8c770c082f3f09492ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs:1758-1769 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs:1771-1784 \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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c7fa11d3e755013da55e305abfa2d9e0819bb69c56a9368e3fbb79c2491c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rspack_plugin_rsdoctor/src/plugin.rs:258-284 | crates/rspack_plugin_rsdoctor/src/plugin.rs:349-365 \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":"crates/rspack_plugin_rsdoctor/src/plugin.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e162ed39b54b2479834f7b0c420589e687e81afe744daf6e7f6e24f98c852db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:820-832 | crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:871-880 \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":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9eaf1dc15a3536d2f834a5d83b1703f5291a14f3d3b87c2f9bd53e687190aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rspack_plugin_library/src/amd_library_plugin.rs:38-60 | crates/rspack_plugin_library/src/system_library_plugin.rs:31-48 \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":"crates/rspack_plugin_library/src/amd_library_plugin.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3ba99e50a85c09db8c5dd5263e32ed1e1122962926214ad0f394a1db45f273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs:1110-1126 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs:1131-1147 \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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4106474d33fb7d8565486a62cafa6f03607034835782cc5dd8bc2f6141a1b123"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/css-module-lexer/src/dependencies.rs:2459-2482 | crates/css-module-lexer/src/dependencies.rs:2488-2508 \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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d159dee184b03e395a401c900b8680dc46ff45cae8fd063c02d494a858d967ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/rspack_binding_api/src/html.rs:156-174 | crates/rspack_binding_api/src/html.rs:178-196 \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":"crates/rspack_binding_api/src/html.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"762dbbef1c8eba23940a4334c8bc3f9d3a3cb4dc246575aaa466f5cb47010cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rspack_binding_api/src/module_graph.rs:70-85 | crates/rspack_binding_api/src/module_graph.rs:281-294 \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":"crates/rspack_binding_api/src/module_graph.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b356acbec2898854dfed032c65de7942ac25a9d290ab0da7a2bcb04ee95f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_binding_api/src/stats.rs:113-123 | crates/rspack_binding_api/src/stats.rs:149-159 \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":"crates/rspack_binding_api/src/stats.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9927af2a23d6bd3933f19b6395229905b9b9dd41ce03a14d2c3073eeeb4faad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/rspack_cacheable/src/with/as_map.rs:48-55 | crates/rspack_cacheable/src/with/as_tuple2.rs:23-30 | crates/rspack_core/src/options/resolve/alias_value_cacheable.rs:34-43 \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":"crates/rspack_cacheable/src/with/as_map.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2bfbd337a8c64b3b790af880a12373b744be99904d8123103d0dcd2ac20310"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rspack_plugin_hmr/src/lib.rs:1088-1115 | crates/rspack_plugin_rslib/src/plugin.rs:425-451 \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":"crates/rspack_plugin_hmr/src/lib.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6df77197f63e852eb851934a0cbf28272fa7a8d466d95c38dc4b8e448dd083"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/rspack_binding_api/src/module_graph_connection.rs:79-91 | crates/rspack_binding_api/src/module_graph_connection.rs:94-106 | crates/rspack_binding_api/src/module_graph_connection.rs:109-125 \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":"crates/rspack_binding_api/src/module_graph_connection.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b674e74b2f52e843d0edb75694cf2e4ddddd06271ebc5fc9bbad5b09f566af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/import_meta_path.rs:163-186 | crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.rs:60-82 \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":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_path.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed30d84d00320c45445a279f695edd1519d2e0dfd8e13d4daed2e130655cb0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rspack_plugin_javascript/src/utils/eval/mod.rs:276-288 | crates/rspack_plugin_javascript/src/utils/eval/mod.rs:290-302 \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":"crates/rspack_plugin_javascript/src/utils/eval/mod.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"789aedba228624e35fc1f1b5c12fa2bfba31529323c6ee4b23ee72f8ec995902"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): crates/rspack_binding_api/src/fs_node/write.rs:332-350 | crates/rspack_binding_api/src/fs_node/write.rs:352-370 | crates/rspack_binding_api/src/fs_node/write.rs:371-389 | crates/rspack_binding_api/src/fs_node/write.rs:436-454 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e44cd859583b07c86510a6b813914f32c275b5ab1ab3f419aeeb2fd935ae6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rspack_loader_swc/src/rsc_transforms/to_client_ref.rs:248-260 | crates/rspack_loader_swc/src/rsc_transforms/to_client_ref.rs:290-305 \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":"crates/rspack_loader_swc/src/rsc_transforms/to_client_ref.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff84bc72266bf02d11dfa5ecc4d26f58d9ba9a39157906a33db2c6a5328fca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/rspack_storage/src/filesystem/db/mod.rs:186-212 | crates/rspack_storage/src/filesystem/db/mod.rs:219-244 \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":"crates/rspack_storage/src/filesystem/db/mod.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4af22812173f6302529c9dabf291f197b7f03d01b2aeeb3e668d3449e3bde7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rspack_core/src/artifacts/code_generation_results.rs:344-353 | crates/rspack_core/src/artifacts/code_generation_results.rs:365-374 \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":"crates/rspack_core/src/artifacts/code_generation_results.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a037d2607d399d2cd228d6e91324a24d0d695a2653d09cf4f55eff1e10a852f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/rspack_core/src/module_graph/mod.rs:1100-1118 | crates/rspack_core/src/module_graph/mod.rs:1123-1141 | crates/rspack_core/src/module_graph/mod.rs:1150-1171 \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":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce17b93b08b5443909b68ac25ad97a595b9cbd3e379ace2fa25dfff1afa8e7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/rspack_plugin_wasm/src/runtime.rs:108-128 | crates/rspack_plugin_wasm/src/runtime.rs:155-175 \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":"crates/rspack_plugin_wasm/src/runtime.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"771ebbcd306b847dc90d95a162fb3a84fb84f30aaa6f8049edde00c2e44f842d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/rspack_resolver/src/lib.rs:651-670 | crates/rspack_resolver/src/lib.rs:1191-1215 \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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"7382312ae73a4240d8e75ba0615ddcc69c2498335d9f084a49581088c79b253e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs:128-147 | crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:92-117 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:96-121 \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":"crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"496842b060655790e9ac2a7f2f9c12f9c8dca4509d5126441fb850c6b1ea3882"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rspack_tracing/src/perfetto.rs:40-61 | crates/rspack_tracing_perfetto/src/lib.rs:91-103 \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":"crates/rspack_tracing/src/perfetto.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee69419ebfae5709748d32f56b0f9421f84b4641433d17b78fb568b847e1980"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): linting/rspack_collection_hasher/src/lib.rs:363-379 | linting/rspack_collection_hasher/src/lib.rs:391-409 \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":"linting/rspack_collection_hasher/src/lib.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed4dea0dace7a9aa26134dfd413810df6cf88244367aa9d6211e726d7b18391"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): crates/rspack_binding_api/src/html.rs:243-260 | crates/rspack_binding_api/src/html.rs:264-281 | crates/rspack_binding_api/src/html.rs:295-312 | crates/rspack_binding_api/src/html.rs:316-333 \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":"crates/rspack_binding_api/src/html.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ac799313b0b41a26987b712fa4fe6232476b067fa03c33fdbd052d60fdce43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_core/src/stats/utils.rs:131-139 | crates/rspack_core/src/utils/mod.rs:113-134 \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":"crates/rspack_core/src/stats/utils.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d28771043f8fb744f51e05315a6c2b3e81530067f520d4124a8a10d1ef5061"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_loader_preact_refresh/src/lib.rs:39-50 | crates/rspack_loader_react_refresh/src/lib.rs:39-69 \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":"crates/rspack_loader_preact_refresh/src/lib.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc509a6fccf356c0701eff9e6d0f54cb4fc4525bf6e05387bb8b803cd3cb61d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/rspack_binding_api/src/raw_options/raw_devtool.rs:38-48 | crates/rspack_binding_api/src/raw_options/raw_split_chunks/raw_split_chunk_chunks.rs:16-29 | crates/rspack_binding_api/src/raw_options/raw_split_chunks/raw_split_chunk_name.rs:158-168 \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":"crates/rspack_binding_api/src/raw_options/raw_devtool.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f152a891700e92b3eaa2dd77415839f473af60d75bdda2b0f1c503ce646c4b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_fs/src/memory_fs.rs:195-209 | crates/rspack_fs/src/memory_fs.rs:211-222 \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":"crates/rspack_fs/src/memory_fs.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"258d9e1572df37e62b7f2c7e8c20b8ed67d891cde796293db8fc5ba5dc1c35e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rspack_paths/src/path_list.rs:51-66 | crates/rspack_paths/src/path_list.rs:69-86 \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":"crates/rspack_paths/src/path_list.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6300970053ffd172e94e0b289e50a88b8781845d666177997ff923081bc943"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_binding_api/src/module.rs:66-74 | crates/rspack_binding_api/src/module.rs:77-85 \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":"crates/rspack_binding_api/src/module.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e35f0f9556794b892b323e411697b8af912f0a567f3f08ee967a3e86da9f0df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rspack_binding_api/src/virtual_modules/fs.rs:112-125 | crates/rspack_binding_api/src/virtual_modules/fs.rs:127-140 \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":"crates/rspack_binding_api/src/virtual_modules/fs.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8501c0ac4c6ff6726304f56453ddeaddeaa64586df09c0d1b8993b555830eeb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rspack_napi/src/threadsafe_function.rs:160-167 | crates/rspack_napi/src/threadsafe_function.rs:199-206 \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":"crates/rspack_napi/src/threadsafe_function.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f26a87c044c420bce1ff535fd202cf6f3c741b2e26770ffc688528de52944a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rspack_plugin_extract_css/src/runtime.rs:482-495 | crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:119-131 \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":"crates/rspack_plugin_extract_css/src/runtime.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f9022ad6a5fedd69211a8f15c830cf00b959d32b3b923dad85ef3621d91761"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:191-202 | crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:205-218 \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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"834a16d4f91694baad3dc824917a51d3e053ed4aecbfd6662fd72cd2dd2d8fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_regex/src/lib.rs:96-104 | crates/rspack_regex/src/lib.rs:106-114 \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":"crates/rspack_regex/src/lib.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"850c3b62b704fd6aa255b99ff33cd305b6a5e559c529412da25299dc2085ef93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/rspack_binding_api/src/fs_node/write.rs:80-95 | crates/rspack_binding_api/src/fs_node/write.rs:98-115 | crates/rspack_binding_api/src/fs_node/write.rs:117-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 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":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c510a212f00357cde5ec811d318d1f73711447c807700df32fa34a5a3874f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_core/src/module_graph/rollback/dense_id_overlay_map.rs:84-96 | crates/rspack_core/src/module_graph/rollback/overlay_map.rs:140-151 \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":"crates/rspack_core/src/module_graph/rollback/dense_id_overlay_map.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"504fe6dbf0f2671e99a1b8b73db8374aec420ea63fd6c80b843f95fb3e1b05d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_core/src/options/filename.rs:461-472 | crates/rspack_core/src/options/filename.rs:478-493 \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":"crates/rspack_core/src/options/filename.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"1173a409ef90904b0e8cc194c636cf507596bddae21d700751ddb58f69d6e0e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rspack_plugin_javascript/src/magic_comment.rs:191-197 | crates/rspack_plugin_javascript/src/magic_comment.rs:199-205 \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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"401339a956ce408f5cfd9fc4cb39371a6d9066251f242bd0336650b50fe41705"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/rspack_plugin_extract_css/src/plugin.rs:766-787 | crates/rspack_plugin_mf/src/container/module_federation_runtime_plugin.rs:141-161 \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":"crates/rspack_plugin_extract_css/src/plugin.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f1fa596a987e0e2e238497406f4dd55506c3434216f3bc32721dc51b393527"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/rspack_plugin_runtime/src/array_push_callback_chunk_format.rs:43-66 | crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:47-69 | crates/rspack_plugin_runtime/src/module_chunk_format.rs:56-77 \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":"crates/rspack_plugin_runtime/src/array_push_callback_chunk_format.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f95dfe2e7e15d74d8501990a0b2efd61f44d62c8f62d14eaa879351f7dad9eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rspack_plugin_swc_js_minimizer/src/lib.rs:609-629 | crates/rspack_util/src/asset_condition.rs:39-56 \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":"crates/rspack_plugin_swc_js_minimizer/src/lib.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9d8e35dbe69fcd3d4380ea0b5e849344d89e1877d0b38ad3a87c7c86379dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/css-module-lexer/src/dependencies.rs:2959-2974 | crates/css-module-lexer/src/dependencies.rs:3170-3184 | crates/css-module-lexer/src/dependencies.rs:3186-3200 \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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2959}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc7d4d6d24225cd612aaac933e5a0bbbff6ed52dfb1a45ba8c17c9d03aaf427"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rspack_binding_api/src/chunk_graph.rs:62-77 | crates/rspack_binding_api/src/chunk_graph.rs:85-100 \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":"crates/rspack_binding_api/src/chunk_graph.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e96881301e1ca6d56e7e880fea64cf7e97fd08755e9e82b2d74bad131ddb6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rspack_binding_api/src/compilation/entries.rs:194-206 | crates/rspack_binding_api/src/compilation/entries.rs:209-221 \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":"crates/rspack_binding_api/src/compilation/entries.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"764ced782fbb3d2eb0cb309eb123a762b869cc59b33e205a072a41f58fa04675"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_binding_api/src/compilation/mod.rs:626-637 | crates/rspack_binding_api/src/compilation/mod.rs:650-663 \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":"crates/rspack_binding_api/src/compilation/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"87df00caed464748605064b76230409973afcd4e72a4f37d15997d13f3af19cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_binding_api/src/modules/normal_module.rs:76-84 | crates/rspack_binding_api/src/modules/normal_module.rs:112-120 \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":"crates/rspack_binding_api/src/modules/normal_module.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a0ee63f433be0901ed50ce19af0f1e3ccf7fe9d6f0707deeada26fbf34d8fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_loader_swc/src/rsc_transforms/to_client_ref.rs:326-336 | crates/rspack_loader_swc/src/rsc_transforms/to_client_ref.rs:338-351 \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":"crates/rspack_loader_swc/src/rsc_transforms/to_client_ref.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3689d97ebe3c5a074716affc999c223c3e174ad675f2c7030cea1f0936432e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rspack_plugin_runtime/src/common_js_chunk_loading.rs:32-54 | crates/rspack_plugin_runtime/src/import_scripts_chunk_loading.rs:22-38 \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":"crates/rspack_plugin_runtime/src/common_js_chunk_loading.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"be60e74ddff6a68a03bb89059602ba658ca25212f5c18305e9183cf17834615e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 15\u002B corresponding lines): crates/rspack_binding_api/src/fs_node/write.rs:193-207 | crates/rspack_binding_api/src/fs_node/write.rs:216-230 | crates/rspack_binding_api/src/fs_node/write.rs:233-247 | crates/rspack_binding_api/src/fs_node/write.rs:250-264 | crates/rspack_binding_api/src/fs_node/write.rs:267-281 | crates/rspack_binding_api/src/fs_node/write.rs:288-302 \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":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf8c2580f8f4d421b397680c112eaf1f8d1affe012502b1071db8a301d93048"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:636-650 | crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:677-692 | crates/rspack_core/src/options/module.rs:731-746 \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":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef329573dd3f65e01d01d30c08c69e23b436a928f72005e06b496a5b7bf7772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rspack_core/src/context_module.rs:319-336 | crates/rspack_core/src/normal_module.rs:351-368 \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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce1cfbc5e78a282d5924bad659d20065fc66f1e0b85abd7cf662493c66ea33d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/rspack_core/src/utils/identifier.rs:86-96 | crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:55-62 | crates/rspack_sources/src/helpers.rs:576-586 \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":"crates/rspack_core/src/utils/identifier.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44f2f8bd463bd0c1238ea72868167874e875c672e6157e916cc8d6f7f653fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_plugin_javascript/src/parser_and_generator/mod.rs:550-560 | crates/rspack_plugin_javascript/src/parser_and_generator/mod.rs:563-573 \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":"crates/rspack_plugin_javascript/src/parser_and_generator/mod.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"104bc446a00eacb9db465c9c1d23b87826fbd034eddf51a25ba95c95b2b909d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rspack_fs/src/memory_fs.rs:284-293 | crates/rspack_fs/src/memory_fs.rs:299-308 \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":"crates/rspack_fs/src/memory_fs.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae9312f6f2611a499e9e84f4aac8e365a65f58991bf0ec82b2a4a0e29567db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_tracing_perfetto/src/lib.rs:447-458 | crates/rspack_tracing_perfetto/src/lib.rs:460-472 \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":"crates/rspack_tracing_perfetto/src/lib.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"423eb3aca4740ee6404a3aff0191312c41322ab15faac9453f926e9e2f5104ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/css-module-lexer/src/dependencies.rs:2037-2057 | crates/css-module-lexer/src/dependencies.rs:2060-2073 \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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fcfb8f94fa36aee0cba41221937c822430d51a7b635eee6293c12c1ec7785d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_core/src/utils/source_size_cache.rs:62-76 | crates/rspack_core/src/utils/source_size_cache.rs:110-121 \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":"crates/rspack_core/src/utils/source_size_cache.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e634e9f6a5f28fe12932cbb841ae5b88db3da5420085e16152a49709c92c38f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_napi/src/threadsafe_function.rs:262-270 | crates/rspack_napi/src/threadsafe_function.rs:286-294 \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":"crates/rspack_napi/src/threadsafe_function.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9f89cd8d1f6a7b804ba191e4bef9e2b997e4c83310cc4435b72fae17f058b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_binding_api/src/stats.rs:1131-1142 | crates/rspack_binding_api/src/stats.rs:1144-1155 \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":"crates/rspack_binding_api/src/stats.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"53895b72c2fa28d8460d453d6f625563245be8e9967414d286a755953fcb242d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rspack_core/src/runtime.rs:362-376 | crates/rspack_core/src/runtime.rs:378-392 \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":"crates/rspack_core/src/runtime.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50eca38efdc51df1a3b6f3b4881b7e49c324cfec11f3bd39704634ad45f76ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs:1033-1048 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs:1054-1071 \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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"a758681c987c332b5850dca4940950434f628405e95ae6ba91b360d696728c61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_core/src/module_graph/rollback/dense_id_overlay_map.rs:43-53 | crates/rspack_core/src/module_graph/rollback/dense_id_overlay_map.rs:56-64 \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":"crates/rspack_core/src/module_graph/rollback/dense_id_overlay_map.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2ddeb4bfb5e865bd59a7ad984e932babb3957c7d43622516dd9d36fe9dd365"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/css-module-lexer/src/dependencies.rs:1245-1268 | crates/css-module-lexer/src/dependencies.rs:1292-1321 | crates/css-module-lexer/src/dependencies.rs:1353-1364 \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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7664acd87d706cca0961479ed488aa12692c0dc8d37d6526f959c675025f0926"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rspack_macros/src/ast_object.rs:171-185 | crates/rspack_napi_macros/src/field_names.rs:41-55 \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":"crates/rspack_macros/src/ast_object.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9366d07138af6919c6e7e46c53db3fd0ee64169502267c0f8df042856cb127"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rspack_plugin_javascript/src/magic_comment.rs:225-238 | crates/rspack_plugin_javascript/src/magic_comment.rs:240-253 \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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b11dffe3ff019f5124f5c9559eb852a38559189c93edc862606b7ae01ba477f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/rspack_binding_api/src/compilation/dependencies.rs:32-42 | crates/rspack_binding_api/src/compilation/dependencies.rs:47-57 | crates/rspack_binding_api/src/file_system_dependency_strings.rs:19-31 | crates/rspack_binding_api/src/lib.rs:171-183 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/compilation/dependencies.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"99396f9c856a9fbbfe2c48950ea8601dea81c80cab78cadaeda519647e2c45e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rspack_binding_api/src/resolver_factory.rs:78-91 | crates/rspack_binding_api/src/resolver_factory.rs:93-105 \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":"crates/rspack_binding_api/src/resolver_factory.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc111990174405cb31420d451ee3e9515a801513ec02f554c08a70ecd02021d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/rspack_core/src/runtime_template.rs:526-542 | crates/rspack_core/src/runtime_template.rs:549-567 | crates/rspack_core/src/runtime_template.rs:574-592 \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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ea893be05c8e2657876e34f891a58fac05df46fd95c77795944e5f1525b0b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/rspack_plugin_javascript/src/dependency/amd/amd_exports_dependency.rs:71-86 | crates/rspack_plugin_javascript/src/dependency/context/import_meta_context_dependency.rs:183-198 | crates/rspack_plugin_javascript/src/dependency/context/require_context_dependency.rs:131-146 \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":"crates/rspack_plugin_javascript/src/dependency/amd/amd_exports_dependency.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08559fb1d4bbecb0d0994594d861399d4080ac7f6aa085b18855675968e2e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 18\u002B corresponding lines): crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_require_dependency.rs:209-228 | crates/rspack_plugin_javascript/src/dependency/commonjs/require_resolve_dependency.rs:145-162 | crates/rspack_plugin_javascript/src/dependency/esm/import_meta_resolve_dependency.rs:102-121 | crates/rspack_plugin_javascript/src/dependency/hmr/import_meta_hot_accept.rs:92-111 | crates/rspack_plugin_javascript/src/dependency/hmr/import_meta_hot_decline.rs:92-111 | crates/rspack_plugin_javascript/src/dependency/hmr/module_hot_accept.rs:92-109 | crates/rspack_plugin_javascript/src/dependency/hmr/module_hot_decline.rs:92-109 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_require_dependency.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ada12b4effc8accb2ac984534358dd3954a34f5fe28d167fa5ffc47dbd78bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:268-279 | crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:871-881 \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":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5597463608ada1af02d06908a28789a27bf111f71629c9a631ea4b59b9c97264"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rspack_core/src/resolver/boxfs.rs:29-38 | crates/rspack_core/src/resolver/boxfs.rs:40-49 \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":"crates/rspack_core/src/resolver/boxfs.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbde5452500360d34dd4fa6981a2d08a9c1dd953bee8c45ed20986009c283ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_fs/src/memory_fs.rs:75-85 | crates/rspack_fs/src/memory_fs.rs:87-97 \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":"crates/rspack_fs/src/memory_fs.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2fa950692b0d25e8ad67530c40b1843a2c3fd8675a652bda111dd4260df650"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs:1501-1509 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs:2250-2261 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs:2269-2277 \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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b2cb12ce1e2c33f9966820a2fd0242d8e203b4e64aff73cd9cc42c976dee6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rspack_storage/src/filesystem/scope_fs.rs:71-82 | crates/rspack_storage/src/filesystem/scope_fs.rs:105-114 \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":"crates/rspack_storage/src/filesystem/scope_fs.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"353f3f2613246e5abdb8270d880d99f4156b4eec994b9db984073715e9c8f8fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_watcher/src/paths.rs:466-482 | crates/rspack_watcher/src/paths.rs:534-545 \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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"360c0334b260c20f671d05cad519d9296fcf2898d4b9b4173ef78d2809532424"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): crates/rspack_core/src/binding/cell.rs:209-217 | crates/rspack_core/src/binding/cell.rs:227-235 | crates/rspack_core/src/binding/cell.rs:245-253 | crates/rspack_core/src/binding/cell.rs:263-272 | crates/rspack_core/src/binding/cell.rs:282-291 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/binding/cell.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8147b37407182302252f3402912805b36e2900ad29d9ebfdad7f105915ae4c9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rspack_plugin_extract_css/src/css_module.rs:186-191 | crates/rspack_plugin_lazy_compilation/src/module.rs:388-394 \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":"crates/rspack_plugin_extract_css/src/css_module.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e64acafb2f21b429d7902af218e0751a5527f59f8831cb9d7014fde8dd21cbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs:471-482 | crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs:492-504 \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":"crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1d098daaa364da99344ce6179fa545d5a3a13aa290e44204ff575afef2862c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/rspack_plugin_library/src/export_property_library_plugin.rs:63-69 | crates/rspack_plugin_library/src/module_library_plugin.rs:49-55 | crates/rspack_plugin_runtime/src/module_chunk_format.rs:40-47 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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":"crates/rspack_plugin_library/src/export_property_library_plugin.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce366d652a6be155cb6378a312d2eccc0bd0a07a5c3ac557894303500c658df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rspack_binding_api/src/js_helpers.rs:52-61 | crates/rspack_binding_api/src/js_helpers.rs:68-78 \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":"crates/rspack_binding_api/src/js_helpers.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85576b4804c73566cc8d5e245e8e019deb8923fef1f81c72764a26dd0f07f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 14\u002B corresponding lines): crates/rspack_core/src/artifacts/module_graph_cache_artifact.rs:56-69 | crates/rspack_core/src/artifacts/module_graph_cache_artifact.rs:75-88 | crates/rspack_core/src/artifacts/module_graph_cache_artifact.rs:94-109 | crates/rspack_core/src/artifacts/module_graph_cache_artifact.rs:115-128 | crates/rspack_core/src/artifacts/module_graph_cache_artifact.rs:134-147 | crates/rspack_core/src/artifacts/module_graph_cache_artifact.rs:153-166 | crates/rspack_core/src/transient_cache/module_static_cache.rs:34-47 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/artifacts/module_graph_cache_artifact.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c44f71351d3fe590fae33e18581c3c0285c68e7d79fe93777017df1b51ae011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_core/src/module_graph/rollback/dense_id_overlay_map.rs:67-78 | crates/rspack_core/src/module_graph/rollback/overlay_map.rs:123-133 \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":"crates/rspack_core/src/module_graph/rollback/dense_id_overlay_map.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b31aecabe662b8e280f97a42f956f9dd2328e9c29e7cc48d0e9a1971e27d433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:1017-1028 | crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:1034-1045 \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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"28275efbad27795b1b9d7a20673299c9774e41bfba1f97f1f5dc9b5c53181575"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/rspack_core/src/runtime_template.rs:1213-1230 | crates/rspack_core/src/runtime_template.rs:1301-1314 | crates/rspack_plugin_rstest/src/import_dependency.rs:165-180 \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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab42dfd8e71077e6bcd375418f634a71c338d296a45e024653992aa14a46d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_fs/src/native_fs.rs:61-69 | crates/rspack_fs/src/native_fs.rs:113-122 \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":"crates/rspack_fs/src/native_fs.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"857e043ecc61855802b7ce50208e0372027d66b60e00793cf166b0d9cc288424"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_core/src/exports/export_info.rs:300-308 | crates/rspack_core/src/exports/export_info.rs:310-320 \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":"crates/rspack_core/src/exports/export_info.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6049027748aa094ea3e947fe3547fb1a4992ed949c783b504b222add6d1b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/rspack_macros/src/lib.rs:82-90 | crates/rspack_macros/src/lib.rs:93-101 | crates/rspack_macros/src/lib.rs:104-112 \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":"crates/rspack_macros/src/lib.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"019510b1475fd76029e50da7c8d135f19bebdc5f4be2e0fbb4f04e41b54ab77e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/rspack_binding_api/src/async_dependency_block.rs:68-82 | crates/rspack_binding_api/src/async_dependency_block.rs:85-100 | crates/rspack_binding_api/src/compilation/mod.rs:255-269 \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":"crates/rspack_binding_api/src/async_dependency_block.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"35daa8e41892451d1353c044632069e4b89c3a80459828d981041eb5982e0708"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_core/src/artifacts/code_generate_cache_artifact.rs:28-39 | crates/rspack_core/src/artifacts/process_runtime_requirements_cache_artifact.rs:26-36 \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":"crates/rspack_core/src/artifacts/code_generate_cache_artifact.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb16c730bffaf4c66c63d2393bc49320d5c34cfe4624345484e3d5f539350c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_plugin_rslib/src/url_external.rs:14-32 | crates/rspack_plugin_rslib/src/worker_external.rs:13-24 \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":"crates/rspack_plugin_rslib/src/url_external.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2ee091c922d4b5b592b32e89015a23c65be391f96f2c8b495e7a0a0b8ad811"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rspack_plugin_runtime/src/runtime_module/make_deferred_namespace_object_runtime.rs:56-71 | crates/rspack_plugin_runtime/src/runtime_module/make_optimized_deferred_namespace_object_runtime.rs:56-71 \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":"crates/rspack_plugin_runtime/src/runtime_module/make_deferred_namespace_object_runtime.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b84c71f86847376464db8b4eea3288ef1b2167a7f02a04ae4b4e66ec23711f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): crates/rspack_core/src/raw_module.rs:136-141 | crates/rspack_plugin_dll/src/dll_entry/dll_module.rs:135-142 | crates/rspack_plugin_dll/src/dll_reference/delegated_module.rs:198-205 | crates/rspack_plugin_mf/src/sharing/consume_shared_module.rs:296-301 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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":"crates/rspack_core/src/raw_module.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1559c4d8774eaeb986c3d2e5853670ec436b29f24de76f70685d01690070f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rspack_binding_api/src/chunk.rs:36-51 | crates/rspack_binding_api/src/chunk_group.rs:26-41 \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":"crates/rspack_binding_api/src/chunk.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eda9e8fa7e8bf97f1022245b6cebc0ff0d36309a8a3ba63e1f732dfe5813b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_plugin_library/src/utils.rs:54-71 | crates/rspack_plugin_runtime/src/module_chunk_loading.rs:16-26 \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":"crates/rspack_plugin_library/src/utils.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b261d2f32e33fee803df831db6aa72e8f5a3eb45e83f9c62e8b1e493727e3e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rspack_binding_api/src/module_graph.rs:50-61 | crates/rspack_binding_api/src/module_graph.rs:173-185 \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":"crates/rspack_binding_api/src/module_graph.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d591d381285ff1966812d6bbfd183853219218a1d18d5304ffb58346ac1bb38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rspack_core/src/options/resolve/clever_merge.rs:172-179 | crates/rspack_util/src/merge.rs:53-60 \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":"crates/rspack_core/src/options/resolve/clever_merge.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"0890d929c1572c0d83c5e72b031d69703d3b84638ee44d332314dd6cda261aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/rspack_binding_api/src/chunk.rs:107-114 | crates/rspack_binding_api/src/chunk.rs:117-126 | crates/rspack_binding_api/src/chunk.rs:154-166 | crates/rspack_binding_api/src/chunk.rs:182-194 \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":"crates/rspack_binding_api/src/chunk.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7186088c9345def94c1fa9e8e515b3b0a0c6a418d523fdd7812e85c5ebebbd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_binding_api/src/raw_options/mod.rs:164-172 | crates/rspack_binding_api/src/raw_options/mod.rs:216-224 \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":"crates/rspack_binding_api/src/raw_options/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5050956f2f56afcaae3a4d2e0147a8ec5a3efb89de63d43069a2e6df16cf20fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rspack_plugin_css/src/parser_and_generator/generator.rs:43-57 | crates/rspack_plugin_javascript/src/parser_and_generator/mod.rs:216-230 \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":"crates/rspack_plugin_css/src/parser_and_generator/generator.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f79341e735d9133bfa8b341c1c9a12945c0d067fb4d758fb8ed400a447984ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs:52-61 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/estree.rs:295-302 \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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cc06c58f7d6dd4db2cd1cad1c89fa76431142e9cc5953d3d0d96ed1068a386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_plugin_javascript/src/magic_comment.rs:112-124 | crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:1044-1054 \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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea0345b3f26ffd3e5be0ba6cdbd5532b7667baee8a599d427336da6ca47c487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/provide_plugin/mod.rs:84-94 | crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/mod.rs:100-107 \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":"crates/rspack_plugin_javascript/src/parser_plugin/provide_plugin/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbda32f96be1ac83fdaed2058c538a5bcf30e7905b21a2d1ca827db0a0c31adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/rspack_core/src/options/module.rs:1649-1659 | crates/rspack_core/src/options/module.rs:1664-1674 | crates/rspack_core/src/utils/module_rules.rs:42-51 \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":"crates/rspack_core/src/options/module.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"def42fef9d4074dab03277f48a4f2bbcc5ecc2b8732417254b779a4155c1d928"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/rspack_plugin_dll/src/dll_reference/delegated_plugin.rs:46-60 | crates/rspack_plugin_mf/src/container/container_reference_plugin.rs:138-149 | crates/rspack_plugin_mf/src/sharing/consume_shared_plugin.rs:485-503 \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":"crates/rspack_plugin_dll/src/dll_reference/delegated_plugin.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f30811e80450f23fd3bb6aaaa6ed0246639132fb22c84f01a553378abfb792c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/esm_top_level_this_plugin.rs:18-26 | crates/rspack_plugin_javascript/src/parser_plugin/require_ensure_dependencies_block_parse_plugin.rs:62-70 \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":"crates/rspack_plugin_javascript/src/parser_plugin/esm_top_level_this_plugin.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e788be50d50ae3ad97c8436e067e4646ee84e42bbc911baa29fff786827747da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/rspack_plugin_mf/src/container/container_plugin.rs:167-179 | crates/rspack_plugin_mf/src/sharing/provide_shared_plugin.rs:337-345 | crates/rspack_plugin_mf/src/sharing/shared_container_plugin.rs:104-112 | crates/rspack_plugin_rsc/src/client_plugin.rs:597-610 \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":"crates/rspack_plugin_mf/src/container/container_plugin.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9083f29c55d775cf07fd99367f86588fb9554a299bbb4e957dce5be7d6ad995c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_binding_api/src/chunk.rs:243-253 | crates/rspack_binding_api/src/chunk_group.rs:47-57 \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":"crates/rspack_binding_api/src/chunk.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"733211f5a3a23cd8201c47657b749de1c64f21885e660746856f83994c324079"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rspack_plugin_library/src/jsonp_library_plugin.rs:117-124 | crates/rspack_plugin_library/src/system_library_plugin.rs:187-196 \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":"crates/rspack_plugin_library/src/jsonp_library_plugin.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32aa3f354507ab41bc4eb3192024714634822a6ca5dc1a8ee84fbffbd28155c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rspack_ids/src/id_helpers.rs:185-194 | crates/rspack_plugin_css/src/utils.rs:394-401 \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":"crates/rspack_ids/src/id_helpers.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b382a17570a5457e4276ef52744b0b5695efdc1118280c379c5894a3b9a648b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/rspack_plugin_javascript/src/dependency/esm/import_dependency.rs:50-66 | crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs:43-56 | crates/rspack_plugin_javascript/src/dependency/esm/import_weak_dependency.rs:40-53 \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":"crates/rspack_plugin_javascript/src/dependency/esm/import_dependency.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea19a5fdbe90e7f3c683ef5d1ad742079333d8b7f88ce8c1cc5000b46fc1f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rspack_binding_api/src/chunk.rs:256-266 | crates/rspack_binding_api/src/chunk_group.rs:116-125 \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":"crates/rspack_binding_api/src/chunk.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3dd24babbdddf2c6bc9829a1a3f638893b85a1e5aa73b0f904d5a88b91b938"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rspack_plugin_runtime/src/runtime_module/get_chunk_update_filename.rs:26-43 | crates/rspack_plugin_runtime/src/runtime_module/get_main_filename.rs:38-55 \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":"crates/rspack_plugin_runtime/src/runtime_module/get_chunk_update_filename.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c7d3ccaba0b6d87e97806cc30872110dba10630ab6b6a8a9e8bf91fa218f53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rspack_util/src/identifier.rs:81-92 | crates/rspack_core/src/utils/identifier.rs:77-83 \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":"crates/rspack_util/src/identifier.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ca4f5687a94854d5f31b66a8463e84d4b948c4eb9dc682ef1f75373b93cf26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_loader_runner/src/loader.rs:274-283 | crates/rspack_storage/src/filesystem/db/bucket/index/bloom_filter.rs:15-23 \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":"crates/rspack_loader_runner/src/loader.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"09df0de4b2f4259bc1938f48f7226103431facb99a20247dff09a72741aee273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs:407-415 | crates/rspack_plugin_runtime/src/array_push_callback_chunk_format.rs:28-34 | crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:32-38 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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":"crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43d1b17cd8781a2ab0d3588386224aaa1a56ffccc23835d393f45a9c121388b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_require_dependency.rs:63-75 | crates/rspack_plugin_javascript/src/dependency/commonjs/require_resolve_dependency.rs:42-54 \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":"crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_require_dependency.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadd0e78d290e4efea0bf1116e25039b65d0e8d2f403558c8c906e8c7b275706"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/rspack_plugin_javascript/src/dependency/context/amd_require_context_dependency.rs:133-146 | crates/rspack_plugin_javascript/src/dependency/context/import_context_dependency.rs:174-187 | crates/rspack_plugin_javascript/src/dependency/context/url_context_dependency.rs:140-153 \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":"crates/rspack_plugin_javascript/src/dependency/context/amd_require_context_dependency.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0211756d860a78dc7df5c56c90a33f5372b901d9ed9021ffef67a2325276f3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rspack_napi/src/js_values/one_shot_value_ref.rs:30-37 | crates/rspack_napi/src/js_values/threadsafe_one_shot_value_ref.rs:193-198 \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":"crates/rspack_napi/src/js_values/one_shot_value_ref.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9460793fe4994aa5b04eff4be44cc4716aabd3e7033db8232c61b89269b4b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs:807-819 | crates/rspack_plugin_javascript/src/dependency/url/mod.rs:205-217 \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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea450560c5f48c88d57a001029aa3c1de9bfc86d056e1e1958446aaabdab37a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rspack_binding_api/src/modules/concatenated_module.rs:9-16 | crates/rspack_binding_api/src/modules/normal_module.rs:14-19 \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":"crates/rspack_binding_api/src/modules/concatenated_module.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b968cd7ffadc3a9d52c8a07300808af3e6a5b8f618f351468bb9b52ef9e6199c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rspack_plugin_extract_css/src/css_dependency.rs:48-66 | crates/rspack_plugin_rsc/src/rsc_entry_dependency.rs:43-55 \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":"crates/rspack_plugin_extract_css/src/css_dependency.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e170930a0edc562ef6ba413960ef8d0eedb523b3a3292059ca51167a5ea9e324"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rspack_binding_api/src/compilation/chunks.rs:22-29 | crates/rspack_binding_api/src/compilation/diagnostics.rs:21-28 \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":"crates/rspack_binding_api/src/compilation/chunks.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac4d6987c23f0f90201b37c980680c03c10b8c58f0b30c87ecc2f134bace428"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rspack_plugin_esm_library/src/plugin.rs:727-734 | crates/rspack_plugin_extract_css/src/plugin.rs:754-763 \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":"crates/rspack_plugin_esm_library/src/plugin.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c1f329867c21f6bd4336a3e19827345356908b805737ad0bdfef3e71517a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rspack_plugin_library/src/system_library_plugin.rs:205-211 | crates/rspack_plugin_library/src/umd_library_plugin.rs:349-355 \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":"crates/rspack_plugin_library/src/system_library_plugin.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3225859c723e0667014430f7eb438815461cfa14467edcc2ed7077511ef9a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rspack_binding_api/src/build_info.rs:29-36 | crates/rspack_binding_api/src/resource_data.rs:24-31 \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":"crates/rspack_binding_api/src/build_info.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f43562885a88a1a4fd37a2cf53c17ba9356f49be3d7e871a1d0c5ba458ba29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rspack_core/src/compilation/finish_make/mod.rs:8-19 | crates/rspack_core/src/compilation/finish_module_graph/mod.rs:11-18 \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":"crates/rspack_core/src/compilation/finish_make/mod.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f32ee0efc42a5ef6d0f92a4facf264ae887f2bff915460c947bcd70fa04e545"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_plugin_javascript/src/dependency/context/amd_require_context_dependency.rs:26-36 | crates/rspack_plugin_javascript/src/dependency/context/url_context_dependency.rs:32-43 \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":"crates/rspack_plugin_javascript/src/dependency/context/amd_require_context_dependency.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62cd206af904e4dcae61cb049b8e46e0556e8fbf0714b34ddd3a9390c6cdf66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rspack_plugin_schemes/src/data_uri.rs:91-101 | crates/rspack_plugin_schemes/src/http_uri/mod.rs:239-253 \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":"crates/rspack_plugin_schemes/src/data_uri.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"469059a666bd8a6b6b3c0c9db16c2e2e70f0b2833e9688614caf1c863db87443"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:86-102 | crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs:94-108 \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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f13c3d407a38469f4c4978ed409f442481c43514e3729ca7f1178df7e5fc13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:62-68 | crates/rspack_core/src/chunk_graph/chunk_graph_module.rs:58-64 \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":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2665161f69f4e620a4789ac8ab04a7514d8bc4949743dcbd99335c685d1321b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_export_require_dependency.rs:185-188 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:140-143 | crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs:111-114 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_export_require_dependency.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94d0e50984caef943dc33e0e0dd7ac9b419f587ac2f3dd778b5290c729adf4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rspack_cacheable/src/with/as_tuple2.rs:40-45 | crates/rspack_cacheable/src/with/as_tuple3.rs:45-51 \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":"crates/rspack_cacheable/src/with/as_tuple2.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4b3f20e31429084b537d03eb6a5bf493038f9e593414207610646d02b8b8c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rspack_cacheable/src/with/as_tuple2.rs:58-63 | crates/rspack_cacheable/src/with/as_tuple3.rs:66-72 \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":"crates/rspack_cacheable/src/with/as_tuple2.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a9c9347961ef6179e9a096642fbd7be9e493efedb3d30ad978a9670a372c1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_core/src/concatenated_module.rs:1797-1808 | crates/rspack_core/src/normal_module.rs:813-821 \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":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c4da7d1febb9d88fc9d96dff52b1150ab9cbf079ed83f35942985ececbdcd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_core/src/concatenated_module.rs:1810-1818 | crates/rspack_core/src/normal_module.rs:823-831 \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":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c40e4f1a73e690f9e40b34114615de55f2e386a281f7cbde7b88f292805cbe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rspack_plugin_mf/src/container/container_exposed_dependency.rs:18-27 | crates/rspack_plugin_rsc/src/client_reference_dependency.rs:28-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":"crates/rspack_plugin_mf/src/container/container_exposed_dependency.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3480cf856444626544d6f6ccf1e49d5590965e2e734f410a3e24820d0dd3a887"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/api_plugin.rs:193-196 | crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs:141-144 \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":"crates/rspack_plugin_javascript/src/parser_plugin/api_plugin.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad93d28ffc2d2ccb8119ea2318b570936ccbb0eab13d07f50417da04c3078785"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:1601-1613 | crates/rspack_plugin_rstest/src/parser_plugin.rs:158-166 \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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"565204e62f50874a0fccdaf0c68d637563a2ec1eef8e117787af5f89488ef332"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): crates/rspack_plugin_library/src/assign_library_plugin.rs:450-496 | crates/rspack_plugin_library/src/export_property_library_plugin.rs:121-167 \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 \u0060crates/rspack_plugin_library/src/assign_library_plugin.rs:450\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 \u0060compilation\u0060 to \u0060\u0026Compilation\u0060 in one and \u0060\u0026mut Compilation\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":"crates/rspack_plugin_library/src/assign_library_plugin.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe84399718c5a4ef161c64fc043e366b12f1700d5b373fa2103c4a5164093dab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): crates/rspack_core/src/context_module.rs:1112-1149 | crates/rspack_core/src/context_module.rs:1223-1259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/context_module.rs:1112\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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d931b6642e043fed9a84c6ca8bd8ef1b8dc2199420f24c372e2464f4322cbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:178-213 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:185-220 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 157 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":"crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eb520f32044f31165af6410367b549ece397b0438560421bd278fadc116eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49\u201351 lines \u00D7 2): crates/rspack_core/src/stats/mod.rs:999-1047 | crates/rspack_core/src/stats/mod.rs:1082-1132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/stats/mod.rs:999\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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a45dd0c3b175c03c44bac32a90d2bfc264f28d2c574ef5d44581a600761ac9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/rspack_binding_api/src/compilation/mod.rs:972-1002 | crates/rspack_binding_api/src/compilation/mod.rs:1075-1105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/compilation/mod.rs:972\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":"crates/rspack_binding_api/src/compilation/mod.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89bc5e715bb129b97efc5e051650f65cdebcc06262c224ac2d9d7f2763200c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/rspack_plugin_esm_library/src/link.rs:1958-1987 | crates/rspack_plugin_esm_library/src/link.rs:2007-2036 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_esm_library/src/link.rs:1958\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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"8555605453a1351d306a8bdf51b8baaca701c5184cf12e45a9addf31c56f1e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:621-650 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:665-694 \u2014 both copies are in the same file, so extract the block 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"c679999a22cbba5146a67e604173db11530b9002d6d72d7f714b69d8aee19186"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:512-539 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:655-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 \u0060crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:512\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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0297d90697a01b1d368349ccfc8cf724aac1054ee2d0102367face6a96f10bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3): crates/rspack_plugin_javascript/src/dependency/esm/import_dependency.rs:135-161 | crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs:118-144 | crates/rspack_plugin_javascript/src/dependency/esm/import_weak_dependency.rs:107-133 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/dependency/esm/import_weak_dependency.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 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":"crates/rspack_plugin_javascript/src/dependency/esm/import_dependency.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"caec16d7884b5a6a822442f0a3c578812a52f5a8abcf32bccec7fd843847cc37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/rspack_plugin_javascript/src/runtime_context.rs:379-405 | crates/rspack_plugin_javascript/src/runtime_context.rs:471-497 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/runtime_context.rs:379\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":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"642ddc8d02e8f829126388d0e8a8ebbd6286b281445ed5580c6f28ec02b4782a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:298-324 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:309-335 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 157 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 \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:298\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":"crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5dd6aa9785d760230d85b22c1ff9cdf38edf2cb55891b549e09889a39c1f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:900-923 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:1050-1075 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:900\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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b793a4dd836e2db256ea77d9545d2b7126baa45f79d141ab5c2ffcf96ec5eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): crates/rspack_core/src/compiler/mod.rs:259-279 | crates/rspack_core/src/compiler/rebuild.rs:27-50 \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 \u0060crates/rspack_core/src/compiler/mod.rs:259\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":"crates/rspack_core/src/compiler/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23bc35fe48b26cab502f8866c7c71bb059691239084a7340a6ccab3ad0c3f9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/rspack_core/src/context_module.rs:1026-1049 | crates/rspack_core/src/context_module.rs:1213-1235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/context_module.rs:1026\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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"9041a545383ecd62bf6c0edb797cd6f92b343000ea90bc34265f6fb6e999ad51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/rspack_plugin_externals/src/http_externals_plugin.rs:49-72 | crates/rspack_plugin_externals/src/http_externals_plugin.rs:87-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_externals/src/http_externals_plugin.rs:49\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":"crates/rspack_plugin_externals/src/http_externals_plugin.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cea8430b384df0faef75c716cafc6bbd04f13bfa9c140bb04ef58bba85548c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:83-106 | crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:701-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060parser\u0060 to \u0060\u0026mut JavascriptParser\u0060 in one and \u0060\u0026mut JavascriptParser\u003C\u0027p\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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"219aa492805fc3f2e242a622552427e2585481736a5dd0e67a57ac3ac258c981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs:699-722 | crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs:749-772 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs:699\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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"0993588f15bc38a6fd679c2f8e6832e0fe23240aece3c74177ecec385fda9af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:668-690 | crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:740-762 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:668\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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"7428b6b0c407b6aecc411a36db2564d43cb4ce440499827ee9d6f59cc61349d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/rspack_binding_api/src/compilation/mod.rs:931-952 | crates/rspack_binding_api/src/compilation/mod.rs:1035-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/compilation/mod.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. 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, \u0060crates/rspack_binding_api/src/compilation/mod.rs:1032\u0060 calls \u0060within_compiler_context_sync\u0060, \u0060clone\u0060 and \u0060crates/rspack_binding_api/src/compilation/mod.rs:928\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":"crates/rspack_binding_api/src/compilation/mod.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c1ef1447cee2afa1191d12e3f1ff28857e236e6af84c04703e11a709a6ac60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/rspack_core/src/stats/mod.rs:1640-1661 | crates/rspack_core/src/stats/mod.rs:1757-1778 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/stats/mod.rs:1640\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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"13598d53db69323a9d8bb0e28871740727243990acd6db3fed40742b9b0c2c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/rspack_plugin_esm_library/src/optimize_chunks.rs:696-716 | crates/rspack_plugin_esm_library/src/optimize_chunks.rs:759-780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_esm_library/src/optimize_chunks.rs:696\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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be3bd08f081c70c7506442b0fcadc613c62b2653e1d8529925dd52cbc6ba998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:404-424 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:450-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 \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"26066b5fdd55e1df8ee86292ad1144d62508dde4214798a9bb4ad84b73f77285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:325-346 | crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:394-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.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, \u0060crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:324\u0060 calls \u0060get_exports_info\u0060 and \u0060crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:393\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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9070dce1da3327abff5c1243ad48e6a9f89436c1d69ed5588be64cfef25643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/rspack_plugin_javascript/src/runtime_context.rs:223-244 | crates/rspack_plugin_javascript/src/runtime_context.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":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded523d828db555c8d3bc2cce2900fe6c7cf7f369095cf81a6ad7c0fa00fbaec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs:1095-1116 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs:1286-1307 \u2014 both copies are in the same file, so extract the block 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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a7c7d5af63cdd5f9e136a3b891d7ceb95a8373a4367030fab6fe1cf85a5f90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:78-99 | crates/rspack_plugin_runtime/src/module_chunk_format.rs:86-107 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/common_js_chunk_format.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/module_chunk_format.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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":"crates/rspack_plugin_runtime/src/common_js_chunk_format.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"542eca634670228354ceba0a880322755f5a871fac098d6b393985d7e9ed302d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 2): crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs:149-164 | crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:122-142 \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 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 \u0060compilation\u0060 to \u0060\u0026mut Compilation\u0060 in one and \u0060\u0026Compilation\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":"crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"369afad38815eb224026b9b2bb24cab03f103ad6961899f75ffc6ac59d96ab80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/rspack_plugin_esm_library/src/link.rs:86-106 | crates/rspack_plugin_esm_library/src/link.rs:155-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_esm_library/src/link.rs:86\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, \u0060crates/rspack_plugin_esm_library/src/link.rs:151\u0060 calls \u0060key\u0060, \u0060ModuleExternal\u0060 and \u0060crates/rspack_plugin_esm_library/src/link.rs:85\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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"793a58b284ba72133caa7b6515a2adfd6331d35f01a06277d8a53a5d2b77f446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:237-257 | crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:166-186 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"696f08aea61e361010efa3ad331fd4151b8c76e3a2959241623f470f074c8bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/rspack_plugin_split_chunks/src/plugin/chunk.rs:144-163 | crates/rspack_plugin_split_chunks/src/plugin/chunk.rs:174-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_split_chunks/src/plugin/chunk.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":"crates/rspack_plugin_split_chunks/src/plugin/chunk.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"888e5716e668815697f1e11571b33f1e0413981613e22ca107fc986c50a848c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): crates/rspack_tracing_perfetto/src/lib.rs:215-235 | crates/rspack_tracing_perfetto/src/lib.rs:318-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":"crates/rspack_tracing_perfetto/src/lib.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4034e866e2aea6ae14d8e224665cfbc2134af3f75330111cf6f527fd8b38283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/rspack_core/src/context_module.rs:1081-1100 | crates/rspack_core/src/context_module.rs:1204-1221 \u2014 both copies are in the same file, so extract the block 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 after the matched lines, \u0060crates/rspack_core/src/context_module.rs:1222\u0060 calls \u0060returning_function\u0060 and \u0060crates/rspack_core/src/context_module.rs:1100\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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"53390374f979c9340a8fa4942e88a09feb8428897bb38f03727a864b58d092f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/rspack_hash/src/lib.rs:258-277 | crates/rspack_hash/src/lib.rs:282-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. 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":"crates/rspack_hash/src/lib.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3db11c73f18dd224050560e655b4d27d95fb8d852ddd9bf4cfacb5fefd2e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1089-1108 | crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs:320-339 \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 \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1089\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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"626b182ddb2d3ee0570dc3ab51b04835ecf33a22cd8387e636ae51cbbca53a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:354-372 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:355-374 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 157 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 \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:354\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":"crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"42580523cb4ff3edd0e021d53ef816b7a37b9dce4644e20b64216d816285119d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:515-533 | crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:557-575 | crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:624-642 \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 \u0060crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:515\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, \u0060crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:555\u0060 calls \u0060span\u0060, \u0060arguments\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:623\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":"crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdd2bd28cea243704cd3ca5c7c6d8401282c5b4140199e9149eec9cacb35e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:2846-2864 | crates/css-module-lexer/src/dependencies.rs:3045-3063 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:2846\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2846}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dd506422bc6fec375c09726fc89da8229c467ce710160755df611d0eac47de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/css-module-lexer/src/lexer.rs:1497-1515 | crates/css-module-lexer/src/lexer.rs:1588-1606 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/lexer.rs:1497\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":"crates/css-module-lexer/src/lexer.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"218490c4e4b0c48d9cc91e1c75f8be3ffc3f29d36e14870fb5babd86d4568b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:437-455 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:599-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:437\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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b8e64e4e423c947f5d4b915392157c9499dbf24183a412e5cb931613e0a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/rspack_macros/src/rspack_hash.rs:208-228 | crates/rspack_macros/src/rspack_hash.rs:240-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_macros/src/rspack_hash.rs:208\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":"crates/rspack_macros/src/rspack_hash.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a7d047439cb2e17dfdc6372c089a140bd321e75513731592df3ac81960142b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs:516-534 | crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs:542-560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs:516\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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"218a7878e6fa9d768ec34704232826899091ac7f80eb035bb35c7a97c0c24abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:2366-2390 | crates/css-module-lexer/src/dependencies.rs:2679-2703 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:2366\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7029c4951a7b720d4eabe5057ed230de6493c937e16fb7fe643b40c02068b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/rspack_core/src/compilation/create_hash/mod.rs:170-189 | crates/rspack_core/src/compilation/create_hash/mod.rs:345-364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/compilation/create_hash/mod.rs:170\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":"crates/rspack_core/src/compilation/create_hash/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7228cee9daa5e612b65a86eb74ccad8e022326cd2c7a062307bb805593b2f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/rspack_core/src/stats/mod.rs:967-984 | crates/rspack_core/src/stats/mod.rs:1050-1067 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"90986d0079e212301778a6ec7a8e77a7ec237a518a72f3ea7c1ab8fdc0356cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/rspack_plugin_runtime/src/helpers.rs:145-162 | crates/rspack_plugin_runtime/src/helpers.rs:173-190 \u2014 both copies are in the same file, so extract the block 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 after the matched lines, \u0060crates/rspack_plugin_runtime/src/helpers.rs:191\u0060 calls \u0060get_runtime_chunk\u0060 and \u0060crates/rspack_plugin_runtime/src/helpers.rs:162\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":"crates/rspack_plugin_runtime/src/helpers.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"500ef525238581d0b12b260cb2dd562bec862797193b41e45b2fe46a918192e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:385-402 | crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs:402-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:385\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":"crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9214482546beb6a47cbe73d3694527a1950162a48abbe415f14f8ab37268b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 5): crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:516-531 | crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:558-573 | crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:585-601 | crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:625-640 | crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:649-665 \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 \u0060crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:585\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":"crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d412e6196ce3b32882e1d1fdc9c5bd2853450cd642f5b276251bcc59dbab37c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs:166-182 | crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs:270-285 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs\u0060 and \u0060crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 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 \u0060crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs:166\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":"crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e785df064ee60a80ba1940086f01465eb329005732f84be02786412457dec68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rspack_plugin_extract_css/src/runtime.rs:417-433 | crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:388-404 \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 \u0060crates/rspack_plugin_extract_css/src/runtime.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":"crates/rspack_plugin_extract_css/src/runtime.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"35121083a20cebc5aeed88ed80de294f3e1954799cb7bbb2239bbf377db02996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rspack_plugin_extract_css/src/runtime.rs:451-467 | crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:420-436 \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 \u0060crates/rspack_plugin_extract_css/src/runtime.rs:451\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":"crates/rspack_plugin_extract_css/src/runtime.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c256397f5cdb6506683694484156d7040f42f8704f7e554416872b0a139d1e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/compatibility_plugin.rs:200-216 | crates/rspack_plugin_javascript/src/parser_plugin/compatibility_plugin.rs:283-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/compatibility_plugin.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"92665b720b3cbbc51f2e9c998723c903a314cab1b84dd0c66654768920ba204c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rspack_plugin_mf/src/container/remote_module.rs:66-82 | crates/rspack_plugin_mf/src/sharing/provide_shared_module.rs:76-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 \u0060crates/rspack_plugin_mf/src/container/remote_module.rs:66\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":"crates/rspack_plugin_mf/src/container/remote_module.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4313780c1d549195357e96015cc99511a327e523895b620272603ca873c5f109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/rspack_plugin_mf/src/manifest/asset.rs:28-44 | crates/rspack_plugin_mf/src/manifest/asset.rs:75-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 \u0060crates/rspack_plugin_mf/src/manifest/asset.rs:28\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":"crates/rspack_plugin_mf/src/manifest/asset.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8409f3a8e65a8731d6e1135a51dddf5b8d6d4f420ed30a36d223f0459ba3cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:101-117 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:105-121 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 157 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 \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:101\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":"crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaf93bfbf329f64dcf2fad9a290b9ae3e1b6fcfd54e9f55b37aef29eb9c1f55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rspack_util/src/time.rs:33-49 | crates/rspack_watcher/src/time.rs:29-45 \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 \u0060crates/rspack_util/src/time.rs:33\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, \u0060crates/rspack_util/src/time.rs:32\u0060 calls \u0060is_multiple_of\u0060 and \u0060crates/rspack_watcher/src/time.rs:28\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":"crates/rspack_util/src/time.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c84dbfcd5080249f3b09ce6d662c468bf3fc0281e4830836e5e288d9030e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs:292-307 | crates/rspack_plugin_javascript/src/dependency/esm/import_dependency.rs:136-151 | crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs:119-134 | crates/rspack_plugin_javascript/src/dependency/esm/import_weak_dependency.rs:108-123 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/dependency/esm/import_weak_dependency.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bf3d180ed9b63adcdb81577ea29a672d507d98c9b79e5cd13055e2d030f2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/rspack_core/src/chunk.rs:905-920 | crates/rspack_core/src/stats/utils.rs:202-216 \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 \u0060crates/rspack_core/src/chunk.rs:905\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":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"a231022da779281efded749389a5a94eb60b0264772ea88c3eddf4a589c06246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/rspack_napi/src/threadsafe_function.rs:174-187 | crates/rspack_napi/src/threadsafe_function.rs:216-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 \u0060crates/rspack_napi/src/threadsafe_function.rs:216\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":"crates/rspack_napi/src/threadsafe_function.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df8c2d536d8f8b3ff2d772422e860a83cc14a75b314bc99a5522a8f25df7495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs:458-473 | crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs:787-801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs:458\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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e313802983a74034fce73544407754ece5f30a29f677399cf1cf6ee9d59961b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/infer_async_modules_plugin.rs:135-149 | crates/rspack_plugin_javascript/src/plugin/infer_async_modules_plugin.rs:171-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/plugin/infer_async_modules_plugin.rs:135\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":"crates/rspack_plugin_javascript/src/plugin/infer_async_modules_plugin.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc868c6b6757b83a3521df94a5a76468da59627ce663c021f13d910897e5ab5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/rspack_plugin_rsc/src/server_plugin.rs:442-457 | crates/rspack_plugin_rsc/src/server_plugin.rs:536-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_rsc/src/server_plugin.rs:442\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":"crates/rspack_plugin_rsc/src/server_plugin.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"68aa5ed41526338a922f79df2d43f0f917afa74ca142858594766d946df55a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:48-63 | crates/rspack_plugin_runtime/src/module_chunk_format.rs:57-72 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/common_js_chunk_format.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/module_chunk_format.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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 \u0060crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:48\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, \u0060crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:65\u0060 calls \u0060insert\u0060 and \u0060crates/rspack_plugin_runtime/src/module_chunk_format.rs:74\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":"crates/rspack_plugin_runtime/src/common_js_chunk_format.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3429bf6e09b5c800d31c4b3f2d1b75104a730d6f4bfc425c958d98db76c360"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:3248-3261 | crates/css-module-lexer/src/dependencies.rs:3404-3418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:3404\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60a71d6dda7b46d84837cfda42bbfd87ed8d6d36bd1c09f759294a47afb38a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack/src/builder/mod.rs:2942-2956 | crates/rspack/src/builder/mod.rs:2988-3002 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack/src/builder/mod.rs:2942\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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":2942}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aad41f746a876cb1e83bcf40bbbee88bac671ae7e8ae17ab607835eb7d0d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_binding_api/src/compilation/mod.rs:954-968 | crates/rspack_binding_api/src/compilation/mod.rs:1057-1071 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/compilation/mod.rs:954\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":"crates/rspack_binding_api/src/compilation/mod.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccc5f4e7261bcc639c4acc43c240a42f34245538000d7109f8f2fbfcfd380fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:457-471 | crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:496-510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:457\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":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b85e16c3832860e11a548f57848504929cdc7316c79d0d359c0e2e0c0d28ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_core/src/resolver/resolver_impl.rs:305-319 | crates/rspack_core/src/resolver/resolver_impl.rs:336-350 \u2014 both copies are in the same file, so extract the block 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":"crates/rspack_core/src/resolver/resolver_impl.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05be3a22bdb99c65732efb8bb8bd21486506e6ded9417606cbd63a382cab3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_core/src/utils/mod.rs:147-161 | crates/rspack_core/src/utils/mod.rs:174-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/utils/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2354b9b9dd0e305fcde2efd172ba9d17cb178a5cc984c66389b0c6bd901c7d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_ids/src/id_helpers.rs:476-492 | crates/rspack_ids/src/id_helpers.rs:542-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_ids/src/id_helpers.rs:476\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":"crates/rspack_ids/src/id_helpers.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf03eaca58286230b80c73725baa8645fa546ed47288863aa21d09f560968cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_macros/src/rspack_hash.rs:140-154 | crates/rspack_macros/src/rspack_hash.rs:166-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_macros/src/rspack_hash.rs:140\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":"crates/rspack_macros/src/rspack_hash.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfebfa9ddb4392f984c51401441527178081a1fc583299d564d64651ccb0040a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_plugin_esm_library/src/link.rs:1258-1272 | crates/rspack_plugin_esm_library/src/link.rs:1275-1289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f44cc72b58e3e6a51d1b2b566f54403a1bf5ba872ee9147ade29e2d480331d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/rspack_plugin_javascript/src/magic_comment.rs:508-520 | crates/rspack_plugin_javascript/src/magic_comment.rs:531-545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/magic_comment.rs:508\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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"94534136cb9e87fbc1471fa044c8c80a3c789fc886ead20c53d4944c6187bbb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:314-328 | crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:343-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:314\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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5697464fbb42b2cd543c69f7bb3691901780e1d69d4d654599c677834805af1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs:495-509 | crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs:815-829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_usage_plugin.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a63ceda2b455025f067f777b21f091ec30e72adee4581a7c34f11aba37f8f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/rspack_plugin_mf/src/sharing/collect_shared_entry_plugin.rs:173-186 | crates/rspack_plugin_mf/src/sharing/shared_used_exports_optimizer_plugin.rs:108-122 \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":"crates/rspack_plugin_mf/src/sharing/collect_shared_entry_plugin.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01d484a2acb4c066a36284d2b211463e7999239b06e77f52bd54872c4d8269b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs:264-278 | crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:475-489 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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 \u0060crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs:264\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":"crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f16c18aa3b4c10a522b431ca3617a145553918ca644a415351828e2cac3c93a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_plugin_swc_js_minimizer/src/lib.rs:368-382 | crates/rspack_plugin_swc_js_minimizer/src/lib.rs:383-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_swc_js_minimizer/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11805fa3331f8d6df3ae3edf9d54fda52b66f058aaa0414cac35c2e27199026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crates/rspack_plugin_esm_library/src/optimize_chunks.rs:646-659 | crates/rspack_plugin_esm_library/src/optimize_chunks.rs:701-713 | crates/rspack_plugin_esm_library/src/optimize_chunks.rs:765-777 \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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac8e80bbb412f75a967532779a8e68941f434b228d6fa49856af7e61bf5193d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/css-module-lexer/src/css_syntax.rs:91-104 | crates/css-module-lexer/src/css_syntax.rs:145-158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/css_syntax.rs:91\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":"crates/css-module-lexer/src/css_syntax.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d11c61f43fd7aa361d2540501b8e18fd3d853f9d312800d6c6194fe5f5a4b12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:2928-2941 | crates/css-module-lexer/src/dependencies.rs:3136-3149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:2928\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2928}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd4343a84068f32200636e4e5213e6a5a635486c541f0f1db62c4c1d41edd7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_binding_api/src/async_dependency_block.rs:35-48 | crates/rspack_binding_api/src/module.rs:331-344 \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":"crates/rspack_binding_api/src/async_dependency_block.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb70d3069069c00a0378a7f3ba52e64c932813fd9e5268bc826ab5fc74614510"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_core/src/compilation/mod.rs:715-728 | crates/rspack_core/src/compilation/mod.rs:764-777 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/compilation/mod.rs:715\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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed959e2ab488f45783e2eb4a4e2f9b75c2cc4d28bc6ef46422cf2d0e232930c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_core/src/runtime_template.rs:1733-1746 | crates/rspack_plugin_esm_library/src/dependency/dyn_import.rs:51-64 \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 \u0060crates/rspack_core/src/runtime_template.rs:1733\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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e104adef541465a498c48eb2e446ffadd53c0e2402cb104a3feffb807da0e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_core/src/stats/mod.rs:1604-1618 | crates/rspack_core/src/stats/mod.rs:1720-1733 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/stats/mod.rs:1604\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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecac04222048d4ec060c7f04cca741a1ad5efc9300f0d6b40a76392f6b514aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_hash/src/lib.rs:477-490 | crates/rspack_hash/src/lib.rs:513-526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_hash/src/lib.rs:477\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, \u0060crates/rspack_hash/src/lib.rs:475\u0060 calls \u0060write\u0060 and \u0060crates/rspack_hash/src/lib.rs:511\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":"crates/rspack_hash/src/lib.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd8ac6764182d91161515aca912bdd6482558d3bbb359b428ed67b1d56513d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:399-412 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:566-579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3334474dc5d39fce36b56494776f73cfa746677937e2c380b3100f7e4f1e4b9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_plugin_css/src/parser_and_generator/generator.rs:1172-1185 | crates/rspack_plugin_css/src/parser_and_generator/generator.rs:1267-1280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_css/src/parser_and_generator/generator.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5752b9adfdda8d913a993246d1eb84feba5a4d50b5bae4df13d4204ba15def"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_plugin_javascript/src/dependency/esm/esm_export_expression_dependency.rs:225-238 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_expression_dependency.rs:279-292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_export_expression_dependency.rs:225\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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_expression_dependency.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07e78a1eebb6e9468de4941a1d24daa9ceac9ee58e975075c687c8147a486da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs:197-210 | crates/rspack_plugin_javascript/src/dependency/esm/import_weak_dependency.rs:190-203 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/dependency/esm/import_weak_dependency.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 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 \u0060crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs:197\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":"crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5fbe39572bd0d2e0078d8ae8f378b68ebb60b75bf829bae76749bb164f6aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_plugin_javascript/src/runtime_context.rs:439-452 | crates/rspack_plugin_javascript/src/runtime_context.rs:542-555 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/rspack_plugin_javascript/src/runtime_context.rs:453\u0060 calls \u0060render_context_field\u0060 and \u0060crates/rspack_plugin_javascript/src/runtime_context.rs:556\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":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafceeca2e2f073d106e6b5077b2bf347fc3475722f53da8474b08dcf455af38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:177-190 | crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:254-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51f1a52660c40f73e298c7037877597a2b00f06054a6d7a32d14cd0380dbdc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_plugin_mf/src/sharing/provide_shared_plugin.rs:294-307 | crates/rspack_plugin_mf/src/sharing/provide_shared_plugin.rs:315-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_mf/src/sharing/provide_shared_plugin.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":"crates/rspack_plugin_mf/src/sharing/provide_shared_plugin.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"62df775518ba72b8e954887254f17d83ed2fdd5adac674efb91654fa0baf4d62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:232-244 | crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:332-344 | crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:480-492 \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 \u0060crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:232\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":"crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b080cc0d2d36801223cc77a0487757c982de7457b540aba83a3606b1c818f648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:3877-3889 | crates/css-module-lexer/src/dependencies.rs:3902-3914 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:3877\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":3877}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb13dfe0ed8183fb5ccc9f2274252fdd626dc8f6375f69c656e6bca17a3fbf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:4555-4567 | crates/css-module-lexer/src/dependencies.rs:4596-4608 \u2014 both copies are in the same file, so extract the block 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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":4555}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ceb095e2fdbad86453656ea6b04e80d7540e7d8d3c3a309806a51948ebaf12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_allocative/src/impls/rspack.rs:58-70 | crates/rspack_allocative/src/impls/rspack.rs:184-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_allocative/src/impls/rspack.rs:58\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":"crates/rspack_allocative/src/impls/rspack.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4b96cd86d982743bbf6e66641c91b21d3c261ec26ea82df8fc6719392a129a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_core/src/concatenated_module.rs:898-910 | crates/rspack_core/src/concatenated_module.rs:1723-1735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb5ba819ea7a5b3b0fa41a5f0eac90f70d5f82ac98dd3804bb9dcb01e4f70ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_core/src/context_module_factory.rs:362-374 | crates/rspack_core/src/context_module_factory.rs:390-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/context_module_factory.rs:362\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":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"891e2fc3f0f7b2e238c491e203d7b18b9f87b1b49ff6a376753fe60287418f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_core/src/options/module.rs:1546-1558 | crates/rspack_core/src/utils/module_rules.rs:286-298 \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 \u0060crates/rspack_core/src/options/module.rs:1546\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":"crates/rspack_core/src/options/module.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c6522f2226ca4d0b3c9d8083ce24788c42627f5e84a9e876111b84f95be4a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_plugin_css/src/runtime/mod.rs:183-195 | crates/rspack_plugin_extract_css/src/runtime.rs:198-210 \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 \u0060crates/rspack_plugin_css/src/runtime/mod.rs:183\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":"crates/rspack_plugin_css/src/runtime/mod.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d9398b152fd63dc7245e14c8f72bd93396b2525409dde4ed7b77d7b60ff9c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs:113-123 | crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs:166-178 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs\u0060 and \u0060crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs:123\u0060 calls \u0060get_path\u0060 and \u0060crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs:178\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":"crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8353cffac52a07450535dd21562f0ad99fbf0f91a90bc83f580e260e94e209d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:648-658 | crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:717-729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:648\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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"492e508386ee8793438ddf5bce64d9dead98c0fd7046346ff86ae24e0bd42a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_plugin_esm_library/src/split_chunks.rs:102-114 | crates/rspack_plugin_split_chunks/src/module_group.rs:265-277 \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 \u0060crates/rspack_plugin_esm_library/src/split_chunks.rs:102\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":"crates/rspack_plugin_esm_library/src/split_chunks.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9af2c61a43c21ce33636599a60f2a7ae33d4bba85f024e32061e37fba1544ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_plugin_javascript/src/magic_comment.rs:686-698 | crates/rspack_plugin_javascript/src/magic_comment.rs:700-712 \u2014 both copies are in the same file, so extract the block 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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"99536fb2d6c588c9d39bbfbba03953fb2dcdbde031413e901d201809d5ca2b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs:201-212 | crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs:214-226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs:201\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":"crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"805926ffa95706c36498f95685dccac576662945b602a05ec61a663ce2c18a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_plugin_javascript/src/utils/mangle_exports.rs:15-28 | crates/rspack_plugin_javascript/src/utils/mangle_exports.rs:45-57 \u2014 both copies are in the same file, so extract the block 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":"crates/rspack_plugin_javascript/src/utils/mangle_exports.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d34050c7d728922ce58a47245fd8207dde323a56ec8ae15735cd4a70e9b9954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_plugin_mf/src/container/container_entry_module.rs:66-78 | crates/rspack_plugin_rsc/src/rsc_entry_module.rs:84-96 \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":"crates/rspack_plugin_mf/src/container/container_entry_module.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa4bbfec3ce9700996059aba81d479e282ceb073982819aa7e91b2243310cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_plugin_rstest/src/parser_plugin.rs:414-426 | crates/rspack_plugin_rstest/src/parser_plugin.rs:486-498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_rstest/src/parser_plugin.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":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4853d1f4c13cbb23bc033539f301def32ae82b1276abf845dfc85ae1d0f247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/auto_public_path.rs:50-62 | crates/rspack_plugin_runtime/src/runtime_module/utils.rs:114-126 \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 \u0060crates/rspack_plugin_runtime/src/runtime_module/auto_public_path.rs:50\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":"crates/rspack_plugin_runtime/src/runtime_module/auto_public_path.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0721cab50c2be8055f5735625dc1744f379b5918515201f2904d69408320c83d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/make_deferred_namespace_object_runtime.rs:40-52 | crates/rspack_plugin_runtime/src/runtime_module/make_optimized_deferred_namespace_object_runtime.rs:40-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. 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":"crates/rspack_plugin_runtime/src/runtime_module/make_deferred_namespace_object_runtime.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ed74453ce9114c2f4dd461a911ba4016e7837a75c800ba50a3aaed0df08a09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/rspack_plugin_swc_js_minimizer/src/lib.rs:463-473 | crates/rspack_plugin_swc_js_minimizer/src/lib.rs:493-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_swc_js_minimizer/src/lib.rs:463\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":"crates/rspack_plugin_swc_js_minimizer/src/lib.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a65a81d270c1fcd4c8a8414186f44b0ad02bece16d5e747329b9e6d6aecd184"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:230-241 | crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:330-341 | crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:406-417 | crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:478-489 \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 after the matched lines, \u0060crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:419\u0060 calls \u0060walk_arguments\u0060, \u0060nodes\u0060, \u0060arguments\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:243\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":"crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f5228150d57c8dce221659f444287493b69c62d3f256e7f451c589fc2af214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:2866-2885 | crates/css-module-lexer/src/dependencies.rs:3065-3085 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:2866\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2866}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f04aefc592d8105a46a0694fc654db352c65e3c30288c5b331662d5b196439e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack/src/builder/target.rs:255-266 | crates/rspack/src/builder/target.rs:413-424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack/src/builder/target.rs:255\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":"crates/rspack/src/builder/target.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fb089a49e1c40fafa4b51c07015cfc0140eca626976e507e405897c1f3e9dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_binding_api/src/lib.rs:190-201 | crates/rspack_binding_api/src/lib.rs:218-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 \u0060crates/rspack_binding_api/src/lib.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":"crates/rspack_binding_api/src/lib.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc928492fa8fb9ef490245c408d84526d2d32bebf2657f978c9d2a2e9411cb98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_binding_api/src/raw_options/raw_external.rs:196-207 | crates/rspack_binding_api/src/resolver.rs:92-103 \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 \u0060crates/rspack_binding_api/src/raw_options/raw_external.rs:196\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":"crates/rspack_binding_api/src/raw_options/raw_external.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fb01dc09572a9c9ed202eab4fc9df1ea51e20afecb8b3d11e4b397901d3d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:637-648 | crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:678-689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:637\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 \u0060value\u0060 to \u0060RawCssModuleParserOptions\u0060 in one and \u0060RawCssAutoOrModuleParserOptions\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":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b4731b559c4f4cd72378845f72c5064599c1e3cdd9b357ab5bb3db8bab9d03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:823-834 | crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:853-862 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs:823\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":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca45e58a47b46ced2ef015570a592419d1c129a083b538176e87e454c4e2552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/rspack_core/src/compilation/build_module_graph/mod.rs:72-83 | crates/rspack_core/src/compilation/build_module_graph/module_executor/mod.rs:74-83 \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":"crates/rspack_core/src/compilation/build_module_graph/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"676e0ab70526de9b554daca76c3f9cc33d031489fdc3a18ddf163f8e4a13ebbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_javascript_compiler/src/compiler/parse.rs:150-161 | crates/rspack_loader_swc/src/lib.rs:321-332 \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 \u0060crates/rspack_javascript_compiler/src/compiler/parse.rs:150\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":"crates/rspack_javascript_compiler/src/compiler/parse.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8307a2399d86c196cbbfeff2775e625d46d3c91bbaeb601d30df051688a26e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:707-718 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:721-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af09f85c0a25c7e2396e8a9e25f61883ba24afa589504d4454ffc297d10aed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs:70-81 | crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs:81-91 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs\u0060 and \u0060crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 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":"crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc55fc997fc68a80d348b7190d10c1cc97b1161681e9bfb010ba17654970b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/rspack_plugin_devtool/src/module_filename_helpers.rs:160-171 | crates/rspack_plugin_devtool/src/module_filename_helpers.rs:200-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 \u0060crates/rspack_plugin_devtool/src/module_filename_helpers.rs:160\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":"crates/rspack_plugin_devtool/src/module_filename_helpers.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c2de2167e97b033d683f57bc7bc92fd585bd232eeef143235f18d8c54ac112"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_plugin_esm_library/src/optimize_chunks.rs:45-56 | crates/rspack_plugin_esm_library/src/optimize_chunks.rs:576-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_esm_library/src/optimize_chunks.rs:45\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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"001ca363895c65d0a50b596767cef1c8b3d320264da607e1b4b83dcc14fd28d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_exports_dependency.rs:195-206 | crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_self_reference_dependency.rs:164-175 \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 \u0060crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_exports_dependency.rs:195\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":"crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_exports_dependency.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d7af535ea80b431835f1dd0c465b9a454736fa9393d4d3cb1a846fa1af133c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201312 lines \u00D7 3): crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1321-1332 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1335-1346 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1347-1352 \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 \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1321\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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82774ef628750fd57983980b79c53faf44c52d861dfd834661a75fc18091410"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_plugin_javascript/src/magic_comment.rs:752-763 | crates/rspack_plugin_javascript/src/magic_comment.rs:765-776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c8801051347cfc638676ab9301d6a0b8f9bd58a486d4ef408eed54ba8cf40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:1820-1831 | crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:1879-1889 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"2489567a9ba866832a4dbac254d40b0e64ead5078092cdc6bd916d5ce3dfe433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs:205-216 | crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs:240-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs:205\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":"crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/parser.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a6bd70fab24dd16c4b79074a1be899bbb9c2bd9fb7597b2658b97eaabed43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:590-601 | crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:902-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:590\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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa8c759fcbecdcab68ea24075e116cefe1e99813112fba42a52d281571ad63c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs:465-476 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs:479-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. 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 \u0060stmt\u0060 to \u0060ForOfStatement\u0060 in one and \u0060ForInStatement\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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"596d5f5f5b63c825310b95f6bdeb0fadb49bf55f96ddc37bcc6e428370264c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs:2013-2024 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs:2032-2043 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbd5246f1c8afb682e4c22ed2a36af3618a63b22621eed52a1d0b2333738a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/rspack_plugin_rsc/src/server_plugin.rs:417-428 | crates/rspack_plugin_rsc/src/server_plugin.rs:522-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_rsc/src/server_plugin.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":"crates/rspack_plugin_rsc/src/server_plugin.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fb080b4f9e6afdf015565f7ffa6e16fb545ac5df2899afed1e37a7e29afd5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/rspack_plugin_rstest/src/parser_plugin.rs:362-373 | crates/rspack_plugin_rstest/src/plugin.rs:232-242 \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 \u0060crates/rspack_plugin_rstest/src/parser_plugin.rs:362\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":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1050606e413ff0f0f8ddc910fd38010c113f443194e34845c4a2122127f563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 6): crates/rspack_plugin_library/src/amd_library_plugin.rs:143-152 | crates/rspack_plugin_library/src/assign_library_plugin.rs:160-170 | crates/rspack_plugin_library/src/jsonp_library_plugin.rs:92-101 | crates/rspack_plugin_library/src/umd_library_plugin.rs:385-395 | crates/rspack_plugin_runtime/src/runtime_module/auto_public_path.rs:62-71 | crates/rspack_plugin_runtime/src/runtime_module/utils.rs:126-135 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_library/src/amd_library_plugin.rs\u0060 and \u0060crates/rspack_plugin_library/src/jsonp_library_plugin.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 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 \u0060crates/rspack_plugin_library/src/amd_library_plugin.rs:143\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060compilation\u0060 to \u0060\u0026mut Compilation\u0060 in one and \u0060\u0026Compilation\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":"crates/rspack_plugin_library/src/amd_library_plugin.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"18672ecfe22bf1d5634c734f0e75a5a98eb878409a3cf4a0ba340832609b0f9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/rspack_core/src/stats/mod.rs:1021-1034 | crates/rspack_core/src/stats/mod.rs:1106-1119 | crates/rspack_core/src/stats/mod.rs:1819-1832 \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 \u0060crates/rspack_core/src/stats/mod.rs:1021\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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ef91147304e05d52fb4dd69ef7e49c9a3b08e13de6f7d44763576d5d637bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:1293-1303 | crates/css-module-lexer/src/dependencies.rs:1354-1362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:1293\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71898f19d7e5976d6b3ff2f2a7602e7b3d380c3c8accd96e747b255e4aa2414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:2393-2403 | crates/css-module-lexer/src/dependencies.rs:2706-2716 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:2393\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, \u0060crates/css-module-lexer/src/dependencies.rs:2718\u0060 calls \u0060slice\u0060, \u0060trim_end_matches\u0060 and \u0060crates/css-module-lexer/src/dependencies.rs:2404\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"11327efb2ff6bc8c3b91d8c99bb653c13397806cb43d90e74b0740315d83a047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_binding_api/src/raw_options/raw_builtins/raw_circular_dependency.rs:86-96 | crates/rspack_binding_api/src/raw_options/raw_builtins/raw_circular_dependency.rs:98-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. 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":"crates/rspack_binding_api/src/raw_options/raw_builtins/raw_circular_dependency.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db9a5e2f6306bb2ddb51c168a2512f9979357ce76236afcfdddde390d1935c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:1790-1801 | crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:1893-1903 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:1790\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 \u0060item\u0060 to \u0060\u0026ProcessEntryBlock\u0060 in one and \u0060\u0026ProcessBlock\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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca0ba10ea622ead9da8e21eed1805e5acbb71fdb1bcbe7aa9fa31a6a8e6d6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_core/src/compilation/create_hash/mod.rs:134-144 | crates/rspack_core/src/compilation/create_hash/mod.rs:366-376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/compilation/create_hash/mod.rs:134\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":"crates/rspack_core/src/compilation/create_hash/mod.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"089e53a251adcf92a035f15165efcfb30ecf1c92b38820379518a292d9ae0122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_core/src/module_graph/mod.rs:212-222 | crates/rspack_core/src/module_graph/mod.rs:237-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 \u0060crates/rspack_core/src/module_graph/mod.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b754809d9746623e030c93fa97c930580398684e973e5da1e747e0f91855287e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_core/src/module_graph/mod.rs:448-458 | crates/rspack_core/src/module_graph/mod.rs:479-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/module_graph/mod.rs:448\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":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb8ae9162f72f7ad7216a80d0c9de0bd21688e06012697f3779953712d7b715"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:436-446 | crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:500-510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:436\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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"415d45c64aef0186c2a579fafea45571172ee7017ee3254e92c4c013da04b71b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_core/src/stats/mod.rs:986-997 | crates/rspack_core/src/stats/mod.rs:1069-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/stats/mod.rs:986\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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"3078371c6bd58cc601b2ef5a15a0e40964c1e5bcacb7e774881f19733932e497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_error/src/displayer/renderer/graphical.rs:482-492 | crates/rspack_error/src/displayer/renderer/graphical.rs:499-509 \u2014 both copies are in the same file, so extract the block 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":"crates/rspack_error/src/displayer/renderer/graphical.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffebb81cb3f8a2d6154013f6b778493972c7bb3bbdefcbe0897f47a30bee764e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_hash/src/lib.rs:463-473 | crates/rspack_hash/src/lib.rs:501-511 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/rspack_hash/src/lib.rs:475\u0060 calls \u0060write\u0060 and \u0060crates/rspack_hash/src/lib.rs:513\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":"crates/rspack_hash/src/lib.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0287524c40364aca923455111bb5ddf495ea126c44975611b456888424fbb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_javascript_compiler/src/compiler/parse.rs:63-73 | crates/rspack_javascript_compiler/src/compiler/parse.rs:87-97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_javascript_compiler/src/compiler/parse.rs:63\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":"crates/rspack_javascript_compiler/src/compiler/parse.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dbc02f7261ebb3316d3f092661b88777f129ebce4734849a6fd1410eb7465e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:1740-1750 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:1790-1800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:1740\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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0d752d0f97bca10af06ab9bda131a8de406fb244a77e3c34ac2911c3ec4e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_devtool/src/module_filename_helpers.rs:380-390 | crates/rspack_plugin_devtool/src/module_filename_helpers.rs:471-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 \u0060crates/rspack_plugin_devtool/src/module_filename_helpers.rs:380\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":"crates/rspack_plugin_devtool/src/module_filename_helpers.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddbaf44b82fa51a7d93b991ed9c1ac705c5e9406b01d4c385b4ca22402f4363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:633-643 | crates/rspack_plugin_library/src/system_library_plugin.rs:93-103 \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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e33b758566158b8a33426e561512e2b4a69a24de697768caad4cc714843821a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_esm_library/src/link.rs:1060-1070 | crates/rspack_plugin_esm_library/src/link.rs:1072-1082 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_esm_library/src/link.rs:1060\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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6499a6a55974c5b3e2995be3a937f19797d2987907fc853b2ae53e75e963a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_javascript/src/dependency/amd/amd_require_dependency.rs:164-174 | crates/rspack_plugin_javascript/src/dependency/amd/amd_require_dependency.rs:210-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":"crates/rspack_plugin_javascript/src/dependency/amd/amd_require_dependency.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73e74adc0f60bd4dafc0f6f2539b3ef31ae465b5de5267b8bbe31ea0ca06419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:208-218 | crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:140-149 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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 \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:208\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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f460e59fefdbb74c75e6734959a6cfc121b5637691b12e57df546ec2223582fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:2807-2817 | crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs:851-861 \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 \u0060crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:2807\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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":2807}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde2ce4a9c1361364602c613e3d6cbd51249625126c83dcec735ae264f1e2aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs:104-114 | crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs:176-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":"crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f40b3e0a33aa9b364d40b441d9d8279c4d3d612075a0104475f2120d7d6a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_library/src/amd_library_plugin.rs:103-113 | crates/rspack_plugin_library/src/umd_library_plugin.rs:117-127 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_library/src/amd_library_plugin.rs\u0060 and \u0060crates/rspack_plugin_library/src/umd_library_plugin.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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 \u0060crates/rspack_plugin_library/src/amd_library_plugin.rs:103\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":"crates/rspack_plugin_library/src/amd_library_plugin.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6948198e01cee027b2dc600153bfa60c399ad940a353710d2e5affc8b3acee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_mf/src/sharing/consume_shared_plugin.rs:392-402 | crates/rspack_plugin_mf/src/sharing/consume_shared_plugin.rs:451-461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_mf/src/sharing/consume_shared_plugin.rs:392\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":"crates/rspack_plugin_mf/src/sharing/consume_shared_plugin.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1db3493e2ec2620a08c50927859029fe90e763e2b37973e8eb80bb054745fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_rsc/src/rsc_entry_module.rs:164-174 | crates/rspack_plugin_rsc/src/rsc_entry_module.rs:274-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":"crates/rspack_plugin_rsc/src/rsc_entry_module.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7ad32ccb75733d733b56cd567eca912d2b12448517a857b41797e1c9c24581"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_resolver/src/lib.rs:174-184 | crates/rspack_resolver/src/lib.rs:195-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_resolver/src/lib.rs:174\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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f855561cf3e81c6f49ad92ab35f60186a4be1bf791e6e6221c0251b82869fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/swc_plugin_import/src/lib.rs:512-522 | crates/swc_plugin_import/src/lib.rs:528-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 \u0060crates/swc_plugin_import/src/lib.rs:512\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":"crates/swc_plugin_import/src/lib.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"505f637f1443d6e89ffaf8c3764032651f76c6e2014d43d85c291eb8c427ef99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/rspack_binding_api/src/build_info.rs:149-158 | crates/rspack_binding_api/src/build_info.rs:174-183 | crates/rspack_binding_api/src/build_info.rs:199-208 | crates/rspack_binding_api/src/build_info.rs:224-233 \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 \u0060crates/rspack_binding_api/src/build_info.rs:149\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":"crates/rspack_binding_api/src/build_info.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8c30ea211e29baa94ac14c2161aca1293b1a482e14fa6f4dd68904a14ef1aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/rspack/src/builder/target.rs:254-263 | crates/rspack/src/builder/target.rs:357-366 | crates/rspack/src/builder/target.rs:412-421 \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":"crates/rspack/src/builder/target.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ef04ceef336aef5a3018e0cef66a1fce232a930652aeab91e831feefec60ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_export_require_dependency.rs:460-469 | crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_exports_dependency.rs:198-207 | crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_self_reference_dependency.rs:167-176 \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 \u0060crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_export_require_dependency.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_exports_dependency.rs:195\u0060 calls \u0060get_exports_argument\u0060, \u0060get_module_argument\u0060 and \u0060crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_export_require_dependency.rs:458\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":"crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_export_require_dependency.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"862dcc535a4fca13628997c82929facfad6f0a129b9075c5d3f79627a921155e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs:188-197 | crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:183-192 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:190-199 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 157 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 \u0060crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs:188\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, \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:193\u0060 calls \u0060insert\u0060, \u0060get_runtime_requirements_with_external_install_chunk\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs:198\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":"crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff94460493546a5bc5f461e4d2378fe295eff80bbca8f09aaf82afe48f3c8d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:2918-2926 | crates/css-module-lexer/src/dependencies.rs:3125-3134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:2918\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a7fad494aa57485f201b3d7e4447117dc4ba007b90ac676bbf710f348e1baa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_binding_api/src/fs_node/write.rs:337-346 | crates/rspack_binding_api/src/fs_node/write.rs:376-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/fs_node/write.rs:337\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":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e296cfc7f3b99420d5485c8f7bfffe0731376b0ec548f0d4399e03efc26081"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs:685-694 | crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs:698-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":"crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89817c41d668fe01d2e08c19d64a35cdc8a8784a0579ceea8a68fb115c260a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_core/src/chunk.rs:412-421 | crates/rspack_core/src/chunk.rs:456-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/chunk.rs:412\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, \u0060crates/rspack_core/src/chunk.rs:467\u0060 calls \u0060is_initial\u0060 and \u0060crates/rspack_core/src/chunk.rs:423\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":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"448b7e32375b4eb0c0e7d4262eec3f5b4cfaf1f8138efdd2271e31e77503fd7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:2591-2599 | crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:2612-2621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:2591\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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a654308c09add1786e15bd5af5020e2bdcfc3a88b3d3aedf2da2b9824a6920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_core/src/normal_module_factory.rs:49-58 | crates/rspack_core/src/normal_module_factory.rs:77-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/normal_module_factory.rs:49\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":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e817348059176f82f582a3a632c098c57cc35532addc35955da782c1117fde4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_core/src/stats/utils.rs:255-264 | crates/rspack_core/src/stats/utils.rs:267-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 \u0060crates/rspack_core/src/stats/utils.rs:255\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":"crates/rspack_core/src/stats/utils.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87a63b2ceb37308a1f3458cd196ff03789a57f10b16269e0ea215ba5b2bebdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/cjs_finder.rs:83-92 | crates/rspack_loader_swc/src/rsc_transforms/cjs_finder.rs:124-133 \u2014 both copies are in the same file, so extract the block 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 \u0060n\u0060 to \u0060\u0026ClassMethod\u0060 in one and \u0060\u0026MethodProp\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":"crates/rspack_loader_swc/src/rsc_transforms/cjs_finder.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffe467c5498ed25fc74f32b1ee9cdaff0f53fa7cf0af4458a7ba380841bab44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:382-391 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:547-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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ff503c8109b8f19debf2eb0d58d3868d32ae64ceb81e369d8e9baeb1a18c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:2229-2238 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:2291-2300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:2229\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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eacd714a538888df16125a9c3034ff3292df03638fa4181d2bfb93e367c7003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_plugin_javascript/src/dependency/context/import_meta_context_dependency.rs:189-198 | crates/rspack_plugin_javascript/src/dependency/context/require_context_dependency.rs:137-146 \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 \u0060crates/rspack_plugin_javascript/src/dependency/context/import_meta_context_dependency.rs:189\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":"crates/rspack_plugin_javascript/src/dependency/context/import_meta_context_dependency.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"572c2ca2cf551975e7822e9428c9a04c25923df81db9cc5b1d0004892f4bb325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:602-611 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:702-712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:602\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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"43580d35cd6d67b9c85b69c081cdfc5fb221965a4146377cc63f97c9f7075e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:357-366 | crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:433-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:357\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, \u0060crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:356\u0060 calls \u0060callee\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:432\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":"crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fb8b0841b30cbdc227aa7b63ed4d9ace02854297b518fd7715962606251df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:286-294 | crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:361-370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:286\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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41d232dea56d4ee8052cbc8ffe9ec8168bce2957e74394fc8f58cb99e8ecd75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/mod.rs:792-801 | crates/rspack_plugin_javascript/src/plugin/mod.rs:1346-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 \u0060crates/rspack_plugin_javascript/src/plugin/mod.rs:792\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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a17a1770b894909aba8c8c24e654ab9e45806436e0ad5bbd92ea226a8d986d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_plugin_mf/src/manifest/mod.rs:430-439 | crates/rspack_plugin_mf/src/manifest/mod.rs:461-470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_mf/src/manifest/mod.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b86cf20a9a941b86943ad68125746af23a4a4c3da656e8d5211a6bad2fed394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/rspack_plugin_rslib/src/dyn_import_external.rs:136-144 | crates/rspack_plugin_rslib/src/worker_external.rs:31-40 \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 \u0060crates/rspack_plugin_rslib/src/dyn_import_external.rs:136\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":"crates/rspack_plugin_rslib/src/dyn_import_external.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9e1b37c227d4dfd7df76462818da25f73ec42c95073b43a533de01e2afac49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs:307-316 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:279-285 \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 \u0060crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs:307\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":"crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8901d55249393866bdc0babab724a9482e4b0e357816649f3e1cc690d5a0ceaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:252-260 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:263-272 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 157 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":"crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"713975769a0dfdc716a4cb8f7eab5081b51f91c50c740a8da07ee8e609ca6109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/rspack_binding_api/src/module_graph.rs:196-204 | crates/rspack_binding_api/src/module_graph.rs:225-233 | crates/rspack_binding_api/src/module_graph.rs:254-262 \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 \u0060crates/rspack_binding_api/src/module_graph.rs:196\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":"crates/rspack_binding_api/src/module_graph.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d98fe9dac1cc4f9a6eba76b5ce35f2ef7b2d22a34d2fa97e373fea90746f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:2230-2238 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:2259-2267 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:2292-2300 \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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0091c810373969b3c5df18110e768a3790f289bc42ca72d19ddddc6ea3ce9675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack/src/builder/mod.rs:2781-2789 | crates/rspack/src/builder/mod.rs:2792-2800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack/src/builder/mod.rs:2781\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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"881c7042a738ca7646d50c59fce1df1b94417b69bed66ad4d5a9bc9ecfc97274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_allocative_derive/src/derive_allocative.rs:296-304 | crates/rspack_allocative_derive/src/derive_allocative.rs:318-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_allocative_derive/src/derive_allocative.rs:296\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":"crates/rspack_allocative_derive/src/derive_allocative.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"db90d70f319f3c07525e776eb431f214f1c51999fdb6cadda1df384b700831ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_binding_api/src/compilation/dependencies.rs:107-115 | crates/rspack_binding_api/src/compilation/dependencies.rs:122-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 \u0060crates/rspack_binding_api/src/compilation/dependencies.rs:107\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":"crates/rspack_binding_api/src/compilation/dependencies.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb22d858a59a3901aeae4616a2a49588844a161a91fa15f117df4bcc68e30436"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/rspack_binding_api/src/module.rs:165-172 | crates/rspack_napi/src/utils.rs:11-19 \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 \u0060crates/rspack_binding_api/src/module.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rspack_binding_api/src/module.rs:173\u0060 calls \u0060from_raw\u0060, \u0060raw\u0060, \u0060coerce_to_string\u0060 and \u0060crates/rspack_napi/src/utils.rs:20\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":"crates/rspack_binding_api/src/module.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"363c8a554bc0ff23511e19cd095aa7d3c0cb2aa59bc8a1764ddd57a79625f475"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_binding_api/src/options/raw_resolve.rs:138-146 | crates/rspack_binding_api/src/options/raw_resolve.rs:276-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":"crates/rspack_binding_api/src/options/raw_resolve.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"44351958525be1c434fc6e9db2fe70837a9ac878ae3d619e06df976bb076d745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:1095-1103 | crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:1105-1113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:1095\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":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"489719169285435b7672f7196aa37ef175bd000aafcd5ada182716f5d97459fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_cacheable_macros/src/cacheable/args.rs:25-33 | crates/rspack_cacheable_macros/src/cacheable_dyn/args.rs:16-24 \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 \u0060crates/rspack_cacheable_macros/src/cacheable/args.rs:25\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":"crates/rspack_cacheable_macros/src/cacheable/args.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c32eaa721fa19d7ea994c8e955f60af64f00fa5148afa3bf98754ad02bac27b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/rspack_cacheable_macros/src/cacheable/impl_with.rs:34-41 | crates/rspack_cacheable_macros/src/cacheable_dyn/impl_trait.rs:14-22 \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 \u0060crates/rspack_cacheable_macros/src/cacheable/impl_with.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. 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":"crates/rspack_cacheable_macros/src/cacheable/impl_with.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51fb28af76712c2804fd943e6528f95f1615faeffee852e41a2900482ea3555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/rspack_core/src/resolver/resolver_impl.rs:196-206 | crates/rspack_core/src/resolver/resolver_impl.rs:227-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/resolver/resolver_impl.rs:196\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":"crates/rspack_core/src/resolver/resolver_impl.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a327f79e92955c882039e5dd8356203943094fe6a604a72bbba2d71e573eb41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_core/src/runtime.rs:276-284 | crates/rspack_core/src/runtime.rs:295-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/runtime.rs:276\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":"crates/rspack_core/src/runtime.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb1a7fb67db5cc0f319ea7de35db0e8d5078f1996cc6f37851527c5a69f29cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_core/src/stats/mod.rs:1412-1420 | crates/rspack_core/src/stats/mod.rs:1423-1431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/stats/mod.rs:1412\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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b9f73fbbb1c2a858a3202866f60cb937cb2837ec1db200ed77345dc54b81f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_core/src/stats/utils.rs:168-176 | crates/rspack_core/src/stats/utils.rs:216-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/stats/utils.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"677c0c09c8426a53caf25be0678bc2579fb699845a35edd8c25edad5a7f9d988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:478-486 | crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:631-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 \u0060crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs:478\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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"df76eacc15e4e43da7aa693e346555954827121e72115d1653392ab44a0bc4b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_esm_library/src/link.rs:2193-2201 | crates/rspack_plugin_esm_library/src/link.rs:2264-2272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b5738cb713ed5d04cf776f87586cda2ea50c0295e302245ed3f7686a3483ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_and_generator/mod.rs:552-560 | crates/rspack_plugin_javascript/src/parser_and_generator/mod.rs:565-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 \u0060crates/rspack_plugin_javascript/src/parser_and_generator/mod.rs:552\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":"crates/rspack_plugin_javascript/src/parser_and_generator/mod.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d3d6b423548ab1e8ff431179ee7e570c1ff886b9476cbce170d0dc31fd1bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:153-161 | crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:85-93 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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 \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:153\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, \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:151\u0060 calls \u0060insert\u0060, \u0060into\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:83\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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b00605f3e108ee39c2876703f1434ce24fafeac1cc9668a1b516e2995e772c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:474-480 | crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:510-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:510\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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"287bf710fcd5ac97596ce8b910cf3c3f80e3471c69517bbfc85d6ea8dae97b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs:1097-1105 | crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs:1200-1208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs:1097\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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9432840591c5ce51994425477f94ae2cd1fb848bb548bae411fa545a2e256b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:310-319 | crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:380-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs:310\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":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8e7d90048bfb37c2c4a39ad25011a0fddbf64aff88cb31cc658954b6c18176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_javascript/src/runtime_context.rs:319-327 | crates/rspack_plugin_javascript/src/runtime_context.rs:460-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/runtime_context.rs:319\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":"crates/rspack_plugin_javascript/src/runtime_context.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7763f1a1cb47396b2723c09f024b9b0fbc360f1e716078352dc942022ab548e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/rspack_plugin_mf/src/sharing/provide_shared_module.rs:175-182 | crates/rspack_plugin_rsc/src/rsc_entry_module.rs:359-367 \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 \u0060crates/rspack_plugin_mf/src/sharing/provide_shared_module.rs:175\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":"crates/rspack_plugin_mf/src/sharing/provide_shared_module.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a4e385a05345970a5b6fedfac94174cc008a5fda1fbbe476e66ea0a00f5b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_rsdoctor/src/plugin.rs:539-547 | crates/rspack_plugin_rsdoctor/src/plugin.rs:576-584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_rsdoctor/src/plugin.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":"crates/rspack_plugin_rsdoctor/src/plugin.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"da51903c31ee97c00c637ad20379cc5d35bcddf3df699a5eca5cba7e5f63dbc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_rslib/src/url_external.rs:48-56 | crates/rspack_plugin_rslib/src/worker_external.rs:46-54 \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":"crates/rspack_plugin_rslib/src/url_external.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7389a8679f7f56193a71f30955c4cf52bb370bbe90872d2b638ca6fd201889fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/utils.rs:80-88 | crates/rspack_plugin_runtime/src/runtime_module/utils.rs:149-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_runtime/src/runtime_module/utils.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71c463154ad481150449b180727b5440be2887ddb45dabccc2bc582c750a196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_tracing_perfetto/src/lib.rs:245-253 | crates/rspack_tracing_perfetto/src/lib.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_tracing_perfetto/src/lib.rs:245\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 \u0060id\u0060 to \u0060\u0026span::Id\u0060 in one and \u0060Id\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":"crates/rspack_tracing_perfetto/src/lib.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd76cd32f7b1502af5577c3e0c32f732b665029c9c3c4a46fca0a60379cad17a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/rspack_binding_api/src/build_info.rs:160-167 | crates/rspack_binding_api/src/build_info.rs:185-192 | crates/rspack_binding_api/src/build_info.rs:210-217 | crates/rspack_binding_api/src/build_info.rs:235-242 \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 \u0060crates/rspack_binding_api/src/build_info.rs:160\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":"crates/rspack_binding_api/src/build_info.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a0dca61236e5eaa969c154d5bff7d7368b1832707831f22289e99d541c4b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1325-1332 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1339-1346 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1353-1360 | crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1374-1381 \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 \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs:1325\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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aa55c48e0310e30f9c4a3413f184395c874b32c66b7d56dd7a2d41a736808d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 4): crates/rspack_binding_api/src/async_dependency_block.rs:147-150 | crates/rspack_binding_api/src/chunk.rs:384-391 | crates/rspack_binding_api/src/chunk_group.rs:227-234 | crates/rspack_binding_api/src/module_graph_connection.rs:228-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 all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/async_dependency_block.rs:147\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, \u0060crates/rspack_binding_api/src/chunk.rs:384\u0060 calls \u0060entry\u0060 and \u0060crates/rspack_binding_api/src/async_dependency_block.rs:147\u0060 does not \u2014 after which the two agree again for 5 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":"crates/rspack_binding_api/src/async_dependency_block.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f501eb23d3737818a22da1f5c42fe7d26d6c8da1ed2bd941bb8ac20aba5a892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/rspack_core/src/context_module.rs:1067-1074 | crates/rspack_core/src/context_module.rs:1145-1152 | crates/rspack_core/src/context_module.rs:1255-1262 \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 \u0060crates/rspack_core/src/context_module.rs:1067\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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ce62091891e1246c8d2d2c5e5883871e61ab6a81731a480cf5dafad01e6fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/rspack_core/src/options/module.rs:1363-1370 | crates/rspack_core/src/options/module.rs:1406-1413 | crates/rspack_core/src/options/module.rs:1652-1659 \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 \u0060crates/rspack_core/src/options/module.rs:1363\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":"crates/rspack_core/src/options/module.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b819f4360a91891168967e9c41e927adbd2882e1839cc1f1248446c6077c351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:248-255 | crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:177-184 | crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:1472-1479 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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 \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:248\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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25cca3001e3bfb7867c6ac13737a7f1796d879124e7d7aebe79049ff8e40b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:769-776 | crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:864-871 | crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:914-921 \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 \u0060crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs:769\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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecad6051e176dfc46e9ff9be97f5104e216c92624bf53a09dbfa9e324ca60244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs:164-171 | crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:199-206 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:206-213 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 157 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":"crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51b70284fa70f54b39c3cbb7223fea78d08b29770147aecaf50403f97ac89bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/rspack_core/src/binding/cell.rs:86-92 | crates/rspack_core/src/binding/cell.rs:139-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/binding/cell.rs:86\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":"crates/rspack_core/src/binding/cell.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fbea9abfcf131252a8a45712aa4372d489c132405376ef632ec2c65651f5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:719-726 | crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:1999-2006 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb1920098e5c6021b66f44fba0f1bb3607da40d083d4a064cde5093671baced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_core/src/stats/utils.rs:249-256 | crates/rspack_plugin_rsdoctor/src/chunk_graph.rs:65-72 \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 \u0060crates/rspack_core/src/stats/utils.rs:249\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":"crates/rspack_core/src/stats/utils.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c3134667e25fc5dc5d0346cba2dbaedd0187c7e5158f872901d96b487d19e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_core/src/utils/module_rules.rs:267-274 | crates/rspack_core/src/utils/module_rules.rs:441-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/utils/module_rules.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":"crates/rspack_core/src/utils/module_rules.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"accda905c92ad8f72a8b0e012e6a4fa9bd10a6cbfe0d042ba3c59d1011bdaffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_ids/src/sync_module_ids_plugin.rs:139-146 | crates/rspack_ids/src/sync_module_ids_plugin.rs:200-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. 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":"crates/rspack_ids/src/sync_module_ids_plugin.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca37520542cec0133ca3cdad02af853e53154108cf91a7b3682508ac993c1a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/rspack_plugin_asset/src/lib.rs:366-372 | crates/rspack_plugin_rslib/src/asset.rs:23-30 \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 \u0060crates/rspack_plugin_asset/src/lib.rs:366\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":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b421534603ca2230ff649b53a7075b3428cc2345c9d43d1c2a691456efedddb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs:573-580 | crates/rspack_plugin_extract_css/src/plugin.rs:706-713 \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 \u0060crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs:573\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":"crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2974c02d5012edfff9a3126de38a96c5a79baf739343838575303c103649a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:605-612 | crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:692-699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:605\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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"01612996c9ecea78164581cc0016fa877b61082a53eccb8955457e4c69fc2f7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_hmr/src/lib.rs:434-441 | crates/rspack_plugin_hmr/src/lib.rs:526-533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_hmr/src/lib.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf17f84f660d785044fc348f839615cb8f9193962e1082cf4157ba3ae2f8cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/walk_data.rs:351-358 | crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/walk_data.rs:374-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/walk_data.rs:351\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":"crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/walk_data.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f4165184f950e566d46c0bec5e7be6d5bbb0df8e13c3ffc0cf509ff3c07c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:370-377 | crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:446-453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:370\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, \u0060crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:378\u0060 calls \u0060is_empty\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs:454\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":"crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ece26909a89bc19a204fcb9f4b4e9b1bf6eb5c42c8bda3a8159ac60b63f931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.rs:175-182 | crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.rs:209-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 \u0060crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.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. 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":"crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ccc989769444909ae8887fdc895bcbd949e3866466363054f62741003a29a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs:225-232 | crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs:235-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5179357f44f56aab29d6004cd190183eb719ef2e88e0bc40ff3bee3e24488935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:543-550 | crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:613-620 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:543\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, \u0060crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:611\u0060 calls \u0060span\u0060, \u0060arguments\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs:542\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":"crates/rspack_plugin_javascript/src/parser_plugin/worker_plugin.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"210fb72573b1f29cd2080276b90a1daa2c99f4a655607d5ba74785fafe2d1d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:531-538 | crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:542-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a5f73e5de46d6329c5321544a8d0c5a43b5bfe04552e5b67408619b4e10912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs:50-57 | crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs:149-156 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs:62\u0060 calls \u0060quote_meta\u0060, \u0060join\u0060 and \u0060crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs:158\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":"crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abe392e8f2d4e72163013388f0bff1cd4f4e08f5623d5b096c09cd206563f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs:1111-1118 | crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs:1132-1139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bccf93e85f0eb43ef60088f815e4e69c7358a99c072aa5323fdf2aa87f43c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_sri/src/manifest.rs:269-277 | crates/rspack_plugin_sri/src/manifest.rs:442-450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_sri/src/manifest.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"562f4fefde2a98378d9969ee7f794bc13754c378f1d4d47fc86c5409184f4b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_tools/src/compare/snapshot.rs:25-32 | crates/rspack_tools/src/compare/snapshot.rs:34-41 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_tools/src/compare/snapshot.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da2d9242863556143cc5376a9b0ed5aed072b0696af48c075ce0de92b6c49d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 12): crates/rspack/src/builder/browserslist_target.rs:112-118 | crates/rspack/src/builder/browserslist_target.rs:133-139 | crates/rspack/src/builder/browserslist_target.rs:153-159 | crates/rspack/src/builder/browserslist_target.rs:174-180 | crates/rspack/src/builder/browserslist_target.rs:192-198 | crates/rspack/src/builder/browserslist_target.rs:210-216 | crates/rspack/src/builder/browserslist_target.rs:231-237 | crates/rspack/src/builder/browserslist_target.rs:254-260 | crates/rspack/src/builder/browserslist_target.rs:272-278 | crates/rspack/src/builder/browserslist_target.rs:290-296 | crates/rspack/src/builder/browserslist_target.rs:311-317 | crates/rspack/src/builder/browserslist_target.rs:332-338 \u2014 all 12 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 \u0060crates/rspack/src/builder/browserslist_target.rs:112\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, \u0060crates/rspack/src/builder/browserslist_target.rs:251\u0060 calls \u0060Some\u0060 and \u0060crates/rspack/src/builder/browserslist_target.rs:131\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":"crates/rspack/src/builder/browserslist_target.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"481935291cc80ea4536b92a2e1ee950ae45f2395d07e1f1520bed3467a0059da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/rspack/src/builder/browserslist_target.rs:125-131 | crates/rspack/src/builder/browserslist_target.rs:166-172 | crates/rspack/src/builder/browserslist_target.rs:223-229 | crates/rspack/src/builder/browserslist_target.rs:244-250 \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 \u0060crates/rspack/src/builder/browserslist_target.rs:125\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, \u0060crates/rspack/src/builder/browserslist_target.rs:251\u0060 calls \u0060Some\u0060 and \u0060crates/rspack/src/builder/browserslist_target.rs:132\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":"crates/rspack/src/builder/browserslist_target.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"860b6b4aa13f533a4c96451ac484d3c84774a694ccee169ab6cd1dc86c6a679a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/rspack_binding_api/src/chunk.rs:98-104 | crates/rspack_binding_api/src/chunk.rs:133-139 | crates/rspack_binding_api/src/chunk.rs:145-151 | crates/rspack_binding_api/src/chunk.rs:210-216 \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 \u0060crates/rspack_binding_api/src/chunk.rs:98\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":"crates/rspack_binding_api/src/chunk.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00fe1536e90421afa71c40579cd35c0b1cd2759b6f98fd60fd1033a986763cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/rspack_plugin_esm_library/src/optimize_chunks.rs:47-53 | crates/rspack_plugin_esm_library/src/optimize_chunks.rs:578-584 | crates/rspack_plugin_rslib/src/dyn_import_external.rs:139-145 | crates/rspack_plugin_rslib/src/worker_external.rs:35-41 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_esm_library/src/optimize_chunks.rs:47\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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4963f8ec132aade6a982afcbb5b947e4cd2a585a44ab634915a362b595103040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/rspack_binding_api/src/module_graph.rs:206-214 | crates/rspack_binding_api/src/module_graph.rs:235-243 | crates/rspack_binding_api/src/module_graph.rs:264-272 \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 \u0060crates/rspack_binding_api/src/module_graph.rs:206\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":"crates/rspack_binding_api/src/module_graph.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"32afc0eca753e17aeb1c455ed8786e7d2e4a4b62d3c4c89913abc624d71055c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/rspack_core/src/stats/mod.rs:1038-1043 | crates/rspack_core/src/stats/mod.rs:1123-1128 | crates/rspack_core/src/stats/mod.rs:1836-1842 \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 \u0060crates/rspack_core/src/stats/mod.rs:1038\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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc7d361922f0e366dc66f1f8b25cea374ec57be6ec4585bb6adb517947d79f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:179-185 | crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:210-216 | crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:256-262 \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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a647de575e235c1d5cc0e4c0b884ad38f679ffb7b677e317effccf82befa4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/rspack_plugin_rstest/src/parser_plugin.rs:247-253 | crates/rspack_plugin_rstest/src/parser_plugin.rs:302-308 | crates/rspack_plugin_rstest/src/parser_plugin.rs:630-636 \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 \u0060crates/rspack_plugin_rstest/src/parser_plugin.rs:247\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":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"979c57796cc1492f602875394c9ca36cf5978f55bbf28352995e7f266df6e33f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/rspack/src/builder/browserslist_target.rs:184-190 | crates/rspack/src/builder/browserslist_target.rs:202-208 | crates/rspack/src/builder/browserslist_target.rs:217-222 \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 \u0060crates/rspack/src/builder/browserslist_target.rs:184\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rspack/src/builder/browserslist_target.rs:183\u0060 calls \u0060MajorMinor\u0060 and \u0060crates/rspack/src/builder/browserslist_target.rs:217\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":"crates/rspack/src/builder/browserslist_target.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"52abb508ca63499250b83ec73f290ba5a5ebc5e38996b9937de6234ff23c29fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_binding_api/src/fs_node/write.rs:197-203 | crates/rspack_binding_api/src/fs_node/write.rs:220-226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/fs_node/write.rs:197\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":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"26472449399e8ce3144c54b0e0a0f08af3162a0f025fc70a897638220102c656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_binding_api/src/fs_node/write.rs:237-243 | crates/rspack_binding_api/src/fs_node/write.rs:254-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/fs_node/write.rs:237\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":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c0b488197dd62c2cbb667f51e33fe2a5d4eb7b3c618cce60001b1bbea55535"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_binding_api/src/fs_node/write.rs:317-323 | crates/rspack_binding_api/src/fs_node/write.rs:416-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/fs_node/write.rs:317\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":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0456d6989c25372b78e73769a4780276a205de39ded1a56fd07796d819fae6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs:352-358 | crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs:785-791 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs:352\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":"crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"629d3a79bade6fe5ed01e3863b44a0473519653f6580a763f1487954469f43c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_core/src/chunk.rs:557-563 | crates/rspack_core/src/chunk.rs:632-638 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/chunk.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26d1deecaad33efb3eef7b03ccb3a653dde9a6a3bf10f9babe9fad06367bfc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:1022-1027 | crates/rspack_plugin_split_chunks/src/plugin/chunk.rs:138-144 \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 \u0060crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs:1022\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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b203f5f9ca62a7ea1a42463d6e063236fb01448637e9260e5e95856354db962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_core/src/options/resolve/clever_merge.rs:483-489 | crates/rspack_core/src/options/resolve/clever_merge.rs:497-503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/options/resolve/clever_merge.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"1225f069e88a0de1d227846f29ff8f9829192c3596ab26ee9ae91f97275f4d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_core/src/utils/mod.rs:200-207 | crates/rspack_core/src/utils/mod.rs:223-230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/utils/mod.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":"crates/rspack_core/src/utils/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3681d7b2962118dd480c12dd8c22bbfe67ebddf94acc40e3263f314773428b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_ids/src/named_chunk_ids_plugin.rs:191-197 | crates/rspack_ids/src/named_module_ids_plugin.rs:166-172 \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 \u0060crates/rspack_ids/src/named_chunk_ids_plugin.rs:191\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":"crates/rspack_ids/src/named_chunk_ids_plugin.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70c603b570153ceb72966551d8ee377367076d325da667f30554a536ed1b845"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_napi/src/threadsafe_function.rs:264-270 | crates/rspack_napi/src/threadsafe_function.rs:288-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_napi/src/threadsafe_function.rs:264\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":"crates/rspack_napi/src/threadsafe_function.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7bb9e7bb3d5a24f61ee4c289d19bf50dd7dd8047a4b6261b0842f8c7416a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:1469-1475 | crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:1518-1524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d281f3d67496bd9ee250394a022fb109c8affbcfbaebeb16345893da3084082f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/import_meta_context_dependency_parser_plugin.rs:304-310 | crates/rspack_plugin_javascript/src/parser_plugin/import_meta_context_dependency_parser_plugin.rs:354-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/import_meta_context_dependency_parser_plugin.rs:304\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":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_context_dependency_parser_plugin.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6fda6d9ec478ef60e79c5ce07ce502a195404d11ea26418d631b8bbbca98d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs:681-687 | crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs:692-698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs:681\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":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaedaa41af55f6ba027fe150ad1f9d98d00b6b7e32d474b4078c232febfd0589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:227-233 | crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:278-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:227\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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3915efdd2a872bc146ad9aa0ec405bb8cdc87594d7f16f02f85b01eb5b28a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_plugin_library/src/assign_library_plugin.rs:153-159 | crates/rspack_plugin_library/src/umd_library_plugin.rs:378-384 \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 \u0060crates/rspack_plugin_library/src/assign_library_plugin.rs:153\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":"crates/rspack_plugin_library/src/assign_library_plugin.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9bb47db881a8c24a902152466320ea370d2f7d241b4045cd3fb079a7e78248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_plugin_mf/src/manifest/mod.rs:422-428 | crates/rspack_plugin_mf/src/manifest/mod.rs:482-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 \u0060crates/rspack_plugin_mf/src/manifest/mod.rs:422\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":"crates/rspack_plugin_mf/src/manifest/mod.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6570212ef64110664077e3f7096c51c92ce4dfbb54fb3027ba1c1876d3e373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_plugin_rstest/src/plugin.rs:390-396 | crates/rspack_plugin_rstest/src/plugin.rs:408-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rstest/src/plugin.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e320a3b8712bda05456d4d502b85d98d02bf153c2460a13445bdf6983f363107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:134-140 | crates/rspack_plugin_runtime/src/module_chunk_format.rs:154-160 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/common_js_chunk_format.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/module_chunk_format.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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 \u0060crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:134\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, \u0060crates/rspack_plugin_runtime/src/module_chunk_format.rs:150\u0060 calls \u0060create_chunk_code_template\u0060, \u0060json_stringify\u0060, \u0060expect_id\u0060 and \u0060crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:133\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":"crates/rspack_plugin_runtime/src/common_js_chunk_format.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"284b5dc572c18a32ff0ecfe3bba49e391540fc1aeff8786cdfd8825f32aa3c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/rspack_macros/src/rspack_hash.rs:146-152 | crates/rspack_macros/src/rspack_hash.rs:172-178 | crates/rspack_macros/src/rspack_hash.rs:221-226 | crates/rspack_macros/src/rspack_hash.rs:253-258 \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 \u0060crates/rspack_macros/src/rspack_hash.rs:146\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":"crates/rspack_macros/src/rspack_hash.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb7b994a1924721bb33e2280f2794341323384818dbcedb08266485410b3fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/rspack_plugin_library/src/amd_library_plugin.rs:80-85 | crates/rspack_plugin_library/src/jsonp_library_plugin.rs:63-68 | crates/rspack_plugin_library/src/system_library_plugin.rs:68-73 | crates/rspack_plugin_library/src/umd_library_plugin.rs:88-93 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_library/src/amd_library_plugin.rs\u0060 and \u0060crates/rspack_plugin_library/src/jsonp_library_plugin.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 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":"crates/rspack_plugin_library/src/amd_library_plugin.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d137e0598f7c62979cb8875c8e319edf9dd8bd5dd6f54ad333395e8c4eb54747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs:157-163 | crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:191-197 | crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:183-188 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:190-195 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd015cae04408e00e2b6606c634b57781254805fade87746214904027aa1b394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_binding_api/src/compilation/mod.rs:914-919 | crates/rspack_binding_api/src/compilation/mod.rs:1017-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 \u0060crates/rspack_binding_api/src/compilation/mod.rs:914\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, \u0060crates/rspack_binding_api/src/compilation/mod.rs:913\u0060 calls \u0060within_compiler_context_sync\u0060, \u0060clone\u0060 and \u0060crates/rspack_binding_api/src/compilation/mod.rs:1015\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":"crates/rspack_binding_api/src/compilation/mod.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48c6be89723df08e1e8adbbf79d6ce48417beac1b7a511fedf4560c0025f3f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_binding_api/src/exports_info.rs:44-49 | crates/rspack_binding_api/src/exports_info.rs:60-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/exports_info.rs:44\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":"crates/rspack_binding_api/src/exports_info.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f354d6143e43588962bf01a27864a0cebb10540eb2f3988fed656c9b52e1c8a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_binding_api/src/file_system_dependency_strings.rs:20-25 | crates/rspack_binding_api/src/lib.rs:172-177 \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 \u0060crates/rspack_binding_api/src/file_system_dependency_strings.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":"crates/rspack_binding_api/src/file_system_dependency_strings.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"be555bbc2cfce162bdb21341af24e76b5e15dd0bbd3d4be2a89253e13321a1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:935-940 | crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:976-981 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/new_cache/snapshot/file_system_info.rs:935\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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1a7e750e015cdf6b8de904a229de25938e321def246e96cec97251f819c541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_napi/src/threadsafe_function.rs:161-167 | crates/rspack_napi/src/threadsafe_function.rs:200-206 \u2014 both copies are in the same file, so extract the block 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":"crates/rspack_napi/src/threadsafe_function.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"091f0093bb92158219528c8812cbf8614d132148e2ad83332dec07379df15213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:1669-1674 | crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs:403-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:1669\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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb71d21a5a4d3aae2cef4db7ee8d357167a45133171c8f01092c527d1ef169c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:214-219 | crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:265-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:214\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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9739e5e2b9f79ab6771c1a77bd96748f9ce142abc334e5540e74b8c2e7d711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:566-571 | crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:603-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:566\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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d5a0ebec6f96b315233b036d558f828df2ac1a4f989a6fb35a302fc6194b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_plugin_library/src/export_property_library_plugin.rs:64-69 | crates/rspack_plugin_library/src/module_library_plugin.rs:50-55 \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":"crates/rspack_plugin_library/src/export_property_library_plugin.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e62db2d5615da37bf9c5193ba9a94964611d601418810a29b3d689e1288d69c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_plugin_runtime/src/array_push_callback_chunk_format.rs:29-34 | crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:33-38 \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":"crates/rspack_plugin_runtime/src/array_push_callback_chunk_format.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3733f7330bff73b70273ec04d619c99647dd679aa85b8b231bc27843b609fd2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_plugin_split_chunks/src/plugin/module_group.rs:159-164 | crates/rspack_plugin_split_chunks/src/plugin/module_group.rs:1138-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_split_chunks/src/plugin/module_group.rs:1138\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":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a15d1b607ac4356d5b171d282373f588d3e2cf1d5c94c4a305a6b4ce6af3ce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_tracing/src/perfetto.rs:96-101 | crates/rspack_tracing/src/perfetto.rs:152-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_tracing/src/perfetto.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacfb97fabf71063783eb86bc353597a438f521b1bf6426c15bf574b4c9fcdcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_watcher/src/scanner.rs:48-53 | crates/rspack_watcher/src/scanner.rs:80-85 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_watcher/src/scanner.rs:48\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":"crates/rspack_watcher/src/scanner.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5b72c3c9578606b46801d6a64928e2ad9bc8ffd1db7965c849326c8a2da66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/rspack_binding_api/src/exports_info.rs:44-48 | crates/rspack_binding_api/src/exports_info.rs:60-64 | crates/rspack_binding_api/src/exports_info.rs:76-80 \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 \u0060crates/rspack_binding_api/src/exports_info.rs:44\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":"crates/rspack_binding_api/src/exports_info.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"169f3d251d0a9fe3b0e4b80c3b9e2784d4e0a8b42bb9be4ff4400fad292fb94f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/rspack_tracing/src/perfetto.rs:95-100 | crates/rspack_tracing/src/perfetto.rs:126-130 | crates/rspack_tracing/src/perfetto.rs:151-156 \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 \u0060crates/rspack_tracing/src/perfetto.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. 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":"crates/rspack_tracing/src/perfetto.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f291cc9e7f890a95226ec50f6ca9b8c93b88815cadfe90c6352589167d597680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack/src/builder/target.rs:295-301 | crates/rspack/src/builder/target.rs:449-455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack/src/builder/target.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rspack/src/builder/target.rs:293\u0060 calls \u0060Some\u0060, \u0060version_dependent\u0060 and \u0060crates/rspack/src/builder/target.rs:448\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":"crates/rspack/src/builder/target.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4623b433cf530054a2d16795a50a7393d1645eda0b4536f06e0e62c4ac4c5b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_binding_api/src/options/raw_resolve.rs:132-136 | crates/rspack_binding_api/src/options/raw_resolve.rs:254-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/options/raw_resolve.rs:132\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":"crates/rspack_binding_api/src/options/raw_resolve.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6db4936120798b0e84b2ec87852cead26bc64c2069578286d7dfd2860aa6b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_cacheable_macros/src/cacheable/impl.rs:18-22 | crates/rspack_cacheable_macros/src/cacheable/impl_disable.rs:27-31 \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 \u0060crates/rspack_cacheable_macros/src/cacheable/impl.rs:18\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":"crates/rspack_cacheable_macros/src/cacheable/impl.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6601f6bed8ce52ab56c328dcae76fe45642925b54beda309d422f46e3ef0861c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_macros/src/hook.rs:70-74 | crates/rspack_macros/src/plugin.rs:137-141 \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 \u0060crates/rspack_macros/src/hook.rs:70\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":"crates/rspack_macros/src/hook.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3addef1ab4ed95329794ccb72f2f19e67566737bd7218e4cef6530a3ce3b9691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_plugin_javascript/src/magic_comment.rs:193-197 | crates/rspack_plugin_javascript/src/magic_comment.rs:201-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/magic_comment.rs:193\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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b990bf43499a0c1513874c0cad8cff0cda0fcc7ce10167fb0bc52c941058e54b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:2064-2070 | crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs:400-406 \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 \u0060crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs:2064\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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56083a6983a64a418286054d4407d2835e7785213e5d09f8e1e9aead9c5eea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/hot_module_replacement_plugin.rs:66-71 | crates/rspack_plugin_javascript/src/parser_plugin/hot_module_replacement_plugin.rs:106-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/hot_module_replacement_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/hot_module_replacement_plugin.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf64e39109556d97f0dd33881b4b24488a17ead39440fb50a9abaef90a9e94e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:87-91 | crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:137-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs:87\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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d002e304d6f2fcc003bd9303428f2c23138435a599d229c51363b607e0db8976"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_regex/src/lib.rs:97-101 | crates/rspack_regex/src/lib.rs:107-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_regex/src/lib.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":"crates/rspack_regex/src/lib.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e6a906aa9990fd9baaf9a7814c46b5bb0b32008c6c8ff26f023bc7208c7990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_watcher/src/lib.rs:434-438 | crates/rspack_watcher/src/testing.rs:76-81 \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 \u0060crates/rspack_watcher/src/lib.rs:434\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":"crates/rspack_watcher/src/lib.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9806c7a2a7a193d200e6c76fd0e3173f71f5a5e9b89a6260b960a55c1c8fd002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/rspack_core/src/artifacts/async_modules_artifact.rs:17-52 | crates/rspack_core/src/artifacts/imported_by_defer_modules_artifact.rs:17-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 \u0060crates/rspack_core/src/artifacts/async_modules_artifact.rs:17\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":"crates/rspack_core/src/artifacts/async_modules_artifact.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda8eb2095cb575150374b83f44b8ae6141de10893842b1aca9d9cf4688a9466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): crates/rspack_core/src/artifacts/cgc_runtime_requirements_artifact.rs:17-58 | crates/rspack_core/src/artifacts/chunk_render_artifact.rs:17-58 \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 \u0060crates/rspack_core/src/artifacts/cgc_runtime_requirements_artifact.rs:17\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":"crates/rspack_core/src/artifacts/cgc_runtime_requirements_artifact.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2200b9c2a02758399181218174f736dba94abbcf4811017aca5cc1413ef08f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/rspack_core/src/artifacts/dependencies_diagnostics_artifact.rs:16-63 | crates/rspack_core/src/artifacts/module_ids_artifact.rs:17-54 \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 \u0060crates/rspack_core/src/artifacts/dependencies_diagnostics_artifact.rs:16\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":"crates/rspack_core/src/artifacts/dependencies_diagnostics_artifact.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee93461bddd7a69ccf0e49958e2d55ad56f28238e9c80e3c3c81372cc944438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_allocative/src/key.rs:54-64 | crates/rspack_allocative_derive/src/derive_allocative.rs:17-27 \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":"crates/rspack_allocative/src/key.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaee41274b0bcdc31d083283a92163fde28598b3bd14f38a60228274c529cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/rspack_binding_api/src/build_info.rs:76-80 | crates/rspack_binding_api/src/build_info.rs:115-119 | crates/rspack_binding_api/src/compilation/chunks.rs:31-35 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/build_info.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"78da1b707567d1b4333b63e5f402dfa011fb43d79dac152b8926d63e68170581"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_binding_api/src/fs_node/write.rs:431-435 | crates/rspack_fs/src/intermediate.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ba04e91f2873875457253a7093a6f9a4082bf3e858197d03543983bdcda0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_core/src/context_module.rs:1459-1467 | crates/rspack_core/src/normal_module.rs:464-472 \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 \u0060crates/rspack_core/src/context_module.rs:1459\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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f616e4a7fab5820c88416b66a5b30764f5e1e961a9823f45d3dc67791eab047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/rspack_core/src/context_module.rs:1599-1603 | crates/rspack_plugin_mf/src/container/container_entry_module.rs:455-459 | crates/rspack_plugin_mf/src/container/fallback_module.rs:197-201 | crates/rspack_plugin_mf/src/container/remote_module.rs:225-229 | crates/rspack_plugin_mf/src/sharing/provide_shared_module.rs:236-240 | crates/rspack_plugin_rsc/src/rsc_entry_module.rs:393-397 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/context_module.rs:1599\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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0f7d5d068a18c5493cc66a4ccd6a0849a19f8af704b0b823f7570ad07ee184"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_core/src/options/snapshot.rs:13-18 | crates/rspack_util/src/asset_condition.rs:10-15 \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":"crates/rspack_core/src/options/snapshot.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0650d5018dc626a9b6f0607ae5638ffe2aa47a3168196fa1747332a31072258a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_fs/src/memory_fs.rs:371-375 | crates/rspack_fs/src/native_fs.rs:395-399 \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":"crates/rspack_fs/src/memory_fs.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f9f1c8fc465aa049b23a10ecf9dedd3119d255109d2252db53baa9262c1b7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_fs/src/memory_fs.rs:377-384 | crates/rspack_fs/src/native_fs.rs:401-408 \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":"crates/rspack_fs/src/memory_fs.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"9923bd47ead0bb43a334b51c19373bb1eb0e0de31ed184e9b4ddc27041247071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_fs/src/memory_fs.rs:385-389 | crates/rspack_fs/src/native_fs.rs:410-414 \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":"crates/rspack_fs/src/memory_fs.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40af668d6f66bc3a8c80cb6304e7a4566a51a616bdee6ac9110b39db5fa04bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/rspack_napi/src/js_values/one_shot_value_ref.rs:66-73 | crates/rspack_napi/src/js_values/one_shot_value_ref.rs:77-84 | crates/rspack_napi/src/js_values/threadsafe_one_shot_value_ref.rs:165-172 | crates/rspack_napi/src/js_values/threadsafe_one_shot_value_ref.rs:176-183 \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":"crates/rspack_napi/src/js_values/one_shot_value_ref.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce31df0c167d257f58c8959b57c63d8c77a17b8b3cb55fbcf29a247a2ed28af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_circular_dependencies/src/circular_check_rspack_plugin.rs:152-159 | crates/rspack_plugin_circular_dependencies/src/circular_modules_info_plugin.rs:29-36 \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":"crates/rspack_plugin_circular_dependencies/src/circular_check_rspack_plugin.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5a166a4f09f8837e19ad58f6b2ff7796bf510ea5bdae08c0b77437adf49a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs:54-62 | crates/rspack_plugin_html/src/plugin.rs:47-55 | crates/rspack_plugin_real_content_hash/src/lib.rs:44-52 | crates/rspack_plugin_rsdoctor/src/plugin.rs:223-231 | crates/rspack_plugin_runtime/src/runtime_plugin.rs:91-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5247e98e64076372c5e59155a1a83cabf03db1dfd66c5d0a9f6ffc0a927299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_css_chunking/src/lib.rs:422-431 | crates/rspack_plugin_mf/src/container/hoist_container_references_plugin.rs:303-310 \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":"crates/rspack_plugin_css_chunking/src/lib.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"46413f18e7d16c334612decd1294fcd002cea89d0da0e292c7e4016e6d4921f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs:210-217 | crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs:328-335 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs\u0060 and \u0060crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 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":"crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca36be9d52ea51971c29ab4b78dafbf891b1de5757c233bf647042303b617e1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs:226-232 | crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs:315-321 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs\u0060 and \u0060crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 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 \u0060crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs:226\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":"crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9212fac2312315e6b81221e8fbbf7bc7b7edfbb349fe4db6ba2e1f149820ef60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs:1341-1348 | crates/rspack_plugin_swc_js_minimizer/src/lib.rs:636-643 \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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"557e1e97af75e1bc64d70f7b508accee34681209f0070613e3af05bccaffbf5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/rspack_plugin_dll/src/dll_entry/dll_entry_plugin.rs:38-44 | crates/rspack_plugin_dynamic_entry/src/lib.rs:133-137 | crates/rspack_plugin_entry/src/lib.rs:53-57 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rspack_plugin_dll/src/dll_entry/dll_entry_plugin.rs:34\u0060 calls \u0060name\u0060 and \u0060crates/rspack_plugin_dynamic_entry/src/lib.rs:132\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":"crates/rspack_plugin_dll/src/dll_entry/dll_entry_plugin.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"203ea07f8f41c5bd2ac3cd8384fa29a776438a76504b40492dccc474e4c5ea9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_require_dependency.rs:87-92 | crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs:172-177 | crates/rspack_plugin_javascript/src/dependency/esm/import_dependency.rs:82-87 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_require_dependency.rs:94\u0060 calls \u0060request_range\u0060 and \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs:178\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":"crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_require_dependency.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8a02cbc029735f54711e91c823943b0b7cd9559971f8811893e38a80aa64e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs:97-107 | crates/rspack_plugin_rstest/src/parser_plugin.rs:86-96 \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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b39013e7124f1b2c0e1dc6b2ae4bcd48079245dcec08622ffd7c8e70d42df91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/mod.rs:114-121 | crates/rspack_plugin_javascript/src/parser_plugin/provide_plugin/mod.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/define_plugin/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"276ce51f71d3073d9d1c8f280751324d8a2163c936c1e284d6d5232b897e6753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/api_plugin.rs:22-30 | crates/rspack_plugin_javascript/src/plugin/url_plugin.rs:164-172 \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 \u0060crates/rspack_plugin_javascript/src/plugin/api_plugin.rs:22\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":"crates/rspack_plugin_javascript/src/plugin/api_plugin.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"650b8f6a82a8a15f28f567723ab7165ad83a40bf8ba8be7a6e16b340f8d1a245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_plugin_library/src/amd_library_plugin.rs:66-71 | crates/rspack_plugin_library/src/jsonp_library_plugin.rs:49-54 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_library/src/amd_library_plugin.rs\u0060 and \u0060crates/rspack_plugin_library/src/jsonp_library_plugin.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 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 \u0060crates/rspack_plugin_library/src/amd_library_plugin.rs:66\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":"crates/rspack_plugin_library/src/amd_library_plugin.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9226628ca03a5f36adf6ffc1ea74f19cd1defef0762e4fff2d7acf785d731ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_plugin_library/src/amd_library_plugin.rs:202-211 | crates/rspack_plugin_library/src/jsonp_library_plugin.rs:133-142 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_library/src/amd_library_plugin.rs\u0060 and \u0060crates/rspack_plugin_library/src/jsonp_library_plugin.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 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 \u0060crates/rspack_plugin_library/src/amd_library_plugin.rs:202\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":"crates/rspack_plugin_library/src/amd_library_plugin.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9768a9300f658a8697b9c9de1c491209a6ed980408ca0a2c807d322732abf89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/rspack_plugin_library/src/amd_library_plugin.rs:218-225 | crates/rspack_plugin_library/src/jsonp_library_plugin.rs:149-156 | crates/rspack_plugin_library/src/system_library_plugin.rs:218-225 | crates/rspack_plugin_library/src/umd_library_plugin.rs:362-369 | crates/rspack_plugin_runtime/src/array_push_callback_chunk_format.rs:231-238 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_library/src/amd_library_plugin.rs\u0060 and \u0060crates/rspack_plugin_library/src/jsonp_library_plugin.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 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":"crates/rspack_plugin_library/src/amd_library_plugin.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21407871e725b53d2d68c276e0e7771327490193fd61b7dbf971ce391448cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_plugin_library/src/assign_library_plugin.rs:510-521 | crates/rspack_plugin_library/src/export_property_library_plugin.rs:185-196 \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":"crates/rspack_plugin_library/src/assign_library_plugin.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdd58527feb2f39a46ea3251312d49245a4c7c74274ab883bd5840e9ba4b21b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_plugin_library/src/export_property_library_plugin.rs:51-55 | crates/rspack_plugin_library/src/umd_library_plugin.rs:75-79 \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 \u0060crates/rspack_plugin_library/src/export_property_library_plugin.rs:51\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":"crates/rspack_plugin_library/src/export_property_library_plugin.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bffdfa1209190068e963a5d5f5ccb638bb66268f816a218c5fa8cba5a6c562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_rslib/src/isolated_dts.rs:204-211 | crates/rspack_plugin_rslib/src/plugin.rs:148-155 \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":"crates/rspack_plugin_rslib/src/isolated_dts.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c964d59e7edb64d8a1986f4e40d32ea4603bc2bd9a12ef3080eee517d09a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): crates/rspack_plugin_runtime/src/bundler_info.rs:96-106 | crates/rspack_plugin_runtime/src/common_js_chunk_loading.rs:178-188 | crates/rspack_plugin_runtime/src/import_scripts_chunk_loading.rs:116-126 | crates/rspack_plugin_runtime/src/jsonp_chunk_loading.rs:116-126 | crates/rspack_plugin_runtime/src/module_chunk_loading.rs:162-172 \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 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_runtime/src/bundler_info.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f36049f761e9c3359022fa1533abcafea559e934c3778288535087fec0cd399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_plugin_runtime/src/common_js_chunk_format.rs:225-236 | crates/rspack_plugin_runtime/src/module_chunk_format.rs:448-459 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/common_js_chunk_format.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/module_chunk_format.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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":"crates/rspack_plugin_runtime/src/common_js_chunk_format.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4e0dd2b7535091a41b6b78aaf87b517279806a010cbed786e25dabec351399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/chunk_prefetch_trigger.rs:47-55 | crates/rspack_plugin_runtime/src/runtime_module/chunk_preload_trigger.rs:47-56 \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 \u0060crates/rspack_plugin_runtime/src/runtime_module/chunk_prefetch_trigger.rs:47\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":"crates/rspack_plugin_runtime/src/runtime_module/chunk_prefetch_trigger.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb0363302d040ec2b0c07012eaf96ffd7c7605f27684ecd09d0e2ec598a9687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/create_script.rs:49-59 | crates/rspack_plugin_runtime/src/runtime_module/create_script_url.rs:49-59 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/create_script.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/create_script_url.rs\u0060 as WHOLE FILES: 87% 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 2 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. 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 \u0060crates/rspack_plugin_runtime/src/runtime_module/create_script.rs:49\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":"crates/rspack_plugin_runtime/src/runtime_module/create_script.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeca47723ca4e98276c108d186487d318949015b185837a039e27cb31d735730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_plugin.rs:111-116 | crates/rspack_plugin_swc_js_minimizer/src/lib.rs:204-209 \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 \u0060crates/rspack_plugin_runtime/src/runtime_plugin.rs:111\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":"crates/rspack_plugin_runtime/src/runtime_plugin.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf74e4fb5d909268acc2b1c680f6f7b54d93d0acd6120eba2b0f94a515ffaf58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_allocative_derive/src/derive_allocative.rs:29-34 | crates/rspack_allocative_derive/src/root.rs:15-20 \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":"crates/rspack_allocative_derive/src/derive_allocative.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f122d7199c7178f9b1ded89f7756380765f8e708c2a56a02f1696572231e3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/rspack_binding_api/src/async_dependency_block.rs:132-137 | crates/rspack_binding_api/src/chunk.rs:349-354 | crates/rspack_binding_api/src/chunk_group.rs:211-216 | crates/rspack_binding_api/src/dependency.rs:201-206 | crates/rspack_binding_api/src/module_graph_connection.rs:212-217 \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 5 call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060compilation_id\u0060 to \u0060rspack_core::CompilationId\u0060 in one and \u0060CompilationId\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":"crates/rspack_binding_api/src/async_dependency_block.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0fc8bb8b988a7cefa6f0bc645d213a3f205b51446aed513df12ee1172ff2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_binding_api/src/chunk_group.rs:70-77 | crates/rspack_binding_api/src/module.rs:447-454 \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":"crates/rspack_binding_api/src/chunk_group.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e666fd3c28d2d12b3308fa6bc68f14a14ffb6f700acc1f4567797a68e86dd95a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/rspack_cacheable/src/with/as_preset/lightningcss.rs:34-39 | crates/rspack_cacheable/src/with/as_preset/serde_json.rs:35-40 | crates/rspack_cacheable/src/with/as_preset/serde_json.rs:75-80 \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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060field\u0060 to \u0060\u0026Browsers\u0060 in one and \u0060\u0026Value\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":"crates/rspack_cacheable/src/with/as_preset/lightningcss.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f572c7da54ee25bdcf36315561debbe18ee5e7a971f72d96c50f6ee9badebb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_core/src/artifacts/cgm_hash_artifact.rs:38-47 | crates/rspack_core/src/artifacts/chunk_hashes_artifact.rs:23-32 \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 \u0060crates/rspack_core/src/artifacts/cgm_hash_artifact.rs:38\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 \u0060hashes\u0060 to \u0060RuntimeSpecMap\u003CRspackHashDigest\u003E\u0060 in one and \u0060ChunkHashesResult\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":"crates/rspack_core/src/artifacts/cgm_hash_artifact.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b26377e58d1fc3d81a3dcc6f2e3fccc16c4dce39d394b1c3f6a2579b931c2f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_loader_preact_refresh/src/plugin.rs:49-59 | crates/rspack_loader_react_refresh/src/plugin.rs:49-59 \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 \u0060crates/rspack_loader_preact_refresh/src/plugin.rs:49\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":"crates/rspack_loader_preact_refresh/src/plugin.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"911adfdd1ea68e0cc235ce81f7765bbe60904843e32a68f5a69a9055bbb2ef05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_module_replacement/src/context_replacement.rs:150-160 | crates/rspack_plugin_module_replacement/src/normal_module_replacement.rs:88-98 \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":"crates/rspack_plugin_module_replacement/src/context_replacement.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9990f8051e220aea445d826fd7c5e00d71619140be105fdd0c660618f46e5034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/create_script.rs:25-37 | crates/rspack_plugin_runtime/src/runtime_module/create_script_url.rs:25-37 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/create_script.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/create_script_url.rs\u0060 as WHOLE FILES: 87% 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 2 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. 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 \u0060crates/rspack_plugin_runtime/src/runtime_module/create_script.rs:25\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":"crates/rspack_plugin_runtime/src/runtime_module/create_script.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98110b1d8a7c61d920d94b3da68648f9df4dc6880ee1f5abd985b4fba3544da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/rspack_loader_swc/src/rsc_transforms/to_server_entry.rs:23-43 | crates/rspack_loader_swc/src/rsc_transforms/to_server_entry.rs:62-83 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_loader_swc/src/rsc_transforms/to_server_entry.rs:23\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":"crates/rspack_loader_swc/src/rsc_transforms/to_server_entry.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac5f8de7c053e2cc41d49f37755b594c640bacd9257f1bff4e0dd4099ddb105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_core/src/compilation/create_chunk_assets/mod.rs:100-114 | crates/rspack_core/src/compilation/runtime_requirements/mod.rs:116-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/compilation/create_chunk_assets/mod.rs:100\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":"crates/rspack_core/src/compilation/create_chunk_assets/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a93bfccb4e83d20c657b13655aab4ccd97056918f58355ecd0ff5b6755cb076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rspack_plugin_rstest/src/parser_plugin.rs:278-292 | crates/rspack_plugin_rstest/src/parser_plugin.rs:334-348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_rstest/src/parser_plugin.rs:278\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":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcb3bdce3afdf8d8be3f1dd012149ebd66c975062b861557f8691e598fc08b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_core/src/runtime_template.rs:1721-1731 | crates/rspack_core/src/runtime_template.rs:1748-1761 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/runtime_template.rs:1721\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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"67857424ed10353667d75692c96c1e011686f0ce669b321d1166ab855140f914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:276-289 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:287-300 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 157 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 \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:276\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":"crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56ff10f3d8d501cf987b37d748dd382ab66f86d9a76e7289282aa5af8f450e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs:310-323 | crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:454-466 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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 \u0060crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs:310\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":"crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"75087236b43c240420527d7a6b580e7a0f7d9f8cff887b8da13b3e9208efd9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rspack_core/src/runtime_template.rs:550-562 | crates/rspack_core/src/runtime_template.rs:575-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/runtime_template.rs:550\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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4d0648a0e5b33a58924c12fdb63410ef83811ab7986ea3f6cfdf2df2f48858"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_dojang/src/context.rs:403-415 | crates/rspack_dojang/src/context.rs:426-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_dojang/src/context.rs:403\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":"crates/rspack_dojang/src/context.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf7f01784ca6b9e25c4c13a57e4548d550e5a009eec66f153af47b22b32e38d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/rspack_dojang/src/eval.rs:281-299 | crates/rspack_dojang/src/eval.rs:341-359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_dojang/src/eval.rs:281\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":"crates/rspack_dojang/src/eval.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"48754d42431d05fa21f0376b1ce44d067a6f7c0617d7facf9240f2e0c1641ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs:1152-1161 | crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs:1186-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 \u0060crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs:1152\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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf61b92da9bcfa709a6716d531ceca7486965f77f12356f5fdf0873df6c83199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rspack_core/src/artifacts/runtime_proxy_metadata_artifact.rs:79-90 | crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs:77-88 \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":"crates/rspack_core/src/artifacts/runtime_proxy_metadata_artifact.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b1dac43612bcb10f72614f7aa69ee84d5eba275327259bc9af5c7941613923"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:1068-1077 | crates/css-module-lexer/src/dependencies.rs:1143-1154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:1068\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1924faa6e974fba032e9bcac79e47ea1e1ec8570dcf693a9c7b01829bfec6b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_rstest/src/import_dependency.rs:274-284 | crates/rspack_plugin_rstest/src/import_dependency.rs:318-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_rstest/src/import_dependency.rs:274\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":"crates/rspack_plugin_rstest/src/import_dependency.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54b7448b0372c12e66e4ba5202a494fea2747a99e9e1f695cb988e36893bd00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rspack_plugin_library/src/assign_library_plugin.rs:288-298 | crates/rspack_plugin_library/src/assign_library_plugin.rs:329-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_library/src/assign_library_plugin.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e37c9550b34078a2d41812ec125105858a44f63e52113b818a1bcf2aff5af96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack/src/builder/mod.rs:1405-1414 | crates/rspack/src/builder/mod.rs:1417-1426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack/src/builder/mod.rs:1405\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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"5309553df4dbd332b6da499fc6425d71c5b2687564fca00b9bc632d00d0b231d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_binding_api/src/lib.rs:474-483 | crates/rspack_binding_api/src/lib.rs:510-519 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/lib.rs:474\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":"crates/rspack_binding_api/src/lib.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"899809cbb5372445ee567bceaeb39950af242b7c7be231dbd537b92a5c1b888d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:2948-2957 | crates/css-module-lexer/src/dependencies.rs:3000-3009 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:2948\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2948}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9068665282a1647d6d79314a926f5e7e549a2bdd202411accc543be9a295315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_tracing_perfetto/src/lib.rs:450-458 | crates/rspack_tracing_perfetto/src/lib.rs:463-472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_tracing_perfetto/src/lib.rs:450\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 \u0060value\u0060 to \u0060\u0026dyn std::fmt::Debug\u0060 in one and \u0060\u0026(dyn std::error::Error \u002B \u0027static)\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":"crates/rspack_tracing_perfetto/src/lib.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b71b6db4e9f718e752f7003cc305d3430c136f5f9b2bc12b781449c2aef4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rspack_plugin_library/src/lib.rs:77-86 | crates/rspack_plugin_library/src/lib.rs:87-96 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_library/src/lib.rs:77\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":"crates/rspack_plugin_library/src/lib.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a47544f41866121f20676fc25def579de9a11ba30a4103956ffcaa8d4618dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_core/src/compiler/mod.rs:343-351 | crates/rspack_core/src/compiler/rebuild.rs:152-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compiler/mod.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5a47e6f44a5622c9fc46471a2a110addab562552ec2fa18478da25a49f96cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/rspack_ids/src/compact_hashed_module_ids_plugin.rs:58-66 | crates/rspack_ids/src/deterministic_module_ids_plugin.rs:72-80 | crates/rspack_ids/src/hashed_module_ids_plugin.rs:63-71 | crates/rspack_ids/src/natural_module_ids_plugin.rs:25-33 \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 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_ids/src/compact_hashed_module_ids_plugin.rs:58\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":"crates/rspack_ids/src/compact_hashed_module_ids_plugin.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ec390f5e8b50f46cfd0540afe5237d31cf8dce512c7717d5f17f51e7667bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/css-module-lexer/src/dependencies.rs:2352-2360 | crates/css-module-lexer/src/dependencies.rs:2923-2931 | crates/css-module-lexer/src/dependencies.rs:3131-3139 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/css-module-lexer/src/dependencies.rs:2932\u0060 calls \u0060next_parser_token\u0060 and \u0060crates/css-module-lexer/src/dependencies.rs:2361\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fd664e422a280e6c8a856bb2f112a768084f973eafcb81aa129e164c1f86b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rspack_plugin_extract_css/src/runtime.rs:403-411 | crates/rspack_plugin_extract_css/src/runtime.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 \u0060crates/rspack_plugin_extract_css/src/runtime.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":"crates/rspack_plugin_extract_css/src/runtime.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9568454abfe161336d5ddc6509022f633f79ac51e5aefe7f2cbcdda26e15ce4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs:106-113 | crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs:178-185 | crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs:205-212 \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 \u0060crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.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":"crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2859608e0d0a3ef1e172b5f4516ade010a8437aa7fc2286ee9f08c30b72bcfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:283-289 | crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs:254-260 | crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:265-272 \u2014 before extracting anything, compare \u0060crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 157 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs:273\u0060 calls \u0060contains\u0060 and \u0060crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs:289\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":"crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f7f1ddc9ace40f5df799f5b627587515b73755adcf0706ea6b9cb6d9b53b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rspack_plugin_rslib/src/url_external.rs:103-110 | crates/rspack_plugin_rslib/src/worker_external.rs:97-104 \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 \u0060crates/rspack_plugin_rslib/src/url_external.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":"crates/rspack_plugin_rslib/src/url_external.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba82d7727a1e84c7714d340e9d5a90812b8a46e969d7b673fc308784a5c8be8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/css-module-lexer/src/dependencies.rs:4324-4330 | crates/css-module-lexer/src/dependencies.rs:4365-4371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css-module-lexer/src/dependencies.rs:4324\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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":4324}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3f457058f9e9dc47aaad7a6794461d18eb3a3eb71d1baed9a935950cfda5ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_storage/src/filesystem/db/bucket/pack/mod.rs:52-58 | crates/rspack_storage/src/filesystem/db/bucket/pack/mod.rs:61-67 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_storage/src/filesystem/db/bucket/pack/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"754cbbe8f4eceaa5e9788eb10438a96dcedf60ed1a1427e02aaf6eac21d2d373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:195-200 | crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:209-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.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. 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, \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs:214\u0060 calls \u0060is_string\u0060, \u0060Some\u0060, \u0060to_owned\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bf23d1c4cba1cf05ea2642bca1c6cc249e6d44c12dc90c641312541a0e4c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/rspack_binding_api/src/dependency.rs:127-132 | crates/rspack_binding_api/src/dependency.rs:136-141 | crates/rspack_binding_api/src/dependency.rs:144-149 \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":"crates/rspack_binding_api/src/dependency.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fee2c2f97fd48672f3aecf803526fd9b268873b6bc182a03b83d753430c515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:821-825 | crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:872-876 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:821\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 \u0060value\u0060 to \u0060RawAssetGeneratorOptions\u0060 in one and \u0060RawAssetResourceGeneratorOptions\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, \u0060crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:828\u0060 calls \u0060RawAssetGeneratorDataUrlWrapper\u0060, \u0060into\u0060 and \u0060crates/rspack_binding_api/src/raw_options/raw_module/mod.rs:877\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":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"508a0e636647e886dae39dded7b188f633b17f3e8c2db965277d8a9b3790bc4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rspack_cacheable/src/with/as_tuple2.rs:24-29 | crates/rspack_cacheable/src/with/as_tuple3.rs:25-30 \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 \u0060field\u0060 to \u0060\u0026(K, V)\u0060 in one and \u0060\u0026(K, V, H)\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, \u0060crates/rspack_cacheable/src/with/as_tuple3.rs:31\u0060 calls \u0060mut\u0060, \u0060ptr\u0060, \u0060from_field_unchecked\u0060 and \u0060crates/rspack_cacheable/src/with/as_tuple2.rs:30\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":"crates/rspack_cacheable/src/with/as_tuple2.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c1b6596e5a7905d084907503dc0d9a6177073cc65dbabb959ffcfa2722cb5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rspack_core/src/normal_module_factory.rs:198-202 | crates/rspack_core/src/normal_module_factory.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_core/src/normal_module_factory.rs:198\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":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a428fe776280e6d2dbfb612556066761b595114db873fd03d378b1d135514e01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rspack_fs/src/native_fs.rs:158-164 | crates/rspack_fs/src/native_fs.rs:172-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rspack_fs/src/native_fs.rs:158\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":"crates/rspack_fs/src/native_fs.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a96a2544523e7d6d9027fc566fcf96efb9f9f9f40f739cb15bc19c57d188454"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project @rspack/binding: @rspack/binding has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1504e80794347453d101e3d0b92da9b4af047f366cab4f812d8d2fc971333539"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_binding_api: rspack_binding_api has instability 0.97 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0f5fc5403f01fbefa1118ed1ff1acec9577184b7960ad01969b78d102aa52e6c"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_loader_swc: rspack_loader_swc has instability 0.86 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9d81e030f45859f62a8176d80c10101c5ec2d815c50a90d2383b908b29ff9c0b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_loader_testing: rspack_loader_testing has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9827584ac321a5a6a2d0bf6068d965a36222a50b1b3923c5e38c8c950f7a0526"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_circular_dependencies: rspack_plugin_circular_dependencies has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"eede8e47e87c9f36fc089472280a5ec088e0d20bb30030fe8ece3c5b286772e7"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_copy: rspack_plugin_copy has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a7171373c99433ee5c6714ef29c81f10097ce33620edb29d9d1d0206ede09a42"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_css_chunking: rspack_plugin_css_chunking has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"141aa7ecb9261f597c0131ff6d98047cdd52a58f04b9ca26f279b41c4ff254ad"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_dll: rspack_plugin_dll has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e5363f03a2c82d20d0f7d661683fbc6ca82f76cf5ee930641c645f05cf771d87"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_esm_library: rspack_plugin_esm_library has instability 0.87 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bba7b2cfdbe741d6a7d84c33d969b8d8ee91567b6b4b5d09edcbd0a01607c757"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_extract_css: rspack_plugin_extract_css has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a1adb86c563e90d7ef981058b21bf4ad8bf27545af452076e7593d006a025bf6"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_hmr: rspack_plugin_hmr has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a0399be8211ba5101a63b4882585368040bba3f88569cce2c8877cf6779ad3df"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_lazy_compilation: rspack_plugin_lazy_compilation has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"260eb44358d152b3cabefb92ff17dd5db512ccfb70c3d1685f361233d52f17f3"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_library: rspack_plugin_library has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d818afc4ee2d6cb113686a000ed315f25c55b143363185e8b24cbac545b528d8"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_lightning_css_minimizer: rspack_plugin_lightning_css_minimizer has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1544b002fb87a6167b1a5e0b63a0c24c644feaa1024f0c6ba0730d43098abc97"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_mf: rspack_plugin_mf has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b8627dc289e1d0af57e14c457dc1a39a877c37fc0cd296a2b4d55d47063723ae"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_module_info_header: rspack_plugin_module_info_header has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8d02cdde1f664a6715d63b21e5b93a96cbf5b20feb2acba36984e23bd4340779"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_module_replacement: rspack_plugin_module_replacement has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d4d7e8c59335eb11c2fcbba729fb5d4210907b004e73f8207180608363039766"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_rsc: rspack_plugin_rsc has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6657830a2c28ee5bf75514b0cce5b37552c9452fe027c7ab760d3246edf17320"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_rsdoctor: rspack_plugin_rsdoctor has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ec4bdfc09974e6663171604f930e45d272d1519a4d2e6c007c665fc256f863db"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_rslib: rspack_plugin_rslib has instability 0.87 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b3ea5f71d330871fa1115452d3ec156fc2dd1d7534d1401c01d78d59da905f4f"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_rstest: rspack_plugin_rstest has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f3a190aec06176184ad481c1efc63567e5f88c42bd77d04ad835507f89acef92"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_size_limits: rspack_plugin_size_limits has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"94a3593b4be3bbb3ae400832b5e512e98ebc61c34454c6816c0d308ed0692532"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_plugin_sri: rspack_plugin_sri has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9ff1ff1aba6a400a68d60eb7fec8ca21ab9364a8c60857b97390d649be3f39cb"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rspack_storage: rspack_storage has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8068512bc04314b69371f630151a0a1f77cfd317f020c04dafef2cbbf0a4a503"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rspack_browserslist: rspack_browserslist: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b5c97e0f103e6d7746797416c7f8aa03c5497bd4f99bcc43767bb201a62c12c9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rspack_swc_plugin_ts_collector: rspack_swc_plugin_ts_collector: 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":"8c9e6f852e8ac5f5946d8e38b9eb483ebe5fecd5bcc685db99aeed542f485a21"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rspack_tasks: rspack_tasks: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"701cb56e5a797fd1b979e4df939599ee25d9695aa50858da4f1d89316d23ecad"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: css-module-lexer: css-module-lexer: abstractness 0.07, instability 0.00, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2d84f5121717fdd1b357b7490f45c38381a0a6874e6a501986745c738347df2a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rspack_intern: rspack_intern: abstractness 0.10, instability 0.06, distance 0.84 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"501a0398b89be5a127ffc02ba8dc955c3fabb0ad117ac1a73849b7ed864f6130"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rspack_regex: rspack_regex: abstractness 0.00, instability 0.18, distance 0.82 \u2014 zone of pain \u2014 concrete and depended on by 14 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ae993b3ad763313e373c3889e198ed8790f9e8c590b2787a4e34db719c140cfa"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rspack_paths: rspack_paths: abstractness 0.17, instability 0.08, distance 0.76 \u2014 zone of pain \u2014 concrete and depended on by 24 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2f4ab539fb2de20d88ca50f8a7749bfbddf32b3b3c990ffc54b996cd9392cbb0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NativeFileSystem (LCOM4 16): NativeFileSystem\u0027s methods fall into 16 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 16 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":"crates/rspack_fs/src/native_fs.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"76888371b4df53fd95ac5833f008646e929360df9a61eb4f2b6452b5c133e7f2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: APIPlugin (LCOM4 12): APIPlugin\u0027s methods fall into 12 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 12 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":"crates/rspack_plugin_javascript/src/parser_plugin/api_plugin.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa64e04899406df648bfb14c1c0c735afc555c058b92cc9290cf63791a23c118"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InnerGraphParserPlugin (LCOM4 12): InnerGraphParserPlugin\u0027s methods fall into 12 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 12 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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e5154f180ed70489468d3d6c7222bcd0967b8251a26491c4c963ad82e6f44e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Compilation (LCOM4 7): Compilation\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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a667182b517a2976102ecd9284278fe8b780c47bfe9ec57661f83faa4c4e9574"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImportMetaPlugin (LCOM4 6): ImportMetaPlugin\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":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_plugin.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2205cef3d84533c10bdab9817b6855fb36a0d58b6688cc018cd1fa2b034c52"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ResolveContext (LCOM4 6): ResolveContext\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":"crates/rspack_resolver/src/context.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e78aeba113ab65f093f2927af066829a6c68535c5dc241ee035fcbf6bb01b32"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JsPlugin (LCOM4 5): JsPlugin\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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"348ed378ae13f4c8b59f70ddead3ac98260fba1a4d429f0bf3de58182d82e74e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OutputOptionsBuilder (LCOM4 4): OutputOptionsBuilder\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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bc1e7dd7494221e512d2465f1d38921335ffcb9548d1a9d0eb7b4b35ad0ebf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RuntimeGlobals (LCOM4 4): RuntimeGlobals\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":"crates/rspack_core/src/runtime_globals.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ae2df55f0e3ffb6ade720766ab0efd8231556dac19ab90a26d27fa45583600"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SplitChunkSizes (LCOM4 4): SplitChunkSizes\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":"crates/rspack_plugin_split_chunks/src/common.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dc6b824ac95b5f64440449888966b343665b631f9c4c4163eab84ddfeb2a29"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FsWatcher (LCOM4 4): FsWatcher\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":"crates/rspack_watcher/src/lib.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee5910ffb7d7ca164d69684fbc03b6be7bfe8816219e98f965ba02522b6625c"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should have \u0060process.env.WEBPACK_SERVE\u0060 set on serve mode: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-cli/tests/build/issue-6359/index.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f869ba772ae03ed3a9697fe648ede8b415702cbad4692976df6e8db320268d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: test a-1: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/source-map/nosources/list.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c83dcd164106a555e9ff7d5b7560eaa8548fddaf4e8c88d5856825a3960175"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: test a-2: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/source-map/nosources/list.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ad9cc1c5db3145dabd73ab26d4eb19cf2000f6450969c4a7ee960fcf05b66f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: (unnamed test): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/source-map/nosources/list.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9a2a1a22fd07f61c2342f8ff6e488eecde977e3d4f073b1af35eb15e7ee3bb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should compile: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/cases/persistent-cache/rename-file/index.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18b7223d4de03590fddfcd06d2a58d6db560d60b4c24e5c353818bad1ad5ffa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should compile: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/cases/make/rewrite-factorize-request/index.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"89007458340312e4e966a613ead284e3c3e9a73570dbe572509ccd1272e64cc4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should compile: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/cases/make/rewrite-factorize-reexport-request/index.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab650d1a1ee54c822c66fe8d3c0057b922952ef23a320b2bf500307f728d719"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should compile: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/e2e/cases/make/rewrite-factorize-provide-request/index.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd971cbc365892f40533f1f3299d821401a7e032cd326bf8d17dcdff11218c64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack/src/loader-runner/index.ts: packages/rspack/src/loader-runner/index.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 138 in index.runLoaders at line 248. 7 of those changes were fix/bug commits, and the other 11 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/loader-runner/index.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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2d16f56fa8e5a894c2ab69b44f50e27bd1e3bd58bbe4cec001326d46c967ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack/src/config/defaults.ts: packages/rspack/src/config/defaults.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 119 in defaults.applyOutputDefaults at line 686. 5 of those changes were fix/bug commits, and the other 15 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/config/defaults.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":"packages/rspack/src/config/defaults.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"80450b3dc0f38d8a0f65c33d01b31ae86a87a559c2f9adc580364ac8c3712f56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/concatenated_module.rs: crates/rspack_core/src/concatenated_module.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in ConcatenatedModule::code_generation at line 887. 6 of those changes were fix/bug commits, and the other 19 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/concatenated_module.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":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"825bac96b67b238d2f3275262c7ee692c3520b8f24208112f27532813c39f105"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs: crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in ModuleConcatenationPlugin::optimize_chunk_modules_impl at line 1048. 8 of those changes were fix/bug commits, and the other 15 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a5f0785619cf1dec5c8a7bcd43ae33e2c3c85ab32fb57a76666b07c9ff18f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/plugin/mod.rs: crates/rspack_plugin_javascript/src/plugin/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in JsPlugin::render_webpack_bootstrap at line 261. 7 of those changes were fix/bug commits, and the other 12 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/plugin/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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c87751e2f9179e7c640418c7664b2808035c498b32160d2c7d55e3e6586ab7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_esm_library/src/link.rs: crates/rspack_plugin_esm_library/src/link.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in EsmLibraryPlugin::link_imports_and_exports at line 2111. 3 of those changes were fix/bug commits, 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_esm_library/src/link.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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2abbaaa16d0273172b3ea6b0c397711862a8426eaf2eec15f05f779d58cc70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs: crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in JavascriptParser::evaluating at line 1796. 7 of those changes were fix/bug commits, and the other 26 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/visitors/dependency/parser/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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f1199e3669c304d146916bba0817eb075d392d950e3d15babfa389cae8a229"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/normal_module_factory.rs: crates/rspack_core/src/normal_module_factory.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in NormalModuleFactory::resolve_normal_module at line 649. 6 of those changes were fix/bug commits, and the other 10 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/normal_module_factory.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":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca63b5847263a9820279cd645ce5d18d76805c9bdccfac9d6c41cb1fc4c7c3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_hmr/src/lib.rs: crates/rspack_plugin_hmr/src/lib.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 113 in rspack_plugin_hmr::generate_hot_update at line 238. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_hmr/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_hmr/src/lib.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd42847938283e1c0209e0c02e95e9d66520869fe735c52f7bcd57f54684ce0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/external_module.rs: crates/rspack_core/src/external_module.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in ExternalModule::get_source at line 716. 5 of those changes were fix/bug commits, and the other 13 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/external_module.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":"crates/rspack_core/src/external_module.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57009e26d31c54b0076e7b182cd3067131dbd2c524c3c57f3e79622871dac9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/plugin/runtime_context.rs: crates/rspack_plugin_javascript/src/plugin/runtime_context.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in JsPlugin::render_rspack_bootstrap at line 138. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_javascript/src/plugin/runtime_context.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9412796c4ff8b93fc66d515fc94e0c6215054965353eba0b243344b2655beb15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_esm_library/src/render.rs: crates/rspack_plugin_esm_library/src/render.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in EsmLibraryPlugin::render_chunk at line 131. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_esm_library/src/render.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":"crates/rspack_plugin_esm_library/src/render.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcd1221a666cd35bf3911994ccdaa8a605ba75bd1d30ca5c391ec61f01931ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack/src/rspackOptionsApply.ts: packages/rspack/src/rspackOptionsApply.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in RspackOptionsApply.process at line 88. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/rspackOptionsApply.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":"packages/rspack/src/rspackOptionsApply.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63bb41d4c533e6d5730c41e94aeeef324dfa1aad237167f8215d8061378c30f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/css-module-lexer/src/dependencies.rs: crates/css-module-lexer/src/dependencies.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in LexDependencies::lex_streaming_inner at line 1576. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/css-module-lexer/src/dependencies.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":"crates/css-module-lexer/src/dependencies.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e84d839606945e1897e993a601cbe68a6576d59c93ab9809631ec4bdde0341"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_sources/src/replace_source.rs: crates/rspack_sources/src/replace_source.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in ReplaceSourceChunks::stream at line 607. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_sources/src/replace_source.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":"crates/rspack_sources/src/replace_source.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d13755ff08279d4b7b671dfc14212da098bdc5d3de36d5004509eece6e49bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs: crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ImportParserPlugin::import_call at line 506. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1d01b7aedb4680cf7ef5e23d71ab04427cf0ef4207ac74f6beab90be3a8265"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_split_chunks/src/plugin/mod.rs: crates/rspack_plugin_split_chunks/src/plugin/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in SplitChunksPlugin::inner_impl at line 93. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_split_chunks/src/plugin/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":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0123ec249953da48aeaf453c2dcd944423ed55e0c155208cbbfb536d8036eb01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs: crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in InnerGraphParserPlugin::infer_dependency_usage at line 109. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/inner_graph/plugin.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0fce6fbe2759ba6d7e271cd630938355ecc066576eb83ed5921dc7a2813464"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_split_chunks/src/plugin/module_group.rs: crates/rspack_plugin_split_chunks/src/plugin/module_group.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in SplitChunksPlugin::prepare_module_group_map at line 1034. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_split_chunks/src/plugin/module_group.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":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d0cdc3b52e4d1605f758520e0252eea2667be911d104c185a61e13b6aafc90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs: crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in JavascriptParser::walk_call_expression at line 1642. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57c464a7275d8f957e2a3afee001338bc6bdf99180683b13a2d0e84b4f1acc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack/src/config/adapter.ts: packages/rspack/src/config/adapter.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in adapter.getRawModuleRule at line 352. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/config/adapter.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":"packages/rspack/src/config/adapter.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6a688706f0bf87effa76001f829bdcc13150f7606d0373241cdb595fbe442a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_mf/src/manifest/mod.rs: crates/rspack_plugin_mf/src/manifest/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in rspack_plugin_mf::manifest::process_assets at line 164. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_mf/src/manifest/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":"crates/rspack_plugin_mf/src/manifest/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"770428cc054c939e80edffa8d777c7e98d46e944f2945a79f901ba77928ac317"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack/src/loader-runner/worker.ts: packages/rspack/src/loader-runner/worker.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in worker.loaderImpl at line 70. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/loader-runner/worker.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":"packages/rspack/src/loader-runner/worker.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e06f9caf0dfa233994ccd9dc1b767d67877a3b6dbea527f71313d4274abd72c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack/src/builder/mod.rs: crates/rspack/src/builder/mod.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in OptimizationOptionsBuilder::build at line 3494. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack/src/builder/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":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":3494}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9e62829a9f0c4762d4b3dcc448fd07f9e73f6bd7e91b918c681b8468ad3a81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_watcher/src/trigger.rs: crates/rspack_watcher/src/trigger.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in EventProcessor::process at line 228. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_watcher/src/trigger.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":"crates/rspack_watcher/src/trigger.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c2dffc2dafb9b29abf30ec8460d0f8ec1146e6af48629f6a5fc6dab2ab6381"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs: crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in AMDDefineDependencyParserPlugin::process_call_define at line 262. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5777c786815c842b2ccefd6bf72bd6b4797ae6dd43ffb27a8b72e47a39bae15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_sources/src/helpers.rs: crates/rspack_sources/src/helpers.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in rspack_sources::helpers::stream_chunks_of_combined_source_map at line 929. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_sources/src/helpers.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":"crates/rspack_sources/src/helpers.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a7158dad2ecb0e07983d38fe331ff1534c5948485bcf1d46bbe398baef19c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/runtime_template.rs: crates/rspack_core/src/runtime_template.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ModuleCodeTemplate::export_from_import at line 1369. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/runtime_template.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":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e419907c464fd6dd7dab3941e1d74b0dee0d55a12726e8cad15a816b6a3e002b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs: crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in CodeSplitter::split at line 1203. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.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":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9564e4db9ce10fd2622efbdf0797158d243ff5ba2c42a1f6275b7bb1849aa782"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_swc_js_minimizer/src/lib.rs: crates/rspack_plugin_swc_js_minimizer/src/lib.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in rspack_plugin_swc_js_minimizer::process_assets at line 223. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_swc_js_minimizer/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_swc_js_minimizer/src/lib.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ea867e0ec5aca4e84497fcafc379b6053bca49a51a29264b493228175a5817"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/context_module.rs: crates/rspack_core/src/context_module.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ContextModule::get_lazy_source at line 800. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/context_module.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":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e9157520a439e0f19954f8c30793e62bdd11a95754f59a36e7d688528707d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/new_cache/snapshot/file_system_info.rs: crates/rspack_core/src/new_cache/snapshot/file_system_info.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in FileSystemInfo::read_context at line 721. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/new_cache/snapshot/file_system_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":"crates/rspack_core/src/new_cache/snapshot/file_system_info.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"98026bd7d1a28682dbb0aaa7c020aefe4d3771e997deb66b00a1dc059b65850c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/node_binding/scripts/build.mjs: crates/node_binding/scripts/build.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in build.build at line 37. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/node_binding/scripts/build.mjs\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":"crates/node_binding/scripts/build.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adf543082aada2c365006a1beae64d9a2a22b061dc0c03c657a65802f537662"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs: crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rspack_plugin_javascript::parser_plugin::side_effects_parser_plugin::collect_pure_annotations at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_parser_plugin.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a0536a50c7f35320b5d8e88103cc78a265d503e7ce416057ba8c4cf8122f9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/stats/mod.rs: crates/rspack_core/src/stats/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Stats::get_module at line 1158. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/stats/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":"crates/rspack_core/src/stats/mod.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0cd411d7c27c0c57bbf917e5541864f5ca41a63d8a0ffcefdea9d442a60534"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs: crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ESMExportImportedSpecifierDependency::add_export_fragments at line 545. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a6e433c0795b1ad95b8f68d1e0f30017d5aaf118b727a95913b401916ee33d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs: crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in CommonJsImportsParserPlugin::declarator at line 2106. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8404c62becef6411c63b4bcd9d122816aac4d88e1beddca8d9458e9b887035"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs: crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SourceMapDevToolPlugin::collect_tasks at line 588. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.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":"crates/rspack_plugin_devtool/src/source_map_dev_tool_plugin.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d76d5e8419d4372eed1017fd0fda15a79f612c1307c3fe1ff7503d565781539"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/magic_comment.rs: crates/rspack_plugin_javascript/src/magic_comment.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in rspack_plugin_javascript::magic_comment::analyze_raw_comments at line 610. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/magic_comment.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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef277a094772b2c4492ae3849c85294f4434ac51f1988ddf084fd13a75adbc7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_esm_library/src/optimize_chunks.rs: crates/rspack_plugin_esm_library/src/optimize_chunks.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in rspack_plugin_esm_library::optimize_chunks::analyze_dyn_import_targets at line 565. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_esm_library/src/optimize_chunks.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":"crates/rspack_plugin_esm_library/src/optimize_chunks.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6860d317ff4e37a709c54a935ac034ec4b5d161882a98cd53cc5deee8a7fc50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs: crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ExecuteTask::main_run at line 185. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.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":"crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"61326850c388a8ab721a6f930ae77948f0b6ddbf066bfba28f27ea4409961867"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs: crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ESMImportSpecifierDependencyTemplate::render_evaluated_in_operator at line 527. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_specifier_dependency.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d496af2781b0635f46f4da3adc5b0a8dccd5b6924428b0d8b8cedf1f8cd2f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/runtime.rs: crates/rspack_plugin_javascript/src/runtime.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rspack_plugin_javascript::runtime::render_module at line 174. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/runtime.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":"crates/rspack_plugin_javascript/src/runtime.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3886fa135d4e73c7d03851aae86b36e1de18136164cd3ab7079cdcf43501ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_asset/src/lib.rs: crates/rspack_plugin_asset/src/lib.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in AssetParserAndGenerator::generate at line 527. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_asset/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd3d77f9b2a83d99b92f8f88bc68baf81fba60070f186ca0d221753e7a87c01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_runtime/src/runtime_plugin.rs: crates/rspack_plugin_runtime/src/runtime_plugin.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in rspack_plugin_runtime::runtime_plugin::runtime_requirements_in_tree at line 157. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_runtime/src/runtime_plugin.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":"crates/rspack_plugin_runtime/src/runtime_plugin.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a47a9dbdb998b66b53fb390dd9295e9b95c592fea2b47e81f387f51aa6b0ada"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack-test-tools/src/case/cache.ts: packages/rspack-test-tools/src/case/cache.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in cache.createCacheProcessor at line 34. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack-test-tools/src/case/cache.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":"packages/rspack-test-tools/src/case/cache.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb10d661b25cf6748102cd80b01cdc64bf919d506446fadc638c7e60779064c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/side_effects_analysis.rs: crates/rspack_plugin_javascript/src/parser_plugin/side_effects_analysis.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in rspack_plugin_javascript::parser_plugin::side_effects_analysis::may_have_side_effects at line 56. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/side_effects_analysis.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":"crates/rspack_plugin_javascript/src/parser_plugin/side_effects_analysis.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6251079e79ff1b8d13b41999af64140cd950f8d845a0d3f12941ee4594839749"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/initialize_evaluating.rs: crates/rspack_plugin_javascript/src/parser_plugin/initialize_evaluating.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in InitializeEvaluating::evaluate_call_expression_member at line 66. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/initialize_evaluating.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":"crates/rspack_plugin_javascript/src/parser_plugin/initialize_evaluating.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b61bed9966bc49f5db7f3bbcab122ad0a4d9d21f8404d0d1d8084bb049fb477"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_watcher/src/paths.rs: crates/rspack_watcher/src/paths.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in PathManager::collect_time_info_entries at line 1055. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_watcher/src/paths.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":"crates/rspack_watcher/src/paths.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7545e67c7da79b25beb408372d5f265cd087ac22162f1e3dd3aaf0a7259a76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_split_chunks/src/module_group.rs: crates/rspack_plugin_split_chunks/src/module_group.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ModuleGroup::update_candidate at line 458. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_split_chunks/src/module_group.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":"crates/rspack_plugin_split_chunks/src/module_group.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"025a9bad07374a9e84e00901f6dace2a9f24a5958f1e8e7b6a3a18baa49d6915"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack/src/NativeWatchFileSystem.ts: packages/rspack/src/NativeWatchFileSystem.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in NativeWatchFileSystem.watch at line 160. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/NativeWatchFileSystem.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":"packages/rspack/src/NativeWatchFileSystem.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d29d79dafbd67fb45493f11d915ab820541326481b8b2dac0ee00daddcc5845"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack-test-tools/src/case/hot-step.ts: packages/rspack-test-tools/src/case/hot-step.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in hot-step.createHotStepProcessor at line 64. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack-test-tools/src/case/hot-step.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":"packages/rspack-test-tools/src/case/hot-step.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dd489dd6e79c5c2059bf4ec3e7eaa4e2f4410b64cb5f9df02502a8ecc3ee41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/url_plugin.rs: crates/rspack_plugin_javascript/src/parser_plugin/url_plugin.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in URLPlugin::new_expression at line 106. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/url_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/url_plugin.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fab2d340d647f12bdb77862ccb2b38db15a8ebba2e413a052c64ac479495833"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/utils/module_rules.rs: crates/rspack_core/src/utils/module_rules.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in rspack_core::utils::module_rules::module_rule_matcher_async at line 304. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/utils/module_rules.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":"crates/rspack_core/src/utils/module_rules.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d78adeaeef74ce8f1f30648c1ebd783a24baed4ad6e148e201c453ba0819544"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs: crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CodeSplitter::update_with_compilation at line 488. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/compilation/build_chunk_graph/incremental.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":"crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"e900bb44234fdd374440e668370611278139e2bd03ac12858d2a5342015d8a09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/const/if_stmt.rs: crates/rspack_plugin_javascript/src/parser_plugin/const/if_stmt.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rspack_plugin_javascript::parser_plugin::const::if_stmt::get_hoisted_declarations at line 60. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/const/if_stmt.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":"crates/rspack_plugin_javascript/src/parser_plugin/const/if_stmt.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"769e8caf6b8e08dca9b1b27d729ddd4af70a45475cd4b92f8892922a40e687c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs: crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rspack_plugin_javascript::dependency::esm::esm_import_dependency::esm_import_dependency_apply at line 115. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c922712a5bbb09f6e9dcf3e7fc31eb13846508f198b40127c1e5828ed439ee69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_externals/src/plugin.rs: crates/rspack_plugin_externals/src/plugin.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ExternalsPlugin::handle_external at line 37. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_externals/src/plugin.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":"crates/rspack_plugin_externals/src/plugin.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddefc0b79ba452bba3200db3d6448f287cd911b0ec3db22e3e5bd2dde5c899ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack/src/node/NodeWatchFileSystem.ts: packages/rspack/src/node/NodeWatchFileSystem.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in NodeWatchFileSystem.watch at line 51. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/node/NodeWatchFileSystem.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":"packages/rspack/src/node/NodeWatchFileSystem.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6eb0955b2da7c8b5813db6c23aca21155be47041eafbdff67c7ec8777d4f72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_rstest/src/plugin.rs: crates/rspack_plugin_rstest/src/plugin.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RstestPlugin::resolve_mock_request at line 281. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_rstest/src/plugin.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":"crates/rspack_plugin_rstest/src/plugin.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"938ac2a0062288dcf6d849c3bfb1fea02b446f5ab0be5d458cc3376c638883f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_css/src/runtime/mod.rs: crates/rspack_plugin_css/src/runtime/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in CssLoadingRuntimeModule::generate at line 263. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_css/src/runtime/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":"crates/rspack_plugin_css/src/runtime/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4e98c6f58ffcae34acaa6b1223f6430a181b9caa589ff41553135a32a76c20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_rslib/src/dyn_import_external.rs: crates/rspack_plugin_rslib/src/dyn_import_external.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rspack_plugin_rslib::dyn_import_external::cutout_star_re_export_externals at line 14. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_rslib/src/dyn_import_external.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":"crates/rspack_plugin_rslib/src/dyn_import_external.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a94b14755039a9aef604fdc960d65b2c0b9cf33e3274ea30b8601291a31d655"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack-cli/src/cli.ts: packages/rspack-cli/src/cli.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in RspackCLI.buildConfig at line 203. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack-cli/src/cli.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":"packages/rspack-cli/src/cli.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7942186054f052da668fe39f637948a7dde064fa02541da1a29586463e316e30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs: crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in rspack_plugin_javascript::utils::eval::eval_binary_expr::handle_add at line 298. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.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":"crates/rspack_plugin_javascript/src/utils/eval/eval_binary_expr.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6739bfc79e8a2a75c1db6f9e996d0fc6e85606a91ac7c5098ede6bcb64cac88c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/require_ensure_dependencies_block_parse_plugin.rs: crates/rspack_plugin_javascript/src/parser_plugin/require_ensure_dependencies_block_parse_plugin.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RequireEnsureDependenciesBlockParserPlugin::call at line 72. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/require_ensure_dependencies_block_parse_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/require_ensure_dependencies_block_parse_plugin.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6856949dfb4307d82a757888c5bc0eb622bb049bf4a1201ab00f6a4e2360ebb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack/src/builtin-plugin/css-extract/loader.ts: packages/rspack/src/builtin-plugin/css-extract/loader.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in loader.pitch at line 113. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/builtin-plugin/css-extract/loader.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":"packages/rspack/src/builtin-plugin/css-extract/loader.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efb1316b19dccc60e872fe9b029bd9298bd253e03055bf26d2cdb0086c00dad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_runtime/src/runtime_module/get_chunk_filename.rs: crates/rspack_plugin_runtime/src/runtime_module/get_chunk_filename.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in GetChunkFilenameRuntimeModule::generate at line 269. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_runtime/src/runtime_module/get_chunk_filename.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":"crates/rspack_plugin_runtime/src/runtime_module/get_chunk_filename.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a1f5798ea161b71662a6b707c148fac104fea752036085d22e1a08341d8e2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/utils/eval/eval_unary_expr.rs: crates/rspack_plugin_javascript/src/utils/eval/eval_unary_expr.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rspack_plugin_javascript::utils::eval::eval_unary_expr::eval_typeof at line 10. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/utils/eval/eval_unary_expr.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":"crates/rspack_plugin_javascript/src/utils/eval/eval_unary_expr.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab17b525222b68fb02d6fac04a9a97853d34a12209cc27ab1688cbaacca52fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_loader_swc/src/lib.rs: crates/rspack_loader_swc/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in SwcLoader::loader_impl at line 58. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_loader_swc/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_loader_swc/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"03759392571a7f5d0e64dabe083759ae3f5647fece32e965fb42a809b49a5084"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack/src/builtin-plugin/ExternalsPlugin.ts: packages/rspack/src/builtin-plugin/ExternalsPlugin.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ExternalsPlugin.#getRawExternalItem at line 74. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/builtin-plugin/ExternalsPlugin.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":"packages/rspack/src/builtin-plugin/ExternalsPlugin.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeec97c8fc98d3a2897d8a8388468008de32220e26f77b3c1499c9f84865753"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_runtime/src/module_chunk_format.rs: crates/rspack_plugin_runtime/src/module_chunk_format.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rspack_plugin_runtime::module_chunk_format::render_chunk at line 137. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_runtime/src/module_chunk_format.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":"crates/rspack_plugin_runtime/src/module_chunk_format.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5683d49d4dc74546f855f491affc1c3e03696468ab4f34262cbb2772da9a4cca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_sources/src/concat_source.rs: crates/rspack_sources/src/concat_source.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ConcatSourceChunks::stream at line 263. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_sources/src/concat_source.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":"crates/rspack_sources/src/concat_source.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0dbccb8fb806f7322e94bc8de9c24145fa65eee3c57b598f71b121d2637777"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.rs: crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in NodeStuffPlugin::identifier at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/node_stuff_plugin.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"93edacf83db9866aba682520112ebf5d52b310dc4af05e4258888ae99609fe71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs: crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in JsonpChunkLoadingRuntimeModule::generate at line 277. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.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":"crates/rspack_plugin_runtime/src/runtime_module/jsonp_chunk_loading.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bb39424e92c020adc8fc3d072c0b5be784eab8bbb95e4d3ac77975ec91c83e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_real_content_hash/src/lib.rs: crates/rspack_plugin_real_content_hash/src/lib.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rspack_plugin_real_content_hash::inner_impl at line 82. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_real_content_hash/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_real_content_hash/src/lib.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc6e29d50b28492519fd031259d9f78669e0a609cc6644f4434116e86a05453"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_mf/src/manifest/asset.rs: crates/rspack_plugin_mf/src/manifest/asset.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rspack_plugin_mf::manifest::asset::module_source_path at line 188. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_mf/src/manifest/asset.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":"crates/rspack_plugin_mf/src/manifest/asset.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a600e171cc082f45bf315d09966a7899ea35e3873c5e05fe65862f160f8d0d34"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rspack/src/Watching.ts: packages/rspack/src/Watching.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Watching.#go at line 284. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/Watching.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":"packages/rspack/src/Watching.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c6e94e58fb9c6340cc1934b68742511897b132c5008145015be24c08ae427a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_extract_css/src/plugin.rs: crates/rspack_plugin_extract_css/src/plugin.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PluginCssExtract::render_content_asset at line 345. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_extract_css/src/plugin.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":"crates/rspack_plugin_extract_css/src/plugin.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa433600bfcf475be39b324cfc19746bce4724a2b9b65139b379d94e0822b85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs: crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rspack_plugin_javascript::visitors::dependency::context_dependency_helper::create_context_dependency at line 24. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.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":"crates/rspack_plugin_javascript/src/visitors/dependency/context_dependency_helper.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ceccf77ace23cc54e2c1047a980e0a5b72412e4f02511800c73cbffc94dcdc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/mod.rs: crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/mod.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Cutout::cutout_artifact at line 28. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/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":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3106abb41327603e9fbab3a4a4c739b0132aaf44f50f27fc29e698861b88f00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs: crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ModuleChunkLoadingRuntimeModule::generate at line 267. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.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":"crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"21316214624679c073647e6a8d257d823d08cbcbc5e587abec6e9668fcf9d095"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rspack_plugin_rstest/src/import_dependency.rs: crates/rspack_plugin_rstest/src/import_dependency.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rspack_plugin_rstest::import_dependency::module_namespace_promise_rstest at line 184. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_rstest/src/import_dependency.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":"crates/rspack_plugin_rstest/src/import_dependency.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71074cc6c80edb0de6783d12daa69f739986558712eb5493301a6451bcc6a97"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tests/rspack-test/cacheTestOptions.mjs: tests/rspack-test/cacheTestOptions.mjs changed 18 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is getCacheTestOptions at line 157), 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(cache): cache module-not-found resolution results (#16560)\u201D; \u201Cfix: finalize finishMake module rebuilds and artifacts (#16580)\u201D; \u201Cfix(cache): snapshot invalid Windows missing paths (#16584)\u201D; \u201Cfix(cache): reuse loader output after a caught import cycle (#16583)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- tests/rspack-test/cacheTestOptions.mjs\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":"tests/rspack-test/cacheTestOptions.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bada5c5a9209b0f7a6565edbc7b58b2c3ed992b35c6459afe879613e1e81b551"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/rspack/src/Compiler.ts: packages/rspack/src/Compiler.ts changed 15 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is Compiler.getInfrastructureLogger at line 457), 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(cache): share loader cache across modes and SSR compilers (#16558)\u201D; \u201Cfix(types): allow omitting child compiler plugins (#15948)\u201D; \u201Cfix(types): accept falsy loaders and child compiler plugins (#15912)\u201D; \u201Cfix(types): allow shouldEmit hooks to return void (#15881)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/Compiler.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":"packages/rspack/src/Compiler.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6083fe4afccc0afd3a3ec6d42b777a6e5c21f7a97f042fcb3afd02f2501a1d3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_binding_api/src/plugins/js_loader/scheduler.rs: crates/rspack_binding_api/src/plugins/js_loader/scheduler.rs changed 9 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 9 (its worst body is rspack_binding_api::plugins::js_loader::scheduler::merge_loader_context at line 76), 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(core): distinguish fatal module errors from loader diagnostics (#16538)\u201D; \u201Cfix(loader): revert native loader hook invocation (#15719)\u201D; \u201Cfix(loader): preserve string BOM across native boundaries (#15632)\u201D; \u201Cfix(loader): invoke loader hooks through the native hook (#15591)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_binding_api/src/plugins/js_loader/scheduler.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":"crates/rspack_binding_api/src/plugins/js_loader/scheduler.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12f7fcf06bed3a8bfb453bb9d05b6793b066f58270e3d01849f0f8a72963a65"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs: crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs changed 8 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 1 (its worst body is JsHooksAdapterPlugin::fmt at line 84), 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(loader): revert native loader hook invocation (#15719)\u201D; \u201Cfix: revert \u0022feat(core): expose NormalModule beforeLoaders hook to JS\u0022 (#15660)\u201D; \u201Cfix(loader): invoke loader hooks through the native hook (#15591)\u201D; \u201Cfix: revert afterOptimizeChunkIds and renderContent hooks (#15471)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_binding_api/src/plugins/js_hooks_plugin.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":"crates/rspack_binding_api/src/plugins/js_hooks_plugin.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a2d51258177713f97c09975c0fa34c04b54f54e8969aaf0c3c1bf8f06879e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_core/src/compilation/build_module_graph/pass.rs: crates/rspack_core/src/compilation/build_module_graph/pass.rs changed 7 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 4 (its worst body is rspack_core::compilation::build_module_graph::pass::run_build_module_graph_phase at line 81), 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: finalize finishMake module rebuilds and artifacts (#16580)\u201D; \u201Cfix(cache): share loader cache across modes and SSR compilers (#16558)\u201D; \u201Cfix: isolate module build cache sessions by graph (#16540)\u201D; \u201Cfix(core): decouple incremental artifacts from cache! (#15229)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/compilation/build_module_graph/pass.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":"crates/rspack_core/src/compilation/build_module_graph/pass.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5bcfa21d6a87b84815b8a8ecd4090cad48d1b5898ccbb484c7cdd747767494"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_watcher/src/executor.rs: crates/rspack_watcher/src/executor.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Executor::wait_for_execute at line 156), 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(watcher): preserve concrete paths in native watcher events (#16411)\u201D; \u201Cfix(watcher): wait for aggregateTimeout after the last change (#16304)\u201D; \u201Cfix(watcher): preserve native event delivery while JavaScript is blocked (#16106)\u201D; \u201Cfix(watcher): report recreated files by their final state (#16040)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_watcher/src/executor.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":"crates/rspack_watcher/src/executor.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76368145676dabe8b33b5ec578f4d26f09215f94f81aeb99b159b3b88d20c2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/rspack/src/config/adapterRuleUse.ts: packages/rspack/src/config/adapterRuleUse.ts changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is adapterRuleUse.resolveStringifyLoaders at line 589), 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!: rename loader filter.code to codeFilter (#16184)\u201D; \u201Cfix(types): accept falsy loaders and child compiler plugins (#15912)\u201D; \u201Cfix(loader): normalize builtin options for inline requests (#15909)\u201D; \u201Cfix(types): improve loader context filesystem types (#15437)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/config/adapterRuleUse.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":"packages/rspack/src/config/adapterRuleUse.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f6f1d6cff48680cf6ba2607c018be3b035eacb36f0bbd5ee1bfeb8eb0133b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_core/src/compilation/build_module_graph/module_executor/mod.rs: crates/rspack_core/src/compilation/build_module_graph/module_executor/mod.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 7 (its worst body is ModuleExecutor::import_module at line 268), 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: finalize finishMake module rebuilds and artifacts (#16580)\u201D; \u201Cfix(cache): reuse loader output after a caught import cycle (#16583)\u201D; \u201Cfix: isolate module build cache sessions by graph (#16540)\u201D; \u201Cfix: preserve diagnostics returned by importModule (#15496)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/compilation/build_module_graph/module_executor/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":"crates/rspack_core/src/compilation/build_module_graph/module_executor/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8156fc1f197b4fdbff1b017cb8c6160b2af8849ebf88b016ca77df08bca97b54"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_ids/src/compact_hashed_chunk_ids_plugin.rs: crates/rspack_ids/src/compact_hashed_chunk_ids_plugin.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 6 (its worst body is rspack_ids::compact_hashed_chunk_ids_plugin::chunk_ids at line 49), 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(ids): rehash identical keys in compact-hashed ids (#15915)\u201D; \u201Cfix: avoid chunk name collisions in compact hashed ids (#15693)\u201D; \u201Cfix(esm): remove empty chunks except for facade chunks (#15424)\u201D; \u201Cfix(ids): correct compact hashed API names (#15356)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_ids/src/compact_hashed_chunk_ids_plugin.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":"crates/rspack_ids/src/compact_hashed_chunk_ids_plugin.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47cb5146320ab9251eb14b21335b9dcb49b1ec2e580c3256162fde4c0c1f19d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/rspack/src/util/fs.ts: packages/rspack/src/util/fs.ts 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 11 (its worst body is fs.rmrf at line 590), 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(watcher): preserve concrete paths in native watcher events (#16411)\u201D; \u201Cfix(types): allow Node fs as intermediate file system (#15895)\u201D; \u201Cfix(types): allow optionless filesystem sync calls (#15438)\u201D; \u201Cfix(types): improve loader context filesystem types (#15437)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- packages/rspack/src/util/fs.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":"packages/rspack/src/util/fs.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f05bec9619f8313a3e34ad8693c18c48dcd15178869a595274864777e554cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_core/src/compilation/build_module_graph/graph_updater/mod.rs: crates/rspack_core/src/compilation/build_module_graph/graph_updater/mod.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 9 (its worst body is rspack_core::compilation::build_module_graph::graph_updater::expand_rebuild_modules at line 17), 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: finalize finishMake module rebuilds and artifacts (#16580)\u201D; \u201Cfix(cache): share loader cache across modes and SSR compilers (#16558)\u201D; \u201Cfix(core): align module need_build and FileSystemInfo with webpack (#15374)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_core/src/compilation/build_module_graph/graph_updater/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":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b1ae4e939f280080d3d5b97a309ed7f1b92f47e3a9e1b73b70419dffd85c9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_loader_lightningcss/src/lib.rs: crates/rspack_loader_lightningcss/src/lib.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 14 (its worst body is LightningCssLoader::loader_impl at line 100), 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(lightningcss-loader): preserve parser flags during stylesheet conversion (#16378)\u201D; \u201Cfix(sources): preserve missing source contents as null (#16366)\u201D; \u201Cfix(deps): upgrade lightningcss to 1.0.0-alpha.72 (#15991)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_loader_lightningcss/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_loader_lightningcss/src/lib.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0b2be597edd1104851c056a2a4c01784ca11603ca117f98f648893bfb77573"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_watcher/src/disk_watcher.rs: crates/rspack_watcher/src/disk_watcher.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 11 (its worst body is rspack_watcher::disk_watcher::handle_event at line 118), 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(watcher): align rename events with watchpack (#16460)\u201D; \u201Cfix(watcher): keep watching when unwatching a stale path fails (#16199)\u201D; \u201Cfix(watcher): report watched files inside directories that appear (#15966)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_watcher/src/disk_watcher.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":"crates/rspack_watcher/src/disk_watcher.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8def6663cea330e4ca542a2c4136f1bc18e76895237648bbf40cad3e9ea24da"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_binding_api/src/raw_options/raw_split_chunks/mod.rs: crates/rspack_binding_api/src/raw_options/raw_split_chunks/mod.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 12 (its worst body is RawSplitChunksOptions::normalize at line 123), 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: \u201CRevert \u0022fix: inherit splitChunks request limits in cache group\u0022 (#16273)\u201D; \u201Cfix: inherit splitChunks request limits in cache groups (#16191)\u201D; \u201Cfix(split-chunks): support minRemainingSize (#15594)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_binding_api/src/raw_options/raw_split_chunks/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":"crates/rspack_binding_api/src/raw_options/raw_split_chunks/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa490b4154e54a1492ee7aafa4109c796b9852d1553d4f588bbba41ffa6e913"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_plugin_css/src/dependency/import.rs: crates/rspack_plugin_css/src/dependency/import.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 3 (its worst body is rspack_plugin_css::dependency::import::create_resource_identifier at line 132), 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(css): calculate CSS module hashes from graph dependencies (#16120)\u201D; \u201Cfix(css): align CSS Modules behavior with webpack css-loader fixtures (#15816)\u201D; \u201Cfix: preserve css-import external conditions (#15522)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_css/src/dependency/import.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":"crates/rspack_plugin_css/src/dependency/import.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46475028cfe5da0cc49287f1e677a8374eb3bca0dadfa9b277412d4ef578c32"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_napi/src/threadsafe_function.rs: crates/rspack_napi/src/threadsafe_function.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is ThreadsafeFunction::call_with_promise at line 286), 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(binding): preserve worker callback ownership and native module lifetime (#16318)\u201D; \u201Cfix(release): synchronize workspace versions and CLI peer dependencies (#16181)\u201D; \u201Cfix(binding): release transient TSFN callbacks (#15938)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_napi/src/threadsafe_function.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":"crates/rspack_napi/src/threadsafe_function.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef4dc2fc9bfdf3a46c59a28966d8d0df5d294735d6765d44fca6d918a94464d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/css-module-lexer/src/dependency_types.rs: crates/css-module-lexer/src/dependency_types.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Warning::fmt at line 686), 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(css): localize type-first nested selectors (#16011)\u201D; \u201Cfix(css): align CSS Modules behavior with webpack css-loader fixtures (#15816)\u201D; \u201Cfix(css): CSS module dashed identifier and composes edge cases (#15223)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/css-module-lexer/src/dependency_types.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":"crates/css-module-lexer/src/dependency_types.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"902b0a562309c910bdec43fd11ab713f001bb27f8d1837ada49a7e4dc68ae95d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs: crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.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 11 (its worst body is ReadFileChunkLoadingRuntimeModule::generate at line 248), 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(hmr): complete new entry chunk dependencies (#15955)\u201D; \u201Cfix(hmr): validate chunk versions before installation (#16360)\u201D; \u201Cfix(HMR): correct hot updated chunk path resolution in Node.js HMR (#16174)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.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":"crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7e82d1bec6a65c62a2c6fcd1cf71f493a234d11acc6b582e12899544752ed2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs: crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.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 11 (its worst body is RequireChunkLoadingRuntimeModule::generate at line 259), 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(hmr): complete new entry chunk dependencies (#15955)\u201D; \u201Cfix(hmr): validate chunk versions before installation (#16360)\u201D; \u201Cfix(HMR): correct hot updated chunk path resolution in Node.js HMR (#16174)\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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:00:01 \u002B00:00\u0027 --until=\u00272026-11-14 10:00:01 \u002B00:00\u0027 --full-history --no-merges -- crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.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":"crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1918f996c283b54b25348da94df040c079131f4bdfa734cde8366e6150abe21d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 12 significant file(s) lose their only recent owner: crates/rspack_allocative/src/flamegraph.rs, crates/rspack_allocative_derive/src/derive_allocative.rs, crates/rspack_allocative_driver/src/lib.rs, crates/rspack_allocative/src/impls/std/sync.rs, crates/rspack_allocative/src/impls/std/unsorted.rs, crates/rspack_macros/src/string_enum.rs, crates/css-module-lexer/src/css_syntax.rs, crates/rspack_allocative_driver/src/main.rs (\u002B4 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4b9bbf80d4027fc770860c2ba327e080c32305521012d0541d284ca404672eb4"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 10 significant file(s) lose their only recent owner: crates/rspack_binding_api/src/file_system_dependency_strings.rs, crates/rspack_plugin_rsc/src/reference_manifest.rs, crates/rspack_binding_api/src/compiler_scoped_tsfn.rs, crates/rspack_binding_api/src/plugins/rsc.rs, crates/rspack_plugin_rsc/src/coordinator.rs, crates/rspack_binding_api/src/js_helpers.rs, crates/rspack_plugin_rsc/src/plugin_state.rs, packages/rspack/src/builtin-plugin/rsc/Coordinator.ts (\u002B2 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e45dc5246af41512c91be0b9292109a212e9183ecd15c58c3eb6d59ff18e0485"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 8 significant file(s) lose their only recent owner: crates/rspack_plugin_javascript/src/runtime_context.rs, crates/rspack_plugin_javascript/src/visitors/scope_info/semantic.rs, crates/rspack_plugin_javascript/src/parser_plugin/side_effects_analysis.rs, crates/rspack_resolver/src/package_json/simd.rs, crates/rspack_paths/src/path_list.rs, crates/rspack_core/src/exports/export_info_setter.rs, crates/rspack_core/src/exports/exports_info_setter.rs, crates/rspack_plugin_sri/src/integrity.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9057956cb74d5035a5fbb3b4ff3263c44dd1bd926cf50b1b4cc3e07295ff3bd5"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 4 significant file(s) lose their only recent owner: crates/rspack_core/src/module_graph/rollback/overlay_map.rs, crates/rspack_core/src/compilation/pass.rs, crates/rspack_core/src/compilation/run_passes.rs, crates/rspack_core/src/module_graph/internal.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"97fb5bb3e98c5931401af8f73b9bf0a3ce0480bf4244264cb1969818fd1cebc5"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 3 significant file(s) lose their only recent owner: crates/rspack_storage/src/filesystem/db/bucket/mod.rs, crates/rspack_cacheable/src/with/custom.rs, crates/rspack_parallel/src/iterator_consumer/try_future.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"73b90dcdc4cebebdc3165fa7e888c3b6ea2992d54b1bafd278217ad3de6e144c"}},{"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 (44 single-owned of 863 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; 863 of the 1556 production source files in this repository met that bar). They are anonymized user #6 (2 file(s)), anonymized user #7 (2 file(s)), anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)), anonymized user #10 (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: crates/rspack_plugin_circular_dependencies/src/circular_dependency_rspack_plugin.rs, crates/rspack_core/src/resolver/resolver_cache.rs, crates/rspack_resolver/src/tsconfig.rs, crates/rspack_resolver/src/context.rs, packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts, packages/rspack/src/builtin-plugin/EsmLibraryPlugin.ts, packages/create-rspack/src/index.ts."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: more flexible filter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-test-tools/src/test/creator.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1994de95170c843120f90dc645b0692c7b634f67bb99bb2d8161a6c9ddddfd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: modify runner module scope based on stats 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":"packages/rspack-test-tools/src/case/config.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbab570d377633ce9b994dda32612e1509a5e59520a6e9ae256cd8e6a2adce4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: modify runner module scope based on stats 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":"packages/rspack-test-tools/src/case/esm-output.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b934350879950e0287fab5aced47d11d2788c6c4be627fef72c9ca4b1b2a9662"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: modify runner module scope based on stats 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":"packages/rspack-test-tools/src/case/serial.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"122939e828cbde95ba618b0d89bcbee38ecbe7992a6476648a335c74779e4a7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: change to stats.errorStack \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-test-tools/src/case/diagnostic.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"519d275338595a72a27849fe7b89620dcac8bfffbd651e109d29da982fc7b41e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add \u0060errorStack: false\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":"packages/rspack-test-tools/src/case/diagnostic.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12c885e617ee32e18b7770de5b3a71493d575b8b8c89796963b2f198bc0b59e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a better 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":"packages/rspack-test-tools/src/case/hot-step.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5179f7ad4dd97955493bd319fa9c7ed1165c1070e202c5c5ab5b7c681463dd03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is a workaround, we can remove it when notify support windows better. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-test-tools/src/case/watch.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbac3e10038610748116c123761feb40209c6d82cb24001799dbef90708f774"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is \u0060memoizeFn\u0060 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":"packages/rspack/src/FileSystem.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6ec88ce1553f747010cf7fc6859f1812931b409d7e4ace71fdd474189e9f8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(v3): Remove resolveData.fileDependencies, resolveData.contextDependencies, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/NormalModuleFactory.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2527eddabdaf08f7ea77ad1523656dad4ac8b68618458526957f393269c71e5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: second param resolveData \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/NormalModuleFactory.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6688a9f2550e3e3da188e8b71d98bff3095e1d9fd8bae666fec9f4fefaeb3859"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a better way to handle accessing stats from stale compilations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/Stats.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"28add2c915a68d94d7a7485cbeafe75a23dde6bc5c058c2d720b4d35963587fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a better way to handle accessing stats from stale compilations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/Stats.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cb467ba2d435def0bd46aabf0768483ef60bc3b3bb5c8d4698736010381379"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: compilation parameter 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":"packages/rspack/src/Watching.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"084437824e9933ebe6e5568fb2dcc6293e94e910a7c127171e22da355b59560b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: inconsistent: the plugin need to be placed after SplitChunksPlugin \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/rspackOptionsApply.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6398c0275c650b9195c91f4eaebe6a63d6e782900e24c41abd981c8b1f29408e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we need a compiler.id for track child compiler \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/trace/traceHookPlugin.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cd1f4b7b447bf82e48df8f8f59f33b272725d29c170a05e107c056fb68a9f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: (type) our native resolver return value is \u0022string | false\u0022 but webpack type is \u0022string\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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ead747763e3b2a218a45f6971ca06138836c4079e7ef416751fad99efae790e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use \u0060with_added_extension\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":"crates/rspack_util/src/swc/runtime.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ad93a5219007e57bc4e81b3832929e2e3802c0803b26830d05c15a5be5c529"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO compare snapshot \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_tools/src/compare/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdc6b5cc0cec28dcb9ba8cad53bb7ac9490b96c8a495f2ef31ccb6d6131f1c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check SnapshotScope::Context \u0026\u0026 SnapshotScope::Missing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_tools/src/compare/snapshot.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8036ef83f4a87afa35095999cd0f6977fa1882e1a8d3897a88b307023913b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Only package.json is supported, so warn about having other 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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f3c70885f559fe476dd888e5ff3beac6c0f8949b3ae8a9ff9e9433f412a19d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fill in test case for this 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":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01770b59151712dfee2171b2d68fc636df8dd675b090585ca5bb35216f7f5e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [DEP0148] DeprecationWarning: Use of deprecated folder mapping \u0022./dist/\u0022 in the \u0022exports\u0022 field module resolution of the package at xxx/package.json. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff06e17f3f243c3f74ca57cc01ba069d1e0b90121ae563ff0d42dfa195ecd95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [DEP0148] DeprecationWarning: Use of deprecated folder mapping \u0022./dist/\u0022 in the \u0022exports\u0022 field module resolution of the package at xxx/package.json. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"143455d6f7e965631047ee1ce75a9d3d47c9029b956c15063a870f97c07b72b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: https://github.com/nodejs/node/blob/8f0f17e1e3b6c4e58ce748e06343c5304062c491/lib/internal/modules/esm/resolve.js#L705C1-L714C1"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5b40027f1d73e5b0b76e24b74456d0247c36adfef50168f039fcf3f5348530"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The error is PackagePathNotExported in enhanced-resolve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_resolver/src/tests/exports_field.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"03aeaefdbb93cba67734e489e8a1afdd3ef1674b95889c79245e8916d8640863"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add more test 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":"crates/rspack_plugin_schemes/src/http_uri/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12cf55f5c2362150b74ceeef5ce6cf1af20f260bbde8af853ba8b8354c710a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO workaround for get_chunk_update_filename \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_runtime/src/runtime_module/get_chunk_update_filename.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"82da87cbda98511e74b95768933ad056d0c3775012ad15d7c879ec11362b1632"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: import_scripts_chunk_loading_with_hmr_manifest same as jsonp_chunk_loading_with_hmr_manifest \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_runtime/src/runtime_module/import_scripts_chunk_loading.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f9645afbe38117949655630ec908dd8b98e6f9e45b7345eb1c09bf3b1c87b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(compat): the \u0060rstest_dynamic_require ? \u2026 : \u003Cplain require\u003E\u0060 guard \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rstest/src/import_dependency.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad18eda8aefbb956c6447848064f3055b6e986fc59e0301722e71df8d5e5591b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider alias? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1966750e6577074c8c4884ef19a45e77b9bd52eb9c461df9d693634bb359e18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace this Rstest-specific parser rewrite with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rstest/src/parser_plugin.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a9496e9db0f1f6f04c79f186581e5d5b0e29f592c4b495f901317498a746f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this compatibility guard once the minimum supported Rstest version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rstest/src/plugin.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9932436a5881864afe4b85668c45a885b0d4e33760517dad050257233f2c801"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should cache calculate results 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":"crates/rspack_plugin_rslib/src/dyn_import_external.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"797b7c51b0d693f3a06f3527e264aca62e557a74ee80c7332f727a3fe2623255"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: color 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":"crates/rspack_plugin_progress/src/lib.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e32dfdcda7fef03259388610a75de360da954cb541cb66f617c229806e49ac9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Disable the warnings for now, cause it cause too much positive-negative warnings, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_lightning_css_minimizer/src/lib.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"32724467a3e94cff16a1307842b3c5feae4dd38cf817794131af09f770cf6ff3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Disable the warnings for now, cause it cause too much positive-negative warnings, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_loader_lightningcss/src/lib.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6234bf1f1277d34e78c420aca4bb9d4b1cb487500e7f0bfb4cc4567d4169afc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we cannot access module graph at this stage \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_lazy_compilation/src/plugin.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"064b80cbbafc3f667c9a76a5876c05f00b486afd94c2e686aace96b3d92f1b23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: remove \u0060.clone\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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d30ddc6ae7da9492dcb1e2d10ad10d9a5f9933f5fbe19852de23484421a44d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should mv it to plugin(for example \u0060parse.hooks.evaluate for\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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad23577f02a6ca7d473344b6207271043fba8c3069195457d8816b18d0bc031"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: self.hooks.label.get \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df9be6e8eecbd15bc6c98252dd8e74a7e5f16cc37ecab87e8d425690ec5074b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: expr.arg belongs chain_expression \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8bcfe17480292f55563438ccea5c30886ccc257da9ea5d8c5af66834cd8d6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: define variable for class expression in block pre walk \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/walk.rs"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada2285fb2f2419af4225dc41bb24d787d9aa66410a5ded74ba839251509fab1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: maybe we can use std::ptr::eq \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/utils/eval/mod.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"500a52db742ccb7e4b6931ecdb99d8f8e17ce80c5780e87d73ba7862550da1fe"}},{"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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d8efb1188413f270b75a4c26a51f29fc42dc120646fd82cab0c057dacdcc6f"}},{"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":"crates/rspack_core/src/compilation/build_chunk_graph/incremental.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a61a8414280fdb401deddc67963ab378b92915d6308e8b372aa35cb0d82526"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ADD module connection explanations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"d196cbf17187f6c3c12f857c29a818c5e67ba86b61e283feed75412244293e6d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Sort configurations by length and start with the longest one \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":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfee354b6f6084c59e2686a813c46a1b2d90b5c44f8c85589a80caa7b8443aad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(from webpack): Allow reusing existing configuration while trying to add dependencies. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec658e215b18a6e9029fe97cac288ce15871625bc67da8ce3171851158ad6c15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize asset module https://github.com/webpack/webpack/pull/15515/files"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/plugin/module_concatenation_plugin.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97da24a8245e4d1a9dcc46620fdb370f8c9b539d9b00c289264fc8d639a34ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should\u0027ve used expression evaluation to handle cases like \u0060abc${\u0022efg\u0022}\u0060, 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":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_context_dependency_parser_plugin.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6a823e5fc3f1e6b005032e72ac44909910dfe8cf102f654b78c2ee83b0a4ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: return \u0060None\u0060 in webpack \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/require_context_dependency_parser_plugin.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"59995cae76955307f062433b8628cd693d5da2cfaca40d1b79666e026b4757ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: return \u0060None\u0060 in webpack \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/require_context_dependency_parser_plugin.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"645105b393e91edfc0270008e2afab3d792417f0728f775897b4a323a3cb4a7d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: return \u0060None\u0060 in webpack \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/require_context_dependency_parser_plugin.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecafb6c0b9773e6995ad2cf8c5eedaff2d925e462bd9f58f1fbbe4afa7377b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: webpack use \u0060walk_expression\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":"crates/rspack_plugin_javascript/src/parser_plugin/provide_plugin/parser.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a946095fd921f4851765974895140662cba2763af67455a7835fed6ef481939a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: how to implement 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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f6f1f1f68eab73a3ec273187c0ae6a8981f3f77473b22a5885c6e11f22d6a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //  TODO: consider how to share 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":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3756350e6205d85fb2df7f9232e6e6a4db46b166314ee5dc076e31e2c97dbf84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ensure all fn_params are identifiers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_define_dependency_parser_plugin.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a48efdc34b1323d444e973f593bf8caf365d27701ac3f82d58edd53cdda022e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check if args includes spread \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/amd/amd_require_dependencies_block_parser_plugin.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b485395287d3055b7a54108fed90cf014a17553c2fc6b6f3ada63227e46c52ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: reexport fake namespace 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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"0677a50cef6d0fb248e6dbfa7e0d2c8c39483aeae839e3801d5b881e8e3af5e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a better way to implement this for performance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/dependency/esm/esm_import_dependency.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a69eea66b4bb0edf11c7797854ac0d1bfc0496399e02287635658fdd3c96eed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support 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":"crates/rspack_plugin_html/src/config.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfbba712eb1789e2dc2133b553acb7b4557307fb4ee76523b41d09f068dd4cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: parallel generate html \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_html/src/plugin.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3481cd8b4fae466566e98b1c32ce59f351499118fcf16b17a592551d201650"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support loader query form \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_html/src/template.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"063477c0f870622e9af2f3a611d989a2fa4ae5fbb18330bc2586b98455afde8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: function eq \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_extract_css/src/plugin.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d070166c94723fa3ca5b8966c3aed11522a9f0034e72b735e9dadfc2c59716"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize import attributes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":2834}}}],"partialFingerprints":{"codehealthFindingId/v1":"06afc0c893b0d93d66baae95f9e05aec23ef3efc7896a8ecaf6b10924e8177c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support config to disable scope hoisting for non strict 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":"crates/rspack_plugin_esm_library/src/plugin.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"28516f58db4191d19c83883706c2b75d1433400c347ec67d5b172e62375f1720"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The fields \u0060name\u0060 for serialize \u0026 deserialize. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_dll/src/dll_entry/dll_entry_dependency.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0eb3b5829409ecab9d2f7eaa5309e64e756097bd97a3bb03611dcc2876ff94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it should be set to EntryDependency.loc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_dll/src/dll_entry/dll_module.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee325c6a444bca94b3361794c121c8a7fade8d9eadc4fcd9bcfcaf33ede0af4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: memory leak if not clear across multiple compilations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"018d6bd5062f513eb96a6a208f05f563b4a6acf7260244a518b81b14ff01ad37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Optimize skipping CSS loading for initial chunks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_css/src/runtime/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbf469c4c2f831db2fa2dbd960eedda89b3aca774fe678c7f917f5f5afaaaaa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(hyf0): we should emit a warning 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":"crates/rspack_plugin_css/src/plugin/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8b164c33edfffc2152e175fde54bee0292f96200831dfe21a8037ff62ce118"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // \t\t\t// TODO print better warning \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_css/src/plugin/mod.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2ed5c79d0fe89e66bd97c40a476dc34d018cf6e2b02d43ef78d45724e1a720"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use PrefixSource to create indent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_css/src/parser_and_generator/source_builder.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c76aedc09ea2d58e8cec5aa35e2f713034511e4473b5a252348940ea04f6be6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use PrefixSource to create indent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_css/src/parser_and_generator/source_builder.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"090954f9c28fa96ae90eb976b7a5484568cf1240cfd0edec81ab0d18ddd9bf48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO 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":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9ef67b34751f03c24051de2f7d09147c7afd686c04aaedba08a0671a0fbd05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO err handler \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_copy/src/lib.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cc97a9ebb398d6a812b637b1cd7c413cad3ea1bfeccc73d7f09dbf3e4e2ac4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: support placeholder, such as [fullhash]\u3001[chunkhash] \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_banner/src/lib.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53283c5a726d30cf631c145e63c23ea170255a8dfff2b175cbf676f705ab78b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Use AsyncFnOnce \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_parallel/src/scope.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1b7e179f533478766f9dbe2b8364f07ae8d320b8332ea2b6fc1e8596f1fdef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For the current implementation, we don\u0027t track if 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":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faef6d0eae790406f84569711864a83dd0d90f53aa1ca2b8ce82c5423931748"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: need to map it to the original span? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_loader_swc/src/rsc_transforms/server_actions.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b91aab2e92deb30946983d0764a2caee423d6d6265fe08fb7f1156798c1d889"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: builtin-loader supports 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":"crates/rspack_loader_lightningcss/src/plugin.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa94fc71d2aacdda961e60f3dd630d3ea67abb762f3867d976cec2530e6a7769"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: De we need to implement Hash for \u0060context\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":"crates/rspack_javascript_compiler/src/ast.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4185f82a291cc22e54e41457031cdbb3401156dcfc0b7ef718c7ab436667db77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add stacker to avoid stack overflow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_javascript_compiler/src/compiler/parse.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0febfbc4971ef8487d47ab0fccf6ea374179582beff5373d381c0820c545e972"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: currently we don\u0027t have logic of compilation.usedModuleIds \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_ids/src/id_helpers.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1aa23458f9b2ed9bb9e9ac4451c2a0d6c002efaf7d35be1701235631e529a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: remove this field and hide stack, just use stack field. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_error/src/error.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"824f8bb7a4a39ae7daec43da4d0ac6e19307b327a0e2aad2d3341816b96ab021"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: replace Option\u003Cbool\u003E to bool. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_error/src/error.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bad050662b99c159688c3e62c42e3497715bb0537f578897a62f58d69426e1"}},{"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":"crates/rspack_error/src/displayer/renderer/graphical.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b164cae185c29bbc5e4e1e79de3103eb888f9596219ad9f4d404dc80dd0a86e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: caching https://github.com/webpack/webpack/blob/1f99ad6367f2b8a6ef17cce0e058f7a67fb7db18/lib/optimize/ConcatenatedModule.js#L663-L664"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a67488c10e910208e899d8864b193bbcfe0ec5dc418cadac4f38ca9e015d2e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace self.modules with indexmap or linkedhashset \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/concatenated_module.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"804c9eec9fc1351d569ecbb1bec13fe71a4930a162db0ea34abfca825ccdcce8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: nodejs resolver return path of context, sometimes is \u0027/a/b\u0027, sometimes is \u0027/a/b/\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":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a58b9c56cc26d2d3aadf567628dbb38cdff3e150ec4406a2e08655a6053845"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should respect fullySpecified resolve options \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd15d28d6dd8c91bec893fd5bbbc5880c2be976dc0e308cd4c409b75632b63ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should be a 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":"crates/rspack_core/src/init_fragment.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c3cbe62a79b997d92bf12d5208bcf7446df2831a605bb47473d79aef83c3da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add optimization bailout \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/normal_module.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"5732396217e9f7d79f5ddbe24fff7bcb75d1cfa216ba7bca2eb8cbed7b83c46c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: with contextScheme \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b2aaeabfff10226dfc9bfded7c332d5e24582756e80cbdf1a61ba14e03eb99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(from webpack) further optimize regexp, i.e., use ranges: (1|2|3|4|a) =\u003E [1-4a] \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/utils/compile_boolean_matcher.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"abeedb0e55bf090caab8f70452bf34907b49f8287ec7ae0bf0f518c66a69c7e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: 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":"crates/rspack_core/src/options/module.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"18516decadfa0703bc77d2b10ad9d54b647eb80fb12c6c4c7753d7cd4829b33a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: not use 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":"crates/rspack_core/src/options/resolve/clever_merge.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2862e79a0235ab63d36d5ebc3fd79ce9421bcd7135a588e73288fd4ae101f3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Here request can be used Atom \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30518961f2f9ef8a366497d0731717c78581cebcb753c1063afde0aa0bdbe5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO try move condition as connection field \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e602b37d2c00cd1672f38425f82ad97051c4ab39dd7616394cbb5683553f9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo remove it after module_graph_partial remove all of dependency_id_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":"crates/rspack_core/src/module_graph/mod.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50b4b7617310a85dbd74a7ead64944642c22fd91090082825393c13f3c91ac6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO merge package version 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":"crates/rspack_core/src/legacy_cache/persistent/snapshot/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2718afcd213f9ce0064d4b813efe1db4914e34b8d8e028876dffd06decaa5ae0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For now we only consider updated dependencies, do we need to consider added dependencies? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/incremental/mutations.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2151f372b3e360c6fd5b1a9a020ee576f83204e6b6154c734e4fd9be3e11fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: more branch \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/exports/referenced_export.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b7ad1ffd7d7283c80c634a496411f4865c64e1cc1452cc0f4acbe20c0d8590"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: 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":"crates/rspack_core/src/dependency/dependency_type.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"287e5ab73ed05714d4c92720370155850a1c8f58e4a8b8520d7c4dbf446a22b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: 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":"crates/rspack_core/src/dependency/dependency_type.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4892a0e524564fcee2ca0da610c21711f29a14a9407230753e6a68246414f82e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: clear the outdated cache entries in resolver, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compiler/mod.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc305cfa69f52b9c15c85f4544121bbed5d59278fc9e37f00a1a9f843f0b954e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe it\u0027s better to use external entries. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compiler/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f98d73914d31d707ee702b63688fea4b2059e8a2627d5e87c49fba0674a050c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move to MakeArtifact \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad70a5a9c962869ae758b0b1e04ef62450649e3a429525c45bbda1805f4a001"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should be removed in 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":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58d3638848131f891aad289109375aacdb474cc3c5c53079d2f416e81419d47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move out from compilation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60f20c658522e0f611d2a86964664fedf4b2cab36c8f795f5c4f111c1318413"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: source file name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cc8d4ce0bcc5b37d1dd2989aeced4744ffd89994bf1dd2275ec0280a650d78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move diagnostic collect to make \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/finish_modules/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"839dc33bb692b30213171141a9d7d0dba184a0d076d5c8d060d1242c813fa7de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO after hooks support using artifact as a parameter, consider merging make and finish_make. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"977f7adcc5662b255ceaa4c2c7d2caad2e05a0b0f3bab029d868edbb8ce6bfa8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use module graph with make artifact \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/context.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aee2320606b681dbfe3cdd38a3146715a6b53101c573bc908bdfdba33de09d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove it after incremental rebuild cover all stage \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/context.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88096fd3df911b5052c27b24e96ac7f17c64f3bf4009304973348b70234360a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: now only module/context dependency can put into resolve queue. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/process_dependencies.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c7024ce38c25597aac0946c8d0fa011d6151ae5cdee2b31f25e4ffaa62581d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should align webpack \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/process_dependencies.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ca178424c0241056b75ebab4c83d778540c0d5e19e771060cfa14d0ac3237f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO need implement more dependency \u0060resource_identifier()\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":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/process_dependencies.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d75c6b98b7c4490e63bbb28f67bd669e7174dc8b91ae551710b5706170e8f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move module_factory calculate to dependency factories \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/process_dependencies.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3e95f59de40e2900bce749d4530cc12e3de9f8a0f3f3708c2eedef0e3ff041"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO replace to .expect() after all modules are cacheable. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/fix_issuers.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc23b33e9b2c030e9140ef332ee7061972facbc384f1ebf55aee02ffd962ca0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: change to expect when persistent cache supports all 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":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/cutout/fix_issuers.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7ab9ff6354f30f709496b1a3bb12c83b5fa6892338c3d3fc983a8ce0b763e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: heuristic incremental updates are temporarily disabled. Keep 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":"crates/rspack_core/src/compilation/build_chunk_graph/mod.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f21fe108031b625b106eae218c6dc9e455021217597d25cc6159de40616f5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: full_hash_modules and dependent_hash_modules, we don\u0027t have now https://github.com/webpack/webpack/blob/1f99ad6367f2b8a6ef17cce0e058f7a67fb7db18/lib/ChunkGraph.js#L445-L462"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/chunk_graph/chunk_graph_chunk.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7505b6fbd6a34498b845b77f9524218abd7c368bdbaf74b4ebd1549a79690e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Delete it after all errors match the message specification \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/error.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"edae316dd64ea599c17c1f04ad0784be518e663051b5c84ef2447f683e56cb4b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: when set bool is 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":"crates/rspack_binding_api/src/raw_options/raw_split_chunks/raw_split_chunk_name.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb86bd63db00d8b09511d1d0cde58aa511ad30ed05aa4acf8f9e4026d680575"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pub 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":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15f42b76a3555a2c0cc576f4271772428db99398c6f886a46ad30f8c177e4a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO how should we handle wrong input ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/raw_builtins/raw_copy.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03412a13697993eb8633b0c5a61d776b56cc994a564d90da4cd00d60ae254e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tap compiler done hook will be better. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/plugins/js_loader/mod.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b39b7323f84d4570dbec801a5e2c2bfe068f9217d9f2b9d532865ac664e5443"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support read_dir options \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8995bf36b0e3993f811cbfa98672d1585d3b868d4ab81cd62b9d7f46b0d96882"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support read_file options \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f274f7a89d03b177b19192343f1358bcec65bfbf97007fbe0aaf3cf5656874d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: simplify the return 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":"crates/rspack_binding_api/src/fs_node/write.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"356b0b171910a75ba7ca8ba116bd5b2d06ee5bc0a76e2230726b8049f99ec722"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: enter variant. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_allocative_derive/src/derive_allocative.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fcc710f9a256ab2f3833d2538c304ebddd86164c405b972d9dd818cda739ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nga): figure out how to put this snippet in a member function of the visitor. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_allocative_derive/src/derive_allocative.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b982df864d46760cd1d9bbdb6acdc38237aaf45e72480889a7cac32627dbeff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deal with potential issue when node is both unique and not. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_allocative/src/flamegraph.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdbe3f6dabe1633f7340a8922682d56c32302b1e367484b39b8a10d0ad1d542"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: record some malloc overhead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_allocative/src/flamegraph.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4841659ee71c7bf46d4fbaed788874b4155be6387fd0eb2a7afc2fbc0027511"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nga): faster for primitive. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_allocative/src/impls/std/unsorted.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecc349a9ecfc0ab7e8698d470802a4bcde7489851747930ff1e452f29832191"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add bundler info plugin \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/builder_context.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"274e2532912c91ab2bee2338197ffb217c9bce8f95e9643b7068a175d2a3af69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add bundler info plugin \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/builder_context.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7b9e41daee258c3319745d06e81f9ec459c00e8b7755f9fbcd9ee86bd71ca0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support lazy compilation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/builder_context.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a312860d904b5360b4385975f3d23005008f5e1c66de6e75dd27f8d863a3f44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support lazy compilation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/builder_context.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9c379201a92c8d725585aadbcff0227bd188a31c0feaddeed38d95f8e46d07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support split chunks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/builder_context.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39739ea4f667f77a8f6aa8867de935da9f88fe0d0c33f2bc2a77556aa3e3d8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support performance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/builder_context.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c05334fcb37ea5251f99e76cfb478871f7101ed8bfedda0980d9518e5c016cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support performance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/builder_context.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea56fc61b1b4cdac16e61692804ddd682e9b85beeacbf419ab424e887f30ac15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: bundler info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"134192a9f760a3ae38f6023717ef6b26c77aa8e60e2628c275a2ac9f2927658b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: stats plugins \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2769a7441eff1295caea5d39209a7311e67d0a2bcf58664ac1d6c6b665d5ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: split chunks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3df505bf7dbf5e3e75cfbce0001e598be9ef3be604b5556db0b7be1ccbc946"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add lightning css \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":3714}}}],"partialFingerprints":{"codehealthFindingId/v1":"437ac83dd8abc81f64bf25a523bb9c6fd914ff8a35196542cf3477d284c93deb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: lazy compilation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/mod.rs"},"region":{"startLine":3771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b062d14e140c9bd8f0de66d485c0bb5c7e98ef54b0d8a647a9b8e3283c1ca7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace import value, should be \u0060exportName: _lib_extender__exportName imported_otherClass;\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":"crates/css-module-lexer/tests/composes.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"e213fd47bbdb01a848008f0e5a409ce0ac85e8b8f8171e357ae04992d0ee9cda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace import 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":"crates/css-module-lexer/tests/composes.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db85ac1e1bff25c9c4174bc29460d2030404044dee0e8f0424562c618ed8170"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should warning for otherClassName not found \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css-module-lexer/tests/scope.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"7024852b31b2bdf2ba85215bb1a7b26aad7985c06cc44325618c978df57234da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate selector, should warning for :local(body) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css-module-lexer/tests/scope.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c1646c59a70ac80b9dc2a91793c4dbdd09c1d92d877f252735c90f3c21819"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate selector, should warning for :local(.exportName1[href^=\u0022https\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":"crates/css-module-lexer/tests/scope.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9574a6aeb41083fff6e9e8785c6fadae270f6f97611076139e58a823a619d9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate selector, should warning for :local(.exportName1[target=\u0022_blank\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":"crates/css-module-lexer/tests/scope.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f52dcebc06efee08cd0a832bcb5db2ce3201348477f51214722402f209fb995"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate selector, should warning for :local(.exportName1[title=\u0022flower\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":"crates/css-module-lexer/tests/scope.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"b420ed0865ec5cc771e4242873a3397417e1f2cbb888f719a306cffe39f30e10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate selector, should warning for :local(.exportName1[type=\u0022text\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":"crates/css-module-lexer/tests/scope.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fc85f17e294fd483b817a9cd8a78b1f2e12601c168d1d193760fd2f3aed01e"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: the repository holds project manifests and neither \u0060README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33a5992d4bd6ac1ea4b853ae69753fcd7e0410099c58731c86be53325ba8c96"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060node_binding\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060crates/node_binding/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c4c564d46b7333e6c403399a79403c0b1beedc8a80df7f545b642427a28144"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060rspack\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages/rspack/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5404b4386a871d4ace9a46641cae1a69e76f9119675a79f09fb9d22e115f0ac6"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060rspack-browser\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages/rspack-browser/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-browser/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2058165f20b016fa928cdf66120cfb33be640a14c3710a2007bdaa55106dfcf"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060rspack-test-tools\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages/rspack-test-tools/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-test-tools/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd2718c037397f3ba38405b34eb6c34fefbadc1914ea10ee098346830e68270"}},{"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 \u0060packages/rspack-cli/package.json\u0060 makes this repository a deployable product (line 22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-cli/package.json"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"672b43c49adfdc52ec9da618acdd01daaa1c10dc2f7b920861cf99004c044595"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060expectExternalMappingURL\u0060 spells \u0060URL\u0060 where 20 names in the project spell it \u0060Url\u0060: 20 of 21 names in project monorepo spell the token \u0060Url\u0060 (20 of 21; unit: names in project monorepo containing \u0060Url\u0060). Peers: index.sourceUrl (tests/rspack-test/configCases/builtin-swc-loader/input-source-map-cheap-module/index.js:11); index.sourceUrl (tests/rspack-test/configCases/builtin-swc-loader/input-source-map-module/index.js:11); module.setIdToUrl (tests/rspack-test/configCases/inner-graph/issue-11678/module.js:1765); .pnp.throwImportNotDefined(packageJSONUrl) (tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs:9162); .pnp.throwInvalidSubpath(packageJSONUrl) (tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs:9169). Rename to \u0060expectExternalMappingUrl\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/css/source-map-export-types/index.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0025d9f12b569738550b13c8c1c6d63ae08dc30ee03497c3aee73299c1e1a60"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060moduleURL\u0060 spells \u0060URL\u0060 where 17 names in the project spell it \u0060Url\u0060: 17 of 18 names in project monorepo spell the token \u0060Url\u0060 (17 of 18; unit: names in project monorepo containing \u0060Url\u0060). Peers: BrowserHttpImportPluginOptions.dependencyUrl (packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts:24); BrowserHttpImportEsmPlugin.resolveWithUrlIssuer (packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts:106); BrowserHttpImportEsmPlugin.parameterize(requestUrl) (packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts:128); BrowserHttpImportEsmPlugin.toHttpUrl (packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts:245); middleware.getFullServerUrl (packages/rspack/src/builtin-plugin/lazy-compilation/middleware.ts:31). Rename to \u0060moduleUrl\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-test-tools/src/helper/node-case.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cae7ad8acf85ef7f17364b60a9dd58b1295ecc425b6da56c6d14cb10fae0d77"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022find the possible devServer config\u0022 repeats the code it sits on: 4 of its 5 words (find, dev, server, config) are already in \u0060const singleConfig =\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":"packages/rspack-cli/src/commands/preview.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6530176f703dda87f3c19f4aef9ce78992c33cfc80d5dc65315d5c85d1a8a0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set config paths\u0022 repeats the code it sits on: 3 of its 3 words (set, config, paths) are already in \u0060pathMap.set(resultConfig, configPaths);\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":"packages/rspack-cli/src/utils/loadConfig.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d51de9ebd3e73d8d13107e436aaf64114bd001bb6e19b9e67044a158bbbb7e2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022normalize options.env\u0022 repeats the code it sits on: 3 of its 3 words (normalize, options, env) are already in \u0060const env = Array.isArray(options.env) ? normalizeEnvToObject(options) : {};\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":"packages/rspack-cli/src/utils/options.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"738bfae983afddf8b8cbbcbbab0f2cfe3b1761f76bbe14a3e56d5200557b8a75"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022text/plain Content-Type is simple request header\u0022 repeats the code it sits on: 6 of its 7 words (text, plain, content, type, request, header) are already in \u0060xhr.setRequestHeader(\u0027Content-Type\u0027, \u0027text/plain\u0027);\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":"packages/rspack/hot/lazy-compilation-web.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba3c75fa8167e41bc654f2d3898878c25f31325da14739b2c6d9ef85a8ed9da"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Handle script tags with src attribute\u0022 repeats the code it sits on: 4 of its 5 words (script, tags, src, attribute) are already in \u0060if (tag.tagName === \u0027script\u0027 \u0026\u0026 typeof tag.attributes.src === \u0027string\u0027)\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":"packages/rspack/src/builtin-plugin/SubresourceIntegrityPlugin.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca688fdbafa6c270a45c5fb36c90bd7afe01b019a48ab3c6e5e24d8b26f796d7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022start an chrome async event\u0022 repeats the code it sits on: 4 of its 4 words (start, chrome, async, event) are already in \u0060static startAsync(events: PartialChromeEvent)\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":"packages/rspack/src/trace/index.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c44943b249af26338651570470450aed2e975c311911bec2a90652202859ea"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022= first.base \u002B second.byProperty\u0022 repeats the code it sits on: 4 of its 4 words (first, base, second, property) are already in \u0060return {\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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"847ae85e5db43573c88ae147e1c8fd6789db91eafc69b2a55648c5323161a4d6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022get info about files\u0022 repeats the code it sits on: 3 of its 3 words (get, info, files) are already in \u0060getFileTimeInfoEntries?(): TimeInfoEntries;\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":"packages/rspack/src/util/fs.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"af43f466c761fc1ee2daedbdae2dcfca0a797d5fc80f72045eff216aeca7df73"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022update js file\u0022 repeats the code it sits on: 3 of its 3 words (update, js, file) are already in \u0060fileAction.updateFile(\u0027src/index.js\u0027, (content) =\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/e2e/cases/hooks/asset-emitted/index.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4925ee1157115634fae41da3e8d9d2dfac75ac3cb7fb752ee4301ed2fb8604fd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022update js file\u0022 repeats the code it sits on: 3 of its 3 words (update, js, file) are already in \u0060fileAction.updateFile(\u0027src/index.js\u0027, () =\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/e2e/cases/hooks/asset-emitted/index.test.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a758f6850abfe9146c4f5416136668442613b7571f21324e9c3ce13f744f51"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022require a harmony module\u0022 repeats the code it sits on: 3 of its 3 words (require, harmony, module) are already in \u0060var module = require(\u0022./harmony\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/rspack-test/exampleCases/harmony-interop/example2.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ffb956b4d07348ec524803553da60d33e4df6ee239b9dd97da810ddb35c918"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022CHAT with shared worker ///\u0022 repeats the code it sits on: 3 of its 3 words (chat, shared, worker) are already in \u0060const chatWorker = new SharedWorker(\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/rspack-test/exampleCases/module-worker/example.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94b9d950a1c3e17fecb2ed4cc0b47025aeaa5a565473002883120480d9cbe5c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022CHAT with shared worker ///\u0022 repeats the code it sits on: 3 of its 3 words (chat, shared, worker) are already in \u0060const chatWorker = new SharedWorker(\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/rspack-test/exampleCases/worker/example.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"715affc876ad421f059fd60cafc3b1a829e40f3628699700e1944edb764c6b9e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 34 comments in this file only repeat the code they sit on (lines 800, 804, 814, 841, 859, 871, 1037, 1043, 1050, 1295, 1303, 1365, 1466, 1483, 1496, 1500, 1591, 1682, 1778, 1784, 1787, 1790, 1793, 1796, 1799, 1803, 1934, 1944, 1947, 1961, 2024, 2090, 2111, 2223), for example \u0022Base group name\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/rspack-test/normalCases/parsing/evaluate-binary/deep2.js"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3648f9655a7fc41b9a61390ea2627810cb2799dd51f391f97e580c6d0fb25ba"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 4 of 111 project(s) overshoot their size bounds, lowering Project Cohesion to 9.3/10. The most over is \u0060crates/rspack_core\u0060 (64149 LoC, 770 module-visible types across 67 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":"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":"0ed8cb53db5affc81b5b096033dd243ef51fd3b2b923161e8657b9fc8b297de7"},"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":"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":"f8e47c1f152fef622c922d1484687b257c63b1a2443c76fa0f45dff11a9ee733"},"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":"2b933f1feaf0f5bd70ebb556902980cc5df87cc2e5a3350cb1475a11d0337bae"},"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":"094ffa2682f5bcd8b4fe0b505010e58ac8886216dc9005b9098be8dcec86a84e"},"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":"4f32e8f3fbf7570a6be9670d21e5c6b43cdac618ba5bf8a556a1c427f087797e"},"taxa":[{"id":"CWE-829","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":"6ee5678153b27cd70b4a217d52789fd97608a58ba0fd947a11b5e7064f0a26bc"},"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":"f6dd45818d15f682b7c8c67ca88d5eab422145c66422093630f13da38c02ae04"},"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":"5c34d70d70174ed06cd6306f3dce0d28b82ba915468d9595f8b22adef1e8973d"},"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":"b037499eba9b30bb712df068ddda498508de2c0b914f146dd10c5a43b523e6e3"},"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":"3addb7d0504a6219d0cfb095b3cdc08e9c4d55c0a3df117a943afdb0ed74b8eb"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"754241630c030c19ec8a19ed238d05d63b2f91e04a5976c6b1e00aa8b8ac9963"},"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":"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":"7da7fd06db3db8354e8b0b6ee20498be55089c43641e0641a51936a762fc1679"},"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":"f1b966c70d2e5f6ab697ac6d268d54938c60e802d8ea58ea6ff9cb7e10a35f70"},"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":"fd34071f0a37397b22950926e6e7d533f19a1ab2e35c80a3ec230eef7195ce4c"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"952986f8801f6d7140851ba27c48be534992ad98416dc517cb8068790dc9b6c7"},"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":"3fd2ee90eb0e71b25b16742ee3acc42cb725ef1be97a190851650fadf04f702d"},"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":"9a6aaaf60845555f596a6f6240126d17e67a94b82b0d5730c59848bc402a1b2c"},"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":"441dbf13a739fc0573ea1213c6d2fabbb9db9f34fa36cbb7d496c2a7fdf956ef"},"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":"ffdca624b78cf307d79ea970ac2c8525de0dcbaa098daf01533119ea62565013"},"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":"b93fda1664d33b0c3fff6ec9b38ba5a394c853a96f9078ccfd37991e729a9e82"},"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":"002b99df855dec0c971a743ebdf610ba9b6c6e0330e2e40ee832c70ce902ab35"},"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":"ef58e44ac31904bd81359d63903140a301436deba2e9c979de37f27f165ae7e5"},"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":"9e98119aa6fe4303c4a11c82a9213ec29cd2246765397bbd7df93a2ac9ed69ea"},"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":"3ed2f6c76d02aee26939e5044cee93790021500325a041f306067076a652cb09"},"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":"29992de9f9e7e60de6a1ca2151d190d6357796fa6e2b9993a766edf6d11b427a"},"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":"6346e20d597c8b6b154f4295ed59ede95286206f55af7c4623b1f066b33952d0"},"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":"da792a5f792874956f535c15a9d1d82dda0d19d0923172308e62b10125d36746"},"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":"53057593d099f692f84c4abc48a071bf9c7d88fa0f8ad408742b11e2fcbdd24a"},"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":"c93b2e1e6fc047423f5d74338ab6cee05865fc46e47be12ba628f5c561e21448"},"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":"6c2b962324bf1ad92232f5ca04192fadd4875cc01492e87e5b5fe2aa872d56bc"},"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":"7cac4e98ffd8086ad24985938464add0ec1c364a71794016e60508aaca817b6d"},"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":"7b3f5367f0c474ccb8cf2f5c80eb4082907401409d4a8db8678f7723b10f5498"},"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":"059f36809c57413c76dbf4fdd41552f401c2588a683ed3a6ace9d75e13d7da25"},"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":"2f41faf26c2755d8fc777dc3680232c47a88a5a3a2f2b353b27d967fa9edf741"},"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":"8af93b54d7b6d09176d9c9016e65470b9e3497c2e30cd6af0b8b0a89230292a4"},"taxa":[{"id":"CWE-829","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":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"taxa":[{"id":"CWE-829","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":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"taxa":[{"id":"CWE-829","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":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"taxa":[{"id":"CWE-829","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":"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":"4f33b05e3adb6e8210b5c970211598c1995eabaf16599ad8fdd64fd3403693f1"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","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":"fe9e61a7b3031d621489d857796f5455ea01b6b18f48e95d7c06036e39b54461"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","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":"94cc3ba8ed37d222e76a52c7c77956a4e2d3540f90896c3b306c973862eff053"},"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":"60f2a62a5705ab4b6e4482b7c9e462abff3abf0144029666f2678171fdb9bd84"},"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":"cb44b638ce10d7e4af9d4724907e4bb8020c496264d7e09e3429cb185212cca9"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8992e06d38e593e9683791f9f678292375da8214ab3d7ed50dc8e6775541e0f5"},"properties":{"dependency":{"package":"brace-expansion","version":"2.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"121df3faaedc3564d5f571d18fec7036cd088794592c87b0bea54fff2d409bd4"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8cebd965383fbf6ec5aa075ac5961d71615ca803fb60541206693fa7a1c8ca18"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.5","advisory":"[GHSA redacted]","aliases":["[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]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"685cba4514570b53bf9bc85812fa54c07fec7b3f62fc67d4712c038e9ec2e605"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74544f0ae015218092291d7247f32133cfb63f4982f3161e4a20e7f4b9d838a4"},"properties":{"dependency":{"package":"probe-image-size","version":"7.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0bf997523edcbfd004b0e48079d2d03fc36b5b8058c165442d7b3299bf52fe16"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7531eb5fa8b12bbac40121f69038f913c6ef844555a157b58db0a6ce500ba8f1"},"properties":{"dependency":{"package":"undici","version":"6.27.0","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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"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":"399b641a1002e75c8bff8b9c396c66ba0c165468034e5af1632a4a0b59ea9a3e"},"properties":{"dependency":{"package":"ansi_term","version":"0.12.1","advisory":"RUSTSEC-2021-0139","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":"9d7e2f5e4e133844171b9412d83e460349b527553e21e4eb5d4f1e038ed6831f"},"properties":{"dependency":{"package":"atomic-polyfill","version":"1.0.3","advisory":"RUSTSEC-2023-0089","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":"2.0.1","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":"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":"cd08558613b1501123823d3d37fc3f1efb021ff78777c7e19d8a90d57f722e0c"},"properties":{"dependency":{"package":"difference","version":"2.0.0","advisory":"RUSTSEC-2020-0095","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":"e000cd327a1d3623c99367a141b26c088a421b6fc7cbb00369201f20db60df99"},"properties":{"dependency":{"package":"json","version":"0.12.4","advisory":"RUSTSEC-2022-0081","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":"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":"1916856307d6d77eb7c2c2ad00a860759d15ef7f6f635ef50a6cc2cbe0531cb5"},"properties":{"dependency":{"package":"rkyv","version":"0.7.45","advisory":"RUSTSEC-2026-0001","aliases":["RUSTSEC-2026-0235"],"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":"b50ee90a4a3b784f8c85f8cbe407c33c468aca8f701844730ea3bb443b35f3f3"},"properties":{"dependency":{"package":"json","version":"0.12.4","advisory":"RUSTSEC-2022-0081","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":"c5bf810b2570234a296274098e68a135e1f2ec29307bd597eac237042c5bfc86"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.29","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":"d0eaab2d1c07f27c088317b664148a6c7ee0a34e99cb7f3fb354755c7d4d4654"},"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":"318aaba612dbd82d0f3bfe80b9d97dfb10f4b886db807c3b7e615bcf0e4cf97a"},"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":"ea7e5354ab7cfc90dd177dde60810f39ea3e10b3fe5c807ca0b2b906b7004ac5"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"scripts/release/version.mjs","line":2}}}},{"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":"cb9aceee4a992fe49bbde040169a8413df868cf0d164f834737877cd7b6cca0b"},"properties":{"dependency":{"package":"minimatch","version":"10.2.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c17cb16957ad3279855f885534502714cb43b7a032f569d531be274bd6c7f22b"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b87b6494a671427e7c27b6404760b1f45f9acd62e070f99912b9d4fbcbce18f"},"properties":{"dependency":{"package":"pbkdf2","version":"3.1.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"932a3bfecc4fdb553659a83b676fe51d69a354f33acdb515911e099d90c2a373"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"6.1.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a57eab2125a83bac1a037585c1deae98907ba83f93aa61c13b5779f77ed4027"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"7.1.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fa903053a3f312606416859cb67a9d184205be1a801337492ae8f642ebf9203"},"properties":{"dependency":{"package":"qs","version":"6.15.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a861b1ab2fd6ac5a0cbbd2d1eaeca38914dcada77f7a5d62bbdd015efb9e974e"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27d974ee3fd5dcbd0dc61a8a77f97951971d209729c9538c070e3cb1baa1af25"},"properties":{"dependency":{"package":"elliptic","version":"6.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a43e43ed02068a9ff6803259f969b012419dde3e1c98260beec85dac1e857b5f"},"properties":{"dependency":{"package":"serialize-javascript","version":"7.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","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":"7eee5b6b253b48ea6775549295705aff4170c3b661559844f9cc74b5a8381963"}},{"ruleId":"D31","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":"0d8b5046a110c02329c85059de9571dd90a0161b4ff0a79d3867748895db2a8e"},"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":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 53 of 863 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (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; 863 of the 1556 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: crates/rspack/src/builder/devtool.rs, crates/rspack_storage/src/filesystem/db/mod.rs, crates/rspack_storage/src/filesystem/db/bucket/mod.rs, crates/rspack_plugin_size_limits/src/lib.rs, crates/rspack_core/src/compilation/build_module_graph/module_executor/module_tracker.rs, crates/rspack_storage/src/filesystem/db/transaction/mod.rs, crates/rspack_storage/src/filesystem/scope_fs.rs, crates/rspack_cacheable/src/with/as_map.rs (and 45 more). 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":"crates/rspack/src/builder/devtool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13347cdcf40a6bfbec6010d59a26d18c6c85a153cdcbdb48c282e8cb5d574259"}},{"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":"crates/rspack_storage/src/filesystem/db/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f4f791b5774cbcf5aebad2ea3fd39a0e2cd495c8c214c428d52c7fb5148568"}},{"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":"crates/rspack_storage/src/filesystem/db/bucket/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99dfd8a7a8fad82f0189b6f9ae58055b471afd37d2e0e37fe9088ffab6a941a"}},{"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":"crates/rspack_plugin_size_limits/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38d3663cd29a4350060bc98811d84ae20015a9f466932e79000c59c7065d2af"}},{"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":"crates/rspack_core/src/compilation/build_module_graph/module_executor/module_tracker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcd3ab830b79559709c4f3d4c0a467f19eb4db1cc75695c2d21ff1f1926ab96"}},{"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":"crates/rspack_storage/src/filesystem/db/transaction/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea919c9786c76e1af0b66d242ad83979a206c2ea761cc6f8c2456f46e13253d7"}},{"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":"crates/rspack_storage/src/filesystem/scope_fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"015a5329e6acab8e24d86e8637bc059f1fc6cdce2ee6d5cfdcecc594af30ecb7"}},{"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":"crates/rspack_cacheable/src/with/as_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8333edfa7d32459fba8926879caec086fbee0da225395ed98adebdf7159d2a8b"}},{"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":"crates/rspack_cacheable/src/utils/portable_string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e61ee4fc087870c92f2cd574c433f1b3fe41d526f82a26131f65dc18612997"}},{"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":"crates/rspack_cacheable_macros/src/cacheable_dyn/impl_trait.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc71592a994c0a4fcd679abd88681f3379923d286adf2e3fb1f055bc6017227"}},{"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":"crates/rspack_cacheable/src/dyn/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5281d1848587212a34366891d5ba882c3ed82ba0ffa6270d0c7e98c8136dc7"}},{"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":"crates/rspack_storage/src/filesystem/db/transaction/lock/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8feace996c257a782fcf00aa5825f6704bdeb3ca5977f6299dac9eb156f63a0e"}},{"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":"crates/rspack_storage/src/filesystem/db/bucket/pack/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35367fc687457ee1ca0cf6999ac001fc3ee330459e470066648dca6ad0ed4af"}},{"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":"crates/rspack_storage/src/filesystem/db/bucket/meta.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b607e58117bd69e11664c7e7acaca5503ddb158152ff345981ed72e7961393"}},{"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":"crates/rspack_cacheable/src/with/as_vec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31d33550c65b44928efe15896cc5c99d1a184026c62e975bfdaab61d0c8eff1"}},{"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":"crates/rspack_cacheable/src/with/as_inner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfc611f6fa703087c392c9b936b8697d5439d3249b8b131be226d6cdfcbdb46"}},{"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":"crates/rspack_binding_api/src/raw_options/raw_builtins/raw_dll.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2471658f68c38c50e3fe83323ac02772abac7048bfaba049cd5d131bf502ca49"}},{"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":"crates/rspack_binding_api/src/virtual_modules/trie_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f402d0763bd2db72a3041450efb554729d08837f5f8307c1be867063667f42"}},{"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":"crates/rspack_napi/src/callback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"708d75c82bda2e0459a1adb2dcd5c4454fc4c5745da6eae869bbe5c88659397b"}},{"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":"crates/rspack_plugin_dll/src/dll_reference/delegated_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b863989e15991ba46d349bade02856473d516d6a43368736b4105981b69714d"}},{"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":"crates/rspack_binding_api/src/virtual_modules/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a12a837143622c6fa9ec0ed7cfd1dac591d80313610502d077a3fe060ba4c6"}},{"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":"crates/rspack_plugin_mf/src/manifest/data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e57d0f22685e5263242ab4d0f407cf425aebedaf354f9b50addf446e1a6e12b"}},{"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":"crates/rspack_napi_macros/src/tagged_union.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2afd97ba776256f0c7803fa2c1008f0e0c13c9bfe3b2af05295e9dbdc3aeda2"}},{"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":"crates/rspack_ids/src/hashed_module_ids_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d34b58a1b2553259f69ac8e4f4c70a404bddd1a259f657abc242b8cda55359"}},{"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":"packages/rspack/src/sharing/SharedContainerPlugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5f2eaa389cd6aba660d4f5505ec3c3b517bcd9ee00e4ff5ca9f7fd65e1c7e2"}},{"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":"crates/rspack_core/src/options/resolve/alias_value_cacheable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea433ac9a3ef95ac3138585a28c69f9cfb060e2309a00ac45ab2405ac9d4d48d"}},{"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":"crates/rspack_core/src/utils/incremental_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54015ad4b9bf4baea42eb5a18bdd44a6d53d019d5215d73f65996ccc7e6a80e"}},{"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":"crates/rspack_cacheable_macros/src/cacheable_dyn/impl_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9c91013966d8f206da2c10ee65eb1de5031a3bdd116bb5dc2ddbdf8e79fcb4"}},{"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":"crates/rspack_cacheable/src/utils/owned_or_ref.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f32ca4cefb74785147afec1a9f4f1a41d8621d33c788ec1e5c607759a6612c5"}},{"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":"crates/rspack_collections/src/identifier.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b1186323ada04a787fcf5868773cf18ec0b86c9769172fcc22a2275534e016"}},{"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":"crates/rspack_cacheable_macros/src/cacheable/impl_with.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18745c99d3a1a402a74ee960b4e7739465aaab41c8625c4cb8853e4d7944404d"}},{"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":"crates/rspack_storage/src/filesystem/db/transaction/lock/commit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"627d540cbbde07622386145e94162f6830ebfad5b8d51d1df5901cc421080252"}},{"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":"crates/rspack_core/src/compilation/build_module_graph/module_executor/overwrite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5510fb44c31cd871c283947c105ff935a0dee1b71eb3b7f6cc67f57f8755c371"}},{"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":"crates/rspack_plugin_mf/src/sharing/shared_container_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4bedc5e555038cf7dced2b0ba10a161fa7ca9f50cc4004c3aaf7cc980aa20b"}},{"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":"crates/rspack_storage/src/filesystem/db/bucket/index/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4b5feb58d32a822a3420d4be6f09108d471d714d6919511fd2171dd9d4b69d"}},{"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":"crates/rspack_plugin_javascript/src/parser_plugin/provide_plugin/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae206458399ac02902583787dee7ff5fb6de9420967f327c89a99a733f2a7dc3"}},{"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":"crates/rspack_storage/src/filesystem/db/bucket/index/bloom_filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee2135ec0b76ce4f07e507ed47dc35951cad2ca6334c66ee64790b21c8dc3c0"}},{"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":"crates/rspack_cacheable_macros/src/cacheable/impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b750912ae209de68476516e85ed28629c4b33a37436b77bbfd0ee3f55832fc4d"}},{"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":"crates/rspack_tools/src/compare/occasion/meta.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60f8b144d5f1af5f9278eb26b7b29b1a4dff19c07badb56a746907bebaf7e07"}},{"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":"crates/rspack_plugin_mf/src/sharing/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6b60352149ad2dfabe132bf21fc211e25a78c86bc939903cb5593a095df80d"}},{"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":"crates/swc_plugin_import/src/legacy_case.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0672bfa7a8acbe79765b127814221cec2dc739adda83cd98ec14855856a1fb6f"}},{"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":"crates/rspack_storage/src/filesystem/task_queue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6633c5e5f3e05c6f5cda663c19aedaf5ea8ab7f003499b497d6f0d824a56c4e"}},{"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":"crates/rspack_cacheable/src/with/custom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9389b1a7a736d5e8af74259d4f05fa135382d1827e72712fe01ea9fbcccc90"}},{"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":"crates/rspack_storage/src/filesystem/db/bucket/pack/id_alloc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e478cde14431cac30fab6c721b3b7509e414a75905ed1266f54c68e2636924"}},{"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":"crates/rspack_cacheable/src/with/as_preset/serde_json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ed7af9d7592de05505ef8f7f2fb0e63937324e97d646ebef130567baa3b2f9"}},{"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":"crates/rspack_core/src/cache/build_dependencies/visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28445f3abf086b9c248fadfa724be22052fe2805fc4db5509b22065aff1aa0b7"}},{"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":"crates/rspack_plugin_dll/src/dll_reference/dll_reference_agency_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec89d29ba6e54a539daefc76c92eca16a84dd0d02b700cd5760c4b75223998e7"}},{"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":"crates/rspack_storage/src/memory/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc85534e589fc084cd277cb49123064ad49f2ed39b58d48c19713ad3eb58b46"}},{"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":"crates/rspack_storage/src/filesystem/db/bucket/pack/generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"678f8634ab666c07a413d7510de56a847991747bbfa893a27705bd66f984f9a0"}},{"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":"crates/rspack_binding_builder_macros/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f447e1df7d38af2864ec85c65176fe8eeb4fd98c426130e6d3377e47ee893fc8"}},{"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":"crates/rspack_parallel/src/iterator_consumer/try_future.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3647254f57fc0944b7e33f6abf51efa3e8d18358989cd2d890f308551d3e8e23"}},{"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":"crates/rspack_cacheable/src/with/as_ref_str.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7000c86996cbc31667b9a148ec4cc8c111d2fef526eca1185858b5e86beaccef"}},{"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":"crates/rspack_plugin_split_chunks/src/plugin/max_request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9200a128eeee75ad5d98f8086d96603da2f1ecaed2a5d9246a57ff6f5b69a3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: context_module.rs, external_module.rs, normal_module.rs, raw_module.rs, self_module.rs, runtime_module.rs, delegated_module.rs, css_module.rs, module.rs, container_entry_module.rs, fallback_module.rs, remote_module.rs, consume_shared_module.rs, provide_shared_module.rs: 14 files \u2014 \u0060crates/rspack_core/src/context_module.rs\u0060, \u0060crates/rspack_core/src/external_module.rs\u0060, \u0060crates/rspack_core/src/normal_module.rs\u0060, \u0060crates/rspack_core/src/raw_module.rs\u0060, \u0060crates/rspack_core/src/self_module.rs\u0060, \u0060crates/rspack_macros/src/runtime_module.rs\u0060, \u0060crates/rspack_plugin_dll/src/dll_reference/delegated_module.rs\u0060, \u0060crates/rspack_plugin_extract_css/src/css_module.rs\u0060, \u0060crates/rspack_plugin_lazy_compilation/src/module.rs\u0060, \u0060crates/rspack_plugin_mf/src/container/container_entry_module.rs\u0060, \u0060crates/rspack_plugin_mf/src/container/fallback_module.rs\u0060, \u0060crates/rspack_plugin_mf/src/container/remote_module.rs\u0060, \u0060crates/rspack_plugin_mf/src/sharing/consume_shared_module.rs\u0060, \u0060crates/rspack_plugin_mf/src/sharing/provide_shared_module.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 91 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/context_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56129a41b24342c5150d2b9640db22dbb181f6931fa60c6be2b4528bff543a67"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: binding.d.ts \u2192 rspack.wasi-browser.js, async_dependency_block.rs, chunk.rs, chunk_graph.rs, entries.rs, dependency.rs, context.rs, mod.rs, raw_banner.rs, raw_copy.rs, raw_devtool.rs, mod.rs, raw_external.rs, raw_optimization.rs, raw_output.rs, mod.rs, compiler_options.rs, mod.rs, externals.rs, struct.rs, lib.rs, cache_group.rs: \u0060crates/node_binding/binding.d.ts\u0060 changes together with 22 other files \u2014 \u0060crates/node_binding/rspack.wasi-browser.js\u0060, \u0060crates/rspack_binding_api/src/async_dependency_block.rs\u0060, \u0060crates/rspack_binding_api/src/chunk.rs\u0060, \u0060crates/rspack_binding_api/src/chunk_graph.rs\u0060, \u0060crates/rspack_binding_api/src/compilation/entries.rs\u0060, \u0060crates/rspack_binding_api/src/dependency.rs\u0060, \u0060crates/rspack_binding_api/src/plugins/js_loader/context.rs\u0060, \u0060crates/rspack_binding_api/src/raw_options/mod.rs\u0060, \u0060crates/rspack_binding_api/src/raw_options/raw_builtins/raw_banner.rs\u0060, \u0060crates/rspack_binding_api/src/raw_options/raw_builtins/raw_copy.rs\u0060, \u0060crates/rspack_binding_api/src/raw_options/raw_devtool.rs\u0060, \u0060crates/rspack_binding_api/src/raw_options/raw_experiments/mod.rs\u0060, \u0060crates/rspack_binding_api/src/raw_options/raw_external.rs\u0060, \u0060crates/rspack_binding_api/src/raw_options/raw_optimization.rs\u0060, \u0060crates/rspack_binding_api/src/raw_options/raw_output.rs\u0060, \u0060crates/rspack_binding_api/src/raw_options/raw_split_chunks/mod.rs\u0060, \u0060crates/rspack_core/src/options/compiler_options.rs\u0060, \u0060crates/rspack_core/src/options/experiments/mod.rs\u0060, \u0060crates/rspack_core/src/options/externals.rs\u0060, \u0060crates/rspack_core/src/stats/struct.rs\u0060, \u0060crates/rspack_napi/src/lib.rs\u0060, \u0060crates/rspack_plugin_split_chunks/src/options/cache_group.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 22 separate couplings, not 22 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 22."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/binding.d.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc273a31861fe7ea5420c1bd327ea9675dd423db71016dbbccd240f044ce3b79"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: eval_dev_tool_module_plugin.rs \u2194 eval_source_map_dev_tool_plugin.rs: \u0060crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs\u0060 and \u0060crates/rspack_plugin_devtool/src/eval_source_map_dev_tool_plugin.rs\u0060 change together 79% of the time (11 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 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 11 shared commits counted here, the most recent 3 are \u0060c878703d\u0060 perf: improve get chunk modules (#11579); \u006062c8e9e7\u0060 feat: support using declaration (#11395); \u0060096bf260\u0060 fix: render namespace template in devtool plugins (#10448) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_devtool/src/eval_dev_tool_module_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dcf3ca1abce4a6d7fcc111240c1d73a03f54c2426217d2406f84f3f7d22454"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: add.rs, process_dependencies.rs, entry.rs: 3 files \u2014 \u0060crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/add.rs\u0060, \u0060crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/process_dependencies.rs\u0060, \u0060crates/rspack_core/src/compilation/build_module_graph/module_executor/entry.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/add.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"974934237561ed050c41df952fc96161a39547f57b9e0b3b561bc282ce070c0a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: esm_export_imported_specifier_dependency.rs \u2192 common_js_self_reference_dependency.rs, esm_compatibility_dependency.rs, esm_export_expression_dependency.rs, esm_export_specifier_dependency.rs: \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs\u0060 changes together with 4 other files \u2014 \u0060crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_self_reference_dependency.rs\u0060, \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_compatibility_dependency.rs\u0060, \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_export_expression_dependency.rs\u0060, \u0060crates/rspack_plugin_javascript/src/dependency/esm/esm_export_specifier_dependency.rs\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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_imported_specifier_dependency.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15ad6fafb5369dcefb9e05572ed319077d0fd6b71145c7791fbc90844d5452c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: node.rs \u2194 write.rs: \u0060crates/rspack_binding_api/src/fs_node/node.rs\u0060 and \u0060crates/rspack_fs/src/write.rs\u0060 change together 73% of the time (8 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 8 shared commits counted here, the most recent 3 are \u006096e2777d\u0060 refactor: simplify file system code (#8654) (at that commit the file was still \u0060crates/rspack_fs_node/src/node.rs\u0060); \u0060b77d7de1\u0060 refactor: rspack_fs use \u0060Utf8Path\u0060 and \u0060FileMetadata\u0060 (#8366) (at that commit the files were still \u0060crates/rspack_fs_node/src/node.rs\u0060 and \u0060crates/rspack_fs/src/async.rs\u0060); \u006026801202\u0060 feat: add read API to output file system (#8274) (at that commit the files were still \u0060crates/rspack_fs_node/src/node.rs\u0060 and \u0060crates/rspack_fs/src/async.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/fs_node/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"270195dbfa78eac074361974cb7e03f96d6362ca7e4d655bd2420b003f9954b7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: common_js_require_context_dependency.rs \u2194 import_context_dependency.rs: \u0060crates/rspack_plugin_javascript/src/dependency/context/common_js_require_context_dependency.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/dependency/context/import_context_dependency.rs\u0060 change together 73% of the time (8 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 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 8 shared commits counted here, the most recent 3 are \u00602e3a54eb\u0060 fix: empty references export for cjs and dynamic import tree shaking \u2026; \u0060c0a82b3a\u0060 feat: amd context require (#9495); \u00601d125ac4\u0060 refactor: use \u0060RealDependencyLocation\u0060 instead of \u0060range\u0060 in dependen\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/dependency/context/common_js_require_context_dependency.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c23e15963fabbaef7b1b51973c2f36c78f4c888d6b14e48107ff0dee00835c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: IgnorePlugin.ts, RsdoctorPlugin.ts, SubresourceIntegrityPlugin.ts, options.ts: 4 files \u2014 \u0060packages/rspack/src/builtin-plugin/IgnorePlugin.ts\u0060, \u0060packages/rspack/src/builtin-plugin/RsdoctorPlugin.ts\u0060, \u0060packages/rspack/src/builtin-plugin/SubresourceIntegrityPlugin.ts\u0060, \u0060packages/rspack/src/builtin-plugin/html-plugin/options.ts\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 6 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/builtin-plugin/IgnorePlugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbc390562e1c70a9ca8ba136f98213d722137e7ab2f65212048227896569321"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 defaults.ts: \u0060crates/rspack_binding_api/src/raw_options/raw_experiments/mod.rs\u0060 and \u0060packages/rspack/src/config/defaults.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) 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 \u00601ea0d42a\u0060 feat(cache): add fine-grained new cache options (#15261); \u0060b67cad2e\u0060 feat!: remove \u0060experiments.lazyBarrel\u0060 (#12724); \u0060ffafc655\u0060 feat!: remove \u0060experiments.topLevelAwait\u0060 (#12722) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/raw_experiments/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f5ef6d585e1a2966939961df29b01b9645bbee7280e3d11c9232b45a9f3930"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 normalization.ts: \u0060crates/rspack_binding_api/src/raw_options/raw_experiments/mod.rs\u0060 and \u0060packages/rspack/src/config/normalization.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) 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 \u00601ea0d42a\u0060 feat(cache): add fine-grained new cache options (#15261); \u0060b67cad2e\u0060 feat!: remove \u0060experiments.lazyBarrel\u0060 (#12724); \u0060ffafc655\u0060 feat!: remove \u0060experiments.topLevelAwait\u0060 (#12722) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/raw_experiments/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c518f4ee3b56980bb0c633746bedd9fbb9297e25163abfada105f451dd52d3d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: clever_merge.rs \u2194 resolver_impl.rs: \u0060crates/rspack_core/src/options/resolve/clever_merge.rs\u0060 and \u0060crates/rspack_core/src/resolver/resolver_impl.rs\u0060 change together 69% of the time (9 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) 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 9 shared commits counted here, the most recent 3 are \u0060f03bd2f4\u0060 refactor: remove redundant clones and unused Clone derives (#15519); \u006072d1b7fb\u0060 feat(pnp)!: drop multi yarn pnp project resolving (#13389); \u0060fb8c2cc1\u0060 feat: Add \u0060pnp_manifest\u0060 option to resolver (#12417) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/options/resolve/clever_merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1340c90f0505241054af8f64384939d3b1f41e5d5e3ee1738d67acf3090ef7f4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: raw_resolve.rs \u2194 clever_merge.rs: \u0060crates/rspack_binding_api/src/options/raw_resolve.rs\u0060 and \u0060crates/rspack_core/src/options/resolve/clever_merge.rs\u0060 change together 69% of the time (9 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) 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 9 shared commits counted here, the most recent 3 are \u006072d1b7fb\u0060 feat(pnp)!: drop multi yarn pnp project resolving (#13389); \u0060fb8c2cc1\u0060 feat: Add \u0060pnp_manifest\u0060 option to resolver (#12417); \u006089c37fbf\u0060 fix: buildDependencies skip resolve nodejs builtin module (#11256) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/options/raw_resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcb93952d42de8a5e1767a922408af7ff84cf68bf3baf9029a4ee8738a6fcc8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: index.ts \u2194 worker.ts: \u0060packages/rspack/src/loader-runner/index.ts\u0060 and \u0060packages/rspack/src/loader-runner/worker.ts\u0060 change together 69% of the time (9 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) 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 9 shared commits counted here, the most recent 3 are \u0060858fd43f\u0060 feat(loader): support buildInfo custom fields in parallel loaders (#1\u2026; \u00608e0da07e\u0060 fix: preserve diagnostics returned by importModule (#15496); \u00602856c504\u0060 feat(javascript): add JavascriptModulesPlugin.getChunkFilenameTemplat\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bbe2cb00bed89dc91da91280e0a7ecb3693b6f996c145abd1089c57cb7a204"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: raw_html.rs \u2194 plugin.rs: \u0060crates/rspack_binding_api/src/raw_options/raw_builtins/raw_html.rs\u0060 and \u0060crates/rspack_plugin_html/src/plugin.rs\u0060 change together 69% of the time (9 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) 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 9 shared commits counted here, the most recent 3 are \u00605eac88c0\u0060 feat!: remove sri option of HtmlRspackPlugin (#12651); \u0060972c005f\u0060 fix(html): not to override plugin options when using multiple instanc\u2026 (at that commit the file was still \u0060crates/node_binding/src/raw_options/raw_builtins/raw_html.rs\u0060); \u00605b7653b4\u0060 feat(html): support function filename and \u0060[name]\u0060 in filename (#7753) (at that commit the file was still \u0060crates/rspack_binding_options/src/options/raw_builtins/raw_html.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/raw_builtins/raw_html.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a66465ba1aaf60673ee2163b941401d8c54588d91ee9f0c96b9673fb201d94"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: raw_optimization.rs \u2194 adapter.ts: \u0060crates/rspack_binding_api/src/raw_options/raw_optimization.rs\u0060 and \u0060packages/rspack/src/config/adapter.ts\u0060 change together 67% of the time (8 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) 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 8 shared commits counted here, the most recent 3 are \u006028abee87\u0060 refactor: remove as much \u0060getRawOptions\u0060 as possible (#8773) (at that commit the file was still \u0060crates/rspack_binding_values/src/raw_options/raw_optimization.rs\u0060); \u0060ea2947e6\u0060 chore: remove new split chunks options (#6536) (at that commit the file was still \u0060crates/rspack_binding_options/src/options/raw_optimization.rs\u0060); \u00607ea17cc2\u0060 feat: add function type splitChunks chunks (#5019) (at that commit the file was still \u0060crates/rspack_binding_options/src/options/raw_optimization.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/raw_optimization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fa92bdc9d45d31271fd2e62b1d1dc9c7588683b406f525e56f795878ca8289"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: builder_context.rs \u2194 mod.rs: \u0060crates/rspack/src/builder/builder_context.rs\u0060 and \u0060crates/rspack_binding_api/src/raw_options/raw_builtins/mod.rs\u0060 change together 67% of the time (8 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 8 shared commits counted here, the most recent 3 are \u006099a13944\u0060 fix(ids): correct compact hashed API names (#15356); \u006025762c20\u0060 feat(ids): add compact chunk ids (#14959); \u0060df6cc3d1\u0060 feat(ids): add compat-hashed module ids (#14926) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/builder_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55282723eb3392f8441c6d7bc052b67c589331b6f52417fb2e4586a1d61a7f2c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: import_meta_context_dependency_parser_plugin.rs \u2194 import_parser_plugin.rs: \u0060crates/rspack_plugin_javascript/src/parser_plugin/import_meta_context_dependency_parser_plugin.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.rs\u0060 change together 64% of the time (9 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 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 9 shared commits counted here, the most recent 3 are \u00605dc1d7ae\u0060 feat: support caseSensitive in import.meta.glob (#14811); \u006026060ed3\u0060 fix: handle context changes in import.meta.glob hooks (#14897); \u006011448d64\u0060 feat: support more import.meta.glob options (#14129) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/import_meta_context_dependency_parser_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c3a30ae8905882e23c4c865de37eba841a75f4d05833b29052d16f0b14faa7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: scheduler.rs \u2194 index.ts: \u0060crates/rspack_binding_api/src/plugins/js_loader/scheduler.rs\u0060 and \u0060packages/rspack/src/loader-runner/index.ts\u0060 change together 64% of the time (14 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) 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 14 shared commits counted here, the most recent 3 are \u006079bad3fc\u0060 fix(core): distinguish fatal module errors from loader diagnostics (#\u2026; \u00602b1dd371\u0060 fix(loader): revert native loader hook invocation (#15719); \u0060df236e5e\u0060 fix(loader): preserve string BOM across native boundaries (#15632) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/plugins/js_loader/scheduler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f458b791e93a8d321c5d19b6b1893b6f5864b3b30ac7fadad676b1912c878233"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: wasm_plugin.rs \u2192 lib.rs, impl_plugin_for_css_plugin.rs, impl_plugin_for_js_plugin.rs: \u0060crates/rspack_plugin_wasm/src/wasm_plugin.rs\u0060 changes together with 3 other files \u2014 \u0060crates/rspack_plugin_asset/src/lib.rs\u0060, \u0060crates/rspack_plugin_css/src/plugin/impl_plugin_for_css_plugin.rs\u0060, \u0060crates/rspack_plugin_javascript/src/plugin/impl_plugin_for_js_plugin.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":"crates/rspack_plugin_wasm/src/wasm_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a5f6a1fddf7dfeb7f0ad33b85f77156e7791bd406283638c9be463fb6ff997"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: assign_library_plugin.rs \u2194 export_property_library_plugin.rs: \u0060crates/rspack_plugin_library/src/assign_library_plugin.rs\u0060 and \u0060crates/rspack_plugin_library/src/export_property_library_plugin.rs\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 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 7 shared commits counted here, the most recent 3 are \u00602f54e648\u0060 refactor: make finishModules readonly for compilation (#13058); \u0060e04df144\u0060 refactor: improve exports info (#12587); \u0060e2b38893\u0060 refactor: refactor collect_build_module_graph_effects using artifact \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_library/src/assign_library_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb3b733c5c2bea7bb3c9efddc99521e453eaa1cbab6209a3cb21292b880d403"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 module_rules.rs: \u0060crates/rspack_binding_api/src/raw_options/raw_module/mod.rs\u0060 and \u0060crates/rspack_core/src/utils/module_rules.rs\u0060 change together 62% of the time (20 of the 32 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 20 shared commits counted here, the most recent 3 are \u0060cfa30dbf\u0060 feat: add experimental rule.as (#15917); \u006030043652\u0060 perf: reduce normal module creation and rule matching overhead (#13926); \u00604da33a84\u0060 feat: support \u0060match_when_empty\u0060 for rule condition  (#8809) (at that commit the file was still \u0060crates/rspack_binding_values/src/raw_options/raw_module/mod.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/raw_module/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96b55726e4fad05aaedad19b9ef208c2198333473226246a29b02220252ad68"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: builder_context.rs \u2194 rspackOptionsApply.ts: \u0060crates/rspack/src/builder/builder_context.rs\u0060 and \u0060packages/rspack/src/rspackOptionsApply.ts\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) 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 \u006099a13944\u0060 fix(ids): correct compact hashed API names (#15356); \u006025762c20\u0060 feat(ids): add compact chunk ids (#14959); \u0060df6cc3d1\u0060 feat(ids): add compat-hashed module ids (#14926) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack/src/builder/builder_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8ed3c2dede26f21186e6616a6d5b7590bb8803a3ae2194f26877e75fa640bc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 mod.rs: \u0060crates/rspack_plugin_javascript/src/parser_plugin/mod.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/visitors/dependency/mod.rs\u0060 change together 57% of the time (21 of the 37 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 21 shared commits counted here, the most recent 3 are \u00609c1a057c\u0060 refactor: side effects parser plugin (#12014); \u0060f2bc023f\u0060 feat!: detect conflicting values in \u0060DefinePlugin\u0060 (#7045); \u0060c0e838d5\u0060 refactor: port inner graph (#7043) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/parser_plugin/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93789e26c9b0668a87a69082f0c4e111220e59d46437880acaa534d1c7cd25e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: compiler_options.rs \u2194 adapter.ts: \u0060crates/rspack_core/src/options/compiler_options.rs\u0060 and \u0060packages/rspack/src/config/adapter.ts\u0060 change together 56% of the time (10 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) 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 \u006096084cc0\u0060 feat: support invalidate persistent cache using \u0060config.mode\u0060 and \u0060co\u2026; \u006028abee87\u0060 refactor: remove as much \u0060getRawOptions\u0060 as possible (#8773); \u0060e833f205\u0060 refactor: phases level switcher for incremental options (#7954) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/options/compiler_options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"912eadce131df6d2c03d34a7fb22055552fda5aba705cfa10add0c57e6657b03"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: build.ts \u2194 serve.ts: \u0060packages/rspack-cli/src/commands/build.ts\u0060 and \u0060packages/rspack-cli/src/commands/serve.ts\u0060 change together 55% of the time (17 of the 31 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 17 shared commits counted here, the most recent 3 are \u00602ec536ba\u0060 fix(cli): surface fatal errors and unhandled rejections on process ex\u2026; \u0060f2efb67b\u0060 fix(cli): apply default lazy compilation value based on user config (\u2026; \u00600e14994d\u0060 perf(cli): switch to cac and refactor code (#11893) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-cli/src/commands/build.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a73e4294d621c8dea12ee8f59620f1a9de5305cdb5f561091f222c1405b9a1a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: common_js_require_context_dependency.rs \u2194 import_parser_plugin.rs: \u0060crates/rspack_plugin_javascript/src/dependency/context/common_js_require_context_dependency.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.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 \u00602e3a54eb\u0060 fix: empty references export for cjs and dynamic import tree shaking \u2026; \u0060b072b9da\u0060 feat: cjs require variable property access tree shaking (#13155); \u0060c0a82b3a\u0060 feat: amd context require (#9495) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/dependency/context/common_js_require_context_dependency.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e52002607eba818a442e87bbee1a2583874d68728bb79d84a0e465b5a846f50"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: common_js_export_require_dependency.rs \u2194 common_js_self_reference_dependency.rs: \u0060crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_export_require_dependency.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_self_reference_dependency.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 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 \u0060304d4814\u0060 refactor: reuse current module in dependency templates (#16149); \u0060e04df144\u0060 refactor: improve exports info (#12587); \u00604ecc0318\u0060 refactor: refine exports info for CJS and ESM interop (#12577) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/dependency/commonjs/common_js_export_require_dependency.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f6d3a184b00100554ef1ff0ab00c4e4f4777c9c021dd5a7890e0efb7b8b285"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: flag_dependency_exports_plugin.rs \u2194 export_property_library_plugin.rs: \u0060crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs\u0060 and \u0060crates/rspack_plugin_library/src/export_property_library_plugin.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 \u00602f54e648\u0060 refactor: make finishModules readonly for compilation (#13058); \u0060e04df144\u0060 refactor: improve exports info (#12587); \u0060e2b38893\u0060 refactor: refactor collect_build_module_graph_effects using artifact \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/plugin/flag_dependency_exports_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"763b2610a8420c8cbfab34f624425bec078120643eb953e4cd3be8f5d6e946ad"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: raw_split_chunk_name.rs \u2194 module_group.rs: \u0060crates/rspack_binding_api/src/raw_options/raw_split_chunks/raw_split_chunk_name.rs\u0060 and \u0060crates/rspack_plugin_split_chunks/src/plugin/module_group.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) 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 \u00604f1ce3e7\u0060 perf: batch splitChunks JavaScript callbacks (#15147); \u0060722967d5\u0060 perf: improve bundle splitting part 2 (#11233); \u00608b3d3f4f\u0060 refactor: remove \u0060block_on\u0060 in split chunk name and test (#9722) (at that commit the file was still \u0060crates/node_binding/src/raw_options/raw_split_chunks/raw_split_chunk_name.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/raw_split_chunks/raw_split_chunk_name.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd5becd9a7c9c3e2cb76828b608d8e9fba6bbbeca208097df14323cb9aba3c1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ctrl.rs \u2194 execute.rs: \u0060crates/rspack_core/src/compilation/build_module_graph/module_executor/ctrl.rs\u0060 and \u0060crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.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) 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 7 shared commits counted here, the most recent 3 are \u00601473292c\u0060 refactor: rename TaskType::Sync to Main \u0026 TaskType::Async to backgrou\u2026 (at that commit the files were still \u0060crates/rspack_core/src/compiler/module_executor/ctrl.rs\u0060 and \u0060crates/rspack_core/src/compiler/module_executor/execute.rs\u0060); \u0060bd6c7568\u0060 chore: support event tracing (#10225) (at that commit the files were still \u0060crates/rspack_core/src/compiler/module_executor/ctrl.rs\u0060 and \u0060crates/rspack_core/src/compiler/module_executor/execute.rs\u0060); \u0060242967b1\u0060 fix: should rebuild css module when rebuild css extract entry (#10124) (at that commit the files were still \u0060crates/rspack_core/src/compiler/module_executor/ctrl.rs\u0060 and \u0060crates/rspack_core/src/compiler/module_executor/execute.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/module_executor/ctrl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83a815bd2195c46ee77a780eab00566b27a454926ed5c6dbe55ff6eefe0b3bf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: array_push_callback_chunk_format.rs \u2194 common_js_chunk_format.rs: \u0060crates/rspack_plugin_runtime/src/array_push_callback_chunk_format.rs\u0060 and \u0060crates/rspack_plugin_runtime/src/common_js_chunk_format.rs\u0060 change together 53% of the time (8 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 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 8 shared commits counted here, the most recent 3 are \u0060b1b7a99c\u0060 refactor(hmr): use the chunk content hash as its hmr version (#16585); \u00606e6aedf7\u0060 perf: improve create hash (#11598); \u00607b2e1568\u0060 fix: css loading runtime order (#5896) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_runtime/src/array_push_callback_chunk_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67cb1fe0126e6231fbce824bab53d9cf7a864c0a038e046ec68151411df77a3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 native_fs.rs: \u0060crates/rspack_core/src/compiler/mod.rs\u0060 and \u0060crates/rspack_fs/src/native_fs.rs\u0060 change together 52% of the time (14 of the 27 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 14 shared commits counted here, the most recent 3 are \u006018f392fd\u0060 perf: Enable more Clippy performance checks and reduce redundant clon\u2026; \u00601c2cb294\u0060 chore: bump rust toolchain (#12183); \u00602f5cf2f3\u0060 chore: change input_filesystem to ReadableFileSystem (#8878) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compiler/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bbc2bd1518ba4b6f8ac6fc5c94bd071c04ff6e56998b7c6bb47826fd902d3f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: raw_optimization.rs \u2194 defaults.ts: \u0060crates/rspack_binding_api/src/raw_options/raw_optimization.rs\u0060 and \u0060packages/rspack/src/config/defaults.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) 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 6 shared commits counted here, the most recent 3 are \u0060f294667a\u0060 fix!: remove unconsumed useless \u0060optimization.removeAvailableModules\u0060\u2026; \u0060ea2947e6\u0060 chore: remove new split chunks options (#6536) (at that commit the file was still \u0060crates/rspack_binding_options/src/options/raw_optimization.rs\u0060); \u00602008c032\u0060 feat: combine three tree shaking related plugin, and add correspondin\u2026 (at that commit the file was still \u0060crates/rspack_binding_options/src/options/raw_optimization.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/raw_optimization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58b2718935e3c0dc711d9ec409e9c100b407f4aae36a8c1b3cb60024888d619"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: async_dependency_block.rs \u2194 module_graph_connection.rs: \u0060crates/rspack_binding_api/src/async_dependency_block.rs\u0060 and \u0060crates/rspack_binding_api/src/module_graph_connection.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 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 \u006010f7856c\u0060 refactor(binding): retain DependencyRef in JavaScript wrappers (#16061); \u006047901fb5\u0060 refactor: move try_dependency_by_id api in internal folder (#12611); \u006052694466\u0060 fix: entry dependency passed to addInclude should be used in module g\u2026 (at that commit the files were still \u0060crates/node_binding/src/dependency_block.rs\u0060 and \u0060crates/node_binding/src/module_graph_connection.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/async_dependency_block.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d2d7f4d6b5242d66eb5fe014830ae4aecea990036c2b287e0d89e52fd2c414"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 mod.rs: \u0060crates/rspack_plugin_javascript/src/dependency/mod.rs\u0060 and \u0060crates/rspack_plugin_javascript/src/visitors/dependency/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) 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 \u0060733257e0\u0060 Cleanup some scanner (#5452); \u0060f43bfbbd\u0060 feat: support __webpack_is_included__ (#5087); \u0060e451b6a1\u0060 feat: ExportInfoApiDependency (#3882) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_javascript/src/dependency/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b39165ab58731c1f691397d01da6361850a536d9aa36d69cfc9ab6a35a25e6"}},{"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":"29ea1cb6d8c4dead4e94b3ff5433e0b5d5f21dfc37d1dc7dc6e4b7e87641b6c8"}},{"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":"b88424691f34b46427178bb364e02c440630c3e80ca553cd113d27dc8086e8fd"},"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":"fe20d37fba7a253c133ce400f0f00786c77bac64cf83f3a9921a233e86de160b"},"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":"29ad0b2d27b3e4f565d46fa515ea43ea3d85798aad43133b3f4466fc96a0400d"},"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":"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":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_runtime/src/runtime_module/runtime/auto_public_path.ejs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c3f03e75785fab7c2155df56eabb73947ac50a1ee0b1363c364f6ab7a7e103"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022root\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-rspack/template-react-js/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ae545ec79281d9fe7ffad336683a08bc2026f0ff3d88b117057feec29536c5"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022root\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-rspack/template-react-ts/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8d4b0407c1830e03f592a0273bbc19423e074ef46e4e330d0152e500a87019"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022root\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-rspack/template-vanilla-js/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca3535346dec2955b0cb2c68b5e8ae15731632c44edf0fd400917fd7b4cfc89"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022root\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-rspack/template-vanilla-ts/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c659f57fb8c926b8973ddbf9e9bb7884eee65d2a6535e17f35f9bb4c0bc28ad9"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022app\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-rspack/template-vue-js/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9e47520d5eefed999f053f0614f5c1fd7d90ceda0eeb74ba42cb236aef01e7"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022app\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-rspack/template-vue-ts/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"46126c6c11521eab7713b4b4b0c6c1bd4cdd20ce7a22802ccf65dddd23756d09"}},{"ruleId":"AX4","level":"error","message":{"text":"Dependency-rule violation: rspack_core (Domain) \u2192 rspack_napi (Web): \u0060rspack_core\u0060 is a Domain project but references \u0060rspack_napi\u0060, a Web project. The clean-architecture rule is that dependencies point INWARD \u2014 the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"30de5adb40e0cb0a48d5b1c81e56df79a9760a2f8c2391dfe1a81cb1d6df7d07"}},{"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":"P2","level":"note","message":{"text":"Logging is not universal: Only 43/46 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/rspack_allocative_driver\u0060, \u0060packages/create-rspack\u0060, \u0060xtask\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/NativeWatchFileSystem.ts\u0060 reports through \u0060console.*\u0060 at line 325 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/NativeWatchFileSystem.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c69348f45f5fda7abbd3bc0110e9dbb077bda7ab602fcc7a5a8c63139e14ad"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/checkNodeVersion.ts\u0060 reports through \u0060console.*\u0060 at line 15 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/checkNodeVersion.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"564328f6da5186e8e15f7f33e649842d37a853874813b55fe9eb1a700f60f818"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/util/asyncLib.ts\u0060 reports through \u0060console.*\u0060 at line 66 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/util/asyncLib.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad4fe60636755d685d2f73dc9ee8d1b33d4e05cc326b99740a81425e6f4805c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/util/asyncLib.ts\u0060 reports through \u0060console.*\u0060 at line 67 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/util/asyncLib.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"96faefc68b15b3daca61265a0be82cb659d0f67969d7418bdcfd4edb589e3a3b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/util/asyncLib.ts\u0060 reports through \u0060console.*\u0060 at line 82 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/util/asyncLib.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"677b32e20c4c5926b6cc41c2b8101ae5868abe1055448d5348ac1c541f4cf624"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/util/asyncLib.ts\u0060 reports through \u0060console.*\u0060 at line 83 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/util/asyncLib.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f662c8352f45ff3c0bb5220cc733d35a06d0ba3bcd957970de45d49ea675c98f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/sharing/IndependentSharedPlugin.ts\u0060 reports through \u0060console.*\u0060 at line 73 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/sharing/IndependentSharedPlugin.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91fa635a95d3391c5cfc80ffbbac5e1168e69940cb2bdfd7bba647636d5494f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/sharing/IndependentSharedPlugin.ts\u0060 reports through \u0060console.*\u0060 at line 106 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/sharing/IndependentSharedPlugin.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a57c3cf11b157ea08cc2c696980b8162976821a5df0a2fb486d6c4e06cb3dc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/sharing/IndependentSharedPlugin.ts\u0060 reports through \u0060console.*\u0060 at line 322 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/sharing/IndependentSharedPlugin.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8d1d547f71c9a2b2d6032bb58d445c5448adc0d0abefe577f078e276442a3f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/sharing/IndependentSharedPlugin.ts\u0060 reports through \u0060console.*\u0060 at line 349 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/sharing/IndependentSharedPlugin.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"a713279023766dcb162d688a8ba5821bc1fbe6ee4435c2bac6b4a3697b203d87"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/sharing/IndependentSharedPlugin.ts\u0060 reports through \u0060console.*\u0060 at line 478 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/sharing/IndependentSharedPlugin.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ce9795d72b91627aa7acffe922fc6fe2f58d28f34f45afd43b6140cab70b44"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/sharing/IndependentSharedPlugin.ts\u0060 reports through \u0060console.*\u0060 at line 490 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/sharing/IndependentSharedPlugin.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d91d9b805802afc61146e5eb30da97403a62079ffbdbe98fcf438a9a4c6586"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/logging/createConsoleLogger.ts\u0060 reports through \u0060console.*\u0060 at line 101 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38d7963a1c9b7f6d68178c898e5694d3fe28d63bef78b87639a9349166993c3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/logging/createConsoleLogger.ts\u0060 reports through \u0060console.*\u0060 at line 103 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e408c7819cefca716bf85720b925d337913e173e923d2e43e4d5a0fdd0fe004"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/logging/createConsoleLogger.ts\u0060 reports through \u0060console.*\u0060 at line 109 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e497375c520cd774cd08b8446f0881e9f169a4edfccbe2172e8a66aec303a55"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/logging/createConsoleLogger.ts\u0060 reports through \u0060console.*\u0060 at line 113 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daf05f6c229d3536f2fbf8cc0a82e16d99cd561066092e2380396643dd58d7f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/logging/createConsoleLogger.ts\u0060 reports through \u0060console.*\u0060 at line 117 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f56a3c4cbcf1651e2a195e1cddb0a2df9c4db407e4461e02329f7b4c013ff2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/logging/createConsoleLogger.ts\u0060 reports through \u0060console.*\u0060 at line 121 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"502c1d6f034981a52c47e1897ae311c2e8ed28cac2f37604b5d626dc1cd9b868"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/logging/createConsoleLogger.ts\u0060 reports through \u0060console.*\u0060 at line 133 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2848568cbe7f29150ca63c16be86ca908f0cfb3c90fe8d21e575410999eaf843"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/logging/createConsoleLogger.ts\u0060 reports through \u0060console.*\u0060 at line 144 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"66992f3597d6e9fd076cb1e417623d2e84afaa46ab670a26c43f3f9eb391b335"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/logging/createConsoleLogger.ts\u0060 reports through \u0060console.*\u0060 at line 161 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc49b6b71717383269d69c2040f578dbc6ab1b4969c3297aa00a14fac0aa1e4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/logging/createConsoleLogger.ts\u0060 reports through \u0060console.*\u0060 at line 192 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4a2829d76059ccfdc309d7f746a924eed8b50f876dfcd27df0190be4e8f994"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/loader-runner/utils.ts\u0060 reports through \u0060console.*\u0060 at line 116 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/loader-runner/utils.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"805dde36a90e2f2c4a008c24aac42302b5a7bc9d98240cd2c058652ef44c568f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/src/loader-runner/utils.ts\u0060 reports through \u0060console.*\u0060 at line 117 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/loader-runner/utils.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1775b9f59cf90f9823e9c2c3b8f414302bb60e0253d65dc2990bbc11bdd581fd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/hot/lazy-compilation-node.js\u0060 reports through \u0060console.*\u0060 at line 99 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/hot/lazy-compilation-node.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46a781cc68e20b28102de55e4b2ff13c84c7fd55e8c69e5d2f97a47e7b6f2b0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack/hot/lazy-compilation-web.js\u0060 reports through \u0060console.*\u0060 at line 87 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/hot/lazy-compilation-web.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e267e5b7127e0092c2ca578b95a291eff72fc819881e23ec7de9aa0942b57693"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack-test-tools/src/helper/util/checkSourceMap.js\u0060 reports through \u0060console.*\u0060 at line 16 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-test-tools/src/helper/util/checkSourceMap.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf24523d426315c179051419a493f1d56d5a1333f9c50add37d5bd4d6deff90"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/rspack-test-tools/src/case/example.ts\u0060 reports through \u0060console.*\u0060 at line 46 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-test-tools/src/case/example.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae6e1aee742923f1aa9e4ad20db46890710f678e2935dc4f203fbb753d18c64"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060loadExtendedConfig\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":"packages/rspack-cli/src/utils/loadConfig.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"41092771e4c8f2c1e97649b0d6e8b7979b151a2060d28372d40cc3651f1a33ff"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060loadRspackConfig\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":"packages/rspack-cli/src/utils/loadConfig.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"53eab83f99924f9be5468acac04a6d60fd07a80923e5bddadc1150610e05e85c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060templateFn\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":"packages/rspack/src/builtin-plugin/html-plugin/plugin.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f2ca4f16afa06f03d6282386bcf4ce58c508476c1de95e8195db6f47793e9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 9 sibling directories (5 clone groups): 5 duplicated blocks under packages/rspack/src/ have copies in at least two of the sibling directories browser, builtin-plugin, config, loader-runner, logging, stats (\u002B3 more sibling(s) not listed) \u2014 3 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10\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 5 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71ad8b74fbfe7a81949d2f6d131327f50a122e423fdec1b261d2369f2559aa0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (65 matched lines \u00D7 2 locations): packages/rspack/src/stats/StatsFactory.ts:209 \u00B7 packages/rspack/src/stats/StatsPrinter.ts:152 \u2014 the two spans are one implementation copied and then locally edited \u2014 361 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":"packages/rspack/src/stats/StatsFactory.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2375bc3f35a61e868de6437b97da8aa5803d683a3991c888d64f29c37e439e41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2 locations): packages/rspack/src/Compilation.ts:947 \u00B7 packages/rspack/src/Compiler.ts:476 \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":"packages/rspack/src/Compilation.ts"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"05832c8f7cc548739e1eae3a50cc5df9b1eb0a54eda917371f109daa06f17933"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2 locations): packages/rspack/src/loader-runner/index.ts:458 \u00B7 packages/rspack/src/loader-runner/worker.ts:400 \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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d50764d1606d82e2922fc1cb66a1a45fd9d10e321bc8e7874d67da3c1893e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): packages/rspack/src/util/fs.ts:383 \u00B7 packages/rspack/src/util/fs.ts:424 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/util/fs.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9c4d4eec021085a4da3637b3f939f8cea5ebd5ed9c9f80ff06a5e4424c9d31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): packages/rspack/hot/lazy-compilation-node.js:35 \u00B7 packages/rspack/hot/lazy-compilation-web.js:32 \u2014 the two spans are one implementation copied and then locally edited \u2014 166 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":"packages/rspack/hot/lazy-compilation-node.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c44f719b51ad168235bcfc7caacb9830415ae7601ae4f83d0078cedf4c3b595"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): packages/rspack/src/Module.ts:51 \u00B7 packages/rspack/src/Module.ts:120 \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":"packages/rspack/src/Module.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f51d197d04d663dbad113e1cd3eea867f4087a6f17a907b913fee5b15ba064"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): packages/rspack/src/Compiler.ts:1115 \u00B7 packages/rspack/src/Compiler.ts:1154 \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":"packages/rspack/src/Compiler.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1739e610da3c6c3db1e79df851c1407c9897194f0a8183a282bc0882dcb13a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): packages/rspack/src/FileSystemDependencies.ts:126 \u00B7 packages/rspack/src/Modules.ts:45 \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":"packages/rspack/src/FileSystemDependencies.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"083364c10eb482e2e13c5303d98718ad5c3250158f163ebd1129dc3c3518a100"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): packages/rspack-cli/src/commands/preview.ts:47 \u00B7 packages/rspack-cli/src/commands/serve.ts:61 \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":"packages/rspack-cli/src/commands/preview.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3285ad72a9b6b7cdd5e7d16630df281506cb46e10462d015ab5e0326eb7b7186"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): packages/rspack/src/Stats.ts:87 \u00B7 packages/rspack/src/Stats.ts:134 \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":"packages/rspack/src/Stats.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f583585348fa9ec8eec20c78a951a050c87af738dd98f60b74f26377abb9dfc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): packages/rspack/src/FileSystem.ts:75 \u00B7 packages/rspack/src/FileSystem.ts:176 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \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":"packages/rspack/src/FileSystem.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"efea22b807874e8bb501d7efc1bd4197b705012ad512ffffb896864aefe1ef32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): packages/rspack/src/browser/service.ts:1 \u00B7 packages/rspack/src/loader-runner/service.ts:125 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd58e0b165ce24e73211f3b42b042e51b523c3d437fb03ad267f24a70908e1ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): packages/create-rspack/template-react-js/src/App.jsx:5 \u00B7 packages/create-rspack/template-react-ts/src/App.tsx:5 \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":"packages/create-rspack/template-react-js/src/App.jsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"307f159b56a0c1e62a0def79544ee598dca49d2504066570bfc72f8cdb516cc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): packages/rspack/src/config/defaults.ts:948 \u00B7 packages/rspack/src/config/defaults.ts:975 \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":"packages/rspack/src/config/defaults.ts"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f1a4b78472d1d12ad74855d5d1d451990e64c28596d957d79bb887be32180f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/rspack/src/rspackOptionsApply.ts:360 \u00B7 packages/rspack/src/rspackOptionsApply.ts: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":"packages/rspack/src/rspackOptionsApply.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"776307d7731b2f6ebbdb456e5ce1a078486191ae3a7cbd254044ba6ccd16b9d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/rspack/src/stats/DefaultStatsPrinterPlugin.ts:240 \u00B7 packages/rspack/src/stats/DefaultStatsPrinterPlugin.ts:264 \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":"packages/rspack/src/stats/DefaultStatsPrinterPlugin.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"63875ba7d757eab8193631a53243de8ea9ea0324fe2bcaf760c03c683c599983"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/rspack/src/taps/compilation.ts:459 \u00B7 packages/rspack/src/taps/javascriptModules.ts:16 \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":"packages/rspack/src/taps/compilation.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"384f428d20d2c9e697d41f41dd5c9313f6c6b763d6e8fe43a3f9b562710bb220"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/rspack/src/loader-runner/index.ts:695 \u00B7 packages/rspack/src/loader-runner/worker.ts:452 \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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"4492bd9aa135495c250760007f9b5b9374625d2dd83e0eaea4230f6201abb8cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/rspack/src/util/fs.ts:287 \u00B7 packages/rspack/src/util/fs.ts:465 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/util/fs.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5920064c31f8a02ab2882d3daad5cfdb0c2dd3fda7d4c15fb8aa4f16e0e7b83d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): packages/rspack/src/logging/createConsoleLogger.ts:41 \u00B7 packages/rspack/src/stats/DefaultStatsPresetPlugin.ts:260 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"65536ecfb50f7ef69ec8ccd1b900fa7e0ade55beb6fe23fef7212a573bf142f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): packages/rspack/src/Compiler.ts:586 \u00B7 packages/rspack/src/Watching.ts:341 \u2014 the two spans are one implementation copied and then locally edited \u2014 117 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":"packages/rspack/src/Compiler.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1306d12d185a0d221f4e9d285e150664dd8e2d5989753629e25051964acd07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/rspack/src/taps/normalModuleFactory.ts:13 \u00B7 packages/rspack/src/taps/normalModuleFactory.ts:73 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/taps/normalModuleFactory.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdbc2196a64c25afcc3e60ab695eb3438b9db1b60797e61f8440835923b0fb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/create-rspack/template-vue-js/rspack.config.js:35 \u00B7 packages/create-rspack/template-vue-ts/rspack.config.ts:37 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-rspack/template-vue-js/rspack.config.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f524de747dafde702cdb07a14209a9a0a17153e34701cdc03093c11b1c07136"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/rspack/src/Compilation.ts:495 \u00B7 packages/rspack/src/Compiler.ts:272 \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":"packages/rspack/src/Compilation.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed5e883fc55927bcfe6da1eede31f2e1cc9365773c4c444e45c10dc83e47bed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4 locations): packages/rspack/src/NativeWatchFileSystem.ts:440 \u00B7 packages/rspack/src/NativeWatchFileSystem.ts:460 \u00B7 packages/rspack/src/node/NodeWatchFileSystem.ts:269 \u00B7 packages/rspack/src/node/NodeWatchFileSystem.ts:289 \u2014 the 4 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":"packages/rspack/src/NativeWatchFileSystem.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3521d533cb1c42b1b90210e837d92fed78025125195bcbe2608d49a773fa45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4 locations): packages/rspack/src/builtin-plugin/html-plugin/taps.ts:23 \u00B7 packages/rspack/src/builtin-plugin/html-plugin/taps.ts:45 \u00B7 packages/rspack/src/builtin-plugin/html-plugin/taps.ts:67 \u00B7 packages/rspack/src/builtin-plugin/html-plugin/taps.ts:110 \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":"packages/rspack/src/builtin-plugin/html-plugin/taps.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b832950dfe46d5f983ec4d8ff36d1b1860c65ca4b31b2bf50b90ea2166c92acd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/rspack/src/stats/StatsFactory.ts:113 \u00B7 packages/rspack/src/stats/StatsFactory.ts:134 \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":"packages/rspack/src/stats/StatsFactory.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f886d35da6a2b2ff6570ff4362eb6ef90d04b0ecd4baa3b7a02b70467053d857"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/rspack/src/loader-runner/index.ts:992 \u00B7 packages/rspack/src/loader-runner/index.ts:1011 \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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dcccc628ba6a8a6c48374e1c3a7412581f6f3275a4047d55dc6deff0aee76e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/rspack/src/config/target.ts:260 \u00B7 packages/rspack/src/config/target.ts:337 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \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":"packages/rspack/src/config/target.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1a717ab7962b0b5acdce4ef556cf0781e8212fbad007d3f7d1e04f8e472ec7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): packages/rspack/src/sharing/IndependentSharedPlugin.ts:170 \u00B7 packages/rspack/src/sharing/SharePlugin.ts:73 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\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":"packages/rspack/src/sharing/IndependentSharedPlugin.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"786dc368df5459747347bb95f041dfa6438474581687340cf76e3693b845801c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/rspack/src/NativeWatchFileSystem.ts:479 \u00B7 packages/rspack/src/node/NodeWatchFileSystem.ts:308 \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":"packages/rspack/src/NativeWatchFileSystem.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5b834c8b9e08668ced2a19c1786ef92485129c48e2389d8e0928909bce94d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/rspack/src/container/ModuleFederationPlugin.ts:101 \u00B7 packages/rspack/src/container/ModuleFederationPlugin.ts: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":"packages/rspack/src/container/ModuleFederationPlugin.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb033c35e720605896396ea7b2a99ef9b59d28d573a469c00d052d6c1eda3a7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/rspack/src/loader-runner/index.ts:670 \u00B7 packages/rspack/src/loader-runner/worker.ts:264 \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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f660ceb6efba30b4e16930f9126bd5b429f3f3e4c994a073a3564b11b849dce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts:173 \u00B7 packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts:395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efd6b5f0b2241aea22f6262b2f97f4ef3aa9a678486a2eb0481009a30890b1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/rspack/src/ChunkGraph.ts:7 \u00B7 packages/rspack/src/ChunkGraph.ts:27 \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":"packages/rspack/src/ChunkGraph.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"776faedd974ed38a613e45d6b8c876f0ff0b343e8cd61785a65797c996c2b7d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/rspack/src/loader-runner/index.ts:545 \u00B7 packages/rspack/src/loader-runner/worker.ts:131 \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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ef04dbdde7865c536369a3bb9d57a7ffc8c10b8796c59093b8fd5e08225824"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts:118 \u00B7 packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts:287 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \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":"packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df99f8cc6f69e134173d17620c50d3a1b7e237c953d52b576e50a8627c48a65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/rspack/src/taps/compilation.ts:370 \u00B7 packages/rspack/src/taps/compilation.ts:387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/taps/compilation.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a3fa3f799767c145817f6faca973e09bbde7d7348740375efe6254d684cb9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/rspack/src/trace/traceHookPlugin.ts:49 \u00B7 packages/rspack/src/trace/traceHookPlugin.ts:82 \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":"packages/rspack/src/trace/traceHookPlugin.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4097bbb9c0d7b13e8fb5d7cf0670ea3251a50df30bb6f220542e6288978eff40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/rspack/src/builtin-loader/lightningcss/target.ts:19 \u00B7 packages/rspack/src/builtin-loader/swc/index.ts: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":"packages/rspack/src/builtin-loader/lightningcss/target.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8596a720ac7070c831c2d9d15e4fe285444964e6c2d700d439336c9d1623370f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/rspack/src/builtin-plugin/CompactHashedChunkIdsPlugin.ts:4 \u00B7 packages/rspack/src/builtin-plugin/CompactHashedModuleIdsPlugin.ts:4 \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":"packages/rspack/src/builtin-plugin/CompactHashedChunkIdsPlugin.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2904a1cc3c4ebfe8c0d1865cdafcee0f56d71363f048ab5a518b93c3dc763271"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/rspack/src/loader-runner/index.ts:233 \u00B7 packages/rspack/src/loader-runner/worker.ts:752 \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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"02169b707aa41e3306f677317a00afcc208f7dea88a120ad0fee24322e9527c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/rspack/src/node/NodeWatchFileSystem.ts:162 \u00B7 packages/rspack/src/node/NodeWatchFileSystem.ts:176 \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":"packages/rspack/src/node/NodeWatchFileSystem.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dae7956e43937443f90e433b3f80ae65ec6d5a25cde8bcf131da3bdc179014"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/rspack/src/swc.ts:7 \u00B7 packages/rspack/src/swc.ts:24 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/swc.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"940e2e091fcba602b0ff07a3d662aac36ed1d61d63879bd32983c8ca7c8a541a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/rspack/src/taps/compiler.ts:19 \u00B7 packages/rspack/src/taps/compiler.ts:35 \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":"packages/rspack/src/taps/compiler.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f601f8ab363e9f334914d243b5b0c6a2970bcbc4e1b16b776455a70e4b5a1593"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/rspack/src/Compilation.ts:581 \u00B7 packages/rspack/src/Compilation.ts:618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/Compilation.ts"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdc9bdc5e275d4945ed3082b8471117c3b4ad60eb9b86b886783bda66c6ea40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6 locations): packages/rspack/src/ExternalModule.ts:19 \u00B7 packages/rspack/src/Module.ts:191 \u00B7 packages/rspack/src/NormalModule.ts:25 \u00B7 packages/rspack/src/NormalModule.ts:38 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 3 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":"packages/rspack/src/ExternalModule.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"33db22e5e8a74653e46bfef4b1b609a11731397407fa83987c5bd0f766cae54a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/rspack/src/Template.ts:93 \u00B7 packages/rspack/src/Template.ts:126 \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":"packages/rspack/src/Template.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0276e880361ca1275680c6b4d561f877df0339c7585cb50c67d22fac71eb3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): packages/rspack/src/builtin-plugin/RuntimePlugin.ts:49 \u00B7 packages/rspack/src/builtin-plugin/RuntimePlugin.ts:62 \u00B7 packages/rspack/src/builtin-plugin/RuntimePlugin.ts:75 \u00B7 packages/rspack/src/builtin-plugin/RuntimePlugin.ts:88 \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":"packages/rspack/src/builtin-plugin/RuntimePlugin.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe1891a3196c0d3655d723383eeb30fe41568fbe8c8ac54c91535bef84306de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/rspack-cli/src/cli.ts:31 \u00B7 packages/rspack/src/util/supportsColor.ts:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"packages/rspack-cli/src/cli.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d86a4d834cc9b26a5d636e7b46832c55a1f2dd5dfcde2eecd26e553b7bdf7e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/rspack-cli/src/commands/serve.ts:151 \u00B7 packages/rspack-cli/src/commands/serve.ts: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":"packages/rspack-cli/src/commands/serve.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"200b48b38e374aadc568edf947af411db2cb453df6c828fe1fc1793aaf2a6098"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 10 locations): packages/rspack/src/RuntimeGlobals.ts:560 \u00B7 packages/rspack/src/RuntimeGlobals.ts:572 \u00B7 packages/rspack/src/RuntimeGlobals.ts:590 \u00B7 packages/rspack/src/RuntimeGlobals.ts:602 \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":"packages/rspack/src/RuntimeGlobals.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbb4557afc0bacc7186f40865493a175d99e18283f1f6a27a8e0a5271d83f87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): packages/rspack/src/builtin-plugin/CompactHashedChunkIdsPlugin.ts:6 \u00B7 packages/rspack/src/builtin-plugin/CompactHashedModuleIdsPlugin.ts:6 \u00B7 packages/rspack/src/builtin-plugin/DeterministicChunkIdsPlugin.ts:5 \u00B7 packages/rspack/src/builtin-plugin/DeterministicModuleIdsPlugin.ts:11 \u2014 the 4 copies are spread across 4 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":"packages/rspack/src/builtin-plugin/CompactHashedChunkIdsPlugin.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8594d21e6395ce1824abf1e9630b49a36a7d1275f06e4fa21a3488041c6b8fd5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/rspack/src/builtin-plugin/html-plugin/plugin.ts:114 \u00B7 packages/rspack/src/builtin-plugin/html-plugin/plugin.ts:145 \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":"packages/rspack/src/builtin-plugin/html-plugin/plugin.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad5088551c086e6b6bd25abe29b01f9ee0bcdf9b48099eb05d6f2810489b9d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/rspack/src/lib/cache/mergeEtags.ts:53 \u00B7 packages/rspack/src/lib/cache/mergeEtags.ts:67 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/lib/cache/mergeEtags.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"891ba287725f17fe60380d285df5e456feba48680ec47e363a9947d723291623"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/rspack/src/loader-runner/index.ts:585 \u00B7 packages/rspack/src/loader-runner/index.ts:601 \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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65f48fb22a7fbdac196f19d8d3f80dd427a27984deb7bd870a170bcf94387f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/rspack/src/loader-runner/worker.ts:322 \u00B7 packages/rspack/src/loader-runner/worker.ts:344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/loader-runner/worker.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b686f660c0f2ca0d4c2dce8510a9d2d15a2277727c6cb3ed58f7cd46780b806c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts:1075 \u00B7 packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts:1118 \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":"packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c108fc41eb32cdb520ef0c13c567f79d1e3147f788949143adbf9e030d5af27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/rspack/prebundle.config.js:17 \u00B7 packages/rspack/prebundle.config.js:51 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 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":"packages/rspack/prebundle.config.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"be58e6dc676dc93c522c7caea1da107e1420b26eba6cc730fc30afee6f1b812f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/rspack/src/builtin-plugin/HttpUriPlugin.ts:120 \u00B7 packages/rspack/src/builtin-plugin/HttpUriPlugin.ts:146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/builtin-plugin/HttpUriPlugin.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed022982c6390a35ce082d072ded5ad2ded5f8a09cfdb8eaf71b5f2c406256af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/rspack/src/container/ContainerReferencePlugin.ts:48 \u00B7 packages/rspack/src/container/ModuleFederationPlugin.ts:216 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 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":"packages/rspack/src/container/ContainerReferencePlugin.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"db422d96a7a5863e8a7fb889c23150520c47b6f2b15f9ba8034f1272661088da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/rspack/src/container/ModuleFederationManifestPlugin.ts:244 \u00B7 packages/rspack/src/container/ModuleFederationPlugin.ts:265 \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":"packages/rspack/src/container/ModuleFederationManifestPlugin.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e30e7be3ca88841b23ca99d9f58fb855f4a9db421de5bd827a6d33d27e03fc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/rspack/src/logging/createConsoleLogger.ts:143 \u00B7 packages/rspack/src/logging/createConsoleLogger.ts:171 \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":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb23beb75976e8c40399c1e75a8f26eb5e677a4456d5216d464ff4ae4922336"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/rspack/src/taps/compilation.ts:159 \u00B7 packages/rspack/src/taps/compilation.ts:172 \u00B7 packages/rspack/src/taps/compilation.ts:186 \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":"packages/rspack/src/taps/compilation.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2f276e2a66bdffed389f057e9145b427f9f4a592ca1cb541634708cdb6443d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/rspack/src/util/identifier.ts:181 \u00B7 packages/rspack/src/util/identifier.ts:223 \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":"packages/rspack/src/util/identifier.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c1b52cb8e1b2b464c7c6a6c5ab08b800faf01830270365ad50497aadf479ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/node_binding/scripts/build.mjs:25 \u00B7 crates/rspack_binding_builder_testing/scripts/build.mjs:15 \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":"crates/node_binding/scripts/build.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb1b8b99222940ad44dd812ce8cfbf10d8ce15ad5fc96b3f1168a7c11d94589"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/rspack/hot/poll.js:24 \u00B7 packages/rspack/hot/signal.js:38 \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":"packages/rspack/hot/poll.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0867b06f7c479d64fd9ff1fb5be99496e42b1ff4bcc0c8354891539349f476d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/rspack/src/MultiCompiler.ts:412 \u00B7 packages/rspack/src/MultiCompiler.ts:426 \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":"packages/rspack/src/MultiCompiler.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"52668a9d86d4b38cffa3ceb9e267519fa70dd0ba834f47c3f69a4fc5fabf3873"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/rspack/src/MultiStats.ts:81 \u00B7 packages/rspack/src/MultiStats.ts:145 \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":"packages/rspack/src/MultiStats.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b70f2549affd1bf5bac4a50e1f0ae1d9f324583b3a6fdebb103e69d068e7e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/rspack/src/NativeWatchFileSystem.ts:200 \u00B7 packages/rspack/src/node/NodeWatchFileSystem.ts:78 \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":"packages/rspack/src/NativeWatchFileSystem.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9b75c7ca440bc9ea87155dfa2d39e74e74049f2a2a588b942581f6d318bfa6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/rspack/src/Watching.ts:229 \u00B7 packages/rspack/src/Watching.ts:248 \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":"packages/rspack/src/Watching.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78a7da2bcfcc01df7d3af14ab600eb71f8229bc2001c53cf3b204727d116be2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/rspack/src/node/NodeWatchFileSystem.ts:281 \u00B7 packages/rspack/src/node/NodeWatchFileSystem.ts:301 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \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":"packages/rspack/src/node/NodeWatchFileSystem.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef74c7cff9d2192dd9510650a945477ca40605fb6ad5c90d98275a1fb6c6f90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts:1532 \u00B7 packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts:1546 \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":"packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cadfb4a7e8b436db8954ec086c96248a472afbc4ed9e0719a6449874c11250"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts:218 \u00B7 packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f303281ca0dfc6e6690dee8c4a15f911d2cac467440312711ab23132cca67a43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/rspack/src/builtin-plugin/SplitChunksPlugin.ts:176 \u00B7 packages/rspack/src/builtin-plugin/SplitChunksPlugin.ts:192 \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":"packages/rspack/src/builtin-plugin/SplitChunksPlugin.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8a14a076e07a357f31a0ef2705cb201c4fe9c96a251ff1dfc127df31bdbf9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/rspack/src/lib/cache/getLazyHashedEtag.ts:71 \u00B7 packages/rspack/src/lib/cache/getLazyHashedEtag.ts:80 \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":"packages/rspack/src/lib/cache/getLazyHashedEtag.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e887adac5316e1c7fa86b40ab83ebe9e7bf4d8a0bf155f4df36a529fa9c3af6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/rspack/src/stats/statsFactoryUtils.ts:710 \u00B7 packages/rspack/src/stats/statsFactoryUtils.ts:720 \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":"packages/rspack/src/stats/statsFactoryUtils.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"9060595d33b2b511408426f293958c55fbb05400baa5fb3af6521e09f5140713"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/rspack/src/util/cleverMerge.ts:52 \u00B7 packages/rspack/src/util/cleverMerge.ts:236 \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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6569c778ad263f4abf8ce8910ade36161e547b5fa72ff7b5aee3d96ddc9e99ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/rspack/src/FileSystem.ts:282 \u00B7 packages/rspack/src/FileSystem.ts:302 \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":"packages/rspack/src/FileSystem.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1acd27f675966b63b561a1fb5dd294b5eea0c8b4aec442bbc78aedc3eb0ab5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/rspack/src/lib/cache/MemoryCachePlugin.ts:13 \u00B7 packages/rspack/src/lib/cache/MemoryCachePlugin.ts:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"packages/rspack/src/lib/cache/MemoryCachePlugin.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2babd6ee5156353e2f8d1939be75e8d1f591766117d090fc539b7c04eecb070"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/rspack/src/logging/Logger.ts:122 \u00B7 packages/rspack/src/logging/Logger.ts:131 \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":"packages/rspack/src/logging/Logger.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b3130020d8597c08cdf2c9b6dc025a69409fa548ac0a45eddeb65b83dba56c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/rspack/src/builtin-plugin/css-extract/index.ts:84 \u00B7 packages/rspack/src/config/defaults.ts:854 \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":"packages/rspack/src/builtin-plugin/css-extract/index.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9240c27df0d2edb09323011da1673de60a0bab3efad0c98ee87e0894c1d083"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/rspack/src/lib/CacheFacade.ts:106 \u00B7 packages/rspack/src/lib/CacheFacade.ts:276 \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":"packages/rspack/src/lib/CacheFacade.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"12be068573fea20ed550cf73eeab2f1a8f9fa0ec658646b5315437b8155186af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/rspack/src/loader-runner/ModuleError.ts:28 \u00B7 packages/rspack/src/loader-runner/ModuleError.ts:39 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/loader-runner/ModuleError.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0980017a826af63d98c16d638bbce8627abff0e67da130c8fe263db962879aac"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: crates/node_binding/scripts/build.mjs:5 reaches into another package with a relative path (../../../scripts/allocative-driver.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/scripts/build.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d230e6f73407d6cf615858e8e2bee4158d4a233258e1e39076f058eccf05943f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/rspack/src/node/NodeEnvironmentPlugin.ts:12 imports enhanced-resolve/lib/CachedInputFileSystem, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/node/NodeEnvironmentPlugin.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5613e98e5efcac9cff0fd46790458e032173a7d04935a2c988e002e37ac111c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getGraphemeBreakProperty (cyclomatic 2120, cognitive 1507): getGraphemeBreakProperty has cyclomatic complexity 2120 and cognitive complexity 1507; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"tests/rspack-test/normalCases/parsing/evaluate-binary/deep.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a460c001ebd6a08a2106051772bd10ed006e4bb3c07491ec16727334909b8a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function process (cyclomatic 90, cognitive 101): process has cyclomatic complexity 90 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/rspackOptionsApply.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccffdd79b87b56926527b4e745afe5b8035c13d92224266008bcf70231e9fed1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _createToolbarTable (cyclomatic 82, cognitive 142): _createToolbarTable has cyclomatic complexity 82 and cognitive complexity 142; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/rspack-test/configCases/inner-graph/issue-11678/module.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6d67e2333af6e2d8312cf2a5979d0d21c004f5d9b0f1713318a7eb131dbd7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveToUnqualified (cyclomatic 54, cognitive 161): resolveToUnqualified has cyclomatic complexity 54 and cognitive complexity 161; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":10134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1b3e022d5d6774c53558e2f2721af2bbe9cffe20c7839cd9afbdbd89b27be0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveToUnqualified (cyclomatic 54, cognitive 161): resolveToUnqualified has cyclomatic complexity 54 and cognitive complexity 161; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":10134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8247f55f9a2770eaeb2f289958d5c8809ff44f0b7557869271302da014a14ad0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 51, cognitive 69): (anonymous) has cyclomatic complexity 51 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/logging/createConsoleLogger.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c03b5850df6ed46db2605938bd2d14e641df918293e11e7f4aa0a4db3678c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _ (cyclomatic 45, cognitive 104): _ has cyclomatic complexity 45 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":"packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f11d9ef95bd8511e738460010e306faed4917b63e2484325a4651a0e5e13151"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 43, cognitive 53): build has cyclomatic complexity 43 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":"tests/rspack-test/compilerCases/hmr-in-flight-chunks/test.config.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1cff4f8c65eba3505277c2fd28655c01dd8a25df69687275f651222d6bb502"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldBreak (cyclomatic 43, cognitive 42): shouldBreak has cyclomatic complexity 43 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 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":"tests/rspack-test/normalCases/parsing/evaluate-binary/deep.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2824f5af18782e1572f36f526cb2a5e275a29c92c184348f83208d2840bb5b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arg (cyclomatic 40, cognitive 81): arg has cyclomatic complexity 40 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":9545}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef5066d4c3e9f77d7e4e8a19ddb1ca934da198e4f9c7558159d57f9b824712e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arg (cyclomatic 40, cognitive 81): arg has cyclomatic complexity 40 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":9545}}}],"partialFingerprints":{"codehealthFindingId/v1":"23317e24be941826bee5c0ec5af074067bb867374f7c5a2d7d0d3b656af4af55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runLoaders (cyclomatic 39, cognitive 70): runLoaders has cyclomatic complexity 39 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ac4c7ddbee8db2ef5c774b1c459682ce4ecce063bc1a86192336ec0e85d725"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 39, cognitive 50): (anonymous) has cyclomatic complexity 39 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":"crates/node_binding/scripts/build.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"05961dcf09766f86af3391caaad9d92a25bc2cf93a7d30e933b1c2ad202b3e17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _showFormButtons (cyclomatic 39, cognitive 49): _showFormButtons has cyclomatic complexity 39 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":"tests/rspack-test/configCases/inner-graph/issue-11678/module.js"},"region":{"startLine":2703}}}],"partialFingerprints":{"codehealthFindingId/v1":"631e28032b7300a0b3aa90c9e6d3ed4627f34d743859884a78c8382a5dc7caff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 37, cognitive 98): build has cyclomatic complexity 37 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/rspack-test/compilerCases/hmr-removed-runtime-cache/test.config.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd07bd802c94864fa54a89df0e77f9600dc1253f1ce137345c912c12920db85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 42): (anonymous) has cyclomatic complexity 37 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":"packages/rspack-cli/src/commands/serve.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64670bf9ed249486fd75172d97da1751baba98bd45f2b7b415aec109c933e6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 35): (anonymous) has cyclomatic complexity 36 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 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":"tests/rspack-test/configCases/chunks/available-modules/rspack.config.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"423e4236798439646b72349c21e47b6eca70fc3a37709f3f4d3a1a9b6ebc1382"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 76): (anonymous) has cyclomatic complexity 34 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/util/smartGrouping.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f18327e5ca131964178e9f423c2837ee477e052aa98adf6d995e002c82fe87d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compilation.summary! (cyclomatic 34, cognitive 29): compilation.summary! has cyclomatic complexity 34 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 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":"packages/rspack/src/stats/DefaultStatsPrinterPlugin.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47e73a457b93490490ba3c9d45b5003c3318a2255b0420fecdd0597aa45afa3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resolveFilename (cyclomatic 30, cognitive 49): _resolveFilename has cyclomatic complexity 30 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":8772}}}],"partialFingerprints":{"codehealthFindingId/v1":"184375d62574039f2577f20e166e0de46d7b24f257a61db8bed4d0982a88aa87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resolveFilename (cyclomatic 30, cognitive 49): _resolveFilename has cyclomatic complexity 30 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":8772}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1b9869135addfec754ea5a68b5190189f3f095d19f4b143f84d32fbd841753"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 29): (anonymous) has cyclomatic complexity 30 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 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":"packages/rspack/src/config/adapter.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4379fd749100916023fe28443c5b4ce12a4b38c136afea80e119c944b0770b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSourceMap (cyclomatic 28, cognitive 54): checkSourceMap has cyclomatic complexity 28 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":"packages/rspack-test-tools/src/helper/util/checkSourceMap.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93aa18c31f945f931be7ddbfca42a82344404fd65bc221ec1548cb112cb6542"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toMatchFileSnapshotSync (cyclomatic 28, cognitive 35): toMatchFileSnapshotSync has cyclomatic complexity 28 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":"packages/rspack-test-tools/src/helper/expect/to-match-file-snapshot.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4214b7d700ddab616fe9c65f12bd585920f05a2b6818c8445a9da6afd2b14fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 26, cognitive 37): open has cyclomatic complexity 26 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":6865}}}],"partialFingerprints":{"codehealthFindingId/v1":"f332e7714544f93bdf0833ebd1356983a466229426d51d1b846e4d16cf45824f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 26, cognitive 37): open has cyclomatic complexity 26 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":6865}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab4e90de9d863d154f30a6127b996b567f972b9bdc1788536df724b04c780ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function areStatsEqual (cyclomatic 26, cognitive 25): areStatsEqual has cyclomatic complexity 26 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 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5474d51129142cd654c88d5ab0493aff6d7626f0385b14d9a2a73d01b9b380"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function areStatsEqual (cyclomatic 26, cognitive 25): areStatsEqual has cyclomatic complexity 26 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 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36727d818c847cb143a4a7fc517d00f23f44264ebfec073b0f26e2cf81d8bb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 25, cognitive 43): build has cyclomatic complexity 25 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":"tests/rspack-test/compilerCases/hmr-stale-module-cache/test.config.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"42817e7c4964982d22fcc7bd4c3574fd8295d5358b9bbfee93399e6e47d5b5db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 64): (anonymous) has cyclomatic complexity 24 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":"packages/rspack/src/config/target.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"40654d34047b6805d166047fbc0cdeb47788bfb136dfac85b63fc03b12bf86fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkArrayExpectation (cyclomatic 23, cognitive 61): checkArrayExpectation 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":"packages/rspack-test-tools/src/helper/legacy/checkArrayExpectation.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafb6a072af9e8da8c5e4d8a4d8caf8923e9756752e23143048e272d4e1f3719"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 40): (anonymous) has cyclomatic complexity 23 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":"tests/rspack-test/configCases/hooks/original-source/rspack.config.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0126b8c704162d9294ecf313509d57da56e838be43560efd1b83153972022684"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 38): (anonymous) has cyclomatic complexity 23 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":"packages/rspack/src/builtin-plugin/html-plugin/plugin.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb059816da97c5839e2f4cb842a942b68056d481493343d9158b901413001502"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function internalBuildConfig (cyclomatic 23, cognitive 27): internalBuildConfig has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack-cli/src/cli.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bb412916a08936e6dfb3c331a644eb27b53d398e25489654b07805fcd6025c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 26): (anonymous) 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9df237fb3d498ab087b3f842d94b2531bcac2e757d1535124fe808cf1c02e08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 26): (anonymous) 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d090ad8cc758c56dae78184f2ca452586ffbc7fe4ea05bd60f3dfb558d11f26f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ___sys_ioctl (cyclomatic 23, cognitive 17): ___sys_ioctl has cyclomatic complexity 23 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 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":7934}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f05d03305ac06a7830f4f221bcd056ce1cfceebdc4cd9fb6c96343c2ee147c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ___sys_ioctl (cyclomatic 23, cognitive 17): ___sys_ioctl has cyclomatic complexity 23 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 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":7934}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d72913c704f8760a67e059e99da12793f47ff02bf37488d507b2bc8ff25038b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 54): (anonymous) has cyclomatic complexity 22 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":"packages/rspack/src/stats/statsFactoryUtils.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f549ae849a0c21ff81debb4d595ac7b5c44764a682c108ed6db7d7f644e7bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rename (cyclomatic 22, cognitive 22): rename has cyclomatic complexity 22 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":6590}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f17c7c4b8e19aa7cf4c3aaa160527e0fc2dbd3d52634b317f0986d766679a4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rename (cyclomatic 22, cognitive 22): rename has cyclomatic complexity 22 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":6590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a417bdf392a91ce807622661874f7ea03c6c3e14c429c96df745f502c6ef5d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeAllMappings (cyclomatic 21, cognitive 31): decodeAllMappings 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":"tests/rspack-test/configCases/css/source-map-export-types/index.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd16064fcb22ac883ea3447820d04a5c6c24e197dfc337745b6349f2a3d059e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loaderImpl (cyclomatic 20, cognitive 42): loaderImpl has cyclomatic complexity 20 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":"packages/rspack/src/loader-runner/worker.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fe000e4345d0504b0bc1d1c3a59aacc2083e80659b8b3fd2fdf6dc42cffeca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePackageTarget (cyclomatic 20, cognitive 40): resolvePackageTarget has cyclomatic complexity 20 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":9240}}}],"partialFingerprints":{"codehealthFindingId/v1":"037dbc752912a65bc09120ea1db92a2d004973ec7e0ecb7e63b967f25990354f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePackageTarget (cyclomatic 20, cognitive 40): resolvePackageTarget has cyclomatic complexity 20 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":9240}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f205318161cf8f87581e70bf305e2ac79f281428f4371b3f8409875ff408eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 19): (anonymous) has cyclomatic complexity 20 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 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":"tests/rspack-test/configCases/build-http/integrity/rspack.config.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"211566ea52dc3019465701baaaff5df80409a8587eb5afc3a9f7e054d8c4824e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 19): (anonymous) has cyclomatic complexity 20 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 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":"tests/rspack-test/normalCases/parsing/rspack-issue-4816/index.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce865901f317a33fc73fc60eef45941bc4fd191a1b3e841d6127e8cc5512e81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 19): (anonymous) has cyclomatic complexity 20 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 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":"tests/rspack-test/rstack.config.mts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b4cc9375c004edef4c5fd5ac6612df22614f34d1f32f77b8afc65b7005aa3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 19, cognitive 47): build has cyclomatic complexity 19 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":"tests/rspack-test/compilerCases/hmr-complete-chunk-apply/test.config.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"18269191fa03e6778bd72fc93c21d0efa2ed8317fc6d1e3618e31990a1d3bc91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 19, cognitive 32): constructor has cyclomatic complexity 19 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"28860c102eb1c9fcc9d301be6df46b404f677d42b0f1a8f57860f28204ac4c47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 19, cognitive 32): constructor has cyclomatic complexity 19 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"7811b2c62d5ea79766eebd8a016c7abf7f6dff687238052f9329f7c3c9c27c0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadExtendedConfig (cyclomatic 19, cognitive 30): loadExtendedConfig 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":"packages/rspack-cli/src/utils/loadConfig.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8540a4f7b0b1244c006bb80b2e74e477a9531b002cb7f20367c56016457253"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 19, cognitive 30): check 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":"packages/rspack-test-tools/src/case/watch.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ff411da286679b8982756eb20c93661b56d568338351bf5ccd66a4ae39f3ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 19, cognitive 23): run 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":"tests/rspack-test/compilerCases/native-watcher-concrete-events.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b23395fc24f87a56e0c9bbbdd862e11c246a898faae37675d55ddbe00a4a2b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 19): (anonymous) has cyclomatic complexity 19 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/rspack-test/configCases/node/output-module-external/import.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4025d6ca2a74e8886bbe06cec17b831b2a5d8719f106e703ee25dea793afe488"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyExternalsPresetsDefaults (cyclomatic 19, cognitive 14): applyExternalsPresetsDefaults 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":"packages/rspack/src/config/defaults.ts"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdedac6f5ea253c140f09fe2f22d8dcc3b89198c76104fb496071db991fe6df6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDataAndShowTable (cyclomatic 19, cognitive 14): getDataAndShowTable 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":"tests/rspack-test/configCases/inner-graph/issue-11678/module.js"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"5395c272834b188204d99601f190214cb8250fa5e3fe19b0259131b9308687f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packageImportsResolve (cyclomatic 18, cognitive 43): packageImportsResolve has cyclomatic complexity 18 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":9464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5454f9be43e1b36065a2db96492b5c8f8a4b973c99b6ffd6b3a1a54e3c488dc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packageImportsResolve (cyclomatic 18, cognitive 43): packageImportsResolve has cyclomatic complexity 18 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":9464}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b92b1f64d5a42c97401b710e406b408653dff4d2cf0ae8c1855147a1dcb969f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function version_handler (cyclomatic 18, cognitive 30): version_handler has cyclomatic complexity 18 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":"scripts/release/version.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d44f9b8f1ce62896c9a3e19f9d7982dab7361c58e052561a711fcb4d851652f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyNodeExtensionResolution (cyclomatic 18, cognitive 26): applyNodeExtensionResolution 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":9981}}}],"partialFingerprints":{"codehealthFindingId/v1":"900d8bf438b89be5c50cff10dc7cc5ac56cdcf819d0e845627689d6c32219db8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyNodeExtensionResolution (cyclomatic 18, cognitive 26): applyNodeExtensionResolution 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":9981}}}],"partialFingerprints":{"codehealthFindingId/v1":"48aaafa5b7ce5e469cc3df9633016e015ceb714def8d025bbd807bda0a4d40ce"}},{"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":"tests/rspack-test/configCases/plugins/progress-plugin/rspack.config.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4487eea4dd4c1c30620df503e3b33752c9e251219b64d18390f9abad9f794520"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 18, cognitive 20): run has cyclomatic complexity 18 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":"tests/rspack-test/compilerCases/native-watcher-nested-context-removal.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d3b1ab2e5793397c72da53f0a67c6d6628eaefc271e7faec55937c629a2221"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveFilename (cyclomatic 17, cognitive 27): resolveFilename 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b42aad971d28a7293471e910c5c31c9ead78701417d77caf765699f823e454"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookupPath (cyclomatic 17, cognitive 27): lookupPath 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":6107}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e98d8eb928e64563710d5c1b3df2945e1a721917cc6dec558e14c5b9d13951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveFilename (cyclomatic 17, cognitive 27): resolveFilename 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8128872f30a39988aa92f7a645c791a44e5bd9e4c94f50025495166e57ec32b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookupPath (cyclomatic 17, cognitive 27): lookupPath 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":6107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f42003fbfd9b85c25ae7c9023c2ce0545b6edf7d2bf562d898114ed6ddb2c51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeSingleValue (cyclomatic 17, cognitive 26): mergeSingleValue has cyclomatic complexity 17 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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3994c4c1616db7f8c0bc7e40cdd4fc767eb8e99242cadb9b4c879878936459eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findApiPathFor (cyclomatic 17, cognitive 25): findApiPathFor 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":10575}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8f5ec42ab3ad6903b07a31077ee1fca35c5cb460a4327d1234161466046e7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findApiPathFor (cyclomatic 17, cognitive 25): findApiPathFor 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":10575}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d3f6f6e8b1849b4e6f0184c9c863e8532808187cca40bebeade1eeaf4b43d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toJson (cyclomatic 17, cognitive 24): toJson 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":"packages/rspack/src/MultiStats.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d904cb3c45631ba1150d1357e6fcdd2035f4c252410295bf51a9c77207acd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 24): (anonymous) 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":"tests/rspack-test/configCases/module/consume-webpack-runtime/index.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e89ebd1f93c76d7a252e033fe70cad91091223dd871d8ee55637f739296f4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePackageTargetString (cyclomatic 17, cognitive 24): resolvePackageTargetString 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":9193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d8e1b5c66162cc9918527ab5da9f6591aff5f6c04e6136e3432de41827449b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePackageTargetString (cyclomatic 17, cognitive 24): resolvePackageTargetString 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":9193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f11a498b7f660833cab7812b202e81bfb377e1553c895d963cff51f49d0cc44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeOptions (cyclomatic 17, cognitive 19): normalizeOptions 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":"packages/rspack/src/builtin-plugin/css-extract/index.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d13f91f5577520a76db15ce10f01f737ad361e572aeb473d8cb678ead5d56c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 17, cognitive 18): check 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":"packages/rspack-test-tools/src/case/stats-output.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57145b1f2d195e3b628f2dfe21a1090bebf79930c4f2647029df3f7af25c76e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 17): (anonymous) 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":"packages/rspack-test-tools/src/runner/node/index.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7830a910793c580d3d58abb6e0e46a5183ead4f5a3d591706da521299bca40c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \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":"packages/rspack/src/stats/DefaultStatsPrinterPlugin.ts"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ad3afdfafa8db723e7240f8d9f0509d04bf4b585d805f8fb28b50ffe2bfe7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 24): (anonymous) 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":"packages/rspack/src/config/defaults.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c3ac37b5d2068eafa67c64601adf8d3cf859a8cf53d7cf0521a989e1d905f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 16, cognitive 24): check 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":"tests/rspack-test/statsAPICases/numeric-chunk-ids.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfc31b7f0ebe48682ce829fd17412a60d9d416232ab8ea087375d69390a67be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packageExportsResolve (cyclomatic 16, cognitive 22): packageExportsResolve 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":9392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f5d434eaec4036e4a01b231e08876aadf424c497ba7672ff847807edf5f0ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packageExportsResolve (cyclomatic 16, cognitive 22): packageExportsResolve 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":9392}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d0143df0b8842768cff1814966801a9141def1d17bbf43c1138dde4033611a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 16, cognitive 21): run 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":"tests/rspack-test/compilerCases/native-watcher-rename-aggregation.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04551ca8ead88906f1d6b93f67f68e14dce47ab7df366ff42eb5e539d4ab2d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 18): (anonymous) has cyclomatic complexity 16 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":"tests/rspack-test/statsOutputCases/track-returned/index.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c982e6cfbf4aa09dc85ff53358a522cccbcb4ff6921daab68437519822a3b6a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) 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":"packages/rspack/src/builtin-plugin/LightningCssMinimizerRspackPlugin.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2ed37f91184b21f26e345c1ece9ee030eb1f6a999ee2e69a7b6b473b377078"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPersistentCache (cyclomatic 15, cognitive 31): checkPersistentCache has cyclomatic complexity 15 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":"packages/rspack-test-tools/src/helper/cache.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a37c041b1974b92b6ff910b8accec14cecc3538e62d039c70fcc6c3fd8f8b13"}},{"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":"packages/rspack/src/stats/DefaultStatsPrinterPlugin.ts"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d027ffa1de8dce150948d1bf1be3d23a496033226368a94f6096c865da2ca9a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleExports (cyclomatic 15, cognitive 21): handleExports 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":"packages/rspack/src/builtin-plugin/css-extract/loader.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c150fc760d519152e4d59b920a71910ed8b7b4bae650dacfd65e34c54fa40ba7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getResolveDefaults (cyclomatic 15, cognitive 18): getResolveDefaults 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":"packages/rspack/src/config/defaults.ts"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac6991b1c7fa2f4ae2e37a6c00bd6d9d5073a86363b9eb21773d2f82b00f479"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveStringifyLoaders (cyclomatic 15, cognitive 17): resolveStringifyLoaders 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":"packages/rspack/src/config/adapterRuleUse.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9127a30bc911213d14dd2db3c03ec7e22f3cc898a9a7acd91ea790aa719ae4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyImpl (cyclomatic 15, cognitive 16): copyImpl 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a900042f24d6b2fd19f40536cacbaacfdf712aeb47da17552a002ba3c3dbbe0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyImpl (cyclomatic 15, cognitive 16): copyImpl 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9164db888ffe1f6d8bea82640c24875e87fcb034c8146ca372ae7f57b1bd380"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function watch (cyclomatic 15, cognitive 14): watch 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":"packages/rspack/src/node/NodeWatchFileSystem.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3a46910186f96e68c4b97c2855014a43199c20cbaf64624121c7e4096d2901"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function write (cyclomatic 15, cognitive 14): write 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":7027}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b7f541b82c67a3585121147e83d62daefe952f178fee49e1cf11cf4349257d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function write (cyclomatic 15, cognitive 14): write 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":7027}}}],"partialFingerprints":{"codehealthFindingId/v1":"217311299ca0e7f719fc07d5ee82152b0832bb14cfeb966e006baa34d3345011"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) 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":"tests/rspack-test/normalCases/parsing/evaluate/index.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6bd25ac3518cff7efd176116c4c335f5e1af63d6fefc58bd84542eb69a29e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) 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":"tests/rspack-test/normalCases/parsing/typeof-api/index.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"77592f62e45c00a816cc980b3ce657b3eab34bd5df474cef6c985a9747ddb2cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function errorsSpaceLimit (cyclomatic 14, cognitive 35): errorsSpaceLimit has cyclomatic complexity 14 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":"packages/rspack/src/stats/statsFactoryUtils.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"49160778bcf3fe1b350146198b5c817080dcb0432b1042be2822cad5fdc7d6f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSwcLoaderOptions (cyclomatic 14, cognitive 24): getSwcLoaderOptions 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":"packages/rspack/src/builtin-loader/swc/index.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"274e960d76d8f6466782f4c1556a5fb23388231b21850d7802eb9b6f7f8b9852"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 23): (anonymous) 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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afa146ae10a4d1fb455d1aefeab3cdb76ff50b816f8bb9d27ac762a9efea108"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchStepSnapshot (cyclomatic 14, cognitive 22): matchStepSnapshot 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":"packages/rspack-test-tools/src/case/hot-step.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3880782245051038dbf461e17c600f971d9a195ea5c78dee8e24b24fae469db7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 14, cognitive 20): check 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":"packages/rspack-test-tools/src/case/common.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"592ccb812a5a6e2150005fd5cc9117ce3a804789c2799d08fff46ca472f2efeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 20): (anonymous) 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":"packages/rspack/src/config/defaults.ts"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd07a7dc64658ffd177abb92e1a8222dbb9e366bc994dd74263705a017bf9a32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/rspack-test/configCases/asset/structured-source-binding/rspack.config.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7253e337254452f6cf5ae6ff1b085fe1374777a733a5396413715b4016cfe7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 14, cognitive 16): run 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":"packages/rspack-test-tools/src/case/common.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7428e2e10247da48dbd1efebb55f9e5bbd79572de44e72bf10ab3816978ea74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getLightningcssLoaderOptions (cyclomatic 14, cognitive 16): getLightningcssLoaderOptions 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":"packages/rspack/src/builtin-loader/lightningcss/index.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcad839d8491515fd8c4e42a920e6284a84c729f431f5f24b228efba62a1bfbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processTag (cyclomatic 14, cognitive 16): processTag 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":"packages/rspack/src/builtin-plugin/SubresourceIntegrityPlugin.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a81257bb5ccb7ab51ce0ec0a9ecd81c25ae6fa4dafa2a0a48b6818007ec81b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 16): constructor 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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83e2d5fa29191ad7f96be18610ff167609f2d5f5a53dac402624009ed4cb6f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) 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/rspack-test/configCases/build-http/integrity/rspack.config.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad33cbb4cfd54b44545bbfe54074cd1a413175be2607578d6ba2781d24727727"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) 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/rspack-test/configCases/split-chunks/intersections-min-size/rspack.config.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d6bce3e5ffe86bfd6b1097ade2e983452a5957d130c7b7233b1504464660b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRspackOptionsDefaults (cyclomatic 14, cognitive 14): applyRspackOptionsDefaults 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":"packages/rspack/src/config/defaults.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c57e9f8ab37dcada61e85276ef23df8614f1f6c12fd4da525fb8b3695194fa0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __writeCrashReport (cyclomatic 14, cognitive 13): __writeCrashReport 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":"crates/node_binding/wasi-worker.mjs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d050212e31b14eba1bcd89f044a3c733781bf879fb2b6558bcb786f19e8414"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _ (cyclomatic 14, cognitive 13): _ 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":"packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edfaf7aab5c9ee6f856d4fe65f7de9f0aa2037107c1b6cd0399350ea8d06315"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createConfig (cyclomatic 14, cognitive 13): createConfig 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":"tests/rspack-test/configCases/split-chunks/named-used-exports-dedup/rspack.config.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"173686ca788ace077b5dd276a4a1cfa0414ec95b155a19da0821bb5ac0493285"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 51): (anonymous) has cyclomatic complexity 13 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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d1fae149ace9bd8d2b7fcaa568a84357eba04c6877df0fb9b13e632e47ab30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadLoader (cyclomatic 13, cognitive 23): loadLoader 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":"packages/rspack/src/loader-runner/loadLoader.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a122ae852681b7910268ab8b435906929c51d1ff55a2ba57722b1231be28e422"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _bindPluginsAfterFormRender (cyclomatic 13, cognitive 23): _bindPluginsAfterFormRender 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":"tests/rspack-test/configCases/inner-graph/issue-11678/module.js"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"158f3a6a64df3fcd51b6a08fd154c9409b200815900dd62d75c8bb66c9aafea5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serializeObject (cyclomatic 13, cognitive 22): serializeObject 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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea54698b746b8feaae80cb5a2b66f3effa54de0b97d3b2f68518ef93e6a03c0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createCompilerCase (cyclomatic 13, cognitive 21): createCompilerCase 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":"packages/rspack-test-tools/src/case/compiler.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"42598f49a4f64f70e262cb6cefc6a5dcd313ada1f5b1717edbd4003c2a11ae14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) 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":"packages/rspack/src/Compilation.ts"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af34077b6dc6eb5d9b4155d4504556f731c4b2e1332d582a31843b27b55a8d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 13, cognitive 18): run 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":"tests/rspack-test/compilerCases/native-watcher-context-removal.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a1e97f31835c39bb1b4209861c0c38c71fd2a2a4d838ff25e4cd19afa3bae5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function concatenation (cyclomatic 13, cognitive 16): concatenation has cyclomatic complexity 13 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":"packages/rspack/src/RuntimeTemplate.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"693679eec3a1b43cbacafa0227ee45da181bbf9f1bd8b49385ead662c6c0b11c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processQueueWorker (cyclomatic 13, cognitive 15): processQueueWorker 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":"packages/rspack/src/MultiCompiler.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"b868d4af34e3e9d8d8ecac1db2648d690caec6912efc18907fd94b5dfeb77739"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRawGeneratorOptions (cyclomatic 13, cognitive 15): getRawGeneratorOptions 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":"packages/rspack/src/config/adapter.ts"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"50baf12b7a0a835b248cd0b277b17c2e4c3e4e62d4ba89a156baca5ef3cab5f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function write (cyclomatic 13, cognitive 15): write 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":5330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43ee9688cb8e76474e96bd58d6ac5df057be20c406810020b29ffe49d96cba1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trace (cyclomatic 13, cognitive 15): trace 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":9857}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ef2b48327aa88bd478ab1eff5e83b664d6428a1526a1a71f73b415336205bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function write (cyclomatic 13, cognitive 15): write 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":5330}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5d2454cf4095e0861e8013d0cfb604926e8904a5655d41b489933145442b96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trace (cyclomatic 13, cognitive 15): trace 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":9857}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad7ed447e5fb7da3e96cd4088afcc4aaf340ba45278d011f81743af9eb4818e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOutputDefaults (cyclomatic 13, cognitive 13): applyOutputDefaults 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":"packages/rspack/src/config/defaults.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3c4ccd4f9c11d20bdc175eead867402c6ea949da507af6a8e17d513790f979"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function limitOpenFiles (cyclomatic 13, cognitive 13): limitOpenFiles 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":3745}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b3773dd5f44383efb52031ce4781874114d2703b2f6a6d15441836d997e828"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPackageConfig (cyclomatic 13, cognitive 13): getPackageConfig 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":9044}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f877fcec040fb9739428bdcb8f8d0bd73bec947f2feac6852b16ddf9b2af8c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function limitOpenFiles (cyclomatic 13, cognitive 13): limitOpenFiles 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":3745}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c64cd7d1debaf10951ad725085000554fbeabf5f61894ae4f94b199bbc48d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPackageConfig (cyclomatic 13, cognitive 13): getPackageConfig 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":9044}}}],"partialFingerprints":{"codehealthFindingId/v1":"07199737d4f5a9eadcdb05a2f1f1cd6c8c168d1855a26fe33875d47e3c1aa9fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) 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":"tests/rspack-test/hotCases/make/issue-10915/rspack.config.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"516aec13c1f926d7cc9bd537f1a615d23b413031080b848cd10342a5858a9b03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function watch (cyclomatic 13, cognitive 12): watch 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":"packages/rspack/src/NativeWatchFileSystem.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d60c93c75241529b089a3fde4db947ef6d25e38cc55e8a65fe40407ff7dfd0"}},{"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":"packages/rspack/src/config/target.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b651aed9ffe92d7fbdd5ff2406504998645094749c12a24815722e46e8201ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _setCostsButton (cyclomatic 13, cognitive 9): _setCostsButton 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":"tests/rspack-test/configCases/inner-graph/issue-11678/module.js"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"7560fd509c7a8fbcbcd60f710523422926f8e1216f7666ae269f1127638de011"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findZip (cyclomatic 12, cognitive 26): findZip has cyclomatic complexity 12 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":3706}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1c70fb576b102b4c31b6617bcd688b93ef7fe654f2df7f3e4b4aea5bdf1f58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findZip (cyclomatic 12, cognitive 26): findZip has cyclomatic complexity 12 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":3706}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f08c0a0490f9a8b9a12d1ab4e2054c9af7cb8bd3f42ba60e732fd5ca294d8d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 24): (anonymous) has cyclomatic complexity 12 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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"137184e016f689c3d0874fea9c29fba3a4dede7ce7627310567dec33ce8aeec7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _updateWithShortString (cyclomatic 12, cognitive 23): _updateWithShortString has cyclomatic complexity 12 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":"packages/rspack/src/util/hash/wasm-hash.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccdd37478c27511c0bff50101a99b4c026409888bd644f152dff8485a921885"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stringToUTF8Array (cyclomatic 12, cognitive 22): stringToUTF8Array 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":4538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75a50490f3f2c7fa355e09f58c2a4715cdc7b14f3ecbfc60d5d2065178dc9dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stringToUTF8Array (cyclomatic 12, cognitive 22): stringToUTF8Array 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":4538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f516d7fbb2ef90f0f7c7cd991df5a678399453df3ad9e6936152695bb4c1635c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSyncOrAsync (cyclomatic 12, cognitive 19): runSyncOrAsync 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":"packages/rspack/src/loader-runner/utils.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceafc6e08c9efb2d3fe3f0e48ba065e049b41e5fc06eb1058e0ac340a89bfa57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 18): (anonymous) 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":"packages/rspack/src/logging/truncateArgs.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ece8067fd3844da81b08f7a1dfd54164b191a68875ef34c3c9a214d13bda080"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _showParentTable (cyclomatic 12, cognitive 18): _showParentTable 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":"tests/rspack-test/configCases/inner-graph/issue-11678/module.js"},"region":{"startLine":2972}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec738b05ff54cfbf8960580eb19f1905fae7add74bbe7ec8b7fe800f4d576ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getKeys (cyclomatic 12, cognitive 17): getKeys 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":"packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"8307e4fb5d5eb4d074867e548c19f7828a87b0c09439080b56e89eb47a7347d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _findPath (cyclomatic 12, cognitive 16): _findPath 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":8850}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c360e7202284fe9ad862363408f3d905dcb72897c0964f99f87290f60460cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _findPath (cyclomatic 12, cognitive 16): _findPath 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":8850}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaae76bb32db6588c9d772d672d7289551c68f7afbb852ab17b493a976ea384"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSnapshot (cyclomatic 12, cognitive 14): checkSnapshot 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":"packages/rspack-test-tools/src/case/common.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fb06a94d8ff6a5e40f61c4e2c0341fcd1db23961f93cd51a3ff36d5d5f093d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) 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":"packages/rspack-test-tools/src/case/hot-step.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8a72e8d00909227ca6da124f4b9ee0d1973ae7d1fe41765f12b354e23f2717"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) 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":"packages/rspack/src/runtime/moduleFederationDefaultRuntime.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e0a7eafeb25b5c5d91a98d32e8f6f49b5dff830f34f8304f23c0e73c68e53e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyLimits (cyclomatic 12, cognitive 13): applyLimits 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":"packages/rspack/src/builtin-plugin/EsmLibraryPlugin.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f4373f570fa3340e4cc06a835d45ad5b007c5fa3e0b48e360543e3d8671716"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTagSrc (cyclomatic 12, cognitive 12): getTagSrc 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":"packages/rspack/src/builtin-plugin/SubresourceIntegrityPlugin.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7b9a7c3fc6d7208c440b19a20d9593e3638cf393904f0b94783cf39254d5fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pitch (cyclomatic 12, cognitive 12): pitch 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":"packages/rspack/src/builtin-plugin/css-extract/loader.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e58494c01e56e6a5a03cf14da31a9efd84b61ab724515665ea7d95ad155a01a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) 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":"packages/rspack/src/config/target.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"193bda1d1579dacc8d360028de9b7d4f7a0d114d940e57a2805cf8122347cf1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function overrideOptions (cyclomatic 12, cognitive 11): overrideOptions 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":"packages/rspack-test-tools/src/case/watch.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0911c2e187db99531192e545e52760073d5eb26490e0b4fd8fc6a0abdd2d5f"}},{"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":"packages/rspack/src/config/target.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2995f25084a2c1ddcd8c4706b2f327baa00752efae28eb589d052670c0543808"}},{"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":"packages/rspack/src/config/target.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a083b1bd526052c8f8aa0bee316ffe577af45d013e1dbb93822b1f8f1dd2b6"}},{"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":"packages/rspack/src/stats/DefaultStatsPrinterPlugin.ts"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d13be315fab6257695abd0a481593e86eea51dd17d299506f47817a8c93c7c"}},{"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":"tests/rspack-test/configCases/errors/generator-generate-error/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2de77a10e9f0b2f4ee0c69cf613db43b69cc264141ce16cd4160c028b6ade0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBufferAndClose (cyclomatic 12, cognitive 11): getBufferAndClose 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"69283dbccfd274d37f497d6ac34e8e785c81f74da9751b14bde3be03dc443674"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBufferAndClose (cyclomatic 12, cognitive 11): getBufferAndClose 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc9765c00c21b8474131af3529d616b2c07c34f6859226132370e7e06895f1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codePointAt (cyclomatic 12, cognitive 11): codePointAt 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":"tests/rspack-test/normalCases/parsing/evaluate-binary/deep.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f2c6a7d4969bc1af18afd1868948fbce6de867f92a730392763f7a9ce87a6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) 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":"packages/rspack/src/config/normalization.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"719b2c9cb9aa4ca1f7ff2684cd77a1e4f6b3fbbdcaab0165cb820a7594fe3683"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBuildInfo (cyclomatic 12, cognitive 10): getBuildInfo 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":"packages/rspack/src/container/ModuleFederationManifestPlugin.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f3b8eec159b5bda8d5a67930ab1c012b477327c6a7b3263ec8123e90c5e005"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isEnvColorSupported (cyclomatic 12, cognitive 9): isEnvColorSupported has cyclomatic complexity 12 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":"packages/rspack-cli/src/cli.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"993b1ee5de23da3114338c6da08ab276c82562727d33a0fce7b211c1696ecc3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function internalPreviewConfig (cyclomatic 12, cognitive 9): internalPreviewConfig has cyclomatic complexity 12 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":"packages/rspack-cli/src/commands/preview.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"302364b02e9a409c20d3db52d9b55a58472a6e704ff50818b3f0bd7243b2dc81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultOptions (cyclomatic 12, cognitive 9): defaultOptions has cyclomatic complexity 12 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":"packages/rspack-test-tools/src/case/normal.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad05b756a61a9458b4add6ab629fb8ad908fd4fd3b31a850b919c227a4617b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStatsColorSupported (cyclomatic 12, cognitive 9): isStatsColorSupported has cyclomatic complexity 12 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":"packages/rspack/src/util/supportsColor.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2e5780c181d0bbc35aa4bfbcf46597c92a3c1b768bab616ccaee59a57e6a65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveUnqualified (cyclomatic 11, cognitive 39): resolveUnqualified has cyclomatic complexity 11 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":10366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3da3da19fe9cfc498e693319bba7e1041b33884ad6efab2546dce83c4659b77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveUnqualified (cyclomatic 11, cognitive 39): resolveUnqualified has cyclomatic complexity 11 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":10366}}}],"partialFingerprints":{"codehealthFindingId/v1":"444aa59e7a98cde34bf1b6f6b7b3ae11aef97fa66c3d1b0329d1d68cd2136f16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 32): (anonymous) has cyclomatic complexity 11 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":"packages/rspack/src/runtime/moduleFederationDefaultRuntime.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50b2e2bccb2741a7ef9c843e9e51c0ad841703e272a8047f939bd9545b1f1cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDependencies (cyclomatic 11, cognitive 23): validateDependencies has cyclomatic complexity 11 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":"packages/rspack/src/MultiCompiler.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e790b591d711166e699bdae5475787e33b97e64b180f9f0ad2996fb717cbc8f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 11, cognitive 21): create has cyclomatic complexity 11 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":"packages/rspack-test-tools/src/test/creator.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20a9b674249650f781120fd2c0ef5b77adff34cbdafb09e374a27ee65a34208"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UTF8ArrayToString (cyclomatic 11, cognitive 21): UTF8ArrayToString has cyclomatic complexity 11 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":4499}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c67a0f9b057c3a8582da1ee76a33bf5e6141ecbf6844fad443ed31cf81254de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UTF8ArrayToString (cyclomatic 11, cognitive 21): UTF8ArrayToString has cyclomatic complexity 11 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":4499}}}],"partialFingerprints":{"codehealthFindingId/v1":"a362e0a0b754ae3a2d68730bf71995b572c39d38f4672b07686eb6d6cd5d4717"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copySync (cyclomatic 11, cognitive 18): copySync 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"416599e81ad8020971430e0e3511ab56072cedf666f3795bba8b1c63e72089f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copySync (cyclomatic 11, cognitive 18): copySync 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4c663a15e71f76f0c340394420f34dd47c4ff0b52131ae9320104ebf7cfa80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __attachCleanupErrors (cyclomatic 11, cognitive 17): __attachCleanupErrors 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":"crates/node_binding/rspack.wasi-browser.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f510f1887e94833f40e20d15e9c0b63d88385a4cd1eb6b6a51e5975f2a0d4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function raw (cyclomatic 11, cognitive 17): raw 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":"packages/rspack/src/container/ContainerReferencePlugin.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6e0da939871cc8a4ff1b5ef436f4c86179c56716483b875d06c7e26052751e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyFolder (cyclomatic 11, cognitive 17): copyFolder 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43b090bfaf284dfaa912b4f651ecde9244bc470e9f08296f370ab64c9f59f4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function patchFs (cyclomatic 11, cognitive 17): patchFs 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":4158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f873ba1a33081a8e2e7303a6a6f77277c88ec614bf0b4114c1be09d7142c2613"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyFolder (cyclomatic 11, cognitive 17): copyFolder 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbbf2568b9ad5f261a02c04028ee7e1c917cfb88e660362440ad97f9de4902e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function patchFs (cyclomatic 11, cognitive 17): patchFs 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":4158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4291a76e2dc5a1fdb345780eaecde6f5822689d360a3aacec7bffb343c5b360"}},{"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":"packages/rspack-test-tools/src/helper/stringify-config.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"032b07b29609d1733f27dcf426939e384b09e58cc038edde6794565bd6264bb8"}},{"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":"tests/rspack-test/compilerCases/cached-diagnostics.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a4b0109a83c26803a8e90bbe57b33909c63ba965b2c38ad0395bbc4e76cca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _bindUiListPickerEmployees (cyclomatic 11, cognitive 14): _bindUiListPickerEmployees 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":"tests/rspack-test/configCases/inner-graph/issue-11678/module.js"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4663d10a56c1d5af05beb299496d6a0a7179554aa2850b8e11dbaf928236672"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function overrideOptions (cyclomatic 11, cognitive 13): overrideOptions 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":"packages/rspack-test-tools/src/case/config.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec03ef79dc3342324754c5e490fdccca091905af508fdeddb9d437bf87b5a122"}},{"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":"packages/rspack/src/builtin-plugin/ExternalsPlugin.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e83812564a5377742127204ed0ea669fd5e04a798339b9b45618f940b0d9cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDefaultEntryRuntimeSource (cyclomatic 11, cognitive 13): getDefaultEntryRuntimeSource 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":"packages/rspack/src/container/ModuleFederationPlugin.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f0eb84cc243375c8496e2f01ddde5cd5c730de1efc12937a10bdb2a50787c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 11, cognitive 11): visit 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":"packages/rspack/src/builtin-plugin/lazy-compilation/middleware.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c752a60fa1e00be381a1d1dbf563b45e3d60d2fd4317c45e2803113539b6dae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRawParserOptions (cyclomatic 11, cognitive 10): getRawParserOptions 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":"packages/rspack/src/config/adapter.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1b73543c6ea3de87400a4b1a277cccadaa0ceaa0622e20efed89e1b9f48cf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 10): (top-level) 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":"packages/rspack/src/util/symbols.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"965fe0e634cd27ba6a76d2b696972e19b3e3efcf897e90e8b21d2a6d95b5fef7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _fd_seek (cyclomatic 11, cognitive 10): _fd_seek 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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":8117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf8d5821e25ec904e8a36ce22f85e0edf2797c6e9074dc00b8a7722e71a59a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _fd_seek (cyclomatic 11, cognitive 10): _fd_seek 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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":8117}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ca973251e586721969958a64863ef27e20c5fa2b0ba5132c808db6ce223a35"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/config/types.ts: 3093 lines of code: packages/rspack/src/config/types.ts has 3093 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":"packages/rspack/src/config/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b5b5cefaf8f5b4f978009e7b5fbf685edaabaca6351dca255cfe287b295c41"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts: 1539 lines of code: packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts has 1539 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":"packages/rspack/src/stats/DefaultStatsFactoryPlugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a53ca70c52bd1a5deb20bac285455c4637318cc251d16fd5870bd1d079e9bd2"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/node_binding/rspack.wasi-browser.js: 1494 lines of code: crates/node_binding/rspack.wasi-browser.js has 1494 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":"crates/node_binding/rspack.wasi-browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ec43865a848597868186cc886ee5be7183b6e126884071d4191a2bec77311b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/config/defaults.ts: 1346 lines of code: packages/rspack/src/config/defaults.ts has 1346 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":"packages/rspack/src/config/defaults.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e95685d5ff167ec0cb07e48e437cf1724fc8c66883b48b5a491af69d56091c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/stats/DefaultStatsPrinterPlugin.ts: 1319 lines of code: packages/rspack/src/stats/DefaultStatsPrinterPlugin.ts has 1319 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":"packages/rspack/src/stats/DefaultStatsPrinterPlugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab199a02be7a81d311f52add9af82075bde3602b273503edb1832e997d0cec82"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/Compilation.ts: 1267 lines of code: packages/rspack/src/Compilation.ts has 1267 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":"packages/rspack/src/Compilation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a89f250c3d435c7cb739023aef7987f972d02df58a172769d0ae856d7cb58ce"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/loader-runner/index.ts: 1180 lines of code: packages/rspack/src/loader-runner/index.ts has 1180 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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85292109437b126eec246e5093864cce3186ac266d623d8074105ae5a5a7235f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/Compiler.ts: 1114 lines of code: packages/rspack/src/Compiler.ts has 1114 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":"packages/rspack/src/Compiler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e74a1f29df654a615e6516321058453917d08df31639021d6615660104f312"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/config/adapter.ts: 922 lines of code: packages/rspack/src/config/adapter.ts has 922 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":"packages/rspack/src/config/adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f249ed0fea0ff02644981bf3ae159f29a549952c3627300e42d56ace79163a6e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/util/fs.ts: 721 lines of code: packages/rspack/src/util/fs.ts has 721 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":"packages/rspack/src/util/fs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41198661e18002bbe1158c6fafedc62a3546632ce0f8382037c582f165b04725"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/loader-runner/worker.ts: 711 lines of code: packages/rspack/src/loader-runner/worker.ts 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":"packages/rspack/src/loader-runner/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b466ed7c1798ea6c27dad1587963ef5290d47e3e78463ef70042817cd07da8d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/config/normalization.ts: 700 lines of code: packages/rspack/src/config/normalization.ts has 700 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":"packages/rspack/src/config/normalization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5b30dd8fca470ffc0c7a9d78c1352ba60de911bb7b98bec87d32bb92e8a91b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/stats/statsFactoryUtils.ts: 675 lines of code: packages/rspack/src/stats/statsFactoryUtils.ts has 675 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":"packages/rspack/src/stats/statsFactoryUtils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19e8fac5bfa5d6ed6156c123550d58fe62af8bc880c32482f524380418999e1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/RuntimeGlobals.ts: 649 lines of code: packages/rspack/src/RuntimeGlobals.ts has 649 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":"packages/rspack/src/RuntimeGlobals.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffc6afc3141032d145dabf3ec029b4c0c512d4238f6696f3978171742435fb9"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/config/adapterRuleUse.ts: 622 lines of code: packages/rspack/src/config/adapterRuleUse.ts has 622 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":"packages/rspack/src/config/adapterRuleUse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c9cfdf9a2393ed5832a97fad7ab0cb9de1e6c6f28285e7914f9e799f340fea"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack-test-tools/src/runner/node/index.ts: 570 lines of code: packages/rspack-test-tools/src/runner/node/index.ts has 570 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":"packages/rspack-test-tools/src/runner/node/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6372df37352aca9e57c52d3dcb3ebd4f9a190a79938e8c46bcd74fadd8867041"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/MultiCompiler.ts: 569 lines of code: packages/rspack/src/MultiCompiler.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":"packages/rspack/src/MultiCompiler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60215ca17779670083dcd8778a0abbbc6a5ce16ca5e440f0338cae4f5f869de2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/config/target.ts: 547 lines of code: packages/rspack/src/config/target.ts has 547 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":"packages/rspack/src/config/target.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9358fef29492de9d49026839149fc2d290f851b6f08d3db75a96084cc6b4bfc6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/taps/compilation.ts: 499 lines of code: packages/rspack/src/taps/compilation.ts has 499 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":"packages/rspack/src/taps/compilation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41870e8ca5977263fd6d9aa723dd682d4bc74872e07a444903ac801d491e376e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/NativeWatchFileSystem.ts: 498 lines of code: packages/rspack/src/NativeWatchFileSystem.ts has 498 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":"packages/rspack/src/NativeWatchFileSystem.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5b63cdb251e376baf3cf3d64a46ab7c927bd4f347652d2f7d05193c55dda49"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/Watching.ts: 495 lines of code: packages/rspack/src/Watching.ts has 495 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":"packages/rspack/src/Watching.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd55b85d5d4497180863ced737bfccef417a38924f04d4cd60b9863d551d96e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack-test-tools/src/case/watch.ts: 485 lines of code: packages/rspack-test-tools/src/case/watch.ts has 485 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":"packages/rspack-test-tools/src/case/watch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7383056e39051b60f1b8409d956f2a4f276b55c1ea54dbc6e31b1563a737d4cd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/util/cleverMerge.ts: 480 lines of code: packages/rspack/src/util/cleverMerge.ts has 480 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":"packages/rspack/src/util/cleverMerge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86756767795c709a3ae7e5a8b967bece6b5b4e43ccc4e3acc8d64d0065ce273"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack-test-tools/src/case/cache.ts: 472 lines of code: packages/rspack-test-tools/src/case/cache.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":"packages/rspack-test-tools/src/case/cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78762ad0eacf6d3f2bf09981e0ee3dde02032e38f6c7c66262d0fa96e97a6816"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/exports.ts: 453 lines of code: packages/rspack/src/exports.ts has 453 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":"packages/rspack/src/exports.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"072dc8aa955482c73d9c8ee876a4f39461c24fe91fffe7d39c4b63e0493496d0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/sharing/IndependentSharedPlugin.ts: 452 lines of code: packages/rspack/src/sharing/IndependentSharedPlugin.ts has 452 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":"packages/rspack/src/sharing/IndependentSharedPlugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c386a1b92f581fab921b140c2e546caec613de1136109289303f39119f03b75"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/rspackOptionsApply.ts: 450 lines of code: packages/rspack/src/rspackOptionsApply.ts has 450 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":"packages/rspack/src/rspackOptionsApply.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5e47309ba1031b62a8093afc96a495f9fb489469e71101604ff89ba08a4391"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack-test-tools/src/runner/web/index.ts: 436 lines of code: packages/rspack-test-tools/src/runner/web/index.ts has 436 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":"packages/rspack-test-tools/src/runner/web/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0440a9f48209d2ac7669b31c8d024422211b260cc8d7c8fa02c10bd1d8dc62ff"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/loader-runner/service.ts: 420 lines of code: packages/rspack/src/loader-runner/service.ts 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":"packages/rspack/src/loader-runner/service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dfc6be848f424e82c25a9927d9661c123f86ddb51b24f85a98c73bd2344b80"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack-test-tools/src/case/hot-step.ts: 418 lines of code: packages/rspack-test-tools/src/case/hot-step.ts has 418 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":"packages/rspack-test-tools/src/case/hot-step.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65848bb7af0d4738ba5e5df8ee608d2bb1a9a8910b8877bb18c836f1b2c95221"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/container/ModuleFederationPlugin.ts: 417 lines of code: packages/rspack/src/container/ModuleFederationPlugin.ts 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":"packages/rspack/src/container/ModuleFederationPlugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6d049a6ef5f54436dd236dab655b65f7203692d081fd86b09626e5029952ca"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/rspack/src/stats/StatsFactory.ts: 401 lines of code: packages/rspack/src/stats/StatsFactory.ts 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":"packages/rspack/src/stats/StatsFactory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f1dcdc82857abeca58758e4db9130d8e03c00fab5cdc0de7e430d56bd7c0f8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/config/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf71df2e610453f790f2dfe45b2e5c1b3382d45011eb1b3262e8ec31c51ea99"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/rspack.wasi-browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3074fd2375f3aa7ac5faa4ffa3f47fb4a3155cc323c75710862a45e6d9efa999"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/loader-runner/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8117f6a9c9941752d1299d13cd64e7c0e920cfe45566b59a89fc4b8d58614d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/runtime/cssExtractHmr.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8d2355d868375cd48b258001fd8141cde6b17c47ab3016b1f498d3826853b5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b96ed1f7102c2f0af71a06672ef96c1b29e9c60cf9c0e7229cc164295dcd6f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/scripts/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c8884ef1202d5f1304f4958860a1b086869f372ac5883de8c9930d22228794"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_builder_testing/binding.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc681b0bf5cec819377fcf6a867a311d83763a353d767a8753b79cfe65cf1376"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/scripts/add-external-debug-info.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1538a39c99330cafc40fc56052750eab177d7c34d3b0faa5a534c8c72c60d39c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/wasi-worker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4aa70b978151eaa577011cfd63548d7c85009b8f5b5edca03e9ab0a97c0b066"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-rspack/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67cd2d3c5333da9dce2a14f3222a8c2140b0dffa11201e908b5f91b5b426a46"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/BrowserRequirePlugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"894553e210a01b0359505ffad752c260a8a2e7792462b7fcf9aef452932d93fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/wasi-worker-browser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e4333043f1c342efc78bab6ff154d2cb11e8f10a8986326bd5c7b2f23857b3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_loader_preact_refresh/src/runtime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54d2041653813df6a653a73d6c72cf933023647e6087762da820bcfce3b5cc5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_builder_testing/scripts/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"661d1eef2b123785bb3687fa9f4c835698adaee3e9491ea74504951d69698632"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/scripts/dts-header.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"511473f88654c84bfaa8623b24a8176feaef87387482e875f5ca05b28fca46fd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c593382225e6778e6123c8429beab11867d8c1fd4e0912ff932d172f81f0f85"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/scripts/move-binding.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca2787a4ce0c141e6bce28d86420b42fc3f6f6008cbb895462ba3f04b1485aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node_binding/webcontainer-fallback.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c59cc6488c6d9300db74ae355bcb099df55893aa5ce0e777daf39b9e0cab40a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/fs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ac6fed7f0c80985c78de184e5636560eeee869d1eb3df4d0fea9481f85316b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/move-tinypool.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5926480bddc9c53f5c561de9f76b5ae870ef68824224d94786df5a7741c0db"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_wasm/src/runtime/read_file_compile_async_wasm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0dbd30589130e5b4ee3f7d7407ffa5c30cef95e2af07005258d0dc1100efbc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd13492578551e8bd71f3804794abfd7ec66f4187e567bf76eeb5903beb30334"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_wasm/src/runtime/read_file_compile_async_wasm_with_import.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db81a602936e78885ac52485f096fdc421210592850401dd20c17466ab0e9a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-rspack/template-vanilla-ts/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be65fd8cdf9e8826ac768b5cc53d002e3c7e9ffa5e351db3abf50eba1b3de18"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/middleware.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78305fdd0290759eae26d08f901bee3f3b3acd581ea4d74478ca5d42733dd63a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-rspack/bin.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"678cf47bb4853be797e9479372299bbe87500179b72e839081c92bddf4248b56"}},{"ruleId":"R7","level":"warning","message":{"text":"Benchmark script nothing runs (~97 LoC): This script imports the product (\u0027../../../i18n\u0027), so it is an authored benchmark, not measurement input \u2014 but nothing invokes it: no package.json script, no CI workflow or build recipe, no Dockerfile, no other file under website/theme/components/Landingpage/Benchmark/, and no in-repo reference to its name at all. It runs only if someone remembers to type \u0060node website/theme/components/Landingpage/Benchmark/index.tsx\u0060, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/theme/components/Landingpage/Benchmark/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66071a63ab780e453cd8fb2a964dd26cdeef9a9fe051c0040360b8e6addf87ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BrowserHttpImportEsmPlugin\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/rspack/src/browser/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/rspack/src/browser/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d6cffb2451b3793d54bcfc267d36d1b5e6fac550a70c72891bbca50825d3cb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BrowserRequirePlugin\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/rspack/src/browser/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/rspack/src/browser/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/browser/BrowserRequirePlugin.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6b98cd21d8c3f1bd6daea19e3be5716d220d1afe56c072eede159005d76366"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\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/rspack-test/builtinCases/samples/concatenate-modules/index.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b0323cff66b433900523029117b62bb0f374d2b24a4371ce1544718b7ed723"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027component\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/rspack-test/configCases/builtin-swc-loader/preact-refresh/index.jsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"320c83bf9179203d66af5960de9da67ff9012211e07cb4ca772f63045c9118eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027App\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/rspack-test/configCases/builtin-swc-loader/react-compiler-panic-threshold/index.jsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e95551216325afb6fd5f4a55c7d87ac50e94283810a6bc05d6f86532178693a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027App\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/rspack-test/configCases/builtin-swc-loader/react-compiler-paren-target/index.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e704981ee44052e795c1a0a07a95bfcd43960d5cd3e4261a1bb344b6d35d3e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyApp\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/rspack-test/configCases/builtin-swc-loader/react-compiler/index.jsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91410a81a33a886aa17041079711c85565f5060bee06a76593bb076567692a57"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027component\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/rspack-test/configCases/builtin-swc-loader/react-refresh/index.jsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeb43b3a2b9fd4c52a7aa995be0adc9cab8a9272aa9029a7817cd20ad1c79d4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027setTimeout\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/rspack-test/configCases/concatenate-modules/issue-13022/a.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"185634c20a579c9540d5b838d7741ed2a6c5c97342e8ea547cec3f33e282c8d0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027X\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/rspack-test/configCases/concatenate-modules/rename-10168/C.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dd78b7152f338196369863c7673dcdebf525a4c83a70f6db754250e18e5d6d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Y\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/rspack-test/configCases/concatenate-modules/rename-10168/C.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"545d6450392e73e4f1aaf0989042fe58d59639f6db0eef108dacf5b5ad7b64d2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fileName_1\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/rspack-test/configCases/inner-graph/issue-12669/module.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4630179b1bf9e1173fc9c178a9b8b60a23392f83ac97e2721f2193655f1b9425"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cls2\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/rspack-test/configCases/inner-graph/issue-17565/module.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65b9afd446937acf329ce8f8f280b1f2cb05569a691e7bde96e375ff1804faa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cls4\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/rspack-test/configCases/inner-graph/issue-17565/module.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b2f7db8acf135c768e98024f092a0a7a28bfec8a2b80ccd529b8d176f2f33a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cls6\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/rspack-test/configCases/inner-graph/issue-17565/module.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c2db853c93e4fb24a3db98410a85f1ff8dd9b4c4df601eca921cc552b3d11c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cls8\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/rspack-test/configCases/inner-graph/issue-17565/module.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bcf206e5ee16426e5ea73318a605c60f99d639aba7619877b563b5af815171"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027i\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/rspack-test/configCases/library/issue-18932/index.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4420e04d0a8383f5d5ce952c94745396058c9c26f0fcc10f3c7c27a5b29fb35"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fileURLToPath\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/rspack-test/configCases/module/node-globals/cjs/file.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85037c3b15d13f6adeb46a4edf062e7eb0c158a95906e8bb4794b06bef927985"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027__dirname\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/rspack-test/configCases/node/filename-and-dirname/index.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf27e9d0f2aa1e7e9c8d42a822cdf387d2b3af8cee7789f4bd8d16276027890b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027__filename\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/rspack-test/configCases/node/filename-and-dirname/index.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf7696ac0d66d41926dbdf28975bb796e41009d7cf076306bff364b1f91d1a7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fileURLToPath\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/rspack-test/configCases/output-module/node-globals/cjs/file.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efac3b9541788f457e3bd7d20cbb52712f464b88646e5788de57a50368d3bcab"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fileURLToPath\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/rspack-test/configCases/output-module/node-shims-in-concatenated-module/file.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"707643c8c95b5934e5a4e5990ac244e5f238bfe70db0a4bfc7cf427bf196215d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\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/rspack-test/configCases/plugins/minify-disabled-on-empty-array/index.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74ebb5a62c716d6a4af17390fb2a015911050559d89b32ba88c1e51944e98cf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TOP_OF_FILE\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/rspack-test/configCases/rstest/mock/doMock.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd04fc8b229c7c41220617c6e156887daf87119d3b8421ab8db1b7e01a1ccbf9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TOP_OF_FILE\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/rspack-test/configCases/rstest/mock/mockFactory.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1078aa4fa207b3ed37d51e8a5a71cf73ed74a25e3c33949eb41d7a4d60e3478c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TOP_OF_FILE\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/rspack-test/configCases/rstest/mock/mockRequireFactory.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b98eaa1ae540de1776aacf52538dd7f8333f32a2df1f3903d9032868cf44e81"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027countHashes\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/rspack-test/configCases/sri/lazy-consume-shared-fallback/index.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"48aa2ca0cd1a5c748291bfd6ee41d1a523d38a669ff39d3d37b821cce0322ed0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/configCases/sri/lazy-css-carrier/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"41472af19147d035a3eeda4b571174cbaafdb618fa0e1ec5e849d88403515df1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/configCases/sri/lazy-cycle/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"adabc2b19426946f44c08055f888e61b9e2ae0ad8acd5521b67078e5d1815915"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027countHashes\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/rspack-test/configCases/sri/lazy-depend-on-css/index.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b0cc75bedae4a366c7a0ffab2e582abf20351241f6eccf5079fba9f0a82fcf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/configCases/sri/lazy-depend-on-css/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c551a2c8b6f652d4b51f0e0a08533080d869a9080c4c26915c4b3f20f0b8ebf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027expectVerified\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/rspack-test/configCases/sri/lazy-depend-on/index.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2513dd98c4c975b763d5d6471225b30eb89028ebae6da9bc8d4d85c970d5b4e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/configCases/sri/lazy-depend-on/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac86b35ad00efd76714177a37b48bec352db5b39f003a1625cc5bc93dce9e56b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/configCases/sri/lazy-diamond/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a219961f3aea5282e7f88564037996a1522387824aa65bba48825e7a088454c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/configCases/sri/lazy-independent-entry/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff563c91e6e32a794b4ed543383841c69dbf7bc2dd3c291e8af9ba72fa79a2ad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027countHashes\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/rspack-test/configCases/sri/lazy-initial-chunk-in-async-group/index.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"469f6f4fef2cec5bc802624e1763ff6539f579643175a80f472b06ad7c0a2b72"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/configCases/sri/lazy-initial-chunk-in-async-group/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"274df15fbb11f2bf13de15abe397c9645816bb0ac9d7679d567624007d7727bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/configCases/sri/lazy-initial-cycle/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fa0f95edce29b535b6c436c993b5091faa5cee815edae34b5da21bffd647b7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/configCases/sri/lazy-runtime-chunk/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0932dfbe8ec0a129288cb6541c4a2a39dcdfbf4e453a18420e0c1361ecdc6ece"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/configCases/sri/lazy-uneven-depth/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"64653824e865ced6ae0cc8bb6cdb1a2c046e5f9c4f34fb7c11e1a529d8007354"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027React\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/rspack-test/diagnosticsCases/factorize/mismatched-module-type/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e937838150b359e7411b68fea33b6caa75c7e4cdac4fddaea6ffe011de1b6da3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027React\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/rspack-test/diagnosticsCases/factorize/mismatched-module-type/app.jsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a8908aa88742320f01101855c36848b6594b5b6ed520059ca5d6b4c662b96d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027React\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/rspack-test/diagnosticsCases/factorize/mismatched-module-type/app.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64954bb461cc57df267fa9519bd2c188effe0969b30039256c9320e03a8244f0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027React\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/rspack-test/diagnosticsCases/factorize/mismatched-module-type/app.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3570408a8954700fb261f17c6eea2c59eaa2dc059d3717a9491da1dae27ccd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027local\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/rspack-test/esmOutputCases/deconflict/deconflit-local/foo.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51729cd4f129b5697c37d176d8e8d384ea1a937307c763caa99f3fb6a860673a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027local\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/rspack-test/esmOutputCases/deconflict/other-chunk-local/foo.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1d943f746b414fa313355649c941563ecb9ddbc579ab4089e581e43816a83c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027local\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/rspack-test/esmOutputCases/deconflict/other-chunk-local/other.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"29deee15eef6bff097228aacc31a9ce95c756780eaa59fcc89b0b70308188bcb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027neverCalled\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/rspack-test/hotCases/lazy-compilation/unrelated/index.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c21c0dcff07ee0a980f2f0a3252b21ba56d34cf50ab2551d75a9370a936462"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027withC\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/rspack-test/normalCases/inner-graph/circular/module.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"df529dc9e53a74a712429fcce87b29280ac0ba1de42b663873d804804343643b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Unused\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/rspack-test/normalCases/inner-graph/class-dynamic-props/unused1.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b25775753aeb34adc40dac5c498cf7278728a97bb893cb077b715f07ec716d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Unused2\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/rspack-test/normalCases/inner-graph/class-dynamic-props/unused1.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff68a53ca4f5a2d94f7151a555c986f17e388e2d3cf2674f6913da08575fd48"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B\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/rspack-test/normalCases/inner-graph/class-static-block/class.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf3ad707271b19dd9b7344fa84cf13efebefe45ba2fadcfe6d7f2fd2908a458"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027__C\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/rspack-test/normalCases/inner-graph/class-static-block/class.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af8c6ac7405440795d8f85f7a7f8e6075d7447751fa80a4227cbcbe2192a8cb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027__D\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/rspack-test/normalCases/inner-graph/class-static-block/class.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de2112fd340e6be1f56e88ca2fcbf1560f452a2b221808e12710768d9a3998f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B1\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/rspack-test/normalCases/inner-graph/extend-class/dep1.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92acd528284bc5cc2db3f917cff0675aebac5d04a19cc21cbd5687afc078cda"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BaseW\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/rspack-test/normalCases/inner-graph/extend-class/module5.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6db8eb81c9a5456e34561b06b367812d388632e5727760181fe6db39fb7e21"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BaseBaseJ\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/rspack-test/normalCases/inner-graph/extend-class/module6.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7388b9570eb588ccaa1825936306be6a4563d0a5b477ee34d53ce67c632fa70f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\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/rspack-test/normalCases/inner-graph/extend-class/module8.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca56f5b3a38aaf5ff91c4271aac8f4df3eb370b0f6632953ebf8f2f486c4846"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bb\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/rspack-test/normalCases/parsing/asi/index.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"971a7dc132c5a8b3391f56894db1716e191850d89c82877354315aebb35b6046"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\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/rspack-test/normalCases/parsing/sequence-expression-asi/index.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93f0af2e33a785fef6bc789d351b3b397cf11efaf4b2178dbce4c12b121bb58"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027e\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/rspack-test/normalCases/parsing/sequence-expression-asi/index.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de6ac28349322522c44cce98c32240ad0097e6cc63440808b7218c58e2c5cc7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\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/rspack-test/normalCases/parsing/sequence-expression-asi/index.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c5563b2ebe63bf39afd7f5fca3950333606e48ad83047e4b4c78df2aa1ff53"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027renaming_4967_file1_js_a\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/rspack-test/normalCases/scope-hoisting/renaming-4967/file1.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d154688cbed901703cfb72435a5a100f43cee673bec3126bdda0f83f98ba8186"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027renaming_4967_file1_a\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/rspack-test/normalCases/scope-hoisting/renaming-4967/file1.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d224a8a81aab53672d60bba2649d079cf74cdd2b0497e29a1f6356562ab39bb1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027top1\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/rspack-test/statsOutputCases/track-returned/index.js"},"region":{"startLine":2541}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9232b9823340e964137010fdd6911e1ac6c71d936e06b68591d3498664e846e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\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/rspack-test/treeShakingCases/class-extend/app.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df1a3791607f011abc750daee5bd3b92a7c8a8673497b010c688f3f9fa95012"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\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/rspack-test/treeShakingCases/context-module-elimated/index.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a1acf4eafe00248af7ddce6fb74aa5f5c11127bf66893326cc0d1a1a470d57"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UnusedClass\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/rspack-test/treeShakingCases/rollup-unused-inner-functions-and-classes/index.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dda772f6643eca0e0fddd084b513ebde18a0ef2f9c000506f6db70f14f2ae3d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027withC\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/rspack-test/treeShakingCases/webpack-innergraph-circular/module.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69c774b44868b1ca292cc6e2ab66c0f3b80239fed930408808e4bcd04652237"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/watchCases/sri/lazy-incremental-entry-edit/0/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adc9135c33c8a44d66cf1ab996ef7385d9cdbe806602a673becc619eee3ee1d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/watchCases/sri/lazy-incremental-entry-edit/1/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0685a1c342c0179d8e12e2dee0c29bddf66e5a13d652c21e68b8a51f676bb049"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/watchCases/sri/lazy-incremental-manifest/0/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceea96d62c29e1b60d7b3840c2c355e9b67b7b89aee76faf59b800196b441ff0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/watchCases/sri/lazy-incremental-manifest/1/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9b88a5dfb5b6617168d398248da368789b16cf95b3ad0ea9da31dddd149f67"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/watchCases/sri/lazy-incremental/0/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3922d8623cf6d5f1d4eebb2154b176a6d9f8b1fce1a09428ba3e50e4e9cf299b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chunkFile\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/rspack-test/watchCases/sri/lazy-incremental/1/index.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"968695f9c99e037fb7ead4e4cfb8443513fdd9e0117c843c163b23ebaf494d7b"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@module-federation/runtime\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/container/ModuleFederationPlugin.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfbd93968a5da5cfae0c730166559fd34b2c58f8f9dfc447fff0c0838a3d58b"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@module-federation/webpack-bundler-runtime\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/container/ModuleFederationPlugin.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf21d4ce273402c6ca17ee05337febb8f7d57409f5d278d6c08dde8504b1aa2"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@rspack/mocked-react\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container-1-5/0-container-full/App.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8208aa79d8ee8700953a623ce2b0b04d91cce86fec4b4d3c1f9d1f43138f0b5c"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@rstest/core\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/rstest/mock-dynamic-import-external/src/fixture.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2683db5c1dbf4c6fce0ad988bcd10f8f01b2211337d169063e776db8a130bd"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027common\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/hotCases/sharing/share-plugin/module.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0233ce68a319fa67f22dc6a9a81386acd7a096c5488d87a7685fcaa50817bc1"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027d\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/split-chunks-common/rspack-issue-4376/index.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2ad1a47ab6e6de4fa0a61e46e5aa7215af16d0646b2a500657b8fab37ae452"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027dep\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/concatenate-modules/side-effects/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e5a42ac5375d8aaef77295e920b2b9c9cb3bd3246fd5f2858be5c756647203"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027lib3\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/builtin-swc-loader/swc-loader-incompatible-wasm-plugin/src/index.jsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9442264ad890fbf158c3b592229023f386ffaf9f27dd17a95a5a7308bd60a231"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027m\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/normalCases/optimize/side-effects-reexport-start-unknown/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47411f5fba025d6d00d016f1757ff436e664816a7e55b5d05e17b3de79332943"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027my-module\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/normalCases/parsing/local-modules/index.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8731dca2c3c773c3866f040e9214eedf50057d514ac8efc95c8371f13de4ae8c"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027my-module3\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/normalCases/parsing/local-modules/index.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"013b5a0a7b892047dd400871afd87de0258a4ce72d45fedbd566aefcad3d8775"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027my-module4\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/normalCases/parsing/local-modules/index.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"39289f36d6ad4849eef4153ce8a7bb3d0bcb6a590cf779f24e91c3607f5685c7"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027package\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/asset-modules/unsafe-cache-13827/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab347ac37788aa55be88706bd2eb57545f3d59ed65ee7891984ae848d6546da"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027react-router-dom\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/tree-shaking/export-star-of-external-module/lib.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a36ae58a55a08e6d7daa75b83aa158c1ae5252af79f92e36f9048bc2c36d171"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027shared\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/container-1-5/async-startup-static-import/index.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"447463941c519a36b10aa353386470f099b84ee657013e40174c87df016cf138"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027vue\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/library/modern-module-dynamic-import-runtime/main.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"322dccb7acd92c6beb6dfa782e2d9391a56a02df5558aeffcd9500ff0d304f03"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027mini-css-extract-plugin\u0027: Declared in tests/rspack-test/configCases/css/css-order-concatenate-modules/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":"91efe9868bfdf59125267a43e6f4bfb638a820a4d463f3f112326f1209041913"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027mini-css-extract-plugin\u0027: Declared in tests/rspack-test/configCases/css/css-order-reexport/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":"3db72dffb464b73a6e7f659e68fb07ddbc00ce7da9c4151ce28aa766914a5d62"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027mini-css-extract-plugin\u0027: Declared in tests/rspack-test/configCases/css/css-order2/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":"afb1e15f284c8e910a7161fdd168b86a39d2509f1f8923663eea685451a83cea"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027mini-css-extract-plugin\u0027: Declared in tests/rspack-test/configCases/css/css-order3/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":"99aec8b064ff033116b240de12c24fc9559234a16e97bbd4ec1abb01efd05155"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (3 files): packages/rspack/src/builtin-plugin/index.ts \u2192 packages/rspack/src/builtin-plugin/DynamicEntryPlugin.ts \u2192 packages/rspack/src/lib/EntryOptionPlugin.ts \u2192 packages/rspack/src/builtin-plugin/index.ts (one verified cycle inside a mutually-dependent group of 21 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/builtin-plugin/index.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"153a1cc3297b3b8259c317e4dbbd48e7717c7da1c49a957efce939cc1e8c420b"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/rspack/src/container/ModuleFederationManifestPlugin.ts \u2192 packages/rspack/src/container/ModuleFederationPlugin.ts \u2192 packages/rspack/src/container/ModuleFederationManifestPlugin.ts (one verified cycle inside a mutually-dependent group of 5 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/container/ModuleFederationManifestPlugin.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ef4965bc8aced24bbf209652656f64b31375060f8212a509505445b0a3fbc4"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_hash/src/lib.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fa0ba2e170171eb17a606f4739607a17f0b289959c0b555d94ef6231e9544e"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is configured \u2014 defense in depth, even when a reverse proxy could set them. This is reported because \u0060_headers\u0060 configures this repository\u0027s static hosting, including its response headers, so the configuration that would carry these headers is in this repository and was read in full. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/docs/public/_headers"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7f9912c8cfa2a5559141c8bc868835aa4ddd9c817cce5441a342930559ad4b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/chunk-ids/stable-chunk-ids-with-duplicate-chunks/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/chunk-ids/stable-chunk-ids-with-duplicate-chunks/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1718c5240cded4e74619d0d491f5b9845f8e429f551d2729cc00ff3e5a098f27"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/container-1-5/exposed-overridables/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/container-1-5/exposed-overridables/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e60849ce2b0f6cf02b25b986dace029b60bdf732ea95ef80dee23adf640c29"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/container-1-5/manifest-disable-assets-analyze/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/container-1-5/manifest-disable-assets-analyze/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4f4d43c2f2ad1a6aca4eaf4aaef773a09d7255c16743a2ffe87a9322399ded"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/container-1-5/manifest-entry-filter/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/container-1-5/manifest-entry-filter/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7db6b1c2fb13dd2e227e70c66a7970e48a699e16c081d7d658afc6f6ce49d4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/container-1-5/manifest-file-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/rspack-test/configCases/container-1-5/manifest-file-name/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcace5a89c76aeb4c249c69beaf4d271f28b8cb64165f0525087837f60c79100"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/container-1-5/manifest-required-version-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/rspack-test/configCases/container-1-5/manifest-required-version-range/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"87306285e50fe44bf4e6427b310c900d857c8c5efffc99c628e992d156dbed63"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/container-1-5/manifest/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/container-1-5/manifest/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f1ffff4594833725ca9a25d1036ef74cc403401033b02e9f3198815f14a106"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/container/exposed-overridables/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/container/exposed-overridables/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ab3a3410186c63e3fe96071cfb7799cd105895f8ea30c50e130c7de5d08fd4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/css/css-order-concatenate-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/rspack-test/configCases/css/css-order-concatenate-modules/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e00d227533ec5f7f9562a86565d9a15c1c60500c02fe65ebaa8520bcc73a81"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/css/css-order-reexport/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/css/css-order-reexport/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"550d4a8439df7af60bf1d16bb62337b17358c0e7ed33db67fb2d723510cba911"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/css/css-order2/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/css/css-order2/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bee0c2194d9d6b8daa3999a32d07f341a556352be502c42d9b38f20b68e9aab"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/css/css-order3/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/css/css-order3/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b158f4a70efdc1950fe58aba707b1b61259eea418f4744c9754e0e584314a928"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/mangle-exports/skipping-mangle-css-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/rspack-test/configCases/mangle-exports/skipping-mangle-css-modules/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fab4ba077910606c1ffefb58906c5c5fe55edd98ed64d34353aac0f7dfe6d1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/rstest/mock/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/rstest/mock/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76291513a02ff99a4f466db90f5894dc185b1333f6152bdceb0bbf134ff429f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/consume-module-ignore-warnings/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/consume-module-ignore-warnings/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e459bd24b6798585855109e198d189f6ab91d064f337aa458f6f878154c968"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/consume-module/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/consume-module/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd32838a1b36f883e506747392c949303881d3beb0cf29541d98a4662337a81"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/consume-multiple-versions-ignore-warnings/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/consume-multiple-versions-ignore-warnings/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27094d23b60cf069088786795ee934fad4dfdcc90bd28b9c95ca3ee95f67317"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/consume-multiple-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/rspack-test/configCases/sharing/consume-multiple-versions/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34eb190d4d83dd7e5d9001c623314d95df1df53bd91ee0524be0644528e30d8"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/consume-self-reference/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/consume-self-reference/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"77790283516a3a129639865ba79d294dc05e1ad3b38802e9ee2b9245534bdaad"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/no-override-loaded/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/no-override-loaded/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"073d4e32ec848a79dcb29511933a1b6280f1c0d85116acae666fcd87a045543e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/provide-eager-module/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/provide-eager-module/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b406945805e7babfd1e9eeb54c84982de73bee9ae4863d3a4a6535f781318a33"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/share-multiple-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/rspack-test/configCases/sharing/share-multiple-versions/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ff1ccbe296f6bbd3fac5806988a8bff754e0ec768e4709b7709f7f961548f1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/share-plugin-dual-mode/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/share-plugin-dual-mode/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6b34bda043af0a4356685d522983506c2ce3c90969e9bf1a1446bb43663d7e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/share-plugin-monorepo/app1/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/share-plugin-monorepo/app1/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1ab8127c453bf736d34fd88b9b241a1934f92db8d10f4029c2a6cdac9277d8"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/share-plugin-monorepo/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/share-plugin-monorepo/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18fc9788000054d51242157bc57506a931cae06b9b73e9f480621c72b7f3a73"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/share-plugin-secondary-entry-point/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/share-plugin-secondary-entry-point/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dab16c5bda7e1af797bf0c7c370516befcff5a03a997b577ec9e51fe7b0d1e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/configCases/sharing/share-plugin/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/configCases/sharing/share-plugin/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1014cab292626c43688bf454dafda45d272c592e2d5b3a61c5cf8610429dd19c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/newCacheCases/common/resolver-cache/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/rspack-test/newCacheCases/common/resolver-cache/package/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf8a03c34fea2de2f8bce218417584279e9e91b87e0332c8c6ce66850a819e3"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/newCacheCases/snapshot/mixed-paths/managed/immutable/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/newCacheCases/snapshot/mixed-paths/managed/immutable/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"439eea69939d5d0bd88e654582ae45947558852ca1ac5145bb99d063b8e8a78c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/newCacheCases/snapshot/mixed-paths/managed/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/rspack-test/newCacheCases/snapshot/mixed-paths/managed/pkg/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df899b017560acbb3566797ccf5dbde3f75a26f8631f6c2188f43da5974b8dc"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container-1-5/1-container-full/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container-1-5/1-container-full/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b293d3260279b2575bad2649c2fafa406d4b54fb23c38db91d15465af4871f4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container-1-5/2-async-startup-sync-imports/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container-1-5/2-async-startup-sync-imports/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4350d8301125cb4d945393a2eaa9ea8cecf9e25523bdb515d240b589dec225d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container-1-5/2-container-full/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container-1-5/2-container-full/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c1ee1c58dd7254830e7db740155de188a0c8ea6e445bacc14e80fa5c3d8dee"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container-1-5/3-container-full/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container-1-5/3-container-full/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ef6d6e70a56a347c0bb667bd376d659d7d8d34de1af98a57ee37dbf4f86d90"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container-1-5/4-async-startup-runtime-chunk-single/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container-1-5/4-async-startup-runtime-chunk-single/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"531a2f78d95342560924094d4d4a2483baa754f13ba574a0aaa95dc4663b84a1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container-1-5/5-async-startup-partial-runtime/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container-1-5/5-async-startup-partial-runtime/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8403541e9c6dd5a97e9f38a6afc61adbe899d6dc321cce263dc144fc42ce4c1a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container-1-5/chunk-matcher/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container-1-5/chunk-matcher/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"45de3180ba5d21064526e1001d728f6342a79e463964fc692359b123090c8109"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container-1-5/module-federation-with-shareScope/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container-1-5/module-federation-with-shareScope/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf599a31c9751abc6d762b88b00d0e0aaf52f2b8aea10714a4129481b3ca7e3"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container-1-5/multiple-runtime-chunk/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container-1-5/multiple-runtime-chunk/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a9e5d314adf204bd2fff871635ecb5b614a2cddcc904f3d0e2fe1f16f8b5a6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container/0-eager-shared/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container/0-eager-shared/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7ef29514fef5342259bafedabec7b4fc4514ef663708dca9e5d59f9de59cde"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container/1-container-full/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container/1-container-full/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbb9fb5bca9baad0006ce103bc449918735f3b5ef358bece57eef533bfde13f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container/2-container-full/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container/2-container-full/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"840b7bc7a488f2fb8c89109265c56de5456cfa1690bdbebd0d7e4c325c8d72bc"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container/3-container-full/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container/3-container-full/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c892ab3ad3a0c9d89804d715b6da7326c6ec9ea284bd3f3eb8f73d3b87e7e7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container/eager-shared/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container/eager-shared/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f9276b6bec7700d6b78b00d49e32a3c748e55cdc70725c7d9b72a651a171b5"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/serialCases/container/module-federation-with-shareScope/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/serialCases/container/module-federation-with-shareScope/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef3ea912f17056a174b028c98463865aa81049b3e0a00c3ffc6a13b09e159a0"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/treeShakingCases/cjs-tree-shaking-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/rspack-test/treeShakingCases/cjs-tree-shaking-basic/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ddeb1ab5ff1955c7b2744ff0133e2bd1a1c33d6541708e49423db4158890d5"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/treeShakingCases/reexport-all-as-multi-level-nested/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/treeShakingCases/reexport-all-as-multi-level-nested/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02ed5900ca02d088ed66008a3f4a13e52f5efaf46e69e71e78f83e2236e6683"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/rspack-test/treeShakingCases/reexport-all-as/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rspack-test/treeShakingCases/reexport-all-as/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5a3eec2e22fb4bcb28e7d7e96474d9ad66da7334a5347c0d6ad42f4d2a28db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(await runSyncOrAsync(fn, loaderContext, args)) || []\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/loader-runner/index.ts, packages/rspack/src/loader-runner/worker.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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5431644c32d813ea96f015b6372ca7a3142757350d5aef27d25006438b35ea3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(error as Error)?.message || String(error)\u0060 appears character-identically in 2 files \u2014 packages/rspack-cli/src/commands/preview.ts, packages/rspack-cli/src/commands/serve.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":"packages/rspack-cli/src/commands/preview.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"946c351c7330b4de012d1a1e70d6ee968b40c351090a2038eec24ca139a88612"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Boolean(value) \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 packages/rspack-cli/src/utils/loadConfig.ts, packages/rspack/src/container/ModuleFederationManifestPlugin.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":"packages/rspack-cli/src/utils/loadConfig.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4278f4359bf49498245233149db93e1694750721921244a3d2ab35693ae0de47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b.status - a.status || a.name.localeCompare(b.name)\u0060 appears character-identically in 2 files \u2014 website/components/CommunityCompatibleTable.tsx, website/components/PluginSupportStatusTable.tsx. 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":"website/components/CommunityCompatibleTable.tsx"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6c95101cb523fd2fd66aaf4d997f6cb5caf35c58c13ea84952ffc9caf15962"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.options \u0026\u0026 typeof entry.options === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/loader-runner/index.ts, packages/rspack/src/loader-runner/worker.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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf26d18d55954f828416343940de22217092e933ddfc2ddc75c0226dbd676fd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasChunkHash || hasContentHash || hasName || hasId\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/builtin-plugin/css-extract/index.ts, packages/rspack/src/config/defaults.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":"packages/rspack/src/builtin-plugin/css-extract/index.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43b3b69811c5b4d28a2149d473bae3d408c504c222548995bdc6f0b5e2cf279"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item === key || !isRequiredVersion(item)\u0060 appears character-identically in 5 files \u2014 packages/rspack/src/container/ModuleFederationManifestPlugin.ts, packages/rspack/src/container/ModuleFederationPlugin.ts, packages/rspack/src/sharing/ConsumeSharedPlugin.ts, packages/rspack/src/sharing/IndependentSharedPlugin.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":"packages/rspack/src/container/ModuleFederationManifestPlugin.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e9f5f669ea27c945f1e04fe2cd7052a7269137cda58444cfb81216e17ad6df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.shareScope || options.shareScope || \u0027default\u0027\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/container/ContainerReferencePlugin.ts, packages/rspack/src/container/ModuleFederationPlugin.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":"packages/rspack/src/container/ContainerReferencePlugin.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab8fe47cb0d092cdbe441380a70aa227b36716c4b12aaf9d6efe08e5bef089f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.shareScope || shareScope || \u0027default\u0027\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/sharing/ConsumeSharedPlugin.ts, packages/rspack/src/sharing/ProvideSharedPlugin.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":"packages/rspack/src/sharing/ConsumeSharedPlugin.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe678b3859108d5c1f75086a1ece3e6205289395393778c5180cdd153ef2620"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060loaderContext.loaderIndex \u003E= loaderContext.loaders.length - 1 \u0026\u0026 !loaderContext.resource\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/loader-runner/index.ts, packages/rspack/src/loader-runner/worker.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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af31ee2d32349be844a47c2f4dfc00086f88cb92beaec389bd4e370bde5e047"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060loaderContext.loaders?.length \u0026\u0026 index \u003C loaderContext.loaders.length \u0026\u0026 index \u003E= 0 \u0026\u0026 loaderContext.loaders[index]\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/loader-runner/index.ts, packages/rspack/src/loader-runner/worker.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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71c415a54283c8a8ae71ba79e0c1124777be4f534d0f64131970e8c96ac9209"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options === null || options === undefined\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/loader-runner/index.ts, packages/rspack/src/loader-runner/worker.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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8333871b3e6eaa7a55c1ceb6c777f339a17731b9112e73b328cecb835d57e7f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.startsWith(\u0027{\u0027) \u0026\u0026 options.endsWith(\u0027}\u0027)\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/loader-runner/index.ts, packages/rspack/src/loader-runner/worker.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":"packages/rspack/src/loader-runner/index.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a51a100bcdd9a8f5c951e95b21240e26e176035bef14301a91c7a2cadab09c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof callbackUndelayed !== \u0027function\u0027 \u0026\u0026 callbackUndelayed\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/NativeWatchFileSystem.ts, packages/rspack/src/node/NodeWatchFileSystem.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":"packages/rspack/src/NativeWatchFileSystem.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"174afebe6ffd2fedf37f8510e9cbbab47c4be30084068bdc2c9719d73d7e2fad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060url.protocol === \u0027http:\u0027 || url.protocol === \u0027https:\u0027\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts, packages/rspack/src/builtin-plugin/SubresourceIntegrityPlugin.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":"packages/rspack/src/browser/BrowserHttpImportEsmPlugin.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fb83d2474821894e74640670e6fb8d1a8fdd73122e9db10bcc98e196947950"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === undefined \u0026\u0026 typeof prop === \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 packages/rspack/src/Compilation.ts, packages/rspack/src/Compiler.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":"packages/rspack/src/Compilation.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b0e656fb9d5801c8bb9dcbf777927834f262a343f03df89477f77a51aa8fe1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!from_magic_comment \u0026\u0026 referenced_specifiers.is_empty()\u0060 appears character-identically in 4 files \u2014 crates/rspack_plugin_javascript/src/dependency/context/import_context_dependency.rs, crates/rspack_plugin_javascript/src/dependency/esm/import_dependency.rs, crates/rspack_plugin_javascript/src/dependency/esm/import_eager_dependency.rs, crates/rspack_plugin_javascript/src/dependency/esm/import_weak_dependency.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":"crates/rspack_plugin_javascript/src/dependency/context/import_context_dependency.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f23e9777bf7fae63f42d26851e414e832f249fa43c66b5f570e68ec4536789"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_matched || original.get_info().minimized.unwrap_or(false)\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_lightning_css_minimizer/src/lib.rs, crates/rspack_plugin_swc_js_minimizer/src/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":"crates/rspack_plugin_lightning_css_minimizer/src/lib.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fa0f5822120a8732d96f530d3dee981001862617653ade14cb8060e9119fca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!request.starts_with(\u0022./\u0022) \u0026\u0026 !request.starts_with(\u0022../\u0022)\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_rslib/src/url_external.rs, crates/rspack_plugin_rslib/src/worker_external.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":"crates/rspack_plugin_rslib/src/url_external.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d07d8b260596c62255a75078fc12161d845ddafc4cc5b0f45cb93537c26b269"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060allow_inline_startup \u0026\u0026 !chunk_ids.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/plugin/mod.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"60df80fe0192e6ef450a014901ae1bc8dd0d996fe83e5c324036e9fc1839b790"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060allow_inline_startup \u0026\u0026 !js_entry_modules.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/plugin/mod.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"313a82906f41136768038a4182bb3605b5e98f60e69fd3b0ede817b70eac91fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060allow_inline_startup \u0026\u0026 intercept_module_execution\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/plugin/mod.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5ac809246390b9136e7c7c5c867483f95c828f2bbf70e73847dd05d280e3d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060allow_inline_startup \u0026\u0026 module_factories\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/plugin/mod.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53a28808f11e1931c853a12d613b35131c0e49c3eb43055eeddfa53558b03ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dep.downcast_ref::\u003CESMExportImportedSpecifierDependency\u003E() \u0026\u0026 dep.name.is_none()\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_esm_library/src/link.rs, crates/rspack_plugin_javascript/src/plugin/side_effects_flag_plugin.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":"crates/rspack_plugin_esm_library/src/link.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"75144e697f2ee564d913a5857e2ce196fdfdf71adaf1ee02a79ea50476c7cb18"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry_runtime_requirements \u0026\u0026 entry_runtime_requirements.contains(RuntimeGlobals::EXPORTS)\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/plugin/mod.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"a494f9f531f80f4380d06839fd2b2c45da3290daf6913b52297f703f53572c90"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry_runtime_requirements \u0026\u0026 entry_runtime_requirements.contains(RuntimeGlobals::MODULE)\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/plugin/mod.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"0049e4a81019f5f525ae71025d0d078e5ff6016fddf86f71c84b46a8a1a3833f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060evaluated.is_identifier() \u0026\u0026 evaluated.identifier() == CREATE_REQUIRE_EVALUATED_TAG\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs, crates/rspack_plugin_javascript/src/utils/eval/eval_call_expr.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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80fbd4142c766c584086c6dc99d35092383580befe10900f0ba35ce5653350a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_chunk_modules_result \u0026\u0026 renamed_inline_modules.is_none()\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/plugin/mod.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18028733332d29fb20ca7297efabe2333bc9808a34dc0533355b733c495a319"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_chunk_modules_result || runtime_requirements.contains(RuntimeGlobals::MODULE_FACTORIES) || runtime_requirements.contains(RuntimeGlobals:\u2026\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/plugin/mod.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ac97ff47986135bbf15a9dc50f0314a5a2badaf89c699f5adc7ce002313ecc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_entry_modules \u0026\u0026 runtime_requirements.contains(RuntimeGlobals::RETURN_EXPORTS_FROM_RUNTIME)\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/plugin/mod.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_javascript/src/plugin/mod.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"83eadc6457a6d2df569135775e4412e49c67b289af13787f91f09be785eb636f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060info.name \u0026\u0026 (info.is_free() || info.is_tagged())\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/visitors/dependency/parser/call_hooks_name.rs, crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.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":"crates/rspack_plugin_javascript/src/visitors/dependency/parser/call_hooks_name.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57afd323526dd9ee7693e22ffb6436c6c178ddd5438fc0a7b95562c8f85c1c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(is_circular_module, Some(false)) \u0026\u0026 !is_mutated \u0026\u0026 !is_deferred \u0026\u0026 !has_direct_eval\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/dependency/esm/esm_export_expression_dependency.rs, crates/rspack_plugin_javascript/src/dependency/esm/esm_export_specifier_dependency.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":"crates/rspack_plugin_javascript/src/dependency/esm/esm_export_expression_dependency.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb44c81de8a362d1358f5f5118665df93bdbc853eddd34952dbbbe7529e0146"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module.full_hash() || module.dependent_hash()\u0060 appears character-identically in 3 files \u2014 crates/rspack_core/src/runtime_module.rs, crates/rspack_core/src/stats/mod.rs, crates/rspack_plugin_javascript/src/runtime.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":"crates/rspack_core/src/runtime_module.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8a520cc828f64bd87f37c7f0335aa808c0fe23931b464416ae43ed8dcaf499"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parser .javascript_options .strict_this_context_on_imports .unwrap_or(false) \u0026\u0026 !direct_import\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs, crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"330d9420e0e80b1dd936b638cd109599a2edbaae055375eb2613e1ab0459830a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parser .javascript_options .strict_this_context_on_imports .unwrap_or(false) \u0026\u0026 !members.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs, crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8894eb73c58fd6893df14836d4d754cb4d392b46a4b4cd132b522915ac9661"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parser.terminated.is_some() \u0026\u0026 !parser.is_top_level_scope()\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs, crates/rspack_plugin_javascript/src/parser_plugin/import_parser_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc94bc70a41cf2243307849c02bb5a04cc0af039bd9138f880f3240ebe74462b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060require_function || intercept_module_execution || module_used\u0060 appears character-identically in 3 files \u2014 crates/rspack_plugin_esm_library/src/render/runtime_mode/mod.rs, crates/rspack_plugin_javascript/src/plugin/mod.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_plugin_esm_library/src/render/runtime_mode/mod.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"102760358f036cc6cebd00925208c17441b9d2b5c355e25ca24ef7b476464af4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime_module.full_hash() || runtime_module.dependent_hash()\u0060 appears character-identically in 2 files \u2014 crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs, crates/rspack_core/src/compilation/create_hash/mod.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":"crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25310a7a1c81d48f4ffc39ff44423ce0d7c44b0353c6e61cfb51fa853f0a75a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime_module.get_custom_source().is_some() || runtime_module.get_constructor_name() == \u0022RuntimeModuleFromJs\u0022\u0060 appears character-identically in 2 files \u2014 crates/rspack_core/src/runtime_module.rs, crates/rspack_plugin_javascript/src/plugin/runtime_context.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":"crates/rspack_core/src/runtime_module.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fea919734e73cb3e99e0beaf68e1bac3b5b4703d5ea26b8b765217cf760472"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.path == other.path \u0026\u0026 self.query == other.query \u0026\u0026 self.fragment == other.fragment\u0060 appears character-identically in 2 files \u2014 crates/rspack_core/src/resolver/mod.rs, crates/rspack_resolver/src/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":"crates/rspack_core/src/resolver/mod.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4453a29fd0f954bd94cbfb49c7efbf6f431fabb3eec136a34e1db5c02e46e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060settings.namespace_import \u0026\u0026 !ids.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs, crates/rspack_plugin_javascript/src/parser_plugin/esm_import_dependency_parser_plugin.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":"crates/rspack_plugin_javascript/src/parser_plugin/common_js_imports_parse_plugin.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"a738dd295ad4354681a7366f9abf06ffd51e3745372ba39bedd3c1fa878f86a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060template.expressions(ast).is_empty() \u0026\u0026 template.quasis(ast).len() == 1\u0060 appears character-identically in 3 files \u2014 crates/rspack_plugin_javascript/src/magic_comment.rs, crates/rspack_plugin_javascript/src/visitors/dependency/parser/mod.rs, crates/rspack_plugin_javascript/src/visitors/dependency/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":"crates/rspack_plugin_javascript/src/magic_comment.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9fd2739d07908b6704bd2bda262014ef4036c9f1399a16ce40fe1926eb2eb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060used == UsageState::OnlyPropertiesUsed || used == UsageState::Unused\u0060 appears character-identically in 2 files \u2014 crates/rspack_plugin_javascript/src/plugin/inline_exports_plugin.rs, crates/rspack_plugin_javascript/src/plugin/mangle_exports_plugin.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":"crates/rspack_plugin_javascript/src/plugin/inline_exports_plugin.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01ef7beacce17a3e58904e80d74d93486a47697ffb373bb676be92d47529c9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060with_loading || with_external_install_chunk || with_hmr\u0060 appears character-identically in 3 files \u2014 crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs, crates/rspack_plugin_runtime/src/runtime_module/readfile_chunk_loading.rs, crates/rspack_plugin_runtime/src/runtime_module/require_js_chunk_loading.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":"crates/rspack_plugin_runtime/src/runtime_module/module_chunk_loading.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d00bb22edf7731c8db4d74b046cfee33ab7e88c13cb9cb938f77e09f9544f1c"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/1 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: defaultHttpClientForBrowser: \u0060defaultHttpClientForBrowser\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rspack/src/builtin-plugin/HttpUriPlugin.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"031d958c043509ff28b89f1339c21f3b2b9c24dc61a4e117f65f93c559f3a358"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 40 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_watcher/src/disk_watcher.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0c6906435808150c36f75879312d1d72c1601c21f3fec55554ce3c2f212f61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 83 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_watcher/src/disk_watcher.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"845f154c6bbc086bfa8e682368192ec405c64e1f64f086b3fcb03654b500e245"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 181 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_watcher/src/ignored.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"714a062b9f87ca05a2994381808352f0ca295bf3c74d058205007b2238b59138"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1087 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d0ee183b339b78eedcb3ccdd62b4815e8a297e439a8ecce59f67b227b70922"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1122 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_resolver/src/lib.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8029b25dbfa214485a09e3597a9bf050cc8c51f085e98fae43426967fa74c938"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 294 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a877fa5e84b3cee94d82723c8a6f53732bed0001c3fc6741ee92c6effc094be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 523 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98be8f50a65ded867b3fd01a5bcac2555542d00089c167683f22783185b8cf8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 535 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0476c6e1ced30ea074a47ca77e14d38839328ccb347a367cee29a74aae036bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 561 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb46f47db1d51bc585a8f2252bd8d3d50db2cb9c06b9562706728379e2231e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 573 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d8029e2e04c2c29dfcd15dc69d6bd36c3fdb6ddb7e83a5c1a2331bd832d807"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 631 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/max_size.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"441f13c0988894c597ba6335833885f2855166fb6641202be26f57dc98fa7a11"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 74 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/min_size.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba446197a163ddac72005768be8bdee32f16492b9ea572642e847c5484d3666"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 247 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/min_size.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b221cc6cbda158ec6f7c89ded48e05ad96945d7b5baa1d5dc1465d69e25fbb0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 289 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/min_size.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce29d77490733645f8b692891d2dbff4261060a5bf0628befbfde1b74d62e60"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 59 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f7cb661d3e2123531bee32b8bd62a707b545fd781292f548c1cf56725043a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 83 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b7fcca0a1af587a0b6339f57db89fcadb484e5463f8432e5bc2325776e1a61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 304 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19e1fbcb629b20cf7895901f1023917c6cf4c20e7ddb437a07480735bdb6690"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 314 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0b314b240f328f86a027397dd8a5fa9c34eafaefedca86da5176944344d8c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 330 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb1e52cfcfa6bc11367a4450f38f9fb72c7149ed011b78f925179b766f8bdfe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 450 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"484e99d497ee41386ea09a137e1df55f78c2f37c9b28bb225e2315b9baa90531"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 494 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a86b624cf0b028fad6f7380fe533c66f646d2325b94a7f35e2438b1624e6925"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 518 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/mod.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bde46ce22e84404b10e05a9e37f80b95660b5379bde650b03510e259d7c679"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1456 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a39a889260517bb8fdbbef6fa8a8f17c7d8d3eb8ab4ff7bfae51b8de0fff42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1462 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fa07d3e996afe1473fdf08b59639a9407dc635315f14e50daf9a76d5b5bb42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1463 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"909802054cab285b8ddfea2df376d2b23c4c04bb32488a315ea11d44e4df26a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1470 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d46532e73490e7ad4df2de62d68d1ed60ec82737f59bd951c4105375c41730a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1481 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c7e3bcf33aa62730eb77a36abb5da64a7b779138a0618efcc800880b81c0ce"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1503 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_split_chunks/src/plugin/module_group.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94ceb5f0afc296a0961e1615645fc7c5353719a7b77ca9d787bd3c46ab17568"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 30 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/file_uri.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"257aff028381877fa1d1eb1b56659b596735150a3a350e70ad68ca1ec3af604f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 64 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/file_uri.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df79e0c0083fc23fc6e8ca768d6045699cebbabc19bf4bb459c7c814222f794"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 74 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/file_uri.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8aea8e04d7c0b9e855d960d3cfc1c90ecc17b51878d37f051ca143bf8446f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 117 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41c80f12b3caa4c6ba74e8be10cebdff541c8ad6ae5d072cd119a4d3055eed9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 131 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfa9a55f00d4e5045818e47a654321289ae360b982b0f45496c3c10c9325123"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 147 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d7954ab8c761ccb44d6e0d27aa35d3399a52d41fb8f2517e43dca4169e309b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 185 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"700d7ad9e12caa786811d17394c5308077f29be5fd668c2756a2ec7202812fcc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 190 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1a8b85a9cf156af69bf54d20bd2827627c12190ec510832b2fa0b48a639506"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 196 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d363a15d2e7b8ca5702143a584a915c28f85d2e477fb8c8feb4e8a01ea49c39a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 206 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"374c54c599937ff53da81383731cce15a8cc11ae68ee3f143a04d0b6bb36c7d2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 211 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eee96a1d83bd1b63118e5f56bd893118e9bfc8320754bda01c42db51d5720bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 317 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"91759dd5f4a26947f5da521b748a13155d64292df8513138aefd7c5cd8819886"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 393 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/http_cache.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3555c212b556809ad54cce17632ccfaa6edbf7e21cd5c9e73a22386e6d98ed6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 37 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f57f87b30125bbeaa55c36ecfe064f9bc5809f2743468e4f055e787bb593f50"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 69 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bd705d694788024c2aad42fb819f72caca329da08e010f3bd1baa59fecdd8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 73 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d100a0fabc038bfc27905a41104f033cba0dd16f394bd37f0fb71183a4bee4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 77 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"38443f93a6f42e3b6464fa74075e4a2a391f8ea4f5871b755164262809ccf462"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 85 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_schemes/src/http_uri/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0b63aaa13fb718cd3d148c6c9a1feff87e739c9fdcca10c4d6d2f393fb8577"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rslib/src/plugin.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"244b1b43c86c137201863db090e63bea989b19ec5b06ee259af1c375362a41bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 125 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rslib/src/plugin.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"33416e6a949687f345301231809c00cc89cf6f0c8f6d830a7371774d8a45b7e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 93 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rsdoctor/src/plugin.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67355f6a5d4ac363a0b0448bfa93a073ad5b155dc0b9007e6d79e9e74f5406e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 673 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_rsdoctor/src/plugin.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb85b3d686cfef8c12a4ef86107a96a19893a0b316a9b9f16185cbdbf997e277"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 94 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_mf/src/sharing/consume_shared_plugin.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"390118fd22e3b0046641918f05bd5b8d01eaeb582e325f770e8aad0b2b50b1af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 76 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_mf/src/sharing/shared_used_exports_optimizer_runtime_module.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe72933aa28b0da0559ea6029118da1c8e32a7d34bee38d8719e87bf27a1b5f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 230 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_library/src/assign_library_plugin.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1dab1abf4f99a2bed9f9a018c6073a38b88c192c94558c8a7c067627df2141"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 414 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_library/src/umd_library_plugin.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2287cc2d0e4f7e1d0ba4a378c1fe150a5f921ef1a6ed0422597173ffe9372a5a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 448 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_library/src/umd_library_plugin.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5123fd42c8dc40603e361f9e071de47e9ae950a1446255422a4efbcc40ac11"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 174 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_html/src/template.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86f2207b2d74dcc1ef87532f8930aa9603c5af1491084881b39bf7fb28011d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 181 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_html/src/template.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded0186fdec36c6a71942c060422107156ad0ae80634c812e8e5956d8769f36b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 50 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_externals/src/plugin.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1306678c67e31bc71fc2104b022e595c8bca50dbeb0822f70a960929d2969b2e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 180 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a865355afae941db8becb45741896a290c69f49f796fd1b701d20b50f4bc0a85"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 228 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_plugin_asset/src/lib.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"90dff08bc1623febc6b0f9b5953c3c128bdb5c9c1ac1edfd60c28dcf2e3b6fdd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 309 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_loader_runner/src/runner.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b81367fcba0ce16ed172cfdace1fb7e217a640eae2b50354723fe7b11715f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 131 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_ids/src/compact_hashed_chunk_ids_plugin.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aef1f430b527b004ad61d835f1dc976b933ab829f06653333e0fed1b41f3018"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 25 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_ids/src/compact_hashed_id.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bdac7e8d39f6ec53b851fdc7e9aacf0aacce79dcabde88b721b2040fe44089"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 102 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_ids/src/compact_hashed_module_ids_plugin.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bb5aa784cf2c3431bd88fb17b4bedf22eaf54c0757f8efb22f335cbb20d5d4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 163 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_ids/src/deterministic_module_ids_plugin.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"678e37849b1cfb513e64208195b34b26cd943afc60554e8fdcb6ac5b09eca20f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 644 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_ids/src/id_helpers.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecc5c7ab2433ba986175b7dc9c35edc30f9ca8b3e911927def8592e736bc0da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 658 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_ids/src/id_helpers.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"0956ae5142f0114ae0440365bfcd9a02cafd3e83338129d30653770dcaaae3e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 41 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_ids/src/sync_module_ids_plugin.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"481e5db28e2e121908c22c42c8186c34ca7f0eacdb3ae9cadfffa8e2b17b2280"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 153 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_ids/src/sync_module_ids_plugin.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad309e637cb44011d857a15e3c1ba4a94d80d1087c3183e76e4d844ac97f211"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 510 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/chunk_group.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"103e3483a3a0bc314c706355e0bc3f986060776543474b4fdde9ed07febf936d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 137 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"827a0791ea012c4981c2b86267f1e4fbbd3a77964b27e9b511406a2b03fce923"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 162 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8305ef9b6317ba3a759423a7da410e0d6d12de33c3f5176f656dad819f3f6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 279 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/context_module_factory.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4271b56001c579121cc21d13c021dabd6e9f15f9122aad8ce5b32077edbf5e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 724 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/normal_module.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1709dab06758cd75ef3e416e421e11237660aadb647ebfb2db22479d7f576a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 771 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54552222b1c6a378a08ea94668837731f8cb2fd0b9d7d2956034a0da22adce9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1087 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"b340bf066e4434b71cd153ccee76204851b5023d1d7673a8059ca05a91cae67d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1318 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/normal_module_factory.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"732759d67a83af9d1392d671ec93069705090ae17f157155a273d774e2018669"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1999 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/runtime_template.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2b19b3053528a250f2aacb681cce1fd780aedfd6fac2b4c7a13b489990dc81"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 326 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/resolver/mod.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f25831b15508178bfb8b45da4b43f673d66332dabfe9c002fab261740b6d03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1874 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/options/module.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b427a4f5a7e05b1bb4733d1ef4be95c38f877c009a6eab70b682b3344b32f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 112 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/minimize/mod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c5c2893c0ce3c85572cc31256189eaa985874fe03fa0a92f3135840f42bd47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 121 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/minimize/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fde5b0d67612eb45551c6475fc494da812b010a262daba241884b19f75ec3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 152 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/minimize/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8447455d03b812bd5e2d42110e889e8140d3c7d01550bea07c98aa9a16f290"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 157 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/minimize/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"737c4e06b3b2b6f5020f0027b93212379bbe0c70672d41f5fb0e3127f44fc950"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/make/module_graph.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9951618209c72ee8666f5367f320da9c5f585047776929c45fca8ffaaccf28f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 134 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/make/module_graph.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7054bbba6c8eff9bb4bafbba070e0f36f7edd1545fe40dcf68977d4bff14c158"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 225 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/make/module_graph.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4477522c232f21b32c0dfb5952929ebac72076ad91007f98b61f82d1d5426adf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 196 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/devtool/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b0ed79e0c84d4a9a75bbf7238f996dc51962af69732d899f6b2e55f70d62d4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 208 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/devtool/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3fd46de7641ead09afb2b27701c79dcdd4f5d98284fef58fededb6917d16a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 225 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/devtool/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65bdfb36ce69ef7a02df61c11784773913a006e4a177e44d8eb48454169cf0a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 234 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/devtool/mod.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0b2fc95217c0c367329901fe7b9ccc9536e599d8e5c95aacc24524fe274d76"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 250 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/devtool/mod.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"849976762165fa00eadda462cdb969f7c19dbb41f9db2266a9dd13d03bfe7fd6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 265 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/devtool/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"abda96576049f6d41a9623f945add2af3287a27181793b632f76fe59f1119317"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 272 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/legacy_cache/persistent/occasion/devtool/mod.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e95205bde8634dae39327f4650598b4e5389429a97085194369fd0e9acef25"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 842 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/mod.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"514b3e113f61db544c5df075011c6735fc19aff32f1ae2e2c95381c634ddc91d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 32 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/module_executor/ctrl.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f1d378ab59612c7a1d8c471d76e7271aed40778b835567d518928aae8c50dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 324 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2876854277beeeebf7ed0ba2743f357632e4d88f5c515e3ab6673176a2facc38"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 411 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/module_executor/execute.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17c017214b7178dd236bc48300b71a9c807678f8f23364f6bb0f43add0ce72d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 65 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/module_executor/module_tracker.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"683d4fea38e73bdaeace660b3c59f762f8d187fd984525d7a17a2a294c093c90"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 128 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/add.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21858ea8464be1457df3685cf058c91820d2da901efa0342c538e23cbfdadfe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 144 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/build.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c132f7341b6d22386321f7f4e7445857cc36d83aa0d8d75a80e781769131ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 133 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/factorize.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bf1cb74fbc7b5d7712bed4e6cc26213b4ed3b76b409f6419663ebbd25fa6b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 145 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/factorize.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb1488c2f56146cb44a3dddfbeb41a9625d5e01230ff73b5b116655a09bfc58"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 154 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/factorize.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08e9f34bc307fbbf86fc618f80a4b36372a44399be8ba537ca57f5b15356b61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 166 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_module_graph/graph_updater/repair/factorize.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f531fbc195f8fb6b0dd42f1554987cb483b468d6ad4677adf27b4744092a65"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 886 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"48148e0b99ee5e7fc826d6a90fd0652525de4687397cd5eca4d27d9463cdc756"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 940 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd44ff3c6254ef6196fc60b8c45aef377b174e0f4b63cd085729c74ae68dc03f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1005 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a93593753acf62577a4cb291c433acb1ced18b3bfef8f307bafc0c008e16d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1513 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d389a741facaf7800b4f5bb689fc85db1d47da4715e251d619542ceb2804a808"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1555 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"6389c61df1157b9a2ee5a180f564e078eac9c48a248dab27d4db828c828f38eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1665 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5e3b256541c5000f0cd4f57c6c303296d1adc3fe0cda8231264d3ffcbf9fc0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1714 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc66fae7ec8e7a8298ae86e095ce739be2b303c6fe5b4dbec966121841314b9c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1743 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b4530643081f90c57c81afed58fc07ee9529a9bbea378b11fa650af4b84ba3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1818 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_core/src/compilation/build_chunk_graph/code_splitter.rs"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f693ae56e50bc7795220c74b80eb16de55c5b20edc0040c206183109c3d7a3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 121 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/logging.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3c76a278654003b6484e6718e6b6774c1045763f9c795b89d31cbb2671206c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 124 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/logging.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86b9e40b103d8d418ab6e4dccb0bf52819ea07eab38307c2bd20b51769a2f44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 276 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/logging.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fb1d9ad71797fe8dbfcd77926e5f2db34c66caee6a646389c31cfa8a3add60"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 57 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/native_watcher.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6415404c78bfa25c5cfcb4e1be5c6206a6240f0598e59a4d0aff173e89437cac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 574 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/native_watcher.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9e63a052baa67ecc86cfb5c918aed17ec964e53117d82a7e3e9cd517f8b9ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 583 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/native_watcher.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"718dfc3ddecf0290688f68e03d279f8ffd3da0da2d1294131f2c478169812afd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"885577d52891b5df46bcf9794199eb03fde4b65018629afc243cffa6f945b237"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 116 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/mod.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9b7cc43002df45269abaa9d2105a4a81ce266634a28f5ecffd349e2953b8f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 122 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/raw_options/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c399b9e2e618be1a9f229321f15745fb5da0a051077ea8b69567aeb36eeea46"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 78 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/options/raw_resolve.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8a48cd2955d4e2698ae6e6fd19a90b88311a831c90efcfe8f5f8210c13f574"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 83 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rspack_binding_api/src/options/raw_resolve.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cf39d6a429242207a1835127c8c69b85f66b7743f9ab89f9404de9b124cff6"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 3/77 of this repository\u0027s type-checking configuration(s) turn on strict null checking (\u0060\u0022strict\u0022: true\u0060, or \u0060\u0022strictNullChecks\u0022: true\u0060). A configuration that states neither is counted as OFF, because off is tsc\u0027s own default; a solution-style one whose \u0060\u0022files\u0022\u0060 is empty and whose \u0060\u0022references\u0022\u0060 point at other projects is in neither number, because it checks no source itself. Where it is off, \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060: passing a value that is null compiles silently and throws on the first property access."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~6.7 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 326 assertion(s) across the 48644 source line(s) of the 319 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/rspack/src/FileSystem.ts (38), packages/rspack/src/loader-runner/index.ts (37), packages/rspack/src/taps/compilation.ts (32). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060patchFs\u0060 swallows every exception into \u0060return false\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":"tests/rspack-test/configCases/resolve/pnp-enable/.pnp.cjs"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd98b5d76f48281bc90b9b90944ce0878715e4731d08e37ad9e0a521e2914c3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getGlobalActual\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":"tests/rspack-test/configCases/rstest/mock/globals-false/importActual.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0eec35e193696a1752b9b20a006ee9c49d9a6ec267a16cff506bc34fb133f34"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060patchFs\u0060 swallows every exception into \u0060return false\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":"tests/rspack-test/diagnosticsCases/config/pnp-disable/.pnp.cjs"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1b3c151a1a2df262bdb7f9eb7c584323835a9daf0d96d5e57fab3b3d132f3e"}}],"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-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-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"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-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"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":"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":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"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-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-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":83,"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."]}]}