{"$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":"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":"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":"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":"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":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"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":"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":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"Evaluator::eval (cyclomatic 96): Evaluator::eval has cyclomatic complexity 96 (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/macros/src/lib.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a8c2783a4c2c80a9eb1dd6488a95e813d7b168a59388e024edfc522142de43"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyCollector::visit_element (cyclomatic 86): DependencyCollector::visit_element has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/dependencies.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"544ed32a712d1c93d349323a957b2d9cfd07ade1553f15c26341260789ee1e38"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_html::optimize::optimize (cyclomatic 69): parcel_html::optimize::optimize has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/html/src/optimize.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfac1469da341015401674020007f18f82b7b677b1d8f9be08ced8ffb980f676"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_js::transformer::plugin::config (cyclomatic 66): parcel_js::transformer::plugin::config has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/js/src/transformer/plugin.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"78288ba3e1b5e4f5555de5431867906e5676c81bc22cf83cd2f25ba6365873a0"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyCollector::fold_call_expr (cyclomatic 65): DependencyCollector::fold_call_expr has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c54cf8ca28abf42f043aadf1cb17690272ecce0948605df9509adae8a6c09b"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel::parse_args (cyclomatic 63): parcel::parse_args has cyclomatic complexity 63 (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/parcel/src/main.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe00a5a9c56a9ca2bdba8eb5cdee6cf1427e636bf6b83b1d534dbd848d6f083"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_js::packager::dependencies::asset_dependencies (cyclomatic 58): parcel_js::packager::dependencies::asset_dependencies has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/dependencies.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe02541ef11428c24dbe933be36d15a2c4b64725a32d3f9b2e0cd05f2ba64c42"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_js::transformer::transform_to_ast (cyclomatic 55): parcel_js::transformer::transform_to_ast 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/js/src/transformer/mod.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a759d5181183d5c8762316d58ac73f7cd3ebb0800fff7b6bd140698951b53d"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_html::package::insert_bundle_references (cyclomatic 53): parcel_html::package::insert_bundle_references has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/package.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5548b3fcbf47dffb6c4b54a3cc96328aebc5d660cba8a36efb8003b4b0f05f"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultResolver::resolve (cyclomatic 53): DefaultResolver::resolve has cyclomatic complexity 53 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/resolver.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"57eb760c345db79f05badd03e244b8b117f01d3968d792feefc9dfd5cd79def6"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultBundler::bundle (cyclomatic 52): DefaultBundler::bundle 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/parcel/src/bundler.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d988fa03430124a0fcb6bfc01c1ba00285b28323afff5800558056180af903"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::normalize (cyclomatic 48): (anonymous)::normalize has cyclomatic complexity 48 (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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"263a8686d98a718911092104d46bba20acc51826bf88137e70ebc902e5841fca"}},{"ruleId":"D1","level":"warning","message":{"text":"AssetGraphBuilder::build_with_changes (cyclomatic 46): AssetGraphBuilder::build_with_changes has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/asset_graph.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"31764f9c074fd30101cb104cbef52026f8914084433a2e29be77f028ef460f0c"}},{"ruleId":"D1","level":"warning","message":{"text":"assetPanel (cyclomatic 46): assetPanel has cyclomatic complexity 46 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 15 belong to 13 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":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78fe1cad2eb112a03fa0bb6b125e50ad7590cd7c559cf1ed8ae876fc7d98fb7"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::resolve (cyclomatic 46): (anonymous)::resolve has cyclomatic complexity 46 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7add3d33f1a3c9583b3e05ed82b912b9d00c19f81a1bb701eb8a28523516e3b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::relative (cyclomatic 42): (anonymous)::relative has cyclomatic complexity 42 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e23a8be533fb9eca77f1d61b664976f60ac8e84dc17b60020eb7694ad6684a6"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel::bundler::style_order::segment (cyclomatic 40): parcel::bundler::style_order::segment 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/parcel/src/bundler/style_order.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d9fc0dde3256bb28e8da2afd577d93fd70286e6a18d417484a3f908b63c14c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::parse (cyclomatic 40): (anonymous)::parse has cyclomatic complexity 40 (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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd62eba0a70dce5992bfdd752cfef557113faf6d7af7a37b80713d8ff2589331"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_html::srcset::parse_srcset (cyclomatic 39): parcel_html::srcset::parse_srcset 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/html/src/srcset.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ba0ad94e1462634a3090a256dc2ea10771e9b7680e77f9b39d5e8cbb891fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"Esm2Cjs::visit_mut_module (cyclomatic 39): Esm2Cjs::visit_mut_module 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/js/src/transformer/modules.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fb6e64a4bbbfdf6a7d373c6639bf8a4167d1c8470d2b3844150cc474d33bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel::bundler::optimizer::optimize (cyclomatic 39): parcel::bundler::optimizer::optimize 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/parcel/src/bundler/optimizer.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"461124523b62b8375a71e6194fa790d666337608cd3891b5b125c9cdbe0818ec"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_html::jsx::to_component (cyclomatic 38): parcel_html::jsx::to_component 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. This is NOT this file\u0027s highest cyclomatic complexity: parcel_html::jsx::jsx_attr_name (cyclomatic 366) 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/html/src/jsx.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"05da8a9d9131066bb1de53ba65a7fa381c123cf0c8d167a93ea14354c5cc3d0f"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_html::serialize_html::can_omit_end_tag (cyclomatic 37): parcel_html::serialize_html::can_omit_end_tag has cyclomatic complexity 37 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/serialize_html.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a3a805b2ecca50f89f522f77e47296636fc0686339982d45296b60842e0c08"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_core::bundle_and_package (cyclomatic 35): parcel_core::bundle_and_package 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/core/src/lib.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b47eef825ea4d13f1826e218a313b7a1b36ff901e14a73ffb89e33930fa5c43"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageTransformer::transform (cyclomatic 35): ImageTransformer::transform has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/src/lib.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cecb27cadbd0ecd24ba87146e20d2bd18f0a7069199dac208b226446c16f51"}},{"ruleId":"D1","level":"warning","message":{"text":"State::rebuild (cyclomatic 35): State::rebuild 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/parcel/src/bundler/optimizer.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"691e76bfe1d4b2984a42ae2fe13174f4339b731ad4eef10ef45b6b080f8ea435"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_css::packager::inline (cyclomatic 32): parcel_css::packager::inline has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css/src/packager.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a5d380d264421f1c2562613af6eb2fcd7983fcc538679d65fc0a2dcf0469bc"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvReplacer::visit_mut_expr (cyclomatic 32): EnvReplacer::visit_mut_expr has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/env_replacer.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e377d8fa3a7936093e4b65a969a751aebe7bdc894740e577aed736e7b6f424"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel::analyzer::write_report (cyclomatic 29): parcel::analyzer::write_report 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/parcel/src/analyzer/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"734b396e869888a1f6b807018cdf34914fa33a1a56890cc955fdd1f2c46ac4b8"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel::bundler::style_order::report_conflicts (cyclomatic 29): parcel::bundler::style_order::report_conflicts 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/parcel/src/bundler/style_order.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"db747a0db5cc0ece13948bc838491aa36c7c53e4effd4685df7f7adac8e2ce34"}},{"ruleId":"D1","level":"warning","message":{"text":"Engines::supports (cyclomatic 28): Engines::supports 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/core/src/target.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"60baa71eec1cc273a572ac3e195890eb930a1b961b58ddaa822a6ef649dcd0e6"}},{"ruleId":"D1","level":"warning","message":{"text":"BundleRoots::from_asset_graph (cyclomatic 27): BundleRoots::from_asset_graph 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/parcel/src/bundler/bundle_roots.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7989d3c91c4ce978fc7cfa77e80348fc8e4bd05e14b59faca7cc6886d0a4ea9b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::dirname (cyclomatic 27): (anonymous)::dirname has cyclomatic complexity 27 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd77f988a90fb352be6d3038107bfb3eb8d4b36adf254d70d86b697ab7a9f4d7"}},{"ruleId":"D1","level":"warning","message":{"text":"JsContent::package_app (cyclomatic 26): JsContent::package_app 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/js/src/packager/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6a3e428e6ebd1487cb703820e8465b4894c748b9cdf07e6c47a2b7517bd233"}},{"ruleId":"D1","level":"warning","message":{"text":"Collect::visit_member_expr (cyclomatic 26): Collect::visit_member_expr 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/js/src/transformer/collect.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d66081d6388882d9b2e780b45f85dff3d846c1ad504c5437bd70508ca88390"}},{"ruleId":"D1","level":"warning","message":{"text":"JsTransformer::transform (cyclomatic 26): JsTransformer::transform has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/plugin.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dab01c8f507521af151d097383ef55d4ffc0fe4e6a897cba7cd0fce7237a55"}},{"ruleId":"D1","level":"warning","message":{"text":"dev-runtime.parcelRequire (cyclomatic 26): dev-runtime.parcelRequire has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 12 of the 26 points are its own statements and the rest belongs to 5 function items inside it that branch (localRequire, a function literal at line 103, a function literal at line 109, \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":"crates/js/src/dev-runtime.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9b40f0676b86d4eaf1ef27f1818efe98d094d589ec09db99becd74ff6fc548"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_core::asset_graph::resolve_symbol (cyclomatic 25): parcel_core::asset_graph::resolve_symbol 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/core/src/asset_graph.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9b26332e5c6ca2f0b26f1abf0c871fda1b849b7d8c2e49d10d5d2752f827a8"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_highlight::js::classify (cyclomatic 25): parcel_highlight::js::classify has cyclomatic complexity 25 (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/highlight/src/js.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f4c302fed994b161e227e3777d466c390493f6f991d2f2a8070c8ba49e4bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobResolver::resolve (cyclomatic 25): GlobResolver::resolve 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/parcel/src/glob_resolver.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afb14257879bc06824532421d0ce97121ae29128e594fde40739512fc1ba389"}},{"ruleId":"D1","level":"warning","message":{"text":"Specifier::parse (cyclomatic 25): Specifier::parse 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/parcel-resolver/src/specifier.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bb1a0a843834be478789f2c6e0195393862164b4240c229cca213362bd5951"}},{"ruleId":"D1","level":"warning","message":{"text":"EntryResolver::resolve_file_entry (cyclomatic 23): EntryResolver::resolve_file_entry 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/core/src/entry.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fc3413b47df82c64af8a7f5e10adba9d7fcabe9fd5cc186983aff3e8e55de7"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeShake::visit_mut_stmt (cyclomatic 23): TreeShake::visit_mut_stmt 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/js/src/packager/tree_shake.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f4f593c008e414a2ee815c3ab6b11d46ded4c0980563f5358586bdb018f525"}},{"ruleId":"D1","level":"warning","message":{"text":"Collect::add_pat_imports (cyclomatic 23): Collect::add_pat_imports has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/collect.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"8384982661837f21ad5c7bad57d52186c1a9ecacb3b043817a699fd553ddee5f"}},{"ruleId":"D1","level":"warning","message":{"text":"PackageJson::resolve_package_target (cyclomatic 23): PackageJson::resolve_package_target 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/parcel-resolver/src/package_json.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e6fa3386fc6952a88134066ad57f2ea0b9ab78836ef2befa217fb892ffda47"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::join (cyclomatic 23): (anonymous)::join has cyclomatic complexity 23 (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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c83cc050f6209a7248f231009cfc4b45eb95a34beebfb09e12cbcc60bb757e"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::basename (cyclomatic 23): (anonymous)::basename has cyclomatic complexity 23 (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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c456937be6c90360395a29efb773867d998a53494842477c5f6d161c3af273"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_html::prepare_to_package (cyclomatic 22): parcel_html::prepare_to_package 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/html/src/lib.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e6d8d8fa189c243ca51fcf807b851b8f19acae7d75a191200e67fe2449a87a"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeShake::visit_mut_module_items (cyclomatic 22): TreeShake::visit_mut_module_items 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/js/src/packager/tree_shake.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b2144e64127d87503a438a4bd99816030b6d67aea17e1d784c9e0364b8bf2e"}},{"ruleId":"D1","level":"warning","message":{"text":"ReactLazy::visit_call_expr (cyclomatic 22): ReactLazy::visit_call_expr 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/js/src/transformer/react_lazy.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2adcc4e6da268a1f55267d6bb10ef996f950a0ab2385c66ce318ea508f22d5"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultPluginFactory::transformer (cyclomatic 22): DefaultPluginFactory::transformer has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/plugin_factory.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d988882d31bdec30ea5228f14687e10a66ab88daf2c86c2fe497314606fd8e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"OxvgConfig::into_jobs (cyclomatic 21): OxvgConfig::into_jobs 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/html/src/oxvg.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cd00cf54dae3b8aa8895f8946a621af11c5cacd8eda5922d2e1d8146c8d766"}},{"ruleId":"D1","level":"warning","message":{"text":"CjsLoader::load (cyclomatic 21): CjsLoader::load 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. This is NOT this file\u0027s highest cyclomatic complexity: CjsLoader::resolve_builtin (cyclomatic 27) 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/plugin-js/src/cjs.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51b848855763b112348a14011e8b9a4662d4191daa181b5e325de03007c7529"}},{"ruleId":"D1","level":"warning","message":{"text":"CssContent::package_impl (cyclomatic 20): CssContent::package_impl has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ReferenceReplacer::visit_rule (cyclomatic 27) 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/src/packager.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"149b3ba18281fd569783546da0e12647976dcb65ce9c4e1dda05b366663a658e"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_highlight::html::tag_attrs (cyclomatic 20): parcel_highlight::html::tag_attrs has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/highlight/src/html.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"78eda6cb0ef66f021fcc11b82d4efee1611d1808fbf9cb71d9b45b6de3df2c2b"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlSerializer::start_elem (cyclomatic 20): HtmlSerializer::start_elem 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/html/src/serialize_html.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fe809a58e1c2a62fe43af8668916fed3a6afb76a61463f4024c021a938d06f"}},{"ruleId":"D1","level":"warning","message":{"text":"SyntheticAsset::write_content (cyclomatic 20): SyntheticAsset::write_content has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/synthetic.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb01ead3c688fc4d31d3a0951edb5b92d0f085ff2478a3143aab171715c80ae"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_js::packager::write_runtime_globals (cyclomatic 20): parcel_js::packager::write_runtime_globals 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/js/src/packager/mod.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb8ee978e3ca2bcd7c9af42fa5705362038b551bf1061f9538b0a62961506c6"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel::run (cyclomatic 20): parcel::run 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/parcel/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddc86e8ef4e70d3633cb3c83575dd9ca207bef2c9b06cef0c0680ae0125f236"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolveRequest::resolve (cyclomatic 20): ResolveRequest::resolve 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/parcel-resolver/src/lib.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8760c9387476ea4913881c357b2d0ade2f7d141c189f42881f5948fd4e2b4e"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_plugin_js::path::parse (cyclomatic 20): parcel_plugin_js::path::parse 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/plugin-js/src/path.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7fd76bc12fb0f182be974e3fad4794d8fbf4fc3e8bbf432e2d1fe1e656d906"}},{"ruleId":"D1","level":"warning","message":{"text":"dev-runtime.handleMessage (cyclomatic 20): dev-runtime.handleMessage has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b81d5bfa6aa01d5b1f4e28c830e102534533e9746e18168b07bb268f48e641c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::normalizeString (cyclomatic 20): (anonymous)::normalizeString has cyclomatic complexity 20 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bcf1364e7fd78f39339718cf9195ef663464a45450487401c84a2ab368fcd2"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeFrame::render_code (cyclomatic 19): CodeFrame::render_code 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/core/src/diagnostic.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"e397f741e0c298553bfdcd253b000d9fae9da9d0fe4ef2c90d89c300dba50e87"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportsContext::to_env (cyclomatic 19): ExportsContext::to_env 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/core/src/entry.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9ee844fb4e0ffdb6097aca53c2a9c737e18b338c107cf6476d87a68d0595d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Browsers::fmt (cyclomatic 19): Browsers::fmt 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/core/src/target.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b85555f941bc13fdf671978e95c1f7b7ee048259b54b76b8c0c7d4aab32a89a"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeShake::visit_mut_expr (cyclomatic 19): TreeShake::visit_mut_expr 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/js/src/packager/tree_shake.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f6e52dcb51707c80ac24fac9d1ba42f428cbb2af4a14b988c70173660db4cd"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_js::hmr::get_hmr_update (cyclomatic 19): parcel_js::hmr::get_hmr_update 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/js/src/hmr.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2dcc356a2b373660ce6b972cf4bbbbb354d3a118e7b1f33c05e0d7f2b55069"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::eval_pat (cyclomatic 19): Evaluator::eval_pat has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/lib.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"b972e0888197c41c09d05d8a83a64e144d6e17ce25b17baffe61c5e13d827b58"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel::server::serve_file (cyclomatic 19): parcel::server::serve_file 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/parcel/src/server.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"92967ef3fdf49c289dc96dee3dba4e8dbd086bcb7d709462ea4782aee9001ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolveRequest::load_file (cyclomatic 19): ResolveRequest::load_file 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/parcel-resolver/src/lib.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"3227c30c2bf56bfe737cbeb16e789273e6511dee30aa49aa115bcd3d53690e12"}},{"ruleId":"D1","level":"warning","message":{"text":"client.showTooltip (cyclomatic 19): client.showTooltip 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/parcel/src/analyzer/client.js"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a663ead48fb5452d53090bee96df196e9bebf734ab96a0816b835ebd00df162"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_core::packaging::package_bundles (cyclomatic 18): parcel_core::packaging::package_bundles 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/core/src/packaging.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"15aaf03a807b1f627505853be9fc1134be3319abc74d967b57ada064bea885bb"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_dev_dep_resolver::read_template_string (cyclomatic 18): parcel_dev_dep_resolver::read_template_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/dev-dep-resolver/src/lib.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"447382b712ebadb281d1e7da7810545e54fae6f7308144b0c44d91c0324f2459"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_html::serialize_html::can_omit_start_tag (cyclomatic 18): parcel_html::serialize_html::can_omit_start_tag 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/html/src/serialize_html.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c73e268a9e1d7fff341ed7ad5863fc9495af7448fdb9adaa6d80e744d1928b9"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyCollector::add_dependency (cyclomatic 18): DependencyCollector::add_dependency 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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"873b71e637d3ac094a10799c54a822e00d7c0c9fc8d068438cc7ca5739d5b54c"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyCollector::fold_new_expr (cyclomatic 18): DependencyCollector::fold_new_expr 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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f28e94e8b3a12469f053bd17409c9ffb97ec6cadea0cd832e5da4516d28157"}},{"ruleId":"D1","level":"warning","message":{"text":"Search::verdict (cyclomatic 18): Search::verdict 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/parcel/src/bundler/optimizer.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc96217a2a7f937b736cb59280fb300e0b1b7ab6da1661dbb9e393510918984"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleLoader::load (cyclomatic 18): ModuleLoader::load has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/src/esm.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad34b76c569863aba774707ddee8cffb3307eaf9613748470d8edaf02af635e"}},{"ruleId":"D1","level":"warning","message":{"text":"CodecOptions::from_js (cyclomatic 18): CodecOptions::from_js 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/plugin-js/src/zlib.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d91652fc58ad9b30c5a25251a7ed06d4b8e8f5d976ae36e4058d756f1440e5"}},{"ruleId":"D1","level":"warning","message":{"text":"BuiltinGraph.readPackage (cyclomatic 18): BuiltinGraph.readPackage 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/plugin-js/buildBuiltins.cjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7448ac44e310cf3b0d9bba376af5a933ce2b315ec55e2ce0e6420551a852e13b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::extname (cyclomatic 18): (anonymous)::extname has cyclomatic complexity 18 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"5965f09a9a623deaa54d0d56d9fb9200df942233efeab31f46eb205abfb9f46b"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_css::bundling::propagate (cyclomatic 17): parcel_css::bundling::propagate 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/src/bundling.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddaca880a64f85f7f8bdbfc159ef1aaae02923ee1065d07f43600e0f8cdd6523"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_css::packager::collect (cyclomatic 17): parcel_css::packager::collect 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: ReferenceReplacer::visit_rule (cyclomatic 27) 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/src/packager.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d77879d889dfec886ef9c03b27a9825b50745ff6c83978fa34110f4a09e74e"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver::jsx_element_inner (cyclomatic 17): Driver::jsx_element_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/highlight/src/js.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b0b60d083093b39a0b1ebb505fb2ff157b0543ce4936efa53b11269ddbce5c"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_html::oxvg::oxvg_node_to_parcel (cyclomatic 17): parcel_html::oxvg::oxvg_node_to_parcel 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/html/src/oxvg.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ad3b868ad00dee59bfde4d7e1529340299c06ca3c333dbcc126cbf7c197bb1"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_js::packager::rsc::resolve_dependency (cyclomatic 17): parcel_js::packager::rsc::resolve_dependency 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/js/src/packager/rsc.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cc2bb18bb7328fec38f99f3288e99425367dba5aa568d932f11f0f37f3780e"}},{"ruleId":"D1","level":"warning","message":{"text":"Reachability::from_bundle_roots (cyclomatic 17): Reachability::from_bundle_roots 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/parcel/src/bundler/reachability.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce64c1f09ff9fdfdb721c4b2d626cf41fe57dc1bd2ce453ea9e798322893a9b2"}},{"ruleId":"D1","level":"warning","message":{"text":"CLIReporter::report (cyclomatic 17): CLIReporter::report 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/parcel/src/main.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b07d705b0ecd7e3ac136d89896dbd9550f2cf5bb18e8f10566bbe107aa8b47"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultNamer::name (cyclomatic 17): DefaultNamer::name 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/parcel/src/namer.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd53a6a291843b172c849d69ba04605802d35553784f609356f033fe60383fb9"}},{"ruleId":"D1","level":"warning","message":{"text":"StylusTransformer.getDependencies (cyclomatic 17): StylusTransformer.getDependencies has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 127). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"606c26c1f6f82fdcd60b0d3af50a0ee487fb8296ae6a10e5310feb40589f593c"}},{"ruleId":"D1","level":"warning","message":{"text":"InvalidationMap::invalidate (cyclomatic 16): InvalidationMap::invalidate 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/core/src/invalidations.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0412729c5d578601c27def505d60efd271d46855f5601501e7c236559761f6b9"}},{"ruleId":"D1","level":"warning","message":{"text":"CssTransformer::transform (cyclomatic 16): CssTransformer::transform 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/src/transformer.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3688ea4db0b247116615b379d960212630ba55a97f60fe6f5ada8bb0a35c44c"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver::run (cyclomatic 16): Driver::run has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/highlight/src/js.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c9582ef749422da273fd6de7c1dec243ed6b64fc3bfeb0d077e3cd351651d4"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_highlight::html::highlight_html (cyclomatic 16): parcel_highlight::html::highlight_html 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/highlight/src/html.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d53b3e938b10feb2c55b312c6182c11d9ffd0a4b2480e6e6005768fcc1762a"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyCollector::match_new_url (cyclomatic 16): DependencyCollector::match_new_url 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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3085cf3dc952bbdf0e4c3feac4692cb530ddd253df7fb39064751a1b873c17"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::fold_expr (cyclomatic 16): Evaluator::fold_expr has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/fs.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a24162939085d70ff3957e4227b7d41293c67a30504ce32ff0e364f7a0474b"}},{"ruleId":"D1","level":"warning","message":{"text":"Internalization::new (cyclomatic 16): Internalization::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/parcel/src/bundler/internalization.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"40625242023aa0044e677d1e13afb842426b1962428945986fe5fb46ff4b8341"}},{"ruleId":"D1","level":"warning","message":{"text":"Internalization::run (cyclomatic 16): Internalization::run 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/parcel/src/bundler/internalization.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e189a0df75f9b47dca027bfd5dfd50045e8b68cc1cddd4ca0a4c86570b54a207"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel::serve (cyclomatic 16): parcel::serve 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/parcel/src/lib.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c48ea2274dfd15edd861490275bbcd758188892c278eacfd96b9619984be32d"}},{"ruleId":"D1","level":"warning","message":{"text":"parcel_plugin_abi::dependency::parcel_asset_resolve (cyclomatic 16): parcel_plugin_abi::dependency::parcel_asset_resolve has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-plugin-abi/src/dependency.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95c8ff7ea0a7acfd3eb5ada3958ee3bfb3de994d2636ee1389b9aaeefbf8684"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::injectIntoGlobalHook::onCommitFiberRoot (cyclomatic 16): (anonymous)::injectIntoGlobalHook::onCommitFiberRoot has cyclomatic complexity 16 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/runtime_modules/react-refresh-runtime.development.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2955f54d29d9012dffb2287e64dfe4c3b0b19527d851223d0dd2d5eaeb1b8c8"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyCollector::fold_call_expr (cognitive 211): DependencyCollector::fold_call_expr has cognitive complexity 211 (threshold 15). Drivers by points: if/else 56 (177 pts), match/switch 6 (27 pts), boolean chains 7 (nesting depth added 142). 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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fefef5e4ce6c614800b28bd6fae481a92d6c9addb9f447df3fd35322a0f3c04"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyCollector::visit_element (cognitive 188): DependencyCollector::visit_element has cognitive complexity 188 (threshold 15). Drivers by points: if/else 61 (163 pts), boolean chains 13, match/switch 4 (9 pts), loops 1 (3 pts) (nesting depth added 109). 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/html/src/dependencies.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b9ddd44541aeefe69385eaaed9a4ba3abd35f55e106880f908e2b24c639e50"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::packager::dependencies::asset_dependencies (cognitive 179): parcel_js::packager::dependencies::asset_dependencies has cognitive complexity 179 (threshold 15). Drivers by points: if/else 41 (144 pts), match/switch 4 (15 pts), loops 3 (11 pts), boolean chains 9 (nesting depth added 122). 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/js/src/packager/dependencies.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ae3ec33ebafa38fc3ca85d71890851bd2c2644c26034a3595dfe07da3a5d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::package::insert_bundle_references (cognitive 164): parcel_html::package::insert_bundle_references has cognitive complexity 164 (threshold 15). Drivers by points: if/else 39 (122 pts), loops 8 (28 pts), match/switch 3 (10 pts), boolean chains 4 (nesting depth added 110). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/package.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31c59f8bcf7af8a61f43cbf16a9d9321190b874e40448f52ede6d7bdb71b71a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetGraphBuilder::build_with_changes (cognitive 161): AssetGraphBuilder::build_with_changes has cognitive complexity 161 (threshold 15). Drivers by points: if/else 30 (112 pts), loops 16 (39 pts), match/switch 2 (7 pts), boolean chains 3 (nesting depth added 110). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/asset_graph.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7ab445f6768f0b54c810ccab1d43993f08580bd544f44b499e89069492dcbd"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::transformer::plugin::config (cognitive 147): parcel_js::transformer::plugin::config has cognitive complexity 147 (threshold 15). Drivers by points: if/else 39 (103 pts), match/switch 8 (27 pts), loops 3 (9 pts), boolean chains 8 (nesting depth added 89). 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/js/src/transformer/plugin.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2c52e95883e955eb30d549703e359e9290e69705a2ca8848ce760eab91e232"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultBundler::bundle (cognitive 130): DefaultBundler::bundle has cognitive complexity 130 (threshold 15). Drivers by points: if/else 42 (92 pts), loops 13 (27 pts), match/switch 3 (7 pts), boolean chains 4 (nesting depth added 68). 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/parcel/src/bundler.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53254d229c5cd29e5089a5abf4d575b639cb1465eb23722082bb879ef5d9faf"}},{"ruleId":"D2","level":"warning","message":{"text":"Esm2Cjs::visit_mut_module (cognitive 115): Esm2Cjs::visit_mut_module has cognitive complexity 115 (threshold 15). Drivers by points: if/else 16 (53 pts), match/switch 10 (41 pts), loops 6 (21 pts) (nesting depth added 83). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/modules.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40854ea9fa03f852a30f6bd224703b74c848392bc99a9bdf8df510e6786f36d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::resolve (cognitive 108): (anonymous)::resolve has cognitive complexity 108 (threshold 15). Drivers by points: if/else 27 (73 pts), boolean chains 18, loops 4 (16 pts), ternaries 1 (nesting depth added 58). 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef59df18dc32d99f016178233b51bc0df0fa10b480bc82f12add37e3bffbab3"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_css::packager::inline (cognitive 94): parcel_css::packager::inline has cognitive complexity 94 (threshold 15). Drivers by points: if/else 22 (71 pts), match/switch 4 (12 pts), loops 3 (8 pts), boolean chains 3 (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/css/src/packager.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffe758941e92f003cd97815f0d60dc190d3d0f0dac9564b2c9c23fcb9ea50b8"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::bundler::style_order::segment (cognitive 92): parcel::bundler::style_order::segment has cognitive complexity 92 (threshold 15). Drivers by points: if/else 16 (48 pts), loops 16 (31 pts), match/switch 2 (8 pts), boolean chains 5 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundler/style_order.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbb5c97e95808eb61eb0f41c2ba9666fb5625d9877a7151b8ce7739f755ff61"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::normalize (cognitive 92): (anonymous)::normalize has cognitive complexity 92 (threshold 15). Drivers by points: if/else 24 (54 pts), loops 5 (16 pts), boolean chains 15, ternaries 4 (6 pts), other 1 (nesting depth added 43). 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f37b815bdd27735c349525690267ebf0f34b9517482bdaf7ea2a4a2bd5b5f3"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::transformer::transform_to_ast (cognitive 87): parcel_js::transformer::transform_to_ast has cognitive complexity 87 (threshold 15). Drivers by points: if/else 37 (59 pts), boolean chains 10, loops 5 (10 pts), match/switch 6 (8 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/js/src/transformer/mod.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49a29d553d0e2d527b573ca2d98934a506567db772ee45e2217cbc0b7b632a5"}},{"ruleId":"D2","level":"warning","message":{"text":"State::rebuild (cognitive 84): State::rebuild has cognitive complexity 84 (threshold 15). Drivers by points: if/else 18 (46 pts), loops 17 (37 pts), match/switch 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundler/optimizer.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f22e732a6d237552b7cd190070a3e8a2984e00eb2d382c27add1072aaeab405"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvReplacer::visit_mut_expr (cognitive 80): EnvReplacer::visit_mut_expr has cognitive complexity 80 (threshold 15). Drivers by points: if/else 24 (65 pts), match/switch 4 (13 pts), boolean chains 2 (nesting depth added 50). 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/js/src/transformer/env_replacer.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"20975a02a6f04ee35117dee8d44c2b2646a08ccef2b2316a9771fae55a0c0b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::bundler::style_order::report_conflicts (cognitive 80): parcel::bundler::style_order::report_conflicts has cognitive complexity 80 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 12 (30 pts), boolean chains 2 (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/parcel/src/bundler/style_order.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b207d699e571e02ea528843e7ad575e317f57b0e732db190a5635a3b91b12b"}},{"ruleId":"D2","level":"warning","message":{"text":"assetPanel (cognitive 77): assetPanel has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 22 (46 pts), if/else 13 (19 pts), boolean chains 7, other 4, loops 1 (nesting depth added 30). Of this number, 45 points are the body\u0027s own statements and 32 belong to 13 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/parcel/src/analyzer/client.js"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e350c52d2c173edaec17bc5bd6e0f0c7149022367fe1006b48412d55c008e7"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::jsx::to_component (cognitive 75): parcel_html::jsx::to_component has cognitive complexity 75 (threshold 15). Drivers by points: if/else 29 (58 pts), match/switch 4 (9 pts), loops 2 (6 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/html/src/jsx.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"260e263a9011b7a6ae52f402000c258a739a424917b47159beb4387f26412f38"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parse (cognitive 71): (anonymous)::parse has cognitive complexity 71 (threshold 15). Drivers by points: if/else 26 (49 pts), loops 4 (13 pts), boolean chains 9 (nesting depth added 32). 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5df9af99f35d3c43476a047a327d6552db4bd32b63fefe12352787e2cc4c38"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_core::bundle_and_package (cognitive 69): parcel_core::bundle_and_package has cognitive complexity 69 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 12 (24 pts), match/switch 3 (9 pts), boolean chains 5 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/lib.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4201422a92dd600b3c893ce33ffce5677e415ecfbe9da0f635649377a12a263"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::relative (cognitive 67): (anonymous)::relative has cognitive complexity 67 (threshold 15). Drivers by points: if/else 26 (47 pts), loops 7 (8 pts), boolean chains 6, ternaries 3 (6 pts) (nesting depth added 25). 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe9c150bc4dd9ad8e7fe364787528d65998b7ea06767cd9615949d758c084cf"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::srcset::parse_srcset (cognitive 64): parcel_html::srcset::parse_srcset has cognitive complexity 64 (threshold 15). Drivers by points: if/else 13 (35 pts), match/switch 5 (18 pts), boolean chains 6, loops 3 (5 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/html/src/srcset.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"938e7119e7bf0d5034ee462add3d2db1df101ce7fca79f994044f3516f848b23"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::optimize::optimize (cognitive 62): parcel_html::optimize::optimize has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (49 pts), boolean chains 10, match/switch 2 (3 pts) (nesting depth added 35). 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/html/src/optimize.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a71a22f7826d00ccbb91ac066783aebb28f5641234f902d9495805db5318eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::eval (cognitive 62): Evaluator::eval has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (34 pts), match/switch 8 (21 pts), loops 2 (5 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/macros/src/lib.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c96fefeab16cbbe6de987925b9756828d78f99b9298b87d3596e34cf3d7407"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::prepare_to_package (cognitive 59): parcel_html::prepare_to_package has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (45 pts), boolean chains 7, loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/lib.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2fb3ba731da8485a6d00d9dcd02274f3346fd56e60536c0fd9b2f177e30435"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::analyzer::write_report (cognitive 59): parcel::analyzer::write_report has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 12 (20 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a972f0a99e906ed08d5b762d775719bf5c2c7a94f5d410eb82b0c4122c668c"}},{"ruleId":"D2","level":"warning","message":{"text":"BundleRoots::from_asset_graph (cognitive 58): BundleRoots::from_asset_graph has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 6 (8 pts), boolean chains 4 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundler/bundle_roots.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f383ad7bdc711be19ae49d15a1e5dd68e26854201c56c666c7276a12e7f735"}},{"ruleId":"D2","level":"warning","message":{"text":"Specifier::parse (cognitive 57): Specifier::parse has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (48 pts), match/switch 3 (7 pts), boolean chains 2 (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/parcel-resolver/src/specifier.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b76fbbae2c39aa2c5ee6395b80e0c9e54da7891aaf04997a5e15a7714abae8"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::dirname (cognitive 56): (anonymous)::dirname has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 4 (13 pts), boolean chains 7, ternaries 2 (4 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":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acb68ce31b3011b17c01cf312c2beeb23e0457b0d80536491fc748798e10d43"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::bundler::optimizer::optimize (cognitive 54): parcel::bundler::optimizer::optimize has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 11 (13 pts), boolean chains 12 (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/parcel/src/bundler/optimizer.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f4d875a385ebb854c01c9d4093296ad1453b76fa373d4271e277b6a8ba4209"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::parse_args (cognitive 53): parcel::parse_args has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (33 pts), match/switch 5 (12 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/main.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"51897f8e9ebf975948837ec7425c9de5f42c6ea72bf8b143711de739413ebf6f"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeShake::visit_mut_stmt (cognitive 52): TreeShake::visit_mut_stmt has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (46 pts), match/switch 2 (4 pts), boolean chains 2 (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/js/src/packager/tree_shake.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b0124dd0acedbc9712ddb7d66422dd37e315086824ee6ea17757d08d6a9606"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeFrame::render_code (cognitive 51): CodeFrame::render_code has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 3 (7 pts), boolean chains 4 (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/core/src/diagnostic.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4c2439183259a606cb9bf0ad40b109a1934887223c5cebd0a9ad9f9eb193b2"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyCollector::fold_new_promise (cognitive 51): DependencyCollector::fold_new_promise has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (41 pts), match/switch 3 (10 pts) (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/dependency_collector.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"116460f23e3e4dabd44b8970a6af45aac8b05a59f769652637d24bafd8382466"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::normalizeString (cognitive 49): (anonymous)::normalizeString has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (39 pts), ternaries 1 (5 pts), boolean chains 4, loops 1 (nesting depth added 26). 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c3291cf684f4b7b29dd1ffe01b95006dad6b78301bb630db0e21a1870d0e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::basename (cognitive 49): (anonymous)::basename has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (43 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 26). 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c027adb7737c278514cf8e9d9b400fd7a276cf4eef84c99dc7d86cedd486e86"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeShake::visit_mut_module_items (cognitive 45): TreeShake::visit_mut_module_items has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (33 pts), match/switch 4 (11 pts), loops 1 (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/js/src/packager/tree_shake.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b15342020c85c328d66f89abfdb10b9d645d2da06fb9afb1112e7ef753d5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Collect::visit_member_expr (cognitive 45): Collect::visit_member_expr has cognitive complexity 45 (threshold 15). Drivers by points: if/else 24 (41 pts), boolean chains 3, 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/js/src/transformer/collect.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3f72d1d0f43e860cd495844bd73f8507060c37102bf38a847292ada5538746"}},{"ruleId":"D2","level":"warning","message":{"text":"Reachability::from_bundle_roots (cognitive 45): Reachability::from_bundle_roots has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 7 (15 pts), boolean chains 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/parcel/src/bundler/reachability.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dcbffd94eedfd74bdd8ce0af9ec2067788bb65b20f937a2ecebe3f10608c07"}},{"ruleId":"D2","level":"warning","message":{"text":"parcelRequire (cognitive 45): parcelRequire has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 7, ternaries 2 (5 pts) (nesting depth added 20). Of this number, 23 points are the body\u0027s own statements and 22 belong to 6 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"876ae6b9c12d2fa6e490c75ca0ec2c87fdf4b11464d9dfc85c0ba113481430b9"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyCollector::fold_new_expr (cognitive 44): DependencyCollector::fold_new_expr has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (32 pts), match/switch 3 (10 pts), boolean chains 2 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/dependency_collector.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29ece7d651e2026d2b53e67754166870f7ed0674d940dd23cedfc78c2690787"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetGraph::dfs (cognitive 43): AssetGraph::dfs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 4 (9 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/core/src/asset_graph.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4a7ff01fdb6eed0e6a6c94632ec010fa5e963e332ad6aa8836359198ebe6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"JsContent::package_library (cognitive 42): JsContent::package_library has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 1 (2 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/library_packager.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7702e4d228e35cb592105d9a917049ae624b629118dec65c37c88548749e14"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::join (cognitive 41): (anonymous)::join has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 5 (9 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 17). 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"96588c3667162fefb20e3d5a7cffe63b67dd9ab396c204abafdbfd704da6862f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReactLazy::visit_call_expr (cognitive 40): ReactLazy::visit_call_expr has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 5, loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/react_lazy.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a051229b097fb70a78d2300361b4b9e69c922d971ed08ef4a82ecf0f96c887"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryResolver::resolve_file_entry (cognitive 39): EntryResolver::resolve_file_entry has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (27 pts), match/switch 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/entry.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e88298bac25e45712eaf0eb581e48208bce2a355c47132e88cae195314978f2"}},{"ruleId":"D2","level":"warning","message":{"text":"JsContent::package_app (cognitive 39): JsContent::package_app has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (29 pts), match/switch 3 (5 pts), loops 4, 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/js/src/packager/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ebd56b4a6a7988617686cdfb453b349d8ebb81361aaf53b8f8196fe0076e89"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyCollector::match_import_meta_prop (cognitive 39): DependencyCollector::match_import_meta_prop has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (35 pts), match/switch 2 (4 pts) (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/dependency_collector.rs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f072b5b281f36b327a878319a53f4e1bd4638374adde50601f644fc247c0ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::fold_expr (cognitive 39): Evaluator::fold_expr has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 8 (21 pts), if/else 4 (14 pts), loops 1 (4 pts) (nesting depth added 26). 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/js/src/transformer/fs.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cfe36eee0776745a38e66d88b7be7cf2cd1d52777e92ff04323d03dad3776b"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::run (cognitive 39): parcel::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c521ab36925d1871e9124f4d3d0164149ad58d4e5dcc3a193d50c32a6d9ef762"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::bundler::resolve_bundle_dependencies (cognitive 39): parcel::bundler::resolve_bundle_dependencies has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 3 (7 pts), boolean chains 3 (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/parcel/src/bundler.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc134cf2c827bff17ff99b9b9bdc9f8521881cfc176fee587cd6990cef58251"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetGraph::get_exports::get_exports (cognitive 38): AssetGraph::get_exports::get_exports has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (6 pts), match/switch 1 (5 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/core/src/asset_graph.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb94b11069e34e70ec1765b986916076feb4fc27a4992a178cce434c8171d71"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryResolver::extract_exports (cognitive 38): EntryResolver::extract_exports has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/entry.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"74de091c3ec7c39684ee94a3f11e15d9c54a265197496b980213f3c5430afd7c"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyCollector::match_new_url (cognitive 38): DependencyCollector::match_new_url has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/dependency_collector.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4e1ed481b042e046d40c14beba4c2e439954436e111864bf0e8f8d75b68cc5"}},{"ruleId":"D2","level":"warning","message":{"text":"Macros::fold_expr (cognitive 38): Macros::fold_expr has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (29 pts), match/switch 2 (9 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/lib.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41d488cce54599e2c62a78343b3c140454747b2cfdbe6565029836578f5743d"}},{"ruleId":"D2","level":"warning","message":{"text":"AvailabilityState::solve_with (cognitive 38): AvailabilityState::solve_with has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 5 (11 pts), match/switch 1 (5 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundler/availability.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8c635f115af2381920a3a23f0009dc516ac00360e555918b5d40b35cf39e54"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_core::asset_graph::resolve_symbol (cognitive 37): parcel_core::asset_graph::resolve_symbol has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 6, match/switch 1 (4 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/asset_graph.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"e782d79f4527e4877f2b0749a6b3afd5023f1ba87f962ad40a98623fc0e08957"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::hmr::get_hmr_update (cognitive 37): parcel_js::hmr::get_hmr_update has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 5 (10 pts), boolean chains 3, 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/js/src/hmr.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7c070af75f9d15d6fa40aa90a3a4a8bdf43bdf0dc59fbbdad49564003dd807"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageJson::resolve_package_target (cognitive 37): PackageJson::resolve_package_target has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 5 (13 pts), loops 2 (4 pts), boolean chains 2 (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/parcel-resolver/src/package_json.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d856c7fb52eb3dbe20c1b8262a500143b038dd16148848c90e2bef52417d0180"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageJson::resolve_alias (cognitive 37): PackageJson::resolve_alias has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 2 (7 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/parcel-resolver/src/package_json.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77dc2d5b06f5af37b9a31f3cae8bbdd1a5d8a76bff1d88a911735a301ecf5d7"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_highlight::html::tag_attrs (cognitive 36): parcel_highlight::html::tag_attrs has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (13 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/highlight/src/html.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6725812040946c2b5786cd7769f68c433fd63e09730ef086cfe839ee338abcc2"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_core::resolver::resolve (cognitive 35): parcel_core::resolver::resolve has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 2 (5 pts), boolean chains 2, 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/core/src/resolver.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"663851e9b51597e388a31a576d7318aa5fe30497baae748f6b935e4c8dcebf8f"}},{"ruleId":"D2","level":"warning","message":{"text":"CssContent::package_impl (cognitive 35): CssContent::package_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 6 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css/src/packager.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ec990ba8bfd1e6fc243c406a4815e55552064d228f9659da50ebf16c54e305"}},{"ruleId":"D2","level":"warning","message":{"text":"CssTransformer::transform (cognitive 35): CssTransformer::transform has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 3 (10 pts), match/switch 1 (4 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/css/src/transformer.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c867fe60aa3d3b4dba3b20498635bf39ee121e53055c13b652bf39f1cc279920"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_dev_dep_resolver::skip_comments_and_whitespace (cognitive 35): parcel_dev_dep_resolver::skip_comments_and_whitespace has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 3 (11 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":"crates/dev-dep-resolver/src/lib.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a66c8585aca5666f0f40c485b7ee2fc252a5b7e0326150dc783459dc61000bf"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobResolver::resolve (cognitive 35): GlobResolver::resolve has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 5 (8 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/glob_resolver.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"948c59ef06b738c0ef3765b16e75cc4d983edfab83f9d0026812a26e2abfa0aa"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultResolver::resolve (cognitive 35): DefaultResolver::resolve has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (21 pts), match/switch 7 (12 pts), boolean chains 2 (nesting depth added 8). 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/parcel/src/resolver.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca36aa8fc61b249c21ca5f11184d3b82e43732338c4c2a8dc31e3c3f999cf7d"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_plugin_js::path::parse (cognitive 35): parcel_plugin_js::path::parse has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 4, 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/plugin-js/src/path.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6869cf1fafc2362b9c30e6768ec8580dc829e8637246378e4ead74d3def16c7"}},{"ruleId":"D2","level":"warning","message":{"text":"handleMessage (cognitive 35): handleMessage has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 16). Of this number, 30 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40552c3dc2457d7a3864165216415b39ba6f4f2afd12ec447940d7bd74ddf62"}},{"ruleId":"D2","level":"warning","message":{"text":"InvalidationMap::invalidate (cognitive 34): InvalidationMap::invalidate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 6 (12 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/core/src/invalidations.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"456d2dafc54dfecbf91c97a73cbc46858e20ec4649c14a8716b816e10a438a40"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_dev_dep_resolver::read_template_string (cognitive 34): parcel_dev_dep_resolver::read_template_string has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dev-dep-resolver/src/lib.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"377c6aabcd4a97cd9031431e3e911a1107c66fe7e917aeb771631daeb7ef4d37"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver::jsx_element_inner (cognitive 34): Driver::jsx_element_inner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 2 (6 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/highlight/src/js.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f54de7f4023c52873f9e045dfb2768908dffdd3df77c4cd46c794d626634076"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_css::packager::collect (cognitive 32): parcel_css::packager::collect has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css/src/packager.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc6f4f16025dda51e7521eadd9d2fa6867c578dea640b4b0cdb91772d718aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeShake::visit_mut_expr (cognitive 32): TreeShake::visit_mut_expr has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 3 (6 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/tree_shake.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"977d0bc46f8e45e72cbf8a9d56b7698a36027653c1d3e5418aa4d652dd72d795"}},{"ruleId":"D2","level":"warning","message":{"text":"Collect::visit_call_expr (cognitive 32): Collect::visit_call_expr has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 2 (8 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/js/src/transformer/collect.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7b8e7d215112ba16331a14b635f39e92bea1ca613dcf707c15d673eb379a14"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_css::resolve_css_module_export_inner (cognitive 31): parcel_css::resolve_css_module_export_inner has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 18). 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/src/lib.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4440a5a120f6b099d270a7d4f69e31db6f062b0c34821cf194d7de8c9cad5b38"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::serialize_html::can_omit_start_tag (cognitive 31): parcel_html::serialize_html::can_omit_start_tag has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 5 (11 pts), boolean chains 4 (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/html/src/serialize_html.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"278d78e88ed9c150126108e0c441bb03122c99c8b6996719b172f0ce316ba88b"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageTransformer::transform (cognitive 31): ImageTransformer::transform has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 4 (10 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/image/src/lib.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc603082b589e097d16a0e457d920e2cd91b041ec7d84bf3e650dcf33cd2650d"}},{"ruleId":"D2","level":"warning","message":{"text":"JsTransformer::transform (cognitive 31): JsTransformer::transform has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (22 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/plugin.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18cdf826c8c04f50b9fcbae181a201e5aa3232e2c27e453de4f12fb652927f4"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_css::bundling::propagate (cognitive 30): parcel_css::bundling::propagate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 7 (9 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/css/src/bundling.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a8cb9f070cdab9f118cc8ba5f0d5f36d3aadb4573a7b4c570ec5c4fc00e22f"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_dev_dep_resolver::specifier_to_glob (cognitive 30): parcel_dev_dep_resolver::specifier_to_glob has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (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/dev-dep-resolver/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c11862c20f6a54243fdd3b6453da024693384a5921174bdbacb1de5ec838b5d"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_highlight::html::highlight_html (cognitive 30): parcel_highlight::html::highlight_html has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 6, 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/highlight/src/html.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"320b1a0cd487fd462035e9f00b1d0b4ba6e0378fe2ca13f5507a1ae47eed8b79"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::packager::write_runtime_globals (cognitive 30): parcel_js::packager::write_runtime_globals has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 5, boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/mod.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceb575d1dbdec4805cd1e6ef4b8a45d0acefcdfc48d2205f36980ce3557c4f7"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::packager::rsc::resource_plan (cognitive 30): parcel_js::packager::rsc::resource_plan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 1, loops 1 (nesting depth added 18). 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/js/src/packager/rsc.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27820f8a92677b32b6194ca5af4e5ce9994e04999e54d539b2512b10f6342e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolveRequest::load_file (cognitive 30): ResolveRequest::load_file has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (27 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/parcel-resolver/src/lib.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf0365cd529a2d2950a3cab4ae1768d89ccf31ff60ec7fc98b618f06e3d0e27"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::serialize_html::can_omit_end_tag (cognitive 29): parcel_html::serialize_html::can_omit_end_tag has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (13 pts), match/switch 2 (3 pts) (nesting depth added 8). 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/html/src/serialize_html.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba08cfd739ae36204341e4705283c426b6f679408f49023b214324a055218ab"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntheticAsset::write_content (cognitive 29): SyntheticAsset::write_content has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (6 pts), match/switch 3 (6 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/synthetic.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b3a3b398576963a4117d50ed0c24cbe2d94945b221be0d21aa5a3bee80afee"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::eval_pat (cognitive 29): Evaluator::eval_pat has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 3 (8 pts), loops 2 (4 pts) (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/lib.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7365c9f0c0a15ae39392cc2384d360f7050999188db059643ea943737d6835d"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolveRequest::resolve (cognitive 29): ResolveRequest::resolve has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 2 (5 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/parcel-resolver/src/lib.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2cf77680e8cd30fae2f823f3cc29ba1c269b272912fd9b9a07cc5cc3667043"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolveRequest::read_tsconfig (cognitive 29): ResolveRequest::read_tsconfig has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (8 pts), boolean chains 1, 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/parcel-resolver/src/lib.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fc06cf2ae3f3ffa357d34d167aa259e225fba537c78dfbb7ab0016e82c3d6f"}},{"ruleId":"D2","level":"warning","message":{"text":"dev-runtime.hmrApply (cognitive 29): dev-runtime.hmrApply has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 18). 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/js/src/dev-runtime.js"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"694bf9a458624696e473dda4c9702ac4cb94b1ea7d629c7a4939dfb71e5bf277"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltinGraph.readPackage (cognitive 29): BuiltinGraph.readPackage has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 2 (9 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/buildBuiltins.cjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"78430729d760e7daa4ae96f4f62821e52cc3364227d7592888ad20c80a4bc42e"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_core::packaging::strongly_connected_components (cognitive 28): parcel_core::packaging::strongly_connected_components has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (7 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/core/src/packaging.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c925d57e976b607f82b5330c98b5831b29c80f8ce9efe0d568e1d7656293f5"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::transformer::dependency_collector::match_worker_type (cognitive 28): parcel_js::transformer::dependency_collector::match_worker_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (9 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/dependency_collector.rs"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"2996dad27f91d6d50a1c896af2e5240f11d0ea8a5c1807a50ff11fa8673281cb"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryBundler::bundle (cognitive 28): LibraryBundler::bundle has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (5 pts), 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/parcel/src/library_bundler.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a36cdbf0fc1c389ec968bd874146f99b7d32d9e2d2459916ad8193f0e54944"}},{"ruleId":"D2","level":"warning","message":{"text":"buildBuiltins.validateOutput (cognitive 28): buildBuiltins.validateOutput has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (4 pts), error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 15). Of this number, 24 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/plugin-js/buildBuiltins.cjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4669d194bba951dffe666d70d7ed10e3357911c6676ac99e3374ae8f5a2782f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Engines::supports (cognitive 27): Engines::supports has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 9 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/target.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7612e511b041379c8de7e0a0a0acc9d0738982971514744f701583cbf3eea69"}},{"ruleId":"D2","level":"warning","message":{"text":"Browsers::fmt (cognitive 27): Browsers::fmt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (27 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/core/src/target.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5401038a7cba5bd553643071e1c1866735b9e004fb6a056aafc2b56c647231dd"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::oxvg::remove_unreferenced (cognitive 27): parcel_html::oxvg::remove_unreferenced has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 5 (8 pts) (nesting depth added 13). Of this number, 22 points are the body\u0027s own statements and 5 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/html/src/oxvg.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f3ec1c95746e6047c4714d28f814a4f10d10bf72e8106b459204891d302908"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineFS::evaluate_fs_arg (cognitive 27): InlineFS::evaluate_fs_arg has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 5 (10 pts) (nesting depth added 13). 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/js/src/transformer/fs.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4a3290c46c50432cd4c53759bac6091e8847a478027f3d95e0b3abca761374"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::transformer::mdx::transform_js_code_block (cognitive 27): parcel_js::transformer::mdx::transform_js_code_block has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/mdx.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c742ae2cbe3046a629fb55b0508199ec80bde641b923418b64b82eb99b2670"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::serve (cognitive 27): parcel::serve has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 5 (11 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/parcel/src/lib.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92c8a8734276c93417d1168d6d9454bb199434af032cc5c264d0fe4ad1fc6ac"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlSerializer::start_elem (cognitive 26): HtmlSerializer::start_elem has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 6, match/switch 2 (3 pts), 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/html/src/serialize_html.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b4e9d1508cbf3064088aab06f228e1f64b3ad072a5005295c84bbde0af15bb"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::packager::rsc::write_resources (cognitive 26): parcel_js::packager::rsc::write_resources has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/rsc.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df33487a67d1e40b9f76c06f705a76aec1100aa323f88debb3383ca3d2939ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Internalization::new (cognitive 26): Internalization::new has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 5, loops 4 (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/parcel/src/bundler/internalization.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4300adfa750b9a7284abc73605f60dd5fc96f90bf32b787312528a655c8a618a"}},{"ruleId":"D2","level":"warning","message":{"text":"Internalization::run (cognitive 26): Internalization::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, 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/parcel/src/bundler/internalization.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8605b5258d8a2a13cc13ebaa806b5f7ac819c5dcbc826112374cb3855069be7"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::server::serve_file (cognitive 26): parcel::server::serve_file has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/server.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1a93d8e526f7364724e3b2d5efa390418723ebce9a1c1f11d810ecc479c308"}},{"ruleId":"D2","level":"warning","message":{"text":"CodecOptions::from_js (cognitive 26): CodecOptions::from_js has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (25 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/plugin-js/src/zlib.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"674c3962a3ee6c655ebb04c6730f6b7f0c764d0314729f060628a3b390fe9136"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportsContext::to_env (cognitive 25): ExportsContext::to_env has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21 (23 pts), boolean chains 1, 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/core/src/entry.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b107cf82469ee652ae4b55be3f187b820506ff6d99469c0369a604631046a04"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::transformer::utils::match_require (cognitive 25): parcel_js::transformer::utils::match_require has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (18 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/utils.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"27196e6961b4144f09c0c33c58177b02bbde6027b65f826fcde6a4363288f241"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultNamer::name (cognitive 25): DefaultNamer::name has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 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/parcel/src/namer.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"951ab8eb6a59a78199164de77b580691c338f2f712634e272b5ef619a2031f27"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::bundle_report::attribute_bytes (cognitive 25): parcel::bundle_report::attribute_bytes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (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/parcel/src/bundle_report.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b0de1db378e5fccacfa58935dfa078c9bbe2e36b65f66d853946f7ee66c238"}},{"ruleId":"D2","level":"warning","message":{"text":"client.finalize (cognitive 25): client.finalize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28d4b543d46b57bea716cb8b456ca46e9a8ab9c7bf38dc2089008a0b6f2fc82"}},{"ruleId":"D2","level":"warning","message":{"text":"LessFileManager.loadFile (cognitive 25): LessFileManager.loadFile has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (5 pts), error handling 1 (4 pts), boolean chains 1, ternaries 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. This shape REPEATS in the file: one other method here (LessTransformer.resolvePathPlugin.install) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages-v3/less/src/LessTransformer.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c667253be1672d0a85c918a4185b9ce7cfbfd6e2c383f4f95adae19ff4a0e7e2"}},{"ruleId":"D2","level":"warning","message":{"text":"LessTransformer.resolvePathPlugin.install (cognitive 25): LessTransformer.resolvePathPlugin.install has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (5 pts), error handling 1 (4 pts), boolean chains 1, ternaries 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. This shape REPEATS in the file: one other method here (LessFileManager.loadFile) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages-v3/less/src/LessTransformer.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"18087d82bb34ff5c3765770b0510f79616c6c136feefaaaf47ddded58763a3bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Collect::visit_module (cognitive 24): Collect::visit_module has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (10 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/js/src/transformer/collect.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"df396eca9f25b5607e6fb269147bf411e319d36a1bdcd8e7062e03ff80890676"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvReplacer::collect_pat_bindings (cognitive 24): EnvReplacer::collect_pat_bindings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 3 (8 pts), loops 1 (2 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/env_replacer.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d56f03d8ed18eba1406396ae57cb6411ef9bd5aa34977571b2db01a7b27552"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::transformer::mdx::parse_code_block (cognitive 24): parcel_js::transformer::mdx::parse_code_block has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (24 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/mdx.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42556dcaaf9ecb03974ebc4f8af7c5d186fcf86e6ad0dd65fc31440690f55c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Search::verdict (cognitive 24): Search::verdict has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5 (6 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/parcel/src/bundler/optimizer.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"177b8332ed1dbc055816efc37d1adfb0f2486249cb8ab5cda1c387a7de9c1733"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolveRequest::try_file (cognitive 24): ResolveRequest::try_file has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (24 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-resolver/src/lib.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa450a6f09db4ef0b63e8efef20e34b76b5cba50a00b0d1f61d743d4ec7118d"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageJson::resolve_package_exports (cognitive 24): PackageJson::resolve_package_exports has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-resolver/src/package_json.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e66129b514d4e7f43b99c3384aa29e0db285791c4ca5882cd232774dd0db1cb"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_plugin_js::path::extension_range (cognitive 24): parcel_plugin_js::path::extension_range has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/src/path.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53f8faf3a0c653e946ccc0bbe926315310aa008bd09ac760091ad59f96732d6"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 24): (anonymous) has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (7 pts), ternaries 2 (4 pts), boolean chains 2, other 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3395ea89c49b544a8255c3cf79c422022e7016ea948d6b4fa2060eabeb1019f0"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetGraph::resolved_dependencies_with_indices (cognitive 23): AssetGraph::resolved_dependencies_with_indices has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/asset_graph.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b6dcbf0f6892cf49abd2c388c71d2ead8ac7575fd00610f0dc4d7e4c4bb6d7"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_core::packaging::package_bundles (cognitive 23): parcel_core::packaging::package_bundles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 7 (9 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/core/src/packaging.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba54760fedddf0ef53978854052c1748ed8948a0c210598756d127bed5adc7d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::visit (cognitive 23): Walk::visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css/src/bundling.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"e801e750acf005d110842dfcdac85a4e49a079efe3f07d3cf1559bf2aa3a43d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::eval_object (cognitive 23): Evaluator::eval_object has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 2 (5 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/lib.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"2482964ea856907c0f168a7971c312408b2c5c0a93e50c68762c559f0a93d54e"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolveRequest::resolve_package (cognitive 23): ResolveRequest::resolve_package has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-resolver/src/lib.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"439d30ff94ff8712ca34ad6f54dbccc7dfa034db442273db5b407e435a666c37"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolveRequest::try_suffixes (cognitive 23): ResolveRequest::try_suffixes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-resolver/src/lib.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd26f07f94ddd5a070bb51f475e472dc97a24742a4335dd4006dbba618ac2dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"StylusTransformer.getDependencies (cognitive 23): StylusTransformer.getDependencies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 pts), boolean chains 5, error handling 1 (nesting depth added 7). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 127). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a30738bc7b25711bcd8180fe5eb492cc8cfd2938e6661d53d7a447e53c2b671"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryFileSystem::create_dir_all (cognitive 22): MemoryFileSystem::create_dir_all has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 3 (7 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/core/src/fs/memory.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6074efdea3ee2aa4d56372d3899670d43d156c9d3f678fbdea977a5799c15b1"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::jsx::jsx_attr_value (cognitive 22): parcel_html::jsx::jsx_attr_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/jsx.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54c79078093a442ed7167394230f6f789abbaed2b0eec230daf1b08bb474ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"Collect::into_symbols (cognitive 22): Collect::into_symbols has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (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/js/src/transformer/collect.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4d08493b0ab3322200aad4c9552ee5ca272299fc51b2562e4be0f2cd7777d7"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyCollector::add_dependency (cognitive 22): DependencyCollector::add_dependency has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/dependency_collector.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"259f3cee5e47b78d2236028f757141edda053827788ef8310090aec8d7fccd5f"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineFS::fold_expr (cognitive 22): InlineFS::fold_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (21 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/fs.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b7e08f896742b272e3a62bd6d12071b08c9c68facd5451dde3fa117715601c"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::packager::rsc::resolve_dependency (cognitive 22): parcel_js::packager::rsc::resolve_dependency has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 6 (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/js/src/packager/rsc.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b939d5245e7ae74680d8e2aeaab88a21e83480814086b7949d760e44e8a39cf"}},{"ruleId":"D2","level":"warning","message":{"text":"createResourcesValueProxy (cognitive 22): createResourcesValueProxy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (get, get, apply, \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":"packages-v3/rsc/src/runtime-helpers.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25f4ac04a61ec49a2b76e1a44584d9b1f16bb5e6fa192ec9f25f1545adb7cc2"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_dev_dep_resolver::skip_expression (cognitive 21): parcel_dev_dep_resolver::skip_expression has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (7 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/dev-dep-resolver/src/lib.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1b4825c46b48e3e083afd06a70b18e71153de8b23ad0bb5d1ebe49ac6aed26"}},{"ruleId":"D2","level":"warning","message":{"text":"SerializableHandle::serialize (cognitive 21): SerializableHandle::serialize has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (11 pts), match/switch 3 (6 pts), if/else 1 (4 pts) (nesting depth added 13). 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/html/src/arena.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edcd913ab972d75a0aa208369b7d213122ed78ae208c2319f2382a9083ad6b2"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::dependencies::collect_dependencies (cognitive 21): parcel_html::dependencies::collect_dependencies has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/dependencies.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4059d1be8dbaf3ed191e0ac5a96c3bb25412c965e28318ed316ba0cb154e4cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::oxvg::oxvg_node_to_parcel (cognitive 21): parcel_html::oxvg::oxvg_node_to_parcel has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/oxvg.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"765363cf7e70d5f245da9b789cdbd95b962bbf241c9b64f95d6b834cd6d9e92f"}},{"ruleId":"D2","level":"warning","message":{"text":"Collect::add_pat_imports (cognitive 21): Collect::add_pat_imports has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 2 (3 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/collect.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"d417911ab7f8b5d81aeb15bb06919d8c544e2a06313fd1e0e1bc9687990a2569"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineFS::match_module_reference (cognitive 21): InlineFS::match_module_reference has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (3 pts), boolean chains 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/js/src/transformer/fs.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"58003fef5a357fef7d8f014a43ba39e9030e0a2db57e3bcc89f6ebc76f69a688"}},{"ruleId":"D2","level":"warning","message":{"text":"AvailabilityGraph::new (cognitive 21): AvailabilityGraph::new has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 3 (9 pts) (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/parcel/src/bundler/availability.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd0895aec791de7c3c94865ba24fe3b76cf8938bb23e5121e6622d0dcdcacd6"}},{"ruleId":"D2","level":"warning","message":{"text":"CLIReporter::report (cognitive 21): CLIReporter::report has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/main.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2312e741dcee060ada930742d9a51294582441918c98f82d50c84000bd1fae0"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::bundle_report::bundle_report (cognitive 21): parcel::bundle_report::bundle_report has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), match/switch 1 (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/parcel/src/bundle_report.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e04c15e216197411d48857cc3890e8f6530b7d21eeeb1d8fe30922a1698c03"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::http::serve_connection (cognitive 21): parcel::http::serve_connection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 4 (9 pts), boolean chains 2, 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/parcel/src/http.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1ac97046d5beb98df31da20f089cb2fa6bffd80cfc389994d8ffbdd11aa49a"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryIter::next (cognitive 21): EntryIter::next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 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/parcel-resolver/src/package_json.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"477ea2a633b583ae3c786117d79b610003c5e1ac57f2b2486ad6cf6a84779571"}},{"ruleId":"D2","level":"warning","message":{"text":"CjsLoader::resolve (cognitive 21): CjsLoader::resolve has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (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/plugin-js/src/cjs.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fb4948c664a7713141b2720478d569759ef5007a7f4cdf6512c914fe8bdac7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::extname (cognitive 21): (anonymous)::extname has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdad30e73f6d67bf627a31b2d408806819bf02457d46fc8c398c49d4075931d"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryResolver::resolve_package_entries (cognitive 20): EntryResolver::resolve_package_entries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/entry.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d85539d4d21a09d2309fc450f4ff6be8c9314ec91c5e1e68a283268eeeff14f"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::process (cognitive 20): Scheduler::process has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/packaging.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"d865574747b4e9132400bfcb56cbf042f8babdcc358a0db1fa0ac2db6bf38113"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_css::packager::unused_css_module_symbols (cognitive 20): parcel_css::packager::unused_css_module_symbols has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css/src/packager.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c476793add189e0b615b2466bc68dc4f6084076d2bf3c19ed303aafba87463c1"}},{"ruleId":"D2","level":"warning","message":{"text":"BundleReference::create_element (cognitive 20): BundleReference::create_element has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/package.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb2ac239f5d7c883d71f5beaaa531361b3c4537390e2399a03b1ac18f9d6d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::oxvg::parcel_node_to_oxvg (cognitive 20): parcel_html::oxvg::parcel_node_to_oxvg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 3, 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/html/src/oxvg.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da769cd4cb944265fd8a95e14f5e87107d94557e7bb99ec58980b3a3dc6725b"}},{"ruleId":"D2","level":"warning","message":{"text":"AvailabilityGraph::from_asset_graph (cognitive 20): AvailabilityGraph::from_asset_graph has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundler/availability.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3b85e7411a822fdafacd9e5df74647383d9bdd3cdbf010e2220fb9c8e99efd"}},{"ruleId":"D2","level":"warning","message":{"text":"TsConfig::paths (cognitive 20): TsConfig::paths has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, 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/parcel-resolver/src/tsconfig.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"19463daa292bffc78afb9d0f54466dcb3bd070440a9ec27d3d5c241acf6da1ce"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_core::fs::match_dir (cognitive 19): parcel_core::fs::match_dir has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, 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/core/src/fs/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"931f34a2a66bd12a20db4665b5b181d5dd9648046dbcf91b843fa18108029b65"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_css::packager::apply_import_condition (cognitive 19): parcel_css::packager::apply_import_condition has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 3 (7 pts), 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/css/src/packager.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"722b5118876983264307210c203a54ca4f11c4c1f06edfacd911657cb7cc965a"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::bundler::optimizer::apply (cognitive 19): parcel::bundler::optimizer::apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundler/optimizer.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ced9214fe9effc76fa1fe28c4baa4f7a97014fb790e7cbe5451734bcdf837a"}},{"ruleId":"D2","level":"warning","message":{"text":"CPlugin::optimize (cognitive 19): CPlugin::optimize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (19 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-plugin-abi/src/plugin.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67f3ba01fa5750885653d6d8e8029d93f1d7fd24ec1ee98c7ee08c7af676803"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_plugin_abi::dependency::parcel_asset_resolve (cognitive 19): parcel_plugin_abi::dependency::parcel_asset_resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (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/parcel-plugin-abi/src/dependency.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65e939bd1e1cd3fd8cb1a15a2eab79eef1abf7843ab4a9f2b0d18aa6cbfb0c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ExportsField::convert_paths (cognitive 19): ExportsField::convert_paths has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 2 (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/parcel-resolver/src/package_json.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8014b1fc1f4e1673e44a2b0f1689b9e8ce8f0c4c2b3262f59cb2c56bcb4c8afe"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleLoader::load (cognitive 19): ModuleLoader::load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (3 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/plugin-js/src/esm.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ca405b826eea97c2ca6ca1a89a574a00ea31e27606ec0a2eab64101a50fd09"}},{"ruleId":"D2","level":"warning","message":{"text":"JsPlugin::resolve (cognitive 19): JsPlugin::resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/src/plugin.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbed6eaf48cd13b516bb5b5a6fdde2dcc259af0e25447eafb7f4d1e154d5c59"}},{"ruleId":"D2","level":"warning","message":{"text":"ParcelImporter::canonicalize (cognitive 19): ParcelImporter::canonicalize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (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/sass/src/lib.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fc1154b311e53b7257ba0289e36b0ab10c9d2fe283e4a0c34ef43288533b91"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltinGraph.packageForFile (cognitive 19): BuiltinGraph.packageForFile has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (8 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/plugin-js/buildBuiltins.cjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2045f0b1e94746e0e35d84d6ae9acd378d738e9329c7f4067439b8e3dc46b828"}},{"ruleId":"D2","level":"warning","message":{"text":"buildBuiltins.buildBuiltins (cognitive 19): buildBuiltins.buildBuiltins has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5, ternaries 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/plugin-js/buildBuiltins.cjs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eeeb3dc844061a6d6ba95de138f47f6a8ea7335622e1ef7254f031248929c12"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_core::asset_graph::request_all (cognitive 18): parcel_core::asset_graph::request_all has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 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/core/src/asset_graph.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcd33cc41c17865ef498bb37d24b893982ee6d67212e9f9e685ab9b958156e7"}},{"ruleId":"D2","level":"warning","message":{"text":"EsmGraphBuilder::build (cognitive 18): EsmGraphBuilder::build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (2 pts), match/switch 2, 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/dev-dep-resolver/src/lib.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a1bf61d316fe6e6a64ce382732ffba182b04c128c7c68104dd5a8b6fe4352c"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver::jsx_children (cognitive 18): Driver::jsx_children has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 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/highlight/src/js.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09533a9195dc2cc1b3967216d399e909b0496f761fd4aa96a1c17eb87ffb318"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::packager::rsc::server_actions (cognitive 18): parcel_js::packager::rsc::server_actions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/rsc.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c6318f73e1a3513a17dd030303b56fba2d2ccc14dec1139ce575a97e00a674"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::webmanifest::collect_resources (cognitive 18): parcel::webmanifest::collect_resources has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 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/parcel/src/webmanifest.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe97b282b2409d87f3c1c5647e49b9bd5d0bd7ec1c15203325364da4da10e96"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_plugin_js::path::resolve (cognitive 18): parcel_plugin_js::path::resolve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 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/plugin-js/src/path.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66a0384ec65fa341be42cd4e0c36826b81c496f7cdcc22daf8168da3b4ea327"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.require (cognitive 18): runtime.require has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3 (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/js/src/runtime.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c4da85943d694f90002608b9fd6f4ded925ba62ad85b9a20f32c38ddaea6df"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltinGraph.add (cognitive 18): BuiltinGraph.add has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/buildBuiltins.cjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"489278413eb0619e433331c19bdb9d28c12fda623f578f369c960b592ec21cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"render (cognitive 18): render has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf11aa3799cf9a21f5953ddf3588d185bcb8cb5c48bd7a49114e010d03d3c24"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::injectIntoGlobalHook::onCommitFiberRoot (cognitive 18): (anonymous)::injectIntoGlobalHook::onCommitFiberRoot has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, ternaries 4 (8 pts), if/else 1 (nesting depth added 4). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/runtime_modules/react-refresh-runtime.development.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1f04e8bef9325c7917b1f5f660f3432aab98f8363cc33c5c32f8a22b6a7846"}},{"ruleId":"D2","level":"warning","message":{"text":"link (cognitive 18): link has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/tla-runtime.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ef328c03a0adc5e8a27c189f60dcd6b6a67539554ff06a119de05ec7619308"}},{"ruleId":"D2","level":"warning","message":{"text":"BundleGraph::async_assets (cognitive 17): BundleGraph::async_assets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 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/core/src/bundle_graph.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cff22ee8b8ea8bf7088ea267d75a30203a622848519ced8fd918d99f45a2d73"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyCollector::import_target (cognitive 17): DependencyCollector::import_target has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css/src/transformer.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae03ea5c6394735d9f109bf832ef74c9e25cb2ad2f39c59abcbb600bd7b68244"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver::run (cognitive 17): Driver::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/highlight/src/js.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a3fcdf096d7185538ee0effdfeeb9f636dcf6f81b1033220a6681dfbc2ba70"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::optimize::remove_whitespace (cognitive 17): parcel_html::optimize::remove_whitespace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/optimize.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa69284d70a967c0bb01d2c4fb7802d24df2098788f65a5ee4cb9132dcc3c1f0"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_html::xml::expand_html (cognitive 17): parcel_html::xml::expand_html has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (5 pts), match/switch 1 (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/html/src/xml.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dbe536bcea3b374ad032a4c3c83c5cf2ca62bea949008976459b723922e63a"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::packager::dependencies::bundle_dependencies (cognitive 17): parcel_js::packager::dependencies::bundle_dependencies has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (5 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/js/src/packager/dependencies.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63619ecc8b7f5328c5d7f783414a5699f12830186b7128b53537d68c30fd8c0"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageJson::resolve_package_imports_exports (cognitive 17): PackageJson::resolve_package_imports_exports has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-resolver/src/package_json.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d21066e49acb357049ceace6c31da5e38bf39fe5badf83332303fa379658d1"}},{"ruleId":"D2","level":"warning","message":{"text":"CjsLoader::load (cognitive 17): CjsLoader::load has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 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/plugin-js/src/cjs.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed3ca0513d112ad3adc955994b6810f4e789448f58530b71aa0d250fb3b4d59"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_plugin_js::await_promise (cognitive 17): parcel_plugin_js::await_promise has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 1 (4 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/plugin-js/src/lib.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a85062196c9a742a0637076436eba6b75308246dd90830773a9d9b2613c256"}},{"ruleId":"D2","level":"warning","message":{"text":"client.squarify (cognitive 17): client.squarify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"355208afb3a99e97c121c3e0087649f14ae83bad83804904f54e7bc5faa3ea7f"}},{"ruleId":"D2","level":"warning","message":{"text":"showTooltip (cognitive 17): showTooltip has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (9 pts), boolean chains 4, if/else 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ede68b8cda1ee1ce85a55ea9e967430b397d17570f0c6805cd706b1712aebc"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::isLikelyComponentType (cognitive 17): (anonymous)::isLikelyComponentType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 8). 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/js/src/runtime_modules/react-refresh-runtime.development.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f78f2e328ca4dbe1e0c14faaa17a182bd46ea3ce16da5a8f62a3cef9a2206b6"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_css::packager::check_import_position (cognitive 16): parcel_css::packager::check_import_position has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 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/src/packager.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6053e937b141cb23886f5c57bd7fb8b982fa2f2759be67a1895e27a5228c3e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_highlight::js::classify (cognitive 16): parcel_highlight::js::classify has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), match/switch 1 (nesting depth added 1). 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/highlight/src/js.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"575985e3783fec9126b6b8531c98fe001c5c7cb1c597461175fc4f5875292306"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyCollector::fold_expr (cognitive 16): DependencyCollector::fold_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, match/switch 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":"crates/js/src/transformer/dependency_collector.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0f8dc49ee7a9096e618d45fab720ac8ba811843eea85e02297d2acc909a078"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel_js::packager::rsc::client_reference_bundles (cognitive 16): parcel_js::packager::rsc::client_reference_bundles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, 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/js/src/packager/rsc.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2efddf5ccd5d828cdd13107be1204ce0cdeadc900f0c6b835b9ce4534bea84"}},{"ruleId":"D2","level":"warning","message":{"text":"parcel::bundle_report::display_width (cognitive 16): parcel::bundle_report::display_width has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundle_report.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb1278444a77b82ac0207eb168adac882c39a09dbc1c01e5b9d96e56ef1a6eb"}},{"ruleId":"D2","level":"warning","message":{"text":"client.layout (cognitive 16): client.layout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 3 (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":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c66073fd975fca398f4196f36b6cf3725ec860b292435a9939a07d41590bc60"}},{"ruleId":"D2","level":"warning","message":{"text":"nodePanel (cognitive 16): nodePanel has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 2, if/else 2, other 1 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 4 belong to 10 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7075ebe890b1e9da15a6a7483d9761d1a7ed8c41d5c70ba1264e15939ef5e34"}},{"ruleId":"D2","level":"warning","message":{"text":"Module (cognitive 16): Module has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (accept, a function literal at line 362, a function literal at line 361, \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":"crates/js/src/dev-runtime.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"30990ea6cf429b56a3a3cfb4f81ddac87e2893f6c660bb3f87b5f8475377b07d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DependencyCollector.visit_element: MethodTooLong \u2014 visit_element runs 326 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 226 over it, 3.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/html/src/dependencies.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"449bc7159727d71555832253f5fdec0ececc063630affa34c4af76853e0a9a7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_js::transformer::transform_to_ast: FunctionTooLong \u2014 parcel_js::transformer::transform_to_ast runs 314 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 214 over it, 3.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/js/src/transformer/mod.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78369d43a2192e51057309ea44a857f36250f83e5277019b80a1135469f377d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultBundler.bundle: MethodTooLong \u2014 bundle runs 303 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 203 over it, 3.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundler.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b425cd4910dc049c63523659d8652e98f58bf4683094f38e0f9b568edf823a10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ParcelApi: TooManyFields \u2014 88 stored fields. The bar is 30 stored fields; this is 58 over it, 2.93\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/parcel-plugin-abi/src/api.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d5e33a21014fcc0b84feb5d94e22365281fed44eba920f98286c9d1f7e740f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_html::optimize::optimize: FunctionTooLong \u2014 parcel_html::optimize::optimize runs 292 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 192 over it, 2.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/html/src/optimize.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6346eca82f582da47b9fc3af32347d1f1e12e4aac907b091d02e43b84a2875fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plugin.rs: FileTooLong \u2014 1365 significant 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 865 over it, 2.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/src/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58704e15fd8b8c022effdf1d11838b13c9de8e5f0c6834d2377157935e1444ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DependencyCollector.fold_call_expr: MethodTooLong \u2014 fold_call_expr runs 272 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 172 over it, 2.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/dependency_collector.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"135d588a1e383f475300844cecd8d2f9c088504ee44b347dcbf1f6c30cc08cd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyzer/client.js: FileTooLong \u2014 1288 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 788 over it, 2.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dab3ff9ac0e9885ef55aba3623432d08ebf017dbec062c0f8a8f861748b0b54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transformer/dependency_collector.rs: FileTooLong \u2014 1287 significant 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: DependencyCollector (6 blocks, 334-1980). The bar is 500 significant lines; this is 787 over it, 2.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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9f192723f40891e68a94cc5fd12a9d3979b6188a53dea989fc9832729675f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1232 significant 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 732 over it, 2.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file 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/parcel-plugin/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4154be245246b1852cbbc12f1dea277a6ea84bf0da9fcbe0e5acc7f838f91755"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DependencyCollector: ClassTooLong \u2014 912 significant 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, 6 blocks, lines 334-1980. The bar is 400 significant lines; this is 512 over it, 2.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/dependency_collector.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"798de40c67301afb06636dc8ea6fd4c502717241ec4d4bfebd5a5b15b150c579"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_js::packager::dependencies::asset_dependencies: FunctionTooLong \u2014 parcel_js::packager::dependencies::asset_dependencies runs 224 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 124 over it, 2.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/js/src/packager/dependencies.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e570ffa42438ceaabe90c9a1e64885ec03996e33ddcccc45ed956e96e7f972"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel::analyzer::write_report: FunctionTooLong \u2014 parcel::analyzer::write_report runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d154a7ab27d81227b3bb17b06731442c606c590b653bc64294a91d7f56eedb20"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_js::transformer::plugin::config: FunctionTooLong \u2014 parcel_js::transformer::plugin::config 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/js/src/transformer/plugin.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"1849e2e648ad0f1204d239668bc8230d37c372e0c0ca1a25f2d3fd108946c019"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssetGraphBuilder.build_with_changes: MethodTooLong \u2014 build_with_changes runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/asset_graph.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ceb3a7d9e55fb401abea8e14dd0b6891ecdbc8df478e753cd6a221ab8120ad1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_css::packager::inline: FunctionTooLong \u2014 parcel_css::packager::inline runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.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/css/src/packager.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf69ed677f9258278858bb7216bc1b12d0ecf7357cf708684caf45d0ddde3d80"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_html::jsx::to_component: FunctionTooLong \u2014 parcel_html::jsx::to_component runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/html/src/jsx.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c9dba2319454dc877f98b13c67ea5113e1ae209e5cbd903397e4dc63656130"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/packager.rs: FileTooLong \u2014 983 significant 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 483 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css/src/packager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05312a419befe8bcf349efa58a4a5fa3e81079343e6897093d15d3b68ac9f2c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Evaluator.eval: MethodTooLong \u2014 eval 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/macros/src/lib.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7ec20739c6fea41c3cc77a00f3ba2b63c466f08915eca9ae12e83adc749b32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Esm2Cjs.visit_mut_module: MethodTooLong \u2014 visit_mut_module runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/modules.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99b8e08e5bc90fbe89bd935e076d7c7ddd169df37f6853e6bc767f47474a259"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/asset_graph.rs: FileTooLong \u2014 923 significant 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 423 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/core/src/asset_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e5619489d9270b833147d0ea19cc8594bf495e9126043552614c9c0800a200"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: packager/mod.rs: FileTooLong \u2014 912 significant 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 412 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34de6e09b645c96ae27ba5166589a63dd04ec93a05105be2388ef6fc7b666bd7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultResolver.resolve: MethodTooLong \u2014 resolve runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/resolver.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"903b7ee99209d0a497cc3cee161f2d11f132c8d216d1c1bc2315c9bb9b19f2f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsTransformer.transform: MethodTooLong \u2014 transform 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/js/src/transformer/plugin.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d192181e516f8aa5e9b50591f8aa61531ca7dbfe387b73c179beb86c2b53ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel::bundler::style_order::report_conflicts: FunctionTooLong \u2014 parcel::bundler::style_order::report_conflicts 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/parcel/src/bundler/style_order.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"9614791dd5eeef1f70f92d608a6047f349d1c12f52a5d532fe945483f8093516"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transformer/mod.rs: FileTooLong \u2014 885 significant 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 385 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be7b2da56df16c8921d1da5643f237faaec4441df0ae9270fb1e8e1312cb97c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: OxvgConfig: TooManyFields \u2014 53 stored fields beside 2 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/html/src/oxvg.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabe81038189e6d33560cb0089a88c6b7ad5b598daf72fe9fb8309a65e4f01ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel::parse_args: FunctionTooLong \u2014 parcel::parse_args 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/parcel/src/main.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d911691b92331773e1ef35a3b4cbd65f1caa4227ec1998d5bcd25feeb9b2203"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsContent.package_app: MethodTooLong \u2014 package_app 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/js/src/packager/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1af17fdb4c36eaf002d815ff1ea041f9ee0a3aa4078cb28f7d7397a274429c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CssContent.package_impl: MethodTooLong \u2014 package_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/css/src/packager.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6192b10f796f69cb8ac3abc06fff70fff592d1786878946ab8688759ea63bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: packager/rsc.rs: FileTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 342 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/rsc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb11627fb505e82a49f365452597bdccc9d0f5ef9fc4069d27b6105c0de17541"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CssTransformer.transform: MethodTooLong \u2014 transform 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/css/src/transformer.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60cc9adfbbc24b983c6c4eee5dfddec02347bc16b5a15a19c8b1fb649eef18d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bundler/optimizer.rs: FileTooLong \u2014 826 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 326 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundler/optimizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13858dcf224ccb94c9105be15ba665327cccff64f2be1475dff14d2e0aae3de5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Collect: ClassTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 5 blocks, lines 62-1105. The bar is 400 significant lines; this is 249 over it, 1.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/js/src/transformer/collect.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ec59463175712cbd13a8b2da81c4884b67af2fab2000f6257e4a6ee4221c24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.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), about 73% of them inside a single declaration: ResolveRequest (2 blocks, 426-1367). The bar is 500 significant lines; this is 291 over it, 1.58\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-resolver/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a04c739fc1b2412da0dbec3f792652331fe2e89d30e1123ff699e47b91739b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_core::bundle_and_package: FunctionTooLong \u2014 parcel_core::bundle_and_package 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/core/src/lib.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7c037d812b2c134e918db04c2026bdbed04c5cee46ae942bcb934af3030e63"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_html::package::insert_bundle_references: FunctionTooLong \u2014 parcel_html::package::insert_bundle_references 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/html/src/package.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d7dd50387a68079c224e0e4d82de27f34013d456d86f50a3ab10207c577ce7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: client.assetPanel: FunctionTooLong \u2014 assetPanel runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2e4e0f0dd610cdcb9eb60a2714658dcc27c92a604186b264aabd80359b4378"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_js::packager::write_runtime_globals: FunctionTooLong \u2014 parcel_js::packager::write_runtime_globals runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/mod.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdcf54092d1a8132ca13c66433176251147d6e3e6a9a8b5fcd09515e664180a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ResolveRequest: ClassTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 2 blocks, lines 426-1367. The bar is 400 significant lines; this is 181 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/parcel-resolver/src/lib.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c0db05710a4c201d476b257f254510897d32f94d72f16eafab932041b6d190"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/oxvg.rs: FileTooLong \u2014 722 significant 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 222 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file 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/html/src/oxvg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"491629b644d5eae95a195a49cd37a1938d96b451759c95382bfbef9d2ae7422e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transformer/collect.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 90% of them inside a single declaration: Collect (5 blocks, 62-1105). 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/js/src/transformer/collect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0792f11bc7cc87cdde4f81c6a19b03708a34899f6453a519c89622c48bd229cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel::bundler::style_order::segment: FunctionTooLong \u2014 parcel::bundler::style_order::segment runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.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/parcel/src/bundler/style_order.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaed3bdecda1f7cf98cf204d22e55cd0d2701b356b19b551f4e558ccc2ed1fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 709 significant 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 209 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/html/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"128c63c3201948924c55eac95310050ce52f76a82a6ccd40de3b6c71a50d298b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageTransformer.transform: MethodTooLong \u2014 transform 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/image/src/lib.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddcc28d077a91814efd63f695e242bb4c594242d292f857eb3d2fb39cfa080c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dev-runtime.js: FileTooLong \u2014 703 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 203 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3bad8a4f3cc29f00780f244262a233586a85d18071e64b826886fde88245b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtin-src/path-win32.js: FileTooLong \u2014 691 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 191 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2003e68e5de8b9952367e9d5d91421daa7a3fc2375ddda049f8509b8610a67d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dependencies.rs: FileTooLong \u2014 684 significant 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: DependencyCollector (2 blocks, 172-886). The bar is 500 significant lines; this is 184 over it, 1.37\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/html/src/dependencies.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9a31f92ab436dc5c3c9116a4b8158c3ff0be8e313f5d3c6ef9dccd381630a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobResolver.resolve: MethodTooLong \u2014 resolve runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/glob_resolver.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba738eb3986c97b83551176686a2c46f49f9233c1bc072437ed63c0d2f1a5a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 661 significant 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 161 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c46603526c9edda7e9da581bee30edbd4bbb9fca814a42c3e0fbdee6d10e5ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostic.rs: FileTooLong \u2014 636 significant 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 136 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/diagnostic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"778daed596e8d0dabf75aa8a82908c8565266cf68c2a52a6afe9a1f7de4a91a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/package_json.rs: FileTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: PackageJson (2 blocks, 94-812). The bar is 500 significant lines; this is 128 over it, 1.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/parcel-resolver/src/package_json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d21e5acbafce560c281eb85339f812e968d09bcbe50e1a03563f26c30f1708"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_js::hmr::get_hmr_update: FunctionTooLong \u2014 parcel_js::hmr::get_hmr_update 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/js/src/hmr.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd33fe421afdd5addf9584abd9cdc4d491b1f88680f3aaece9e23828e8c6ead"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DependencyCollector: ClassTooLong \u2014 495 significant 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 172-886. The bar is 400 significant lines; this is 95 over it, 1.24\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/html/src/dependencies.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a135af52022b3c336c0dbb56365f82108f0cf321e1e3248c752086f928802e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9871bad9a3c81a336e3c4232703b886cc49b7217037b947f94dd436685f61c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EntryResolver.resolve_file_entry: MethodTooLong \u2014 resolve_file_entry 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/core/src/entry.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7226507ef9abf1588937b6efd02df5517fb35004bfcfe368c882bcfe82a4dde9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyntheticAsset.write_content: MethodTooLong \u2014 write_content 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/js/src/packager/synthetic.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8542fdc7d634556280ff6c2125e144d0dacc88f9b65a303a734cb581b3e3b26a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_html::srcset::parse_srcset: FunctionTooLong \u2014 parcel_html::srcset::parse_srcset 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/html/src/srcset.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78c8432cfc339e63c6dec9634dc29e0411124a1c9233847a70eef4d18b7d613"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/crypto.rs: FileTooLong \u2014 568 significant 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 68 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/src/crypto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e5cc9a91b25216da009b9b02a3721263bb2c7b14fbb7ccb65f792441e3f2ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fs.rs: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 62 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/plugin-js/src/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fb64ca60d85b1ce68d85234fd197980e9086084d16fadb4e9fbb51b7f3a3b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/entry.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/entry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4dd9faef94c5fc05fb26947b02e0cf02371cb1d9e4605a62637fc09217480b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_html::serialize_html::can_omit_end_tag: FunctionTooLong \u2014 parcel_html::serialize_html::can_omit_end_tag 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/html/src/serialize_html.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bda6fdd9c4689645f2183a1dc9435d966a5040b107fe212e1bff8105201af4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_js::packager::rsc::write_resources: FunctionTooLong \u2014 parcel_js::packager::rsc::write_resources 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/js/src/packager/rsc.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1628a9d2b1d779de81b4c44080b63381668234aec97f80104428fa8a91edd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_core::packaging::package_bundles: FunctionTooLong \u2014 parcel_core::packaging::package_bundles runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/packaging.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e329fc36f42bb314fda640a5597aacb08980e612a1e85e98283a3aff8bbadee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parcel_js::packager::rsc::resolve_dependency: FunctionTooLong \u2014 parcel_js::packager::rsc::resolve_dependency runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/rsc.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"70621c14aadff8af42f5ab8bb973abd7b1d0942ddd5333ac891a6dabe5f67ea5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plugin.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), about 66% of them inside a single declaration: CPlugin (8 blocks, 258-830). The bar is 500 significant lines; this is 19 over it, 1.04\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/parcel-plugin-abi/src/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73b5da59c65df7b8ce04d4a411ca43b07d4f9274b993d773ed97d027348efef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BundleRoots.from_asset_graph: MethodTooLong \u2014 from_asset_graph runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundler/bundle_roots.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b999d7347627cf775a1ac7963e22af50561b874b40a500ce7a8140a57c943c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/plugin-js/src/fs.rs:393-408 | crates/plugin-js/src/fs.rs:418-433 | crates/plugin-js/src/fs.rs:454-468 | crates/plugin-js/src/fs.rs:485-499 \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/plugin-js/src/fs.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"193d9a9f2ec29f5b19dd6eb88eb65cba2f638a50b0fec8bc44c7892876692a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/html/src/lib.rs:276-313 | crates/html/src/lib.rs:361-388 \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/html/src/lib.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7659bc3c91575e2c2102897fca3c577bc94280c80b850513a7a11eba9c77bb4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/js/src/transformer/collect.rs:358-397 | crates/macros/src/lib.rs:86-126 \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/js/src/transformer/collect.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1853bd169fb0dbed9f6bf77ee088384134d480907c2e671ca7860dc4a8fb80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/html/src/lib.rs:579-618 | crates/html/src/lib.rs:978-1017 \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/html/src/lib.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4b3725077f880cda35377c6163f648e2564f163a2256c46564e6dfdb72b9f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/parcel-plugin-abi/src/fs.rs:76-95 | crates/parcel-plugin-abi/src/fs.rs:126-146 \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/parcel-plugin-abi/src/fs.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8846bb28f0a3ba8e8ead31a666a187e1bc117b12eec2b0a95dd7667d6b992a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/html/src/lib.rs:126-158 | crates/html/src/xml.rs:103-134 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/lib.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"196068b28a6ade4503b754ec87e78c036dc31a21ffeb32fb8af96bccb3c41af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/js/src/transformer/modules.rs:134-156 | crates/js/src/transformer/modules.rs:158-184 \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/js/src/transformer/modules.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0556cebca4a7c505e09c61f95844c3227ccee5b6265c5b9cd6ac8646f8e9e4c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/html/src/lib.rs:520-544 | crates/html/src/xml.rs:143-162 \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/html/src/lib.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86e6cfe59ef78803d3db1401f4866b0d49af799ece29ee81f0b9eddf413b051"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/parcel-plugin-abi/src/bundle.rs:213-225 | crates/parcel-plugin-abi/src/bundle.rs:234-246 \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/parcel-plugin-abi/src/bundle.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e74fb51953e042411f9fff5a22fa1f00e4405fd3ad7651abe430f25d39d8832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/core/src/target.rs:57-74 | crates/core/src/target.rs:139-156 \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/core/src/target.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d740d81086803d5a93ea275ce0e7c31ab3432a3f9f2cfbef4bbbb1aa36207a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/core/src/resolver.rs:122-147 | crates/parcel-resolver/src/specifier.rs:242-270 \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/core/src/resolver.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"553e0c98e6c7abdef6b1deb76c6516690f65a468c92bd22d95f26f246a685013"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/core/src/fs/memory.rs:168-189 | crates/core/src/fs/memory.rs:228-241 \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/core/src/fs/memory.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a69db015b91a2244455fb87e232c00029b4084de07d529df1781096da2c6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/parcel-plugin-abi/src/asset.rs:241-258 | crates/parcel-plugin-abi/src/asset.rs:260-283 \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/parcel-plugin-abi/src/asset.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1b27ce3bf084184a4ebd48e153b4760713ddb66f01442c41228c9a242b98f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/html/src/optimize.rs:545-566 | crates/html/src/optimize.rs:572-592 \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/html/src/optimize.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"abca7fff81657ca6ed7f7cafc560b76f0fb93601577361c1bab65a8112c62c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/core/src/path.rs:575-599 | crates/core/src/path.rs:614-644 \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/core/src/path.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60405e5443932d9489c8bc3fe48d86ab82f290dc45929eedfe8f4ac3552025e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/html/src/lib.rs:315-338 | crates/html/src/lib.rs:404-421 \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/html/src/lib.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4efde6132542000647cd7d0cbce84634bef9eb58bb9fd38890595ff2917228"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/html/src/arena.rs:163-175 | crates/html/src/arena.rs:177-189 \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/html/src/arena.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3728c5a77aeef778ca364b953ccc564840327657e195fc5de9a2222514af99e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/js/src/transformer/dependency_collector.rs:651-677 | crates/js/src/transformer/dependency_collector.rs:679-707 | crates/js/src/transformer/dependency_collector.rs:709-731 \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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b6553b8e2e1bdf07d55e9b6d125473dea8c0340bba9327d23f619bf5bdd5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/plugin-js/src/fs.rs:132-146 | crates/plugin-js/src/fs.rs:151-165 \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/plugin-js/src/fs.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1226c896434d3b5c8d8d11f7f39f5a7b498ba01da90b99f1d7e781a6f2f8d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/parcel-plugin-abi/src/asset.rs:140-150 | crates/parcel-plugin-abi/src/asset.rs:162-173 \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/parcel-plugin-abi/src/asset.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c31f07e729ab7788247acf2b869efc1dd9965d078fec9a408dcd36b6bdedec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/parcel-plugin-abi/src/extensible.rs:62-81 | crates/parcel-plugin-abi/src/extensible.rs:104-121 \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/parcel-plugin-abi/src/extensible.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5d3b60690b800a1808fc8cb19cc6ed701aed0d741158e8df10b01cc937c846"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/parcel/src/trust/windows.rs:100-127 | crates/parcel/src/trust/windows.rs:129-150 \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/parcel/src/trust/windows.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b1cf629a0afba22db3579c27c995d27994af43caa14ad69a869d3aed759839"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/parcel-plugin-abi/src/dependency.rs:453-475 | crates/parcel-plugin-abi/src/dependency.rs:480-506 \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/parcel-plugin-abi/src/dependency.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb52cd2716bfd917d38eb7bf5fb413ed5966fd35cd0996bba98bd83088f70d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/js/src/packager/dependencies.rs:209-223 | crates/js/src/packager/rsc.rs:466-478 \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/js/src/packager/dependencies.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bf41c6073994a78a6037dad3d84d6f2df6d5f074649cd575c016d2c2d28f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/parcel/src/json.rs:13-27 | crates/parcel/src/toml.rs:14-24 | crates/parcel/src/yaml.rs:14-24 \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/parcel/src/json.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d14a0bce288ef4f352ea2bfe33d9ffbb349b507c1ce865b9ca889a4f0d97a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/plugin-js/src/fs.rs:224-230 | crates/plugin-js/src/fs.rs:235-241 \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/plugin-js/src/fs.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4de473fd46c2ec3b810415be7c62318b2bc7ee0b69b573aec4d35c47e20410b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/parcel-plugin/src/lib.rs:240-248 | crates/parcel-plugin/src/lib.rs:268-276 \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/parcel-plugin/src/lib.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab424b5467e137b0992eae1621febc2f0f0753bfd905916c39a38f0010e16a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/parcel-plugin-abi/src/asset.rs:72-87 | crates/parcel-plugin-abi/src/asset.rs:97-112 \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/parcel-plugin-abi/src/asset.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b90112bdc7bbc3b39935f3c0e5ef4c8c297eb781e59611d79ff8dca23c76674"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/plugin-js/src/buffer.rs:112-127 | crates/plugin-js/src/buffer.rs:132-138 \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/plugin-js/src/buffer.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfaad401a8fab5b6d312833aff9b8e2772e49b7e54c8b100f22d38cdc069d6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/parcel/src/macos.rs:126-136 | crates/parcel/src/macos.rs:150-166 \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/parcel/src/macos.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b77816e7b6118dc3016e295a277086cb03470cb6ffe53d8aa1072bd6ba6945"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/html/src/serialize_html.rs:95-107 | crates/html/src/serialize_xml.rs:61-73 \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/html/src/serialize_html.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"116c09fd6af15e7716cfe3b60a8ca56b274d1d0a0271674a4bf93dc0f64cd514"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/parcel-plugin-abi/src/asset.rs:495-507 | crates/parcel-plugin-abi/src/asset.rs:584-596 \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/parcel-plugin-abi/src/asset.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"042683b9be3da9a5550e8effd792dca3baba4c2af3d35118348f0abb6f722568"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): plugin-swift/Sources/ParcelPlugin/Options.swift:102-109 | plugin-swift/Sources/ParcelPlugin/Options.swift:132-139 \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":"plugin-swift/Sources/ParcelPlugin/Options.swift"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f562041ad746886155caa5940b21ef7df9e45f6fc7c8d2e84cad15981c2c397"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): plugin-swift/Sources/ParcelPlugin/Asset.swift:57-69 | plugin-swift/Sources/ParcelPlugin/Asset.swift:74-86 \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":"plugin-swift/Sources/ParcelPlugin/Asset.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fe23d402acc17f728e7522d60e74e4879486c0ed92fbbc907f4e9b91fa631d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/parcel-plugin/src/lib.rs:1243-1251 | crates/parcel-plugin/src/lib.rs:1288-1296 \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/parcel-plugin/src/lib.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0af9076a7c83550c83053bf5ac8330c21afa37005c84e32ae4762e6db4b98e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/core/src/path.rs:132-142 | crates/core/src/path.rs:324-334 \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/core/src/path.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"39eae09d840ea3fe053b6d04e10125fdf65a80bdfbe51c7def05068af8f9c1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/html/src/optimize.rs:474-487 | crates/html/src/optimize.rs:494-509 | crates/html/src/optimize.rs:512-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 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/html/src/optimize.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f71681559a2fd5d4ea21983ec31bb093f4300a3c0cff525b024e3abc4e74cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/plugin-js/src/crypto.rs:753-772 | crates/plugin-js/src/path.rs:400-424 \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/plugin-js/src/crypto.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f34ab752891abcc58335d0b141e8598a8a5e368a5e52d50b8b6e58e1cb9a257"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/html/src/arena.rs:254-269 | crates/html/src/oxvg.rs:516-528 \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/html/src/arena.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de5ff55bc4f201ecc29436ae22ef123a31ad40a787c0dd97d221bbda1def470"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/parcel-plugin-abi/src/asset.rs:451-472 | crates/parcel-plugin-abi/src/asset.rs:478-487 | crates/parcel-plugin-abi/src/asset.rs:514-523 | crates/parcel-plugin-abi/src/asset.rs:572-581 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-plugin-abi/src/asset.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96d4529ca33b5f115b185ba101082835c3b527767c17fdc746b376a22a27ca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/parcel-plugin-abi/src/bundle.rs:90-111 | crates/parcel-plugin-abi/src/target.rs:239-258 \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/parcel-plugin-abi/src/bundle.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b8b2a7c8896e0b0bd2bbd32e5cc12bd4f738771d2a6f12794b877a79347a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/core/src/fs/cached.rs:184-192 | crates/core/src/fs/cached.rs:194-202 \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/core/src/fs/cached.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1bc70e03760671b63a84799d95ecb269240a601eb0b19b749ba6d55bae1906"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/parcel-resolver/src/lib.rs:195-206 | crates/parcel-resolver/src/lib.rs:209-220 \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/parcel-resolver/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58c52d0c79c2874f1af5e8d670cd769401d33b67b4aa9e0df4f33c9689929f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/plugin-js/src/plugin.rs:1323-1335 | crates/plugin-js/src/plugin.rs:1337-1351 \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/plugin-js/src/plugin.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"684983b3b546a3048632fce3dcf3780efaa37ba4e3dadb8947138f1f45e5c057"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/js/src/transformer/dependency_collector.rs:1612-1625 | crates/js/src/transformer/dependency_collector.rs:1627-1639 \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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f438d1e7a9e2d718b6015b6c32934497ab5520bb9812943aa99ee1019e160bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/parcel/src/plugin_factory.rs:133-143 | crates/parcel/src/plugin_factory.rs:150-161 \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/parcel/src/plugin_factory.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b80b68cd88ca83efea4dc51b6f06f6090dd452eb42d3df7df7972d8386ec0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/parcel-plugin-abi/src/diagnostics.rs:87-94 | crates/parcel-plugin-abi/src/diagnostics.rs:111-118 | crates/parcel-plugin-abi/src/diagnostics.rs:127-134 \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/parcel-plugin-abi/src/diagnostics.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba3ad68d27a165aee4e949fe5707562c055af285106e6cf6a47926265d47bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): plugin-swift/Sources/ParcelPlugin/Asset.swift:289-296 | plugin-swift/Sources/ParcelPlugin/Asset.swift:300-307 \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":"plugin-swift/Sources/ParcelPlugin/Asset.swift"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e64d233dfea28ac9e6830b4c370923a4ed71bdb950aad510c9496790dd122b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/html/src/serialize_html.rs:322-328 | crates/html/src/serialize_xml.rs:229-235 \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/html/src/serialize_html.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20ccffe1810688d2eb62a5bb141f2ab4e1962eb2ae13d36b27f494885e6d3f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): crates/parcel-plugin-abi/src/bundle.rs:54-60 | crates/parcel-plugin-abi/src/bundle.rs:166-174 | crates/parcel-plugin-abi/src/bundle.rs:178-186 | crates/parcel-plugin-abi/src/bundle.rs:191-199 | crates/parcel-plugin-abi/src/target.rs:229-235 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-plugin-abi/src/bundle.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e4d8075cd97bbab9ae27f9ea04851810820663bae681af0b9da1e5254aa970"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/parcel-plugin-abi/src/bundle_graph.rs:86-97 | crates/parcel-plugin-abi/src/bundle_graph.rs:113-123 \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/parcel-plugin-abi/src/bundle_graph.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e53341dafef8d55c9cde981e21517c3bfa37726091dd4463fbc6bb9f137666"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/plugin-js/src/bytecode.rs:138-146 | crates/plugin-js/src/bytecode.rs:192-205 \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/plugin-js/src/bytecode.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0f7a6296f42d6abade3b8797d7bda9774ecd0d9c1b40e1e31585be535a5a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/core/src/asset.rs:61-70 | crates/core/src/dependency.rs:344-352 \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/core/src/asset.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a95847a28a492ea4fe1a88c7cf503bbf9a03271a5389a5bec2c9ea4641a5ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): crates/parcel/src/bundler/bit_matrix.rs:107-110 | crates/parcel/src/bundler/bit_matrix.rs:158-166 | crates/parcel/src/bundler/bit_matrix.rs:168-176 | crates/parcel/src/bundler/bit_matrix.rs:178-186 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/bundler/bit_matrix.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"23395b031faad1e80823124ade03597679fb7d34034805a07a3944e8d1ce2337"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/plugin-js/src/cjs.rs:50-55 | crates/plugin-js/src/esm.rs:43-52 \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/plugin-js/src/cjs.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b06c176242768f31e4ec6bafbead551a403b6d32eb40286b148144a8ee49a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): plugin-swift/Sources/ParcelPlugin/BundleGraph.swift:120-123 | plugin-swift/Sources/ParcelPlugin/Dependency.swift:155-158 \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":"plugin-swift/Sources/ParcelPlugin/BundleGraph.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b420c8a9ba5a44e57dd73f0dba159ac232d658372af2c261ef7bd45ef73f008"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): plugin-swift/Sources/ParcelPlugin/Asset.swift:31-34 | plugin-swift/Sources/ParcelPlugin/BundleGraph.swift:18-21 | plugin-swift/Sources/ParcelPlugin/Dependency.swift:97-100 \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":"plugin-swift/Sources/ParcelPlugin/Asset.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb56a26e4d64dd4cfaa85a8fe815ec7ad6113662027b6039ef71cb5013506ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/parcel-plugin-abi/src/asset.rs:551-557 | crates/parcel-plugin-abi/src/dependency.rs:207-213 \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/parcel-plugin-abi/src/asset.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"63284b63a4f34e6ab0fc765e11aaade9c2b581747b123326cebdf8bd5635959d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): plugin-swift/Sources/ParcelPlugin/Asset.swift:47-49 | plugin-swift/Sources/ParcelPlugin/BundleGraph.swift:137-139 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugin-swift/Sources/ParcelPlugin/Asset.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6c7f0bfc7a30d2d062316316028f1ece5bf0a80f77346a3af95f9b74ca1f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): plugin-swift/Sources/ParcelPlugin/Asset.swift:41-43 | plugin-swift/Sources/ParcelPlugin/BundleGraph.swift:132-134 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugin-swift/Sources/ParcelPlugin/Asset.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36893e77a8e27f4471362737a3f47efb5180d0471cdaf0b87fe0245a789648f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): crates/html/src/serialize_html.rs:110-152 | crates/html/src/serialize_xml.rs:127-169 \u2014 before extracting anything, compare \u0060crates/html/src/serialize_html.rs\u0060 and \u0060crates/html/src/serialize_xml.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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/html/src/serialize_html.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7397880abd89f0d09688d378cbd7a9f4dcdff8a4731332544d43a645d0849f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/plugin-js/src/path.rs:185-213 | crates/plugin-js/src/path.rs:271-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugin-js/src/path.rs:185\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/src/path.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9258501f7d5daf82202212d7e5f8c4dbedea64d786dd2d5fab1766e6be0f0fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/js/src/transformer/collect.rs:502-523 | crates/js/src/transformer/collect.rs:525-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/js/src/transformer/collect.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"188892666545285cf8d90067cab465d7be6e679e53057d3535e7052501e30eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/css/src/packager.rs:494-513 | crates/css/src/packager.rs:531-551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css/src/packager.rs:494\u0060 it does not close everything it opens, so those exact 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/src/packager.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c9b68043421ccea83744fc30ecee2b27bfe8816a7dc1f3d9eca8dd86c42d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/css/src/packager.rs:570-586 | crates/css/src/packager.rs:879-895 \u2014 both copies are in the same file, so extract the block into one function there 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/css/src/packager.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a65bae9f091b6b57fd7ad345450088a8a8fb76e0b6bbe9375d87d3a792efbc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/css/src/packager.rs:206-221 | crates/css/src/transformer.rs:147-162 | crates/css/src/transformer.rs:622-637 \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/css/src/packager.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0518b22a09f20c1f3d190d0c6d1ebc57100bfdea04816bac701620d5851ec981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/html/src/jsx.rs:910-925 | crates/html/src/jsx.rs:929-944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/html/src/jsx.rs:910\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/html/src/jsx.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d991873043302c37642fb53fff873d6fc2072a0c0d1e1d1fde074d1756ccf6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/parcel-plugin/src/lib.rs:1185-1200 | crates/parcel-plugin/src/lib.rs:1666-1681 \u2014 both copies are in the same file, so extract the block 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/parcel-plugin/src/lib.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"085eedbe9bb1ec002d1fb8e085b09db329526627ca3d89c4bbb90ea8d5566390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/parcel-plugin-abi/src/asset.rs:242-255 | crates/parcel-plugin-abi/src/asset.rs:261-274 \u2014 both copies are in the same file, so extract the block 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/parcel-plugin-abi/src/asset.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"204a47104cc28506717907dd9e9745c1b4ec919dede92bd0088cbec5780c80a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/plugin-js/src/url.rs:144-156 | crates/plugin-js/src/url.rs:167-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/plugin-js/src/url.rs:167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/plugin-js/src/url.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ff97005502f84deabaab669ecdc9c72cb16a796c910691432ea612c4b194fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/core/src/entry.rs:133-145 | crates/core/src/entry.rs:243-255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/core/src/entry.rs:133\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/core/src/entry.rs:132\u0060 calls \u0060default\u0060 and \u0060crates/core/src/entry.rs:242\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/core/src/entry.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6658cebc53f8aeda36a92876a3a05e92005738fd07ed0015fc82735b5dc165b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/html/src/dependencies.rs:460-472 | crates/html/src/dependencies.rs:492-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/html/src/dependencies.rs:491\u0060 calls \u0060text_content\u0060 and \u0060crates/html/src/dependencies.rs:458\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/html/src/dependencies.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bb42dc839dd197498e98730fbad3bb9290bf5bdaf8d902309055e60fc07fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/js/src/packager/tree_shake.rs:530-542 | crates/js/src/packager/tree_shake.rs:619-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/tree_shake.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"640ab74e118ae6a4f5ead32ec414064b2688df9828b9c4e05caa6978d1d47dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/plugin-js/src/fs.rs:135-146 | crates/plugin-js/src/fs.rs:154-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/plugin-js/src/fs.rs:135\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/plugin-js/src/fs.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d419bb7c7bb9a9605a3e0e9e85e7b959cb164909088df8ec6aae1e22da4c3b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): crates/css/src/transformer.rs:134-144 | crates/css/src/transformer.rs:302-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css/src/transformer.rs:134\u0060 it begins part-way through the construct above it, so those exact 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/css/src/transformer.rs:132\u0060 calls \u0060clone\u0060 and \u0060crates/css/src/transformer.rs:301\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/src/transformer.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"06eecee5f83940ce88a55c98bf8ada98e3696bb69075b0423bdf3ecd7783989b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/highlight/src/js.rs:244-254 | crates/highlight/src/js.rs:364-374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/highlight/src/js.rs:244\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/highlight/src/js.rs:363\u0060 calls \u0060jsx_name\u0060 and \u0060crates/highlight/src/js.rs:243\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/highlight/src/js.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"25efe11d71b3b8519658708db6fb585bf513b634bd3ec1055b3cd2bcf253660a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/js/src/transformer/dependency_collector.rs:652-662 | crates/js/src/transformer/dependency_collector.rs:681-691 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/js/src/transformer/dependency_collector.rs:652\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6a27249ed5772aa83a6b96cb88d65ca6ea4a49ea6965a06b5a490898a916d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/parcel-resolver/src/package_json.rs:164-174 | crates/parcel-resolver/src/package_json.rs:488-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/parcel-resolver/src/package_json.rs:164\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/parcel-resolver/src/package_json.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8527d6aaa3b052414e724a1cd8c94f7876b569a33ad4789dbfbd2331457b70a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/plugin-js/src/url.rs:356-365 | crates/plugin-js/src/url.rs:373-383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/plugin-js/src/url.rs:373\u0060 it begins part-way through the construct above it, so those exact 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/plugin-js/src/url.rs:367\u0060 calls \u0060Err\u0060 and \u0060crates/plugin-js/src/url.rs:384\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/plugin-js/src/url.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"03938c988841668c91251a36b3af6214fd3a61686930e07239f4b5fe167d27ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/html/src/lib.rs:79-88 | crates/html/src/lib.rs:277-286 | crates/html/src/lib.rs:362-371 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060TransformOptions\u0060 in one and \u0060PackageOptions\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/html/src/lib.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f874cc6ee7831f5bb3f25bf758557315065d821db40515f073dcf2fa2f7fe35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/plugin-js/src/plugin.rs:132-141 | crates/plugin-js/src/plugin.rs:506-515 | crates/plugin-js/src/plugin.rs:606-614 \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/plugin-js/src/plugin.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2708cbdd247801245b5c13badaca07d3057ecc87852008a84b24a44df6b8ebde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/fs/memory.rs:71-80 | crates/core/src/fs/memory.rs:282-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/fs/memory.rs:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/core/src/fs/memory.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6fba39fb525d6c657178440d4c317a896567a011b6edd5a18c237c6dac10a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/html/src/dependencies.rs:345-354 | crates/html/src/dependencies.rs:427-436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/html/src/dependencies.rs:345\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/html/src/dependencies.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98a55a8e9e8f22398a6679e3b785479368b61dbd93188fe080e99f62c7a02ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/js/src/packager/tree_shake.rs:571-580 | crates/js/src/packager/tree_shake.rs:642-651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/js/src/packager/tree_shake.rs:571\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/js/src/packager/tree_shake.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b53959fc16bf991d2520c4424575ba349ad30a467bc733943a05cc9557d9795"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/js/src/transformer/collect.rs:987-996 | crates/js/src/transformer/collect.rs:1073-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/collect.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df3a730e910fa7f61590b340e2fc29e4f0221140014653ddc3d22e814f276b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/plugin-js/src/fs.rs:396-405 | crates/plugin-js/src/fs.rs:421-430 | crates/plugin-js/src/fs.rs:457-465 | crates/plugin-js/src/fs.rs:488-496 \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/plugin-js/src/fs.rs:396\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/src/fs.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c668612e6ec6e705795eb1597e69ada73b833bcb3bea22a2760769b34dd373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/fs/memory.rs:135-143 | crates/core/src/fs/memory.rs:303-311 \u2014 both copies are in the same file, so extract the block into one function there 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/core/src/fs/memory.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4c29ab371b8fffa4b24dca4ac4d083ede164ebdb9abd4022c93567b7677325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/css/src/packager.rs:964-972 | crates/css/src/packager.rs:977-985 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/src/packager.rs:964\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/src/packager.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a7a18e0da504f150bfd42f3360ffda5795470c784753ff1de40cbc9d56f7fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/css/src/transformer.rs:230-247 | crates/css/src/transformer.rs:267-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/css/src/transformer.rs:287\u0060 calls \u0060insert\u0060 and \u0060crates/css/src/transformer.rs:249\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/src/transformer.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfb00c59af189a0f6a372eb20c6df264fe448a9908ed60509101152908e766c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/highlight/src/js.rs:257-265 | crates/highlight/src/js.rs:293-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/highlight/src/js.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"012627d847062a5ca00b8a4b0e207a6efc6cae34f1a2945ba028ebabde4a46cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/js/src/transformer/collect.rs:359-367 | crates/js/src/transformer/modules.rs:351-359 \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/js/src/transformer/collect.rs:359\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/js/src/transformer/collect.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89a50e62b48271d886fc0febf6fa127cd9b49a5cd015ea9393685307f10fd73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/js/src/transformer/dependency_collector.rs:656-664 | crates/js/src/transformer/dependency_collector.rs:710-718 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/js/src/transformer/dependency_collector.rs:656\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e386595e9b16f52ec93164fa299cf3fee8d44261eb4af2dfff3f5eef2c33309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/parcel-plugin-abi/src/fs.rs:77-85 | crates/parcel-plugin-abi/src/fs.rs:127-135 \u2014 both copies are in the same file, so extract the block 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/parcel-plugin-abi/src/fs.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d169da17ea3f8cbda5b9b57017c736d3c00ce989538c1e5c51ac85f2a37d56b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/parcel/src/lib.rs:193-201 | crates/parcel/src/lib.rs:288-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/parcel/src/lib.rs:193\u0060 it does not close everything it opens, so those exact 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/parcel/src/lib.rs:202\u0060 calls \u0060build_started\u0060 and \u0060crates/parcel/src/lib.rs:297\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/lib.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4b04ea3dcd8b020ab26b468c2492f66d136b153ebd21ccbe7f69dea7113ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/highlight/src/js.rs:256-263 | crates/highlight/src/js.rs:292-299 | crates/highlight/src/js.rs:348-355 \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/highlight/src/js.rs:256\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/highlight/src/js.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfcc1872a0c534ed7af7962f9003407584d8e90fc0340053706c752f425868a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/plugin-js/src/cjs.rs:165-172 | crates/plugin-js/src/cjs.rs:293-300 \u2014 both copies are in the same file, so extract the block 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/plugin-js/src/cjs.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f860bec7c399822812139a62a94c200b128341da132871fd4a489ab11eb18f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/css/src/packager.rs:378-383 | crates/css/src/packager.rs:488-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/css/src/packager.rs:378\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/src/packager.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"0991623f6b2ff6e5b5710a298ed4ebe6d407c2647a2dde28b444715043a02d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/macros/src/lib.rs:212-219 | crates/macros/src/lib.rs:240-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/macros/src/lib.rs:212\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/macros/src/lib.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc03ee87d8b0175b5273730c0794897e37514b461a755ed81928cc1b2b0fac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/plugin-js/src/cjs.rs:99-105 | crates/plugin-js/src/esm.rs:77-83 \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/plugin-js/src/cjs.rs:99\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/plugin-js/src/cjs.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e312758465d9c6cda818fcae5d1737bf97cc10adb56258b5a194ef4895ba797a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/js/src/packager/tree_shake.rs:581-586 | crates/js/src/packager/tree_shake.rs:591-596 | crates/js/src/packager/tree_shake.rs:601-606 \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/js/src/packager/tree_shake.rs:581\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/js/src/packager/tree_shake.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab84c1260188d931300e4e5c3c62422dd69a8d4be76c459c1e820b308c9b72b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/path.rs:133-138 | crates/core/src/path.rs:325-330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/core/src/path.rs:133\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/core/src/path.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7e8d4a096105163fd94c3cee6fee5e15d5f3b97ea8969e4cab8dd03a7315c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/path.rs:553-559 | crates/core/src/path.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/path.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"63717d11c757928a2ca68ba5f0f57670ebe946f3df096374fdd6fbfccbcf2997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/core/src/target.rs:482-494 | crates/core/src/target.rs:496-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/core/src/target.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfcebe885d6a8352538f35dc6acbf2ea4ef4c4b9b14875e09f3855a623ace13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/css/src/packager.rs:248-258 | crates/css/src/transformer.rs:206-216 \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/css/src/packager.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/css/src/packager.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45befe19e92f8b9526e99c061f52e0e9e065d24c6a682b22acfb29b1b0826f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/html/src/lib.rs:666-669 | crates/js/src/packager/dependencies.rs:217-222 | crates/js/src/packager/rsc.rs:471-475 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/html/src/lib.rs:666\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/js/src/packager/rsc.rs:475\u0060 calls \u0060sort_unstable\u0060, \u0060dedup\u0060 and \u0060crates/js/src/packager/dependencies.rs:222\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/html/src/lib.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f78f473216efd21833f40bb422395baca6118f7b8d8ba9d5dbcb03bc5aff523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/parcel/src/toml.rs:19-24 | crates/parcel/src/yaml.rs:19-24 \u2014 before extracting anything, compare \u0060crates/parcel/src/toml.rs\u0060 and \u0060crates/parcel/src/yaml.rs\u0060 as WHOLE FILES: 83% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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/parcel/src/toml.rs:19\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/parcel/src/toml.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf50b5a67c151f908d186dd7e75a670fc5dc5bf30d079abc875be5a3ebce0c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/parcel-plugin-abi/src/bundle.rs:167-171 | crates/parcel-plugin-abi/src/bundle.rs:179-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/parcel-plugin-abi/src/bundle.rs:167\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/parcel-plugin-abi/src/bundle.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a4b45c3098f627f1805f503202fad18d4c100125d810ad929c162860eb6b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/plugin-js/src/url.rs:141-145 | crates/plugin-js/src/url.rs:353-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/plugin-js/src/url.rs:141\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/plugin-js/src/url.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad38b09c3457850f1921323284e8158e1ee004aa0c380b9a10160a705196c919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/html/src/serialize_html.rs:310-314 | crates/html/src/serialize_xml.rs:210-214 \u2014 before extracting anything, compare \u0060crates/html/src/serialize_html.rs\u0060 and \u0060crates/html/src/serialize_xml.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/serialize_html.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb02bebbcd0349bfc547b52dffb842f84b04ad408fc8fd83a9c4ff708d28a822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/html/src/serialize_html.rs:316-320 | crates/html/src/serialize_xml.rs:217-221 \u2014 before extracting anything, compare \u0060crates/html/src/serialize_html.rs\u0060 and \u0060crates/html/src/serialize_xml.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/html/src/serialize_xml.rs:224\u0060 calls \u0060write_text\u0060, \u0060write_to_buf_escaped\u0060 and \u0060crates/html/src/serialize_html.rs:322\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/html/src/serialize_html.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02c22ad37b47f391e3a77e0014991c4752a0024f2f5073b46ca94a098a16d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/parcel-plugin-abi/src/bundle.rs:81-87 | crates/parcel-plugin-abi/src/target.rs:205-211 \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/parcel-plugin-abi/src/bundle.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"657cc74cf64c8bd6ad802592265f5937807d878da59f8d3af4e0b6dfd39b4d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/parcel-plugin-abi/src/dependency.rs:509-515 | crates/parcel-plugin-abi/src/target.rs:169-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-plugin-abi/src/dependency.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"35aad195018d071361b74223f10e9835ca87f2a733a37e426881804effbb7376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/html/src/jsx.rs:798-808 | crates/html/src/jsx.rs:810-820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/html/src/jsx.rs:798\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/html/src/jsx.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d99c46b7389d9fd83e2447e45f77b95431a87bfc4e661d2d5e91a7863b5d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/js/src/transformer/dependency_collector.rs:923-931 | crates/js/src/transformer/dependency_collector.rs:936-944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/js/src/transformer/dependency_collector.rs:923\u0060 it begins part-way through the construct above it, so those exact 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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b27db06d3c2ae9d848d560c0a72605daecdfb17e272c3d3d49178f897b9ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/js/src/transformer/dependency_collector.rs:875-881 | crates/js/src/transformer/dependency_collector.rs:884-890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/js/src/transformer/dependency_collector.rs:875\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/dependency_collector.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"052c4c1894970c2aeda5a65f25e025af39b3e7b317b13e101ff218aeabddd5e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/html/src/optimize.rs:349-354 | crates/html/src/optimize.rs:366-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/html/src/optimize.rs:349\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/html/src/optimize.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2137acec44d25926c61240b28e73dba83a1ca5b4f596e76661155ead379a0f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/css/src/packager.rs:1040-1045 | crates/css/src/packager.rs:1116-1121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/src/packager.rs:1040\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css/src/packager.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad50e73e63c9a1eeb95a2a22b46d78863e98a706e61d148a216dad76c78342be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/parcel-plugin-abi/src/bundle.rs:214-221 | crates/parcel-plugin-abi/src/bundle.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. 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/parcel-plugin-abi/src/bundle.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7da2f18de9dcdc0b6982434512a04f67d50d38f6404ea6d31616e4a246bc90b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/parcel/src/lib.rs:68-72 | crates/parcel/src/lib.rs:105-109 \u2014 both copies are in the same file, so extract the block into one function there 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/parcel/src/lib.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42f849e3fd76e417ae9ddaa395169276b9654aa04358e41766b7c6fc093c9c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): plugin-swift/Sources/ParcelPlugin/Exports.swift:84-93 | plugin-swift/Sources/ParcelPlugin/Exports.swift:170-179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugin-swift/Sources/ParcelPlugin/Exports.swift:84\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":"plugin-swift/Sources/ParcelPlugin/Exports.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e225baa9f635821f449008328da9705a206dedca953b528c0261b6b87ab99cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): plugin-swift/Sources/ParcelPlugin/Asset.swift:162-167 | plugin-swift/Sources/ParcelPlugin/BundleGraph.swift:188-193 \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":"plugin-swift/Sources/ParcelPlugin/Asset.swift"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0a40cee5171e81cfa7269ffcb0889757b13d4580287819c1fd5da827a4d9d9"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project parcel-js: parcel-js has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5d527787520280fac74a1f7202b53ef7d5b0b4953e5bdb4f12e86fe28f14eea2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: browserslist-rs: browserslist-rs: 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":"b7d49db2e2a4a8a9fbb94853f536d9b6e94d8bb6e05de81ea3037c42a58dc97b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: parcel-highlight: parcel-highlight: 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":"0e97c0688b3afa1e98bbd21ef77ea613954742985f4c39b2dba05c635ae69506"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: parcel-macros: parcel-macros: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3293aa67a05b74b8bd76239646500944a22888cab69968dadff3f567baf04dd4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: parcel-plugin: parcel-plugin: abstractness 0.08, instability 0.00, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"283021c691e5ddbe04f70a5dfa1d13dd2f31a4fe357f5794a21ee4fe34a2aa43"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: parcel-resolver: parcel-resolver: abstractness 0.00, instability 0.17, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"922939b54d4466821672fd9904afc69bf896a60644d20d69ce9714ee0cc057f9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: parcel-core: parcel-core: abstractness 0.11, instability 0.17, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"82af18fc2818ab4f3cbc567aa5b9779ca2cc56db3be2c62a0ad75c11a11c7dc8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Sink (LCOM4 6): Sink\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/html/src/arena.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a508be0178de025de872adc2e3a582bf9332fbf240ee1522dfca6bc07222a4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HmrServer (LCOM4 5): HmrServer\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/parcel/src/server.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d7c53c7a70b4ff023b4e5276ec57a2fcce898bafe96b46cb0d45ee34abc31e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Resolver (LCOM4 4): Resolver\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/parcel-resolver/src/lib.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61ff5dfe546b9fbe880956cd5dfe5fff87a23099663aef5bed95b8cc3cdb997"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/transformer/plugin.rs: crates/js/src/transformer/plugin.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in parcel_js::transformer::plugin::config at line 329. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/transformer/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/js/src/transformer/plugin.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb54ce0f0d381fd699c85fc9b580e9bc105d2a730110ffd6619bb3ca0a7b470"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/bundler.rs: crates/parcel/src/bundler.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in DefaultBundler::bundle at line 173. 2 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/bundler.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/parcel/src/bundler.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"595b63737027f0f48a8270a154de93e1602af18e81c936ca5bf96565f0b9d3e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/transformer/mod.rs: crates/js/src/transformer/mod.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in parcel_js::transformer::transform_to_ast at line 459. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/transformer/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/js/src/transformer/mod.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e42fac300b16eed2f3d4075119b82b776252eda30f0b1f31413543b373578b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/packager/dependencies.rs: crates/js/src/packager/dependencies.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in parcel_js::packager::dependencies::asset_dependencies at line 237. 7 of those changes were fix/bug commits, and the other 17 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/packager/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/js/src/packager/dependencies.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad378e441de95fe4fd8976a1a764e8d72505f01a851c456a6a5537637d3c6bff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/transformer/dependency_collector.rs: crates/js/src/transformer/dependency_collector.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in DependencyCollector::fold_call_expr at line 750. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/transformer/dependency_collector.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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e19bd4f6ac890d54baa207adefa401cbe019efdcd5cc52baa059d06d13c9dfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/main.rs: crates/parcel/src/main.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in parcel::parse_args at line 145. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/main.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/parcel/src/main.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dee1bb91898ca3bed1a0799bc2b90a78577d024e8b3be83bded0d102320dd3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/html/src/dependencies.rs: crates/html/src/dependencies.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in DependencyCollector::visit_element at line 243. 2 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/html/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/html/src/dependencies.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab7fa7a9234cae8604c19312344ae17bbe828b62d9a8261be8a9d632589c8ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/lib.rs: crates/core/src/lib.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in parcel_core::bundle_and_package at line 428. 3 of those changes were fix/bug commits, and the other 23 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/core/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/core/src/lib.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ee81f2ddbfb6c4a3b7b4b6cafc8561107eb2d53c0bd4dad6f765e5cd4f8fe3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/asset_graph.rs: crates/core/src/asset_graph.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in AssetGraphBuilder::build_with_changes at line 238. 3 of those changes were fix/bug commits, and the other 14 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/core/src/asset_graph.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/core/src/asset_graph.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1764ffb02416290020adcf83ab86af12f64426acc979d3848947f29e567a3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/packager/mod.rs: crates/js/src/packager/mod.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in JsContent::package_app at line 69. 6 of those changes were fix/bug commits, and the other 24 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/packager/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/js/src/packager/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53ae038a86d91538d8eda7f974c35a6b50706ab8985aae936d833ab739d14bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/resolver.rs: crates/parcel/src/resolver.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in DefaultResolver::resolve 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/resolver.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/parcel/src/resolver.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5301fc6e80517449533615f86f9e1019d13283cbb72b61c0cc8a80cd41b49f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/html/src/lib.rs: crates/html/src/lib.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in parcel_html::prepare_to_package at line 718. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/html/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/html/src/lib.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1277ced6faa2e0969113655326465622f3762e54094002836c35c71a04ceb36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/dev-runtime.js: crates/js/src/dev-runtime.js changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in dev-runtime.parcelRequire 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/dev-runtime.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2133930d5542261a2430a22840ae8ebe47c23c43ab70c86302e075dec8ab9ce5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/css/src/packager.rs: crates/css/src/packager.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in parcel_css::packager::inline at line 457. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/css/src/packager.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/src/packager.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a668b22b86d07aa555a86ac3598aa4f1782a35a158b86348438428e763fd3cfa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/bundler/optimizer.rs: crates/parcel/src/bundler/optimizer.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in parcel::bundler::optimizer::optimize at line 404. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/bundler/optimizer.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/parcel/src/bundler/optimizer.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"da34b144462a858e0b0f2f258c2796f2abf3b99a62c5b68fd0bc2b558b2ad02e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/bundler/style_order.rs: crates/parcel/src/bundler/style_order.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in parcel::bundler::style_order::segment at line 153. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/bundler/style_order.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/parcel/src/bundler/style_order.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b7251abc8d5e8d89899e442657879f761861a97db28f26cd6b51076745fc0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/lib.rs: crates/parcel/src/lib.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in parcel::run at line 230. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/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/parcel/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"702f11994fd90eab5a58b7637483b38cd1c0f5eb0536b4b816dfb7724708b930"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/html/src/package.rs: crates/html/src/package.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in parcel_html::package::insert_bundle_references at line 168. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/html/src/package.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/html/src/package.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ad22e12d9c42b95c76959b7e31013d2eff2dc176ecbe1f8564f966f0bec7e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/transformer/modules.rs: crates/js/src/transformer/modules.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Esm2Cjs::visit_mut_module at line 335. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/transformer/modules.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/js/src/transformer/modules.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ac5666cd76c8ada2b34a61d7a50babd5413383772ec0b635a0a1b0d604ffd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/server.rs: crates/parcel/src/server.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in parcel::server::serve_file at line 252. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/server.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/parcel/src/server.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40d2f448d191081ce5fc639159cbcc23c801b134a0e16a66d8160c57a9dbba3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/entry.rs: crates/core/src/entry.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in EntryResolver::resolve_file_entry at line 103. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/core/src/entry.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/core/src/entry.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e0a42c089e919e09869d414f2f968908c893632c0e28de1c9a90088fff9384"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/css/src/transformer.rs: crates/css/src/transformer.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CssTransformer::transform at line 110. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/css/src/transformer.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/src/transformer.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0427963f8c0be64474b46ae3275eb5c1cd528f7993d760f033ad83a54f5cac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/plugin_factory.rs: crates/parcel/src/plugin_factory.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in DefaultPluginFactory::transformer 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/plugin_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/parcel/src/plugin_factory.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"839ac9ee8b2d79b366a44922a01535a3ecdc976da0c350cfb7104b048c2dc170"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/hmr.rs: crates/js/src/hmr.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in parcel_js::hmr::get_hmr_update at line 62. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/hmr.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/js/src/hmr.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c0ee5bceb866b4b2069419ec75447c9940f3c5e2c05807a52baa8ebd5b3f54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/packager/synthetic.rs: crates/js/src/packager/synthetic.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SyntheticAsset::write_content at line 183. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/packager/synthetic.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/js/src/packager/synthetic.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c98aa1b742fa3fd7f34a246f71d257c8b57da2f5f8c6eed868cce503f4af2d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/transformer/collect.rs: crates/js/src/transformer/collect.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Collect::visit_member_expr at line 614. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/transformer/collect.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/js/src/transformer/collect.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c461f1cc2af6f31c76770931a3847bc5a2aa842da215411c66f2b583ff560f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugin-js/src/cjs.rs: crates/plugin-js/src/cjs.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CjsLoader::load 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/plugin-js/src/cjs.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/plugin-js/src/cjs.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"162eb0796105c4a9f98ba0f9ebde151850aafa11a8a3d2578403f71644f40f63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/glob_resolver.rs: crates/parcel/src/glob_resolver.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in GlobResolver::resolve at line 18. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/glob_resolver.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/parcel/src/glob_resolver.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7cae8220aa3bd9aa4aca6002a597dafc4804b5684f8aedc9ca92dba837235d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel-plugin-abi/src/dependency.rs: crates/parcel-plugin-abi/src/dependency.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in parcel_plugin_abi::dependency::parcel_asset_resolve at line 311. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel-plugin-abi/src/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/parcel-plugin-abi/src/dependency.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"105c3c2189cff095b17f4b3672fd9a2bd84aa31aa5239e8af17c1c3900333e6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugin-js/src/esm.rs: crates/plugin-js/src/esm.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ModuleLoader::load at line 127. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/plugin-js/src/esm.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/plugin-js/src/esm.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"69efa6ff0b1f041bb3eddb9d3e9b6f48106ffa86239ca474baf281b1ae9e68ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/image/src/lib.rs: crates/image/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ImageTransformer::transform at line 49. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/image/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/image/src/lib.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8170a249967ded78fc8f97d438bee54d2dbec029c09b403448b07d5b7b06ad13"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/packager/rsc.rs: crates/js/src/packager/rsc.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in parcel_js::packager::rsc::resolve_dependency at line 105. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/packager/rsc.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/js/src/packager/rsc.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ef4f4dc675526e8b9ad4039717571f5e59a550d0db4d68dcdd823ca29f8c6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/packaging.rs: crates/core/src/packaging.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in parcel_core::packaging::package_bundles at line 253. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/core/src/packaging.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/core/src/packaging.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"842aa8b888a19c416ae3b83d124e1d6ec2209b5549cc81cd0da1a41b3ba65c0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/packager/tree_shake.rs: crates/js/src/packager/tree_shake.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in TreeShake::visit_mut_expr at line 426. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/js/src/packager/tree_shake.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/js/src/packager/tree_shake.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f89e206df7e091239a86d2747aabe2d13f20e2a5cacfd954f0a8ad5d11985c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/bundler/bundle_roots.rs: crates/parcel/src/bundler/bundle_roots.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in BundleRoots::from_asset_graph at line 36. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/bundler/bundle_roots.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/parcel/src/bundler/bundle_roots.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"309d25ea10d6c0b8cd2eb2e8b679d275adce28935aa144e35e161d763dd7b1fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/invalidations.rs: crates/core/src/invalidations.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in InvalidationMap::invalidate 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/core/src/invalidations.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/core/src/invalidations.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3259e9db8cbd52f1d154193261d9bedcc1692929310cf974e7e4c3159552bec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages-v3/stylus/src/StylusTransformer.ts: packages-v3/stylus/src/StylusTransformer.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in StylusTransformer.getDependencies at line 92. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- packages-v3/stylus/src/StylusTransformer.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-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff53fa27b3a103fab32e9cb7f625c61188fcb5b6e648486f4486dd5fde88ee89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/bundler/internalization.rs: crates/parcel/src/bundler/internalization.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Internalization::new at line 45. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/bundler/internalization.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/parcel/src/bundler/internalization.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"92238132c998adea80b624b7e01af8c864c02665d4383e0ec7bac9a4c3df07a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/namer.rs: crates/parcel/src/namer.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DefaultNamer::name 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/namer.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/parcel/src/namer.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed0fd435d067a20c7f66b052631ada67cae21753bc0051e2a5de983e168d210"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/bundler/reachability.rs: crates/parcel/src/bundler/reachability.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Reachability::from_bundle_roots at line 21. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/bundler/reachability.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/parcel/src/bundler/reachability.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70eb651764b4f2f2dbe1970b44775e58dd879e39a259b469daf70ce29211437"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parcel/src/analyzer/mod.rs: crates/parcel/src/analyzer/mod.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in parcel::analyzer::write_report at line 117. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/parcel/src/analyzer/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/parcel/src/analyzer/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c3b4135a26c36815ef1bbe068e7bd4384f5741db4c8fd8fa66105cd8c3849c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/css/src/bundling.rs: crates/css/src/bundling.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in parcel_css::bundling::propagate at line 194. 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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 22:58:23 -08:00\u0027 --until=\u00272026-11-10 22:58:23 -08:00\u0027 --full-history --no-merges -- crates/css/src/bundling.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/src/bundling.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31a561e83b55434d95692c6bef04dbe9d0a9e78f286b896d4adb6c005b042c3"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 145 significant file(s) lose their only recent owner: crates/parcel-resolver/src/lib.rs, crates/js/src/transformer/dependency_collector.rs, crates/parcel-plugin/src/lib.rs, crates/parcel-plugin-abi/src/tests.rs, crates/plugin-js/src/plugin.rs, plugin-go/parcel.go, crates/core/src/entry.rs, crates/parcel-resolver/src/package_json.rs (\u002B137 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"584d9251c115a93abdc2a5859d34564cbb6281e9bd8a760f189b4fe31375fd16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: skip if tailwind is not present? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/tailwind/src/lib.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a99f1749394334deb61ffe0d2d998c6b7ce006b0741a79d57c788e0c180e90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: error handling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/tailwind/src/lib.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"316944b3cc68555c7043ef61ce11d81e3c14a78283cd25dc2a1dffedae7b321d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: expect \u0022not a valid Parcel transformer plugin\u0022 once that is removed before GA. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/plugin-js/tests/test_transform.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"723f0fdcd1a93142c9c97ad09a907123c90c36e436bab31263e87768e16dadcb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: other encodings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/src/encoding.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1bcef0409e42e0f597c9ed1eebcde92e1006ac114a097732c5678ada7a6a45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: invalidations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/plugin-js/src/macros.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c982c7242498e4eadad8f4fa074d654e81d46928c8e1be54cbbf2ed0b3b71857"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove before GA. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/plugin-js/src/plugin.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f6d52f64dd26e99fd24c473f115e80a5dde26c7db80df2efdd8d2f3768f562"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add file create above invalidation via fs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/parcel-resolver/src/lib.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1640fd1b0fabc1132dcff8d646c1b5a61444bb95c2edcbca715abecef64b885c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // // TODO: use the fs find_ancestor_file so we get file_create_above invalidation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/parcel-resolver/src/lib.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b3ded1440732ce0bce78458af96e63572fc3813181470dc0dfeeb2362e52ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should this follow aliases?? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/parcel-resolver/src/lib.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c67ff5d8fc8cfda90ef6ce00246c0ca4092a13fd9bbe0103ffcc966870c51f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: track location of resolved 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/parcel-resolver/src/lib.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c5fd3aec8c1c46db48ce51d1506d739b6335168bd50baf04be88412673b7b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Revert this in the next major 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/parcel-resolver/src/lib.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3074111d3e0bfae9877c63ebdc559af8283daf93d653158177196027446bc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: TypeScript only removes certain extensions 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/parcel-resolver/src/lib.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7e79bc338448fdaa77e5069065148d5d61b1007698283c6a0bf0fa1a9b1765"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should aliases apply to tsconfig paths?? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-resolver/src/lib.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41e3a6666f3931a2edb9a94ad719b7e363878914633796954e78b6c4a28cde3"}},{"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/parcel-plugin-abi/src/tests.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2232f2f827f17b7ae3762dc8424334b679ee8c5f3dc37e24fa3ab504b83823fd"}},{"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/js/src/hmr.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c779ca58cfdf0a551aee6a95c84cbc204cfe1b7ab93423a6c3b81ebd3cef4b82"}},{"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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"e521ac2edefc810c35c09b6d77d548f7eac598d67e7639406c7854f6a2d0eeab"}},{"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/js/src/packager/tree_shake.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"abed596bb1d82c33cb747a9169f4482c8651940cf1c46866ce1e313dba72b57e"}},{"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/js/src/packager/tree_shake.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f497193ff38d8f9834d4b2b6f4e78afbc40fedc3bc3533945c534b055a0c1d4"}},{"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/core/src/entry.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b311f0e3e2b36e2cf8491fc1d247a43e750754d8d92b168fdb1144d6121f28da"}},{"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/core/src/entry.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54dfe28a0f711b47e17e433fc8c16ad6baeeb4e3a97294cf057edd0e235b255"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: other environment properties? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/parcel/src/bundler.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab85c43ec633f4b734e63050fe92449501a47aea249df7c4717243247f0fd546"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: other environment properties? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/parcel/src/bundler.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d400211e12194d6f87485d827f6eb3a7bf85ab1d0400c2cd964ca43e829faf9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I think we don\u0027t need this anymore. Was added in https://github.com/parcel-bundler/parcel/pull/4311"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/hmr.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec84be2b9155fd5724d185c36cd7995db4074a6b9ea7e3f39ebc374b2bee20f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: only changed ones?? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/hmr.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d603dacc7fc0336ac76b67660777a0af5a77cea1045ad2fe05d7e49be68d2782"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize \u0060require(\u0027foo\u0027).bar\u0060 / \u0060require(\u0027foo\u0027).bar()\u0060 as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/collect.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49d23e04e5804bcb228d38fe9643cd9e371fb3a402110e25956ef8df258c116"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: get versions from package.json? Can we do it at compile time? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/js/src/transformer/dependency_collector.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd2c007424522c28bd027734f1f04377aa87a0c6861dbe0ea3671143632daf3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this seems questionable but we did it in the JS 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/js/src/transformer/env_replacer.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"750da1892388eca181a39e9c403149b3a1ea7bf57324d26b60ba517fbdc45e5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This can be written to run in-place to make it more efficient \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/env_replacer.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d4e17de436fe31c25f9ad3c6e8f7eaa8ff84cf7ac419ed6cca72f101118da2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This can be written to run in-place to make it more efficient \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/env_replacer.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f245b65ea2de0d2e456b5aa59dfa7001049d7e87cd1eebbd46b422c816ca41c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This can be written to run in-place to make it more efficient \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/env_replacer.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5603dbee4ebee14e6244af6659badbfb1d8bb04baccd5b1c795af9658a9cc8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This behaviour is wrong, nothing should be changed on 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/js/src/transformer/env_replacer.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"3523976dc457ceca2be935044fdbaff052e00a721fe724688bfd53b1db3554f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This behaviour should be removed and will be disabled for canary builds. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/js/src/transformer/env_replacer.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"dace3e054b67c35b346737df17d4b6f4010f35695ef02af18099cd649a4e49b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This seems wrong as there\u0027s an extra trailing 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/js/src/transformer/env_replacer.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"9277a3f84b90a93f02fa8c40a5aa0b65f45fe26aa54df3c1cf3610eedee94cfe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// (TODO: why is this needed?). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/transformer/global_replacer.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e809207b5c27f59302ff453c0f62b3e6c1de8f2e083d041b8afdec19c7b50d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use a real parser \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/js/src/transformer/plugin.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb3717837dd70bba3b3a1a6fcb626ce400444b13604dd368ef52912c41a93ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add indirect/star exports \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/js/src/packager/dependencies.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"216eb29e31977dcb747d8d2944fd9d9e2b2bd14aa074fb5080fd139cccc0d55c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is wrong. It should be if the _target_ module is CJS. But this breaks some dynamic_import tests. Would be a behavior change. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/packager/dependencies.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0c5aa3d5e4dd38346948b7f531da2c20cc0facfc97b73391018d1f91ea4833"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid re-parse by storing JS ast. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/html/src/lib.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a096b3ca10ea15f90135b00bfd37afd07ea8f1b3a044eb063628a7d20d43be3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#122)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/serialize_html.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"31abfe0cdf33065d1c14480b1d934ff19425206688ba05441b40638c5c825f3e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#122)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/serialize_html.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0833ab293cba6000f6ae2cb51f99698e0c8bb6e143e3b4f7211f8f02039fce85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do what Gecko does and first validate the number passed to the Rust float parser. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/html/src/srcset.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd61daf880716d5859a8e7a11ef66ac27b5b6baa5403ccac62573306fa2b5fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: how should we handle package exports? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/dev-dep-resolver/src/lib.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"066216e351f74986c5847039ecf3daa36f58b534a615e831a6f1d1f424be2262"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: set rule source index \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/src/packager.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab9302b843c39ee5327c4ab064b141b616c72574bf550d974994f260e15433e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid 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/css/src/packager.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65130b6f481ef19f3e4aa07cb86232e9f0fee3e06587f5ce074ec4b7d046013"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: transform AST instead of printing and re-parsing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/css/src/transformer.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfbe1c31b63e52b47963e52b1a94bad198cfdcab93424ae65e1d00349aa226a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: evaluate if we can avoid having multiple in-flight requests for the same asset in the first place. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/core/src/asset_graph.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ad22d5f16f0e724699505a87a7893ae5ba6d3105dbe13ac618dee82fe88862"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if we didn\u0027t transform unreachable nodes in the first place this wouldn\u0027t happen \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/core/src/asset_graph.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0753a92317a8b78d5a4ca80b8badca8f2d6f586d9b8f20819c079e00f2f1633"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/core/src/asset_graph.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b0b8bc84626373bf8547b5f505205e1edc180d63275aa00f476ae620cbb417"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: error on reserved named pipeline \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/core/src/config.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"bede0ce26a976f097cbbb1451045bce958f16585dbcff2e12cc7d565f509d838"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace tab with spaces? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/core/src/diagnostic.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"835db091802d69746e0133337925fc8c5e7cf87f807d4e73d8594578571fbdb3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: hashset? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/core/src/entry.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ad2d7bd17c10fe419e0eafa7e373bb0814af6e70ff0109b47aabb9fad8b007"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/entry.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0722c6d35b8f14e3f375b2eacfa767ba7142fbd2b4122ceb7517956181da2f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: error instead of deadlocking if there is a cycle in inline bundles. Currently this cannot happen. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/core/src/packaging.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e067d43eedeadb10981581fc64823d6e11c54f72c0e5d9de77400b3eca000ef2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: symlinks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/core/src/transformer.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bf049baf522256b3bd339567ef5976b73511234d5af7928e7e07b2936080c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is this needed? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/tracking.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dc301244a3e31c2e37703a4703db3d3f46d819c7d8072d84d5b71034c4ccb2"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060babel\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages-v3/babel/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-v3/babel/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3459dcf2b666c425f88edd5c3bfe08114790a452928c5ebc46ca289d5dbbf20"}},{"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 \u0060crates/parcel/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"498e556554f98285a68d5de46ffca9fbd260c89831a11d40ba9fccaa2d4895c4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The bundles each bundle loads, the reverse of \u0060loaded_by\u0060.\u0022 repeats the code it sits on: 4 of its 5 words (bundles, bundle, loads, loaded) are already in \u0060const loads = data.bundles.map(() =\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":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"908dae694b1fa33cff849b5e5c6934c3c14e4edfb19b19729be497f8d57bbf7e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Normalize the tail path\u0022 repeats the code it sits on: 3 of its 3 words (normalize, tail, path) are already in \u0060resolvedTail = normalizeString(resolvedTail, !resolvedAbsolute, \u0027\\\\\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":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"38992c65bdbe45ea379c67052b152f59d81abff49e347cb4ab8962bbbbddbff0"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 30 project(s) overshoot their size bounds, lowering Project Cohesion to 9.3/10. The most over is \u0060crates/core\u0060 (14215 LoC, 130 module-visible types across 2 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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"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":"45f8d04301b54a67bda9e3ecfb059d77e3679d9d162f8668ff02e63d27184fdc"},"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":"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":"e505b8b44bcb9950e83e94d310aa007d38ba96fc409467d6c8b211a9706c5483"},"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":"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":"309e9b89177f98efdf15caf1b2029984572824977cd3545238ff621e998569ba"},"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":"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":"4f40559c9c4828ea62552600c19ca673b56d9b54c84962a3cb533bf1f3c3a7ff"},"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":"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":"641f262149b55b99741467a3f7ae41355ad6cc83ae05b2b0942ac77295f9e36e"},"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":"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":"836c54a0750f76b89b302d34277c82b816c09122947f4e9d21e1b825aff00cf2"},"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":"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":"a1eba3945ca7335af26a3697ed9941a69f2460a553128797f7c51edf40e5c306"},"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":"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":"73c0aee2c0b78cfb6897dc098059ea4f6067319f8674ec2ae74998d1fb7182d3"},"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":"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":"4e745227711985933fae7044f061ff685f2d14f67c075b47e611a8b82c871b44"},"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":"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":"24391c14506d428113028fa493320afef419f81ed393480ab794d97f9e270e5a"},"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":"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":"493b8c107440505775c13312802441000775e0d041aeab8d9cd7ea7809f8152f"},"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":"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":"6097e6289cc712a8508b42507fdf3edd42937e38d9916dcf602c6ca07b2ef31c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"692d01c948fdabb0cf5a56147fa36c57fd7263865bf8494580d79aff05f21e8c"},"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":"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":"b144571c7e3887e4f72d48860e8a44575dd1441c7aa03c5b46ec4762b36a884c"},"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":"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":"90f2e2cf8e7d492771fcbc88fc1ec4a361f449f1b486231ace6ee8e04ffede57"},"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":"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":"f5a1187d2754e27aa09cfb35a4e2a4c3c2ad680d76206a96b7951f66e374c207"},"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":"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":"33aba1dcbec59cedbba839623a1eb99d6133d63161d7385cea13ac8b1241104d"},"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":"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":"e7db7fb40eae4a2243f15bcf758a0733d59ee4f1192868e53ecff0410379bbd0"},"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":"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":"80540c9e4caf6ea90a9e388257cbfcc22949e0dd06de6fd9473fed5bdc34fbd5"},"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":"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":"f128bbcb4e45b27bf161eb6008ba3204b760660ec28cb801c8602a30d54931f1"},"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":"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":"610cdb9567137c1fd7408dd910901f25ccebe7155dbe104a89ea5b0aa8a0c53b"},"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":"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":"f4177f152bfe169399846a7156f57edbc97f3c6ae53fc80bf52b2e4cb3a7f858"},"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":"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":"5c973802a666f5943ab9b64392b1b3dce23430fa71f0cb1a5311efedd6aaf3b8"},"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":"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":"1cd964d3c2af403aab2fc0d7534914db7ca9f678b87d263f7035f895b50621e1"},"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":"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":"b3fd70c69c5a3f720becb9211b9e344a694cab44743fcd2fdca704d6909887ee"},"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":"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":"27cb211024abd4a3c2d524434bb36d71cbfe088eba4b8de4e5c5d8ddb87da820"},"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":"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":"7f4c77b8590510761bd0f7ecff24a6e6a3e601e157821b0e00f07d5a2c25db6d"},"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":"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":"462c768a245a0009a8d0f8a17b72ab7e0916b6615edb04b2098824caa2212a2c"},"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":"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":"a3257383cee4c787f8c8019e489dc82f00451994d80625cbec1b66364f8d0788"},"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":"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":"8f6459990389712ee9b55ad3e11e3d592f040736ea62df530b140d3faa21d593"},"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":"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":"0c187c791d652f5b287cb52f9edb2aedf472fd4aa35d871bb67567dd20d8925a"},"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":"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":"2afbcafeac4ca7bbab4bf039eb49469617b702404826530b55e122d68e6d30a6"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c98ea18cf3748f13d9fa4e12e83a76c257a3f9d41a7cb4474ac60534b3a9b77c"},"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":"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":"62e9f3e1d1e4c022aa1235e4829149d2838bb76bfca6ce9d5fcc42941fced452"},"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":"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":"86b27d1a258d911ff3d5ff94769f555bfb4c1b1d291a7ae2f0b5b98c588f7338"},"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":"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":"bce5c41969b7d2639f7fd1ae60388b4e5abc684683b223cbc70f33dad681c167"},"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":"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":"63f4eef4de3eb68c7eb2173329884c59d828a2062cd251caba5ade8f4b474f3f"},"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":"2254efc53bbcc6fc10e8f7a51b585e2aa7b694e208da5baefd0bc95088d43bd9"},"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":"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":"b982e4e1bf5bd1d8e5728fc8f69650039e1b5ccb08e569a5507404d6523f9054"},"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":"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":"b3760bd903bd4280f119ad46f0de9db3c701e607fa1f7107fca9a49e8a89e7f2"},"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":"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":"aed12355843a80a1ba4969f6d5d8152da3704e775aeb31f4931a168adb42f09e"},"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":"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":"484bd72394e1e28ed115d6d1e1e5011f919e172bf5862a1cfa0a014ffa9c89bf"},"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":"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":"311891588590d1e372f1a93485af2463f8cfbc3f8166335f582206d78438af61"},"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":"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":"032b3ec99f14889146f9ff146d1cea34e1cd78cd2f5380de1df0ce501f265e89"},"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":"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":"770b8196975a98f0d7c75c1a2416b437cd6587e5dde0f0bc5a730df31709e4ac"},"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":"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":"552c6f08739f5bfc0be27a3bb1bd15b5c610207016ce2e69e2850806388d7a0c"},"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":"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":"43104250098bdb2a8e5bd374a83545fa29f5c4477bb7672240cc5bf4cd5c95bd"},"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":"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":"324d59a7a77474637cdb30611e52ab6997203e08395c3a9fd5b0c46fc79ebfd8"},"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":"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":"0850ab837fa6c2227fa8263bedf5d093a4cef07a1e6ba6fa2fd3ba2559d2d1cb"},"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":"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":"2b35bcbb81a8f1326de954aee02cfe6b17d4c18599f3fc66db00cced6a910aeb"},"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":"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":"82c4f8a03e69343108877df9b2905fde55858c4731cf9426f29697b55d80f5dd"},"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":"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":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"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":"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":"d7c35f6274689ea88bd20df87299f476cf34a27320b671666cf704d0018a4110"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3881a2267d6d7656a079efc6e331db9e9912f93db67141b970cdf0d4f21e2711"},"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":"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":"05b25a21d5f7b544d6d9511b9c1864dae6f6422ce06989395efc68e00ca4f983"},"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":"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":"cd5a1504ea8e23e3858b9187f214932bd8d9b0d15e84aeabe0c182e50ce8c1a1"},"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":"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":"bb1a143ccff2312309dec9299425548f276a8f442f166d0a4450d0f4fcdf7641"},"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":"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":"b84ae62ff5191ecc77350c197ba8bc27ed518a9f7ac1fdb92c5f887af86b0ee9"},"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":"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":"f1d14f0b0a2ea6460c2bd72690e8c84f9415da5cc9f603bba7bd0c4addef4d02"},"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":"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":"d73f8efdb4e9922b332b4b64efdfaeb58a35ca224095cd88840a5b4ccdb05f32"},"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":"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":"8227b209e0be4804eae421a358d8a496d0cea2fca316551d7ebb9cb6837e7fe7"},"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":"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":"15a458fdd820bb101abe2030fed67475ac508aade1d86216fb3974979882a23c"},"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":"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":"58ba1f5314a6ed29437091556b6ccd38fb5dc8923b3868660f623adf3cb650bb"},"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":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e37d8c3080d3f8e690d19a540a352f863a9d0d11f51431a4df4b2e0a9df4df9"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"b2bf75fd5010df649bc35907af6d09a8659e7518221003ea03b629f6a3959794"},"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":"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":"23beb72e5b26aac7ef837f3858826b9fbfcac5005b1b31ee9fcd4c633c157ef2"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59735f5047570631a063775a0d1e31145de489b52ee2e1a66ceaa77499bd63ce"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9485be2f543f9e0fefdd3795988602aad65e384ed2236205bcfe1ad65ef54f4a"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21ebc2eaf5be4d1c9def433ad72a3c7ce708de3232c1eff244d785daf6be5d35"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"6e4ffbad46fa328e12ed13aff03ce9779cdf11d95d4cd14493f2985a94d2cc91"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"1f49523946f10fcb10be2a674c1d5cedfddac6e6612d42707a9e79b45a98df5b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"383adfa7bd0e177ad02dcd7d9ed00089c2a7cafe187e6f4941fcd2893c4cf4d6"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"8673aa68dbcf151abe2543c835284bf16c85b996e4a2c8a280f7c9af7c114447"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"02cfc31698600c106bca4be058b178a4e1b0cb8d36e4b6516c73984819255d11"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"7a59b319f07ed2e745fdb6803afa6c866b76dc0c66cb84e37da27157149073d1"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"03a83b6bf15fc1f7c47b58870792d83983d0f1d10065c360f54e6045fa50071f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"3ac0b0dc6dd21405616838c7aae88a86b01421b99f8b6b85ad9bdab6784735ce"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"a65b169492153baafe23a972048741379abfc344fb2795f99d4057dee5ca49e1"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"fbbb1408abbe0676b2a102d70189fd899d0f0cbca3755fe2adae4c8de7f00980"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"c839bfbbf31dc4d4e9b09cc3744c1ecb404227c25416a5d511385d8cb465bf57"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"0d759b1133a055ad71dbd34da956ae90ccc8e45d546dfc08bbd3311e65a88a0d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"69295208a0a4e7c3b0b318945b3a832299c16bb425435d22d769ae686696c1cd"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"74c7164913a8e5ab0f6786c7b7de1e80868cfdb3e8aee295f2e57996205144bb"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"db5a191a08584ffd3c68e67b42bf7749ab04ba54aa2627db62934c41e0f32b56"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"7ae066e4b7365f4cfdc2ea707dc569e6a86f33df4bd30abb33f4a92abace6e7b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"4990f0b69891775700eeca897a5b23b781dca1618fb66cb5ddb3ad8aea58f1bf"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"4cfb5a699cab4c4c2dc144d78ca6bf109a7a518ae7be7ccff576e803c832b340"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"306565857cba177ac9aa6ff65c331be41f631042729f59c593a86f8a6594e574"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"e8dfb83b6a2b876829c276296bed3f79377490d3cd5870a3421fbf3048de83cf"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"2cda33f295f069b25d05dc93f88bc89740453e3fe24bbefa09184862106ee518"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"de28e50cd58914250d8f3e6079bf29c41b664a808d6b5bdeeaba1f588a65ec7d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"ed558b42e43f6448219c7701520a99e37aad65a3a90e3da4a0b4ed09a0f456d6"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"487c6ba7f4fd40803a93fe4b63ec96862984accdcc7492764b9f645071275081"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"2e8e2315bf04f69e763138c5e11da3b68c410680af2736171d259c40e7506917"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"c55e5a73938f5fc34a430d67f060f25d04b508b2e6ef14c3202d593a293bb587"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"8d176f8755fc2a4ae68d5379a0775573f221c14c51d94ddcb14383573d249acd"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"7ef93443e40e4c5e7a55a843ef21ef7a458be6b8c42387da5fa99bc8e4891358"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"3263810afae2369f99117110d2aba97359329dbdce626e7154c5a2d78400d639"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"5783a59d6b55b1d435ba582deff5b585fa472270fcac38de8391251a7ffc2849"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"9326c095de1fc73227125b9636fc32df351d812e4be04aeebd23e4e1e4d41a0c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"399973e2b638b948d721d1f75d1e6337d70642a612a72d16b151b442800a63f6"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"c23945eec49a14bb4abe4d8acf81da0addeb8841b73b3d497b6714cf55cbe022"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"660fe92de8ec9b8591c2e545b252df8aa093e897620d053ca43036cd27628883"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"6684a0f89da39987fe8e402ee54b8e017ad98aa11d12f5d18fd18286fde8c816"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"77acfe78bcac09aab7d5303d1b5c9e7cf8c51887504d5617b8e470f1d50330c2"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"9dc26b38d03285daca2ea68bbb47c02c2266d2a39f15cc5b94fc7db4efdbf694"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"80a0e62d6f0141b870debaca5f5c9b4755c32016f997e5916c369e7f372493a5"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"3b67eb553845daf3504c6f7c89180b489a1752023c8c331deb274ddd5534ac27"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"2b0b44bda90bbeffa1f33c5085a0118bdef20774963df1ac1339ddd812218ac8"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"c70b2f288f41ab60a9d7defa2906efdbf97b5982d48ac95ea5d0afb6ecd16825"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"bc85bc50a9ea4841d0d42fb33f5bf0a8ee9cb7f4d1eb72782bb99dd44e5b1b91"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"45b3700d6358dd1317793edcc161f868466fae5572fbfbcdf7a7a3162bd19c88"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"ad81e180562edcbc162d263e1349c54f2613d62ee48d89c03238da7b179e7f79"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"be17ce80f8ca4c1d0d5f5e33563ca6a5ee304618e0564f3c7488e2da7be69852"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"3ef87da5fbf28d0b890c8f6cee8a5280943fbf9f03f78a9b77474903e65d6f10"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"64526e42e6fe4f8955a838947905ebf3c13d57d29bc738605b0c457f44830dc6"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"c07298ca71d16660f01e3a952f271487eb1944ab5652a2da0f8d7bbfb29e86d4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"90b623579748bca570d7a781fab7513c010b8c28a4d48c67513a006e6b1a8c66"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"ffaf6dd16271b0bae74481e46241e77ce13f39d878b93d6fce10dd93b1cd5284"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"558d44a79ea6d42b21f3ea5316482ff247d60d59e14b92a11aee35e1f515a9f4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"6a89b26859597807a576c0c24444a4fe16b562c84235e0e7e02e0c83714f844b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"c67bca703fca991536cbb66c3bc4e72cbfc5deeff560800a2fcff44a8322b9f7"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"e958bfefb3ebfdd6e5920175693294bb3c3d16f5ca82709492551cf9607ffaf3"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"71e68f9610b5686979ed0b3309de343ab65896d295a04563559bc0c489fe6880"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"66cd50bf3c8029d0ee0e94ce16ea3ba306004d2df73e7ca92c5c537304f88b93"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"04b00f5b8b69c562ddb9f633d6ed1011ce4f973e1a0752adda25fb4fe0d84e4c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"cd1866defa78458605d44a78dd8ea44732debcd788bc68a9cc4bb44422f3e0a4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"30cb071418b2b6c886584cc3994b66122ea33934217a2308560e3ef6804e3153"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"bc0f20dcc16cd41f704221983e68bbb99d2ea6dda12e3bdb116ffb541f30ee81"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"39100d68f30606b9345df1ba59f66facefefefa7162b50026a59802b07e0f63f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"6a4841aaae75bdcf426acf83ed8042c5883b97aefa522a3f4d2ad9da5e6a2c41"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"1e578ddcc98a29ca54e4dad7606857bbd7a8061c6505c81a8a0b52849ae7b8a6"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cfa1b79920f594301f05aa83d916831895645ff6fc60869e55ba5131042c582"},"properties":{"dependency":{"package":"react-server-dom-parcel","version":"19.2.1","advisory":"[GHSA redacted]","aliases":["[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]"],"reachability":{"kind":"production","file":"crates/parcel/tests/fixtures/react-server/client-server-references/client.jsx","line":2}}}},{"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":"1c9a61626e0d439eacda938bf7340276efbf3bfe3de024eb2bd43a16ebca4a59"},"properties":{"dependency":{"package":"tar","version":"7.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89a848ee30bc5cb407bd58163c767584e4aca69fd1bad30f6532a9e8904db97f"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.11","advisory":"[GHSA redacted]","aliases":["[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]"],"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":"0476795fbf42039d05f4c5005b8041795f07545ad465d801e41a301d5c816bb1"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.1","advisory":"[GHSA redacted]","aliases":["[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]"],"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":"141c9073bf454ba0393bd30e60638105a902f15a49d5e28ba0a8a1b52f7a5947"},"properties":{"dependency":{"package":"braces","version":"2.3.2","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":"516168152bb5dba93c5dbb03351418a2c72ea2c9ecf10f18a6ade72fa55dd0a9"},"properties":{"dependency":{"package":"browserslist","version":"4.24.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88d6edd37098557a47aff180cdb78dc20cfeb67faa4badeab2d57a968dbe84fd"},"properties":{"dependency":{"package":"decode-uri-component","version":"0.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f959547bc7b6416191ab179cafc949f624fdd43260819ba97651a8d30b116c7a"},"properties":{"dependency":{"package":"glob","version":"10.4.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3322cfa69f32b8fe1e33a0f5f0f552005af75b9130c549b9d4efb8f23387821"},"properties":{"dependency":{"package":"ip-address","version":"9.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE 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":"3f8c8aa149822f12d5a5041a2c92277aa368cd732db689685d8b23ddd28ec545"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9e27044692570219c2a22b58da49f8513c7d284493e0603daecc44a3058a122"},"properties":{"dependency":{"package":"minimatch","version":"9.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE 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":"20e05f808fdaa55e8331bf6a3bd129087179d9080258232e44cb58ba85f77abc"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","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":"bcaa3aeb9aede7e9fa8341c54213e62f0656db09f0aaeaa66bc813801f5ed1a7"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"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":"0b4015221782c3956ce20a27b534f01aaacd39391c527fa9c224316b6086fae8"},"properties":{"dependency":{"package":"picomatch","version":"4.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98c10bd5bcca3bca929fd3cd90a5ccf9aa482f7ff68301e9c94c00acd2ed6d27"},"properties":{"dependency":{"package":"postcss","version":"8.5.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"packages-v3/postcss/src/PostCSSTransformer.ts","line":2}}}},{"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":"292aff019dd5f3776df4eb4601bbfa1fc4f398a7e6300ee9441be232f8c34274"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","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":"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":"f33134b914692cd6c5f119efdf542f3d6c34c918da971c9cc600e5d39c46efde"},"properties":{"dependency":{"package":"rkyv","version":"0.7.46","advisory":"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":"22995033016ae3861d571b2c92ada6244555e3aeec08bc870b909cda12b35c06"},"properties":{"dependency":{"package":"rustls","version":"0.23.45","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0347","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"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":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"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":"2b5cc6a78fe02a95b2f6755616011982ae866dcba8c2aeaae7b037f36ce19be5"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","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":"e325083f55e202cf1bf3ac742d991739bee0450e626efb8fc1676d4bdc888426"},"properties":{"dependency":{"package":"stdlib","version":"1.21.99","advisory":"GO-2024-3105","aliases":["BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"plugin-go/examples/custom-reporter/main.go","line":50,"symbol":"os.WriteFile"}}}},{"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":"e2349dff77f96e0bc39f97a9ccb5f23acdc83b46b3a4c595422c0f9b1efec07e"},"properties":{"dependency":{"package":"micromatch","version":"3.1.10","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":"a5ef63c4a2705d824d287d97171f5f5f0eac8d17fcc8c23faf57199841212706"},"properties":{"dependency":{"package":"qs","version":"6.13.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"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":"00ed707afe41e4cd07a94968cefd27f126f4df7d9236a735a4ac504710221974"},"properties":{"dependency":{"package":"yaml","version":"1.10.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 3 of 185 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; 185 of the 210 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/js/src/transformer/typeof_replacer.rs, crates/js/src/transformer/test_utils.rs, crates/parcel-resolver/src/url_to_path.rs. 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/js/src/transformer/typeof_replacer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"530e040c4c8d5951f71e47272d96b139020c2bf18d9660c6f3f562f3e7c4eb57"}},{"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/js/src/transformer/test_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6cb018ef0c9543c7d8cb0e1aa6b4733ad0065d3e379d2b65646c39d6e81b6a"}},{"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/parcel-resolver/src/url_to_path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5075e31c600360f8b197b0976f11a555f19966a3ec19ea5eb2bc8ca7169c333"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","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":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 16: package.json declares Node.js 16 as this project\u0027s engines.node, and Node.js 16, support ended 2023-09-11. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2023-09-11 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ae2f3a8282e46ca5dd279e36d8b67377808c252f1adc205b7a3682137c5b9b"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 18: packages-v3/create-parcel/package.json declares Node.js 18 as this project\u0027s engines.node, and Node.js 18, support ended 2025-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages-v3/create-parcel/package.json"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6648803ca1184d1b831cc0935c1131320f0ac2f71c390fad75199d5bf2e7db6"}},{"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-v3/create-parcel/templates/react-client/src/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50c60892540006344f586e5fb7681424a4b58b7992040a71e930aaa07e97df7"}},{"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. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages-v3/create-parcel/templates/react-server/src/Page.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"92885a9e1b1db6a2ef5a76280d386d50ca2303b60b88a49c5c58e80b4afc5a5e"}},{"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. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages-v3/create-parcel/templates/vanilla/src/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"035127231bd949d42f6cafc54647121fa5d8406d4d283996f77e02b7ebb3242a"}},{"ruleId":"C2","level":"warning","message":{"text":"No authorization: This repository serves requests \u2014 a server (Server::new(listener) (crates/parcel/src/server.rs:210) \u2014 and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/server.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0993ff6496d81efa525c8c430c02bf3861103359a3716ec013fea7b72592e751"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README.md names Parcel 2, but the manifest declares \u0060parcel\u0060 ^3.0.0-alpha.0. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85864071a30ab325207b0475304e4f6aa1b79c8e2996b50e4173a6d35a328ea"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/6 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/dev-dep-resolver\u0060, \u0060crates/parcel\u0060, \u0060packages-v3/create-parcel\u0060, \u0060packages-v3/create-parcel/templates/react-server\u0060, \u0060plugin-swift\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 4 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/v3.yml"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch github-actions/npm/cargo/gomod: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060github-actions\u0060, \u0060npm\u0060, \u0060cargo\u0060, \u0060gomod\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d51b2e46cc914cf14105f14beb146460addf6aa9819960fe43b18069fd7e926"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadFile\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-v3/less/src/LessTransformer.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"617f2b5e6ce0c9da87b3a633a210ae0e9fe90ac7c80ac49905aa935b3a6d35c8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadFile\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-v3/less/src/LessTransformer.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecce2b28ba37f77701aec6a115fcba1e650f638a4a0627419a12efad63d7514f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060findConfig\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-v3/postcss/src/PostCSSTransformer.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e1dab9071c423810955365d87d04a75690cae0e1d24841185889fdece74ee9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadConfigFile\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-v3/postcss/src/PostCSSTransformer.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2794b204e63257a3cebce13ddf5466ba32eb15b75d74dfdd2e6c6828ed826f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060findConfig\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-v3/posthtml/src/PostHTMLTransformer.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2592361dcd3d767a84ab177186185c8c0c5a7e5179155c49439549b6866788f9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadConfigFile\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-v3/posthtml/src/PostHTMLTransformer.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fefa7ba11503af190afab3996b7ec92fe2b3a75ec7814af7e3e18d191be2e3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nativeFS.readFileSync\u0060 in \u0060callback to map\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-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c08d767250e455dca9645ff76933870b3ab3f90367f6b8031053e1e2e465114"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 21 typed \u00B7 23 plain JS \u2014 the untyped files are crates/js/src/dev-runtime.js, crates/js/src/runtime.js, crates/js/src/runtime_modules/esmodule-helpers.js, crates/js/src/runtime_modules/mdx-components.jsx, crates/js/src/runtime_modules/react-refresh-runtime.development.js, crates/js/src/runtime_modules/react-refresh.js (\u002B17 more). 0 production file(s) opt out entirely with @ts-nocheck \u00B7 6 @ts-ignore suppression(s)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (111 matched lines \u00D7 2 locations): crates/js/src/dev-runtime.js:25 \u00B7 crates/js/src/runtime.js:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 710 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":"crates/js/src/dev-runtime.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daad26b23309525df3e75ab34f56673830134d030795dcf3335bebfee6c3932"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (69 matched lines \u00D7 2 locations): packages-v3/postcss/src/PostCSSTransformer.ts:21 \u00B7 packages-v3/posthtml/src/PostHTMLTransformer.ts:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 419 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-v3/postcss/src/PostCSSTransformer.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"33399317aa6fd4059ce8205885935cf0fc4d8b082f7114323fdafe6ac144aed1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): crates/plugin-js/builtin-src/path-win32.js:235 \u00B7 crates/plugin-js/builtin-src/path-win32.js:355 \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":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e051617cea5081d2694750700b1ca37a104969ccbb7e08d4e0b0cd8c9fd6b5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): crates/plugin-js/builtin-src/path-win32.js:997 \u00B7 crates/plugin-js/builtin-src/path-win32.js:1147 \u2014 both copies are in the same file, so extract the block into one function there 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8bf95849a2babc3d2ab834688417b7c83403ee433ba61b19217bb28e8a9e79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): crates/plugin-js/builtin-src/path-win32.js:811 \u00B7 crates/plugin-js/builtin-src/path-win32.js:1076 \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":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"192f93d01f69301e441e1eb20d5177fd5b9dcaa9b7f78e5e6d022fb5959d2fa4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): gulpfile.js:54 \u00B7 gulpfile.js:77 \u2014 the two spans are one implementation copied and then locally edited \u2014 110 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":"gulpfile.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e1da45b0b4892c4e174b100c60f3c3a80094816974bc895f10e0333cef9ca9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): crates/js/src/dev-runtime.js:108 \u00B7 crates/js/src/runtime_modules/esmodule-helpers.js:9 \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":"crates/js/src/dev-runtime.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"448f01a2b360fb78c1b0662ac07aa9bd1408c5246ea963e18279c4a35115c08b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): crates/js/src/runtime_modules/react-refresh-runtime.development.js:310 \u00B7 crates/js/src/runtime_modules/react-refresh-runtime.development.js:326 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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":"crates/js/src/runtime_modules/react-refresh-runtime.development.js"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdc5c102901ca39c16f999c6d9569cd7a3e87f20e4127160eb9d8e6ce5915cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): crates/js/src/runtime_modules/react-refresh.js:173 \u00B7 crates/js/src/runtime_modules/react-refresh.js:191 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 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":"crates/js/src/runtime_modules/react-refresh.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed24ebacfd9d917a1a1514a880782103420c7055f8e89151cfa1e295bd08cdeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/plugin-js/builtin-src/path-win32.js:655 \u00B7 crates/plugin-js/builtin-src/path-win32.js:671 \u2014 both copies are in the same file, so extract the block into one function there 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8bb6fdf979373578109395c8a10ec7e6b0b6ee5a64d01af8daaa7c0b26fac0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages-v3/rsc/src/node.tsx:59 \u00B7 packages-v3/rsc/src/server.tsx:101 \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-v3/rsc/src/node.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bddd969e778a2584747ab30566655f8c759b341de18d36015a97ccce74c03e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/js/src/dev-runtime.js:611 \u00B7 crates/js/src/dev-runtime.js:1123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcd82b23a2901c16f634998a8912384793cad7b9c418a05ef0d58cb54467e93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/plugin-js/builtin-src/native-zlib/index.js:198 \u00B7 crates/plugin-js/builtin-src/native-zlib/index.js:205 \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":"crates/plugin-js/builtin-src/native-zlib/index.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b54e9714c9ecee82a1f79b04efda0aea1f63afe4bf6b615a7d2b7cd83173dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/plugin-js/buildBuiltins.cjs:437 \u00B7 crates/plugin-js/buildBuiltins.cjs:450 \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":"crates/plugin-js/buildBuiltins.cjs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bdddc1a5b9f703c5ec1023f8382e3d4cb46ce85b54e6480fb6c0bfa081bbb3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: crates/plugin-js/builtin-src/assert/index.js:9 imports assert/build/assert.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/assert/index.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4250cbbed3249bf16b7592826ded01957c153156799ede391b53858ff5d802f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages-v3/stylus/src/StylusTransformer.ts:6 imports stylus/lib/parser, 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-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"258f77405dd4822a5ebfc85b0330062ec0282079fe8e875bba610bd10ee305ab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages-v3/stylus/src/StylusTransformer.ts:7 imports stylus/lib/visitor/deps-resolver, 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-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a513e59e623245ece459c4412d6ecbc539ade1204e7038ac4a0b39c10bcb136"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages-v3/stylus/src/StylusTransformer.ts:8 imports stylus/lib/nodes/index, 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-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb61d3de11f314a34c390d1cf4aaf26bd3c6af1a58f28443dcf1e3bcd09c7f6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages-v3/stylus/src/StylusTransformer.ts:9 imports stylus/lib/utils, 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-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6fc960dd3e33628adbdad7bd091f122b5c278a032e65e0048d9b8086cf9bf6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages-v3/stylus/src/StylusTransformer.ts:10 imports stylus/lib/visitor/evaluator, 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-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9af8b7a64766bf0e256087ced0abe249b47aea75cd9ce64e698ddc658606d2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize (cyclomatic 48, cognitive 92): normalize has cyclomatic complexity 48 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd19848f4dae574783d0bca6f5badfd60f9d647f10d733a7370a15e34be3f0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 46, cognitive 108): resolve has cyclomatic complexity 46 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"84444d9afdf3c34a6a7e4f21ca6342ba894003e5152ee54540d02443aa18b8f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relative (cyclomatic 42, cognitive 67): relative has cyclomatic complexity 42 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf42934d2f22b772f4dac032524bc1ed33b97890eb187b011b0e95a43f15b22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 40, cognitive 71): parse has cyclomatic complexity 40 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6452088c3ae6a72e8a41977746216fdbb2a3c1d73769c438b6f3c1cb38a2884"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assetPanel (cyclomatic 31, cognitive 45): assetPanel has cyclomatic complexity 31 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d923d591450d1a67edc34a5f24e187f97fe390e984574e13838d5a6c239a193"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dirname (cyclomatic 27, cognitive 56): dirname has cyclomatic complexity 27 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a547e2754ea479c1d7ad7f3f5d2ba714519b569c4bc3fae9e59de6dc958fc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function basename (cyclomatic 23, cognitive 49): basename has cyclomatic complexity 23 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":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d932984f5dada8e3d7f1f8b95a63c518d40198804e17bc7f047b6822ce92a66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function join (cyclomatic 23, cognitive 41): join has cyclomatic complexity 23 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"32465cc4cc7a02fe33772f524a960da90afe58648baee303ae058cabe8c254f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeString (cyclomatic 20, cognitive 49): normalizeString has cyclomatic complexity 20 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"47aa2ce5de1d6b003adec72924fda63867fe9391c6730dbbf194ebeb0fd40f6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 19, cognitive 21): evaluate has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bundle-optimizer-prototype/model.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4bce451e93356efdaa27344ad4b1664d766ae21c5e509f286bedc9b9b71055"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 17): (anonymous) has cyclomatic complexity 19 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":"crates/js/src/runtime_modules/react-refresh-runtime.development.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a93af2399f661691dc4173b181e64efc7b0fd1c3c814dc2bec289eef56804be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showTooltip (cyclomatic 19, cognitive 17): showTooltip has cyclomatic complexity 19 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":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"517bfc77a2095cbf62e88a6723e3409200d2ef54dfe01d569142137edca913f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPackage (cyclomatic 18, cognitive 28): readPackage has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/buildBuiltins.cjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbd4da95cec7e93804d66d4241be89a2bfaa0672e44cac0c36c2eda4b65f2b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 18, cognitive 27): validate has cyclomatic complexity 18 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":"scripts/bundle-optimizer-prototype/model.mjs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"215aa8547ebc1f32e4b831dddf8ebcf9d7e61a61a0022e9632a8569a0d4f216f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extname (cyclomatic 18, cognitive 21): extname has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8e59a8afbaa5a66f5bdf8470347282c2b14d5fd39038f1d7ac2e7b083e474c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bestCandidate (cyclomatic 17, cognitive 32): bestCandidate has cyclomatic complexity 17 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":"scripts/bundle-optimizer-prototype/model.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"239b1e9e289d05f5da09c4282a965bd285f1f3d091818a7b8d44a98093c8ac18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMessage (cyclomatic 17, cognitive 30): handleMessage has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"22aa2a557960fc5ff580dfd1c8a1a9c17935ee084f4e4a8a05fac1d82d974bad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onCommitFiberRoot (cyclomatic 16, cognitive 18): onCommitFiberRoot 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":"crates/js/src/runtime_modules/react-refresh-runtime.development.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2465af68bc5adc378ff4bf105e7186319586c49346c273a638c71d2dac6e12c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalize (cyclomatic 15, cognitive 25): finalize has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5981179eb26131981283a23a23f1b1a05713417ad49908225d25cb68e36655"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 15, cognitive 17): prepare 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":"scripts/bundle-optimizer-prototype/model.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"127991666e231137d2b41429f7371d026018b56b7f07566e6f740aa975272e20"}},{"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-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"198e08537adcbf4bed87f2ab1d0b4ac7ea70f7882a1271eceaff9b21871819ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 14, cognitive 18): add 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":"crates/plugin-js/buildBuiltins.cjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb55406cfa9bb78c1c8cc7636c382c9a9b31ed1d245779178353e576bc35a41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layout (cyclomatic 14, cognitive 16): layout 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":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6096ce3a2da2c2998543fe93f8a8c46ba858ea01884d3f7eb2b7420cd0ee5704"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadFile (cyclomatic 13, cognitive 25): loadFile has cyclomatic complexity 13 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":"packages-v3/less/src/LessTransformer.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"267900ad9764738baad2ccba5d5a5b38e7af68f0222de43a9893d63ad6011558"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 24): (anonymous) has cyclomatic complexity 13 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":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5af618b1e977fcdd72d7549c3667936c516d1391688303f1cddbf1e6d94e4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBuiltins (cyclomatic 13, cognitive 19): buildBuiltins has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/buildBuiltins.cjs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b3e9b73f3d537176858aaad67a56ae18f0e89fe7eccd4bae155d56c64c365e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 13, cognitive 18): render 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":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaf1d73d094dfc4a1cb821b39de553d7b1eec61ac9cc0689c7435f22b2bbbae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isLikelyComponentType (cyclomatic 13, cognitive 17): isLikelyComponentType has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/runtime_modules/react-refresh-runtime.development.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0d2f8453f93272c1fdfcc3d766b10abe85e2487a2dadcf990f2156028e31bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixtures (cyclomatic 13, cognitive 17): fixtures has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bundle-optimizer-prototype/graphs.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f811b907e7ba466e7d2bdab8120ced9e9388145054974cff45710ab17a8b1ac2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 13, cognitive 12): visit 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":"crates/plugin-js/buildBuiltins.cjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c6c5a9592ae4169629b2f524c696676be83e915f2db127d59e146b3d303689"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hmrApply (cyclomatic 12, cognitive 29): hmrApply has cyclomatic complexity 12 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1b4702e5fa693befbbf37d4d9719fa1142092d01d4a1263bf768c8bf625770"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parcelRequire (cyclomatic 12, cognitive 23): parcelRequire 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":"crates/js/src/dev-runtime.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"848a560e6c75dd8988471e0a726ae95c930a9ee0869d3ab83406319df322f58a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function link (cyclomatic 12, cognitive 18): link 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":"crates/js/src/tla-runtime.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"af97641418cdd90d2bc6efd0137b4bf237c11fb7bbd60370a03340930d17ed20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 12, cognitive 15): evaluate has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/tla-runtime.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdaef943f230fce743ad389f765ba9315a73502df26426a10af09b02c0189aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transform (cyclomatic 12, cognitive 13): transform 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-v3/postcss/src/PostCSSTransformer.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7be8338daa580b1e3e4b2d7bb47835d427f4612d9757d5794cc9aff30f854d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOutput (cyclomatic 11, cognitive 24): validateOutput has cyclomatic complexity 11 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":"crates/plugin-js/buildBuiltins.cjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"c820fb86da79f81e5c6ac75cd22ca918c73ab79bdf633eb4afc2c2c6b6039608"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generated (cyclomatic 11, cognitive 17): generated 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":"scripts/bundle-optimizer-prototype/graphs.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50b17f64bdf85978425b7cdc752d7270a37d5d7d55ff3e329216bdbc540a307"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fitModels (cyclomatic 11, cognitive 15): fitModels 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":"scripts/compression-measurement/measure.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece576c16e44784566df8a4cdc38130aadfd205eba28ef09b1809fa9bc432776"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toNamespacedPath (cyclomatic 11, cognitive 13): toNamespacedPath has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"370073b06177ddef99e3b12a66b887ee6b907a7cc0010d425a58088f28068a7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isReactRefreshBoundary (cyclomatic 11, cognitive 12): isReactRefreshBoundary has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/runtime_modules/react-refresh.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdddd6853f6947fbc844cf683c763ddb8f46b37a502aec699711e2cf67343b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nodePanel (cyclomatic 11, cognitive 12): nodePanel has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"481413492d89e2078dd3257a99af1e7595f61346870ed7377f321eb512d42859"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function optimize (cyclomatic 11, cognitive 11): optimize 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":"scripts/bundle-optimizer-prototype/model.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5982e557b44b099501a381d4eb65b7fde0ff08b3d917538c35e7d909899e4ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a602a9aa16097f7b53680c6f1406fff12b0753e84792ef00e5fe2d9def85de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bundlePanel (cyclomatic 11, cognitive 10): bundlePanel 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":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"230244afef82ba5fd3fee07bca19e945e2da10901966dee1a18cd3855efd6656"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/parcel/src/analyzer/client.js: 1623 lines of code: crates/parcel/src/analyzer/client.js has 1623 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/parcel/src/analyzer/client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cb2d934038e3b173add9b9e0099f5eff4a35b149f74f25a6cd4901bea312a4"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/plugin-js/builtin-src/path-win32.js: 1115 lines of code: crates/plugin-js/builtin-src/path-win32.js has 1115 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae59ba8742a1517e575d03d96b4591343c1cda7feada723ab4a802bc73f1988"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/js/src/dev-runtime.js: 1056 lines of code: crates/js/src/dev-runtime.js has 1056 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/js/src/dev-runtime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7b147ba1834e9410634239153c232bbcddaf06fbe9b2ed8e300ad442352e1a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages-v3/plugin/src/types.ts: 796 lines of code: packages-v3/plugin/src/types.ts has 796 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-v3/plugin/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dcf39e114e9a246075d9a82f83861a9a5362c17783694232fccc42bd5e65f7"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/plugin-js/buildBuiltins.cjs: 547 lines of code: crates/plugin-js/buildBuiltins.cjs 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":"crates/plugin-js/buildBuiltins.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300ddda4d25a9b48c7c3f08ed485bd5a836fd6f6ce22652fe3ffdbf8707d312c"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: crates/parcel/tests/fixtures/glob/glob-esm-library/index.js:1 imports \u0027./dir/*.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/tests/fixtures/glob/glob-esm-library/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec42b94d7bf7126e2b62d1ffdd3e4c7d386e00a95115808f483eea35b69c925"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: crates/parcel/tests/fixtures/url-imports/import-raw-import-meta-url/local-url.js:7 imports \u0027./invalid.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/tests/fixtures/url-imports/import-raw-import-meta-url/local-url.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fba30539dc961c89de0ce1cf2af79699ae0ef6ed33d4e0686c3ccd35a44295"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: crates/parcel/tests/fixtures/workers/service-worker-import-meta-url/missing.js:1 imports \u0027./invalid.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/tests/fixtures/workers/service-worker-import-meta-url/missing.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c97c913805a79821b9ef192794ef5d47c6050fbff362fb8f8a5afdf38735bc"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: crates/parcel/tests/fixtures/workers/worker-import-meta-url/local-url.js:7 imports \u0027./invalid.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/tests/fixtures/workers/worker-import-meta-url/local-url.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d60c1ad2225e1f721384121fd197706154c241b1982f17efcc5a3a99423b855"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: crates/parcel/tests/fixtures/workers/worker-import-meta-url/missing.js:1 imports \u0027./invalid.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/tests/fixtures/workers/worker-import-meta-url/missing.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c2d862d56942765fc363873d53273d4273daec99d0724b6e4a91438e6cbf94"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/parcel/src/analyzer/client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b96bbfb99896e8d36cd23523b187aeb012c887fb741f2467dedf45ba1e94fcc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/plugin-js/builtin-src/path-win32.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84ced4d6aaf252cd5c7160386811c4948b1332d64cb2a11c68b2176a4d64611"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/js/src/dev-runtime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9cfa6ee39e77ede8d18c0fe5fa58305e448af1758ea6ef465dca4b95a16850"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/js/src/runtime_modules/react-refresh-runtime.development.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f806f3fe5102f6ecada456cafc0e7fbe3c330df4a142d17b163162351f307af"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/js/src/tla-runtime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9ebe6ced3738da7960d3646f056b7f90b34cd0f7f003459f2b730bd5ed4113"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/stylus/src/StylusTransformer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caaaf2587dac87115b7dbcf612f06ea1f180e84558d3d1ddc75793f82d7d30a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/js/src/runtime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1127d555ea18afb2b62f8a07bcfd7a6d05d4598d9ec541cea53c086001f312"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/js/src/runtime_modules/react-refresh.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a49c24f58e38b140aa23c4ee5dc97eaf4fe4cb82fee253ce0595b9d689d069"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/rsc/src/server.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed21cfa41ef235c45ab4e8fd636688d55a5814cc799527945b3cd1459dc7e359"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/create-parcel/src/create-parcel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"345897c29a2ce38701509afb79cd5494dc007ff99a53a8b3ddae7d6fa0307e8c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/postcss/src/PostCSSTransformer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6fafdf811a204a567fdbd94c84c32653e09bd04503f386b38a961b611bb445"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/less/src/LessTransformer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1848162f31a4055fd75434fdd260efcbb02c34b4128f96564d1d189c8bde1a62"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/posthtml/src/PostHTMLTransformer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9cdf0066a0bb88704d5b486483aaf715acc5ab49a88c3d653a92b2a19f7faa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/rsc/src/runtime-helpers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c238a2af022ad6d5da4b9254c2c81c218fa6f4f721fa7e7a6674683f52185d7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/rsc/src/node.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0ab7d0c2093439e353e064a36e494d0d6c6283240e0b31afd97cd005c77105"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/rsc/src/client.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8434a18d14a091d5cf9c8a6bb9cab0f38e4d03d1ea92b0ff0196ab5fe0d91f0d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/plugin-js/builtin-src/assert/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3931d72fe3f7eb34fd871689c24e6e9648582d5354c1d2215a805644ada49cd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/babel/src/BabelTransformer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"533123093d9c7185359aebc49db781ae0dae947ceef897dbd8e2dc1bda8dccae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/create-parcel/templates/react-server/src/client.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02b28b4f937588ab8e4fd9c0d9f1b496ec8a27cbd7ef2263442eea273fe74b0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwind/src/compile.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb392a1b438196a2623b6bae930526df584c5801952ca09e63944143a0c42d76"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/create-parcel/scripts/update-template-versions.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d63790ccbec0d02b9aae66fd7e8bb82b7a522df0471a6042b4c55019f55cfd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/js/src/runtime_modules/esmodule-helpers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76754c0bc92ed681f2ec0b404b056a0cb97bfb464fc91630a857c8c10b81476f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/create-parcel/templates/react-server/src/Page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f366dd7950bd7f7ca4f964377515fea41e947d2a47e7302596a7663550cd1f85"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/rsc/src/runtime-server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a976bb36240c86687e0b60dd2b386e8c9751d746166cd5c42e52896dc9971a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/js/src/runtime_modules/mdx-components.jsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6414e415a17a502273f9cc108005fa64d6236c5f95b318455b9047b3d11062a6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/coffeescript/src/CoffeeScriptTransformer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ef9cec36976f4349f5b7ed7d40bb1a556777809d982c766442c2f13faea066"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/create-parcel/templates/react-server/src/server.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8848d4ea6b964eb4085786ee832d95329f7ae57225011a1fc615ba91ba3e1f4d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/pug/src/PugTransformer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f86e6951d7c487601ccfe84bab20ba9fbab468feacd9b6993acb7f6ce76877"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/sugarss/src/SugarssTransformer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb9682d794920774440d4a183623a017fcd12fdcb5be20f7dc65e57a62ce715"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/rsc/src/runtime-client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e68de909e8a81f7b78ed71b3390095890121327ca079664361c4985e05770d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/create-parcel/templates/react-client/src/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d6475bdbd1f5d3f97e04fad68b10e2caf93ade414b37ff5ab5a3e0e41dac54"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/create-parcel/templates/react-server/src/Counter.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1a39b4adac5ec0adfe67c470ae45230fff71673ef4e244bca30b03f4a4c9af"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/create-parcel/templates/react-client/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92366e1485c1c6b8e9bd67aa6da7a3611d99d7fcc58b551bd62044d4ca98ebec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-v3/create-parcel/templates/react-server/src/actions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d007e2d3a5b08f073f3e02c9915c3bc9c04647ff2aaf3be4fec05178b9683000"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but crates/parcel/tests/fixtures/glob/glob-esm-library/index.js and 4 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/tests/fixtures/glob/glob-esm-library/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dfb89f3b5e9f0d60b4cf8431baa7ba6e9a0389590ea1ed754c69fd7aa487ec"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1727 LoC): no import path from any entry point (344 application, 10 tooling, 775 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/analyzer/client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b754636bf5dd7f1e58f97539b920873754091518193a88a38988247a594356"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/parcel-resolver/tests/fixture/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel-resolver/tests/fixture/package.json"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9f8c6a78da643d9baf0c4cca896de6f1a91fa0d2b774a3e85261d3e826d332"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: packages-v3/create-parcel/templates/react-client/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages-v3/create-parcel/templates/react-client/package.json"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f4c3b0c495c53ffe5aeefa10852adc97fd2b42628d38bd1e046b30f49d3c5b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: packages-v3/create-parcel/templates/react-server/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages-v3/create-parcel/templates/react-server/package.json"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc40c928997f19e1994b7b2f73860676d03ee41c8d97cd2d3d10d9f865081021"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: packages-v3/create-parcel/templates/vanilla/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages-v3/create-parcel/templates/vanilla/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8513ad4bb8ca6531b60a5e90848a3aaf08a7e4bdca70e8381d4e31f79a8e7bf9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!previousRequire \u0026\u0026 typeof document !== \u0027undefined\u0027 \u0026\u0026 typeof document.querySelectorAll === \u0027function\u0027\u0060 appears character-identically in 2 files \u2014 crates/js/src/dev-runtime.js, crates/js/src/runtime.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"667aca0974b7d351a746a602b55667e7bf1b43c9377ca4bd867495e46b751a0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing[i].href === link.href \u0026\u0026 existing[i].relList.contains(\u0027stylesheet\u0027)\u0060 appears character-identically in 2 files \u2014 crates/js/src/dev-runtime.js, crates/js/src/runtime.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ac6d695a6026283f8c1caf5d355a3dd5e2aa76f209a3df63b39460c233f645"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof define === \u0027function\u0027 \u0026\u0026 define.amd\u0060 appears character-identically in 2 files \u2014 crates/js/src/dev-runtime.js, crates/js/src/runtime.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41657f706f7e8583d772dc4d482e388b90ef73d24d588cb25709698519247c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof globalThis[parcelRequireName] === \u0027function\u0027 \u0026\u0026 globalThis[parcelRequireName]\u0060 appears character-identically in 2 files \u2014 crates/js/src/dev-runtime.js, crates/js/src/runtime.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/dev-runtime.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa3253e7285fc5c201edebcb6d9f66e021ffb65c8c993d8ef0c41b0d9083ea2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg!(windows) \u0026\u0026 Path::new(name).is_absolute()\u0060 appears character-identically in 2 files \u2014 crates/parcel/src/plugin_factory.rs, crates/plugin-js/src/esm.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/parcel/src/plugin_factory.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc6b44a63798163ed02c9842bd84424a9197c2d4c6fe723b0f31d33607c0b17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dep.bundle_behavior == BundleBehavior::Inline || referenced_bundle.bundle_behavior == BundleBehavior::Inline\u0060 appears character-identically in 2 files \u2014 crates/css/src/packager.rs, crates/html/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/css/src/packager.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb1856bd79dbfb763b90820bcaa7ac1985ac921468ca68f6e9443a066b736ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.is_empty() || !input.starts_with(ascii_alpha)\u0060 appears character-identically in 2 files \u2014 crates/core/src/resolver.rs, crates/parcel-resolver/src/specifier.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/core/src/resolver.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51fb7f7a2c05368f77b77c51ed74c012abc867f90ba4669d75e2903d14c77ab"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 3/15 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: ~0.4 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 1 assertion(s) across the 2623 source line(s) of the 21 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-v3/create-parcel/templates/react-client/src/index.tsx (1). 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 on Err: \u0060process_names\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parcel/src/launch_editor.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72500f0e1c622de41439644cf03f0d02f36587dc249998d5b2e97a9915343c5"}}],"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-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-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.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-457","guid":"b62874fe-6222-8b5b-8ade-9527ad1cbb4a","name":"CWE-457","shortDescription":{"text":"CWE-457"},"helpUri":"https://cwe.mitre.org/data/definitions/457.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"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-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":"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/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-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-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"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":165,"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."]}]}